CN103068020A - Collection method of mobile data in wireless sensor network - Google Patents
Collection method of mobile data in wireless sensor network Download PDFInfo
- Publication number
- CN103068020A CN103068020A CN2013100221283A CN201310022128A CN103068020A CN 103068020 A CN103068020 A CN 103068020A CN 2013100221283 A CN2013100221283 A CN 2013100221283A CN 201310022128 A CN201310022128 A CN 201310022128A CN 103068020 A CN103068020 A CN 103068020A
- Authority
- CN
- China
- Prior art keywords
- node
- mobile
- wireless sensor
- overlay
- sensor network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 230000005540 biological transmission Effects 0.000 claims abstract description 30
- 238000010586 diagram Methods 0.000 claims abstract description 20
- 230000003068 static effect Effects 0.000 claims description 52
- 229910052799 carbon Inorganic materials 0.000 claims description 7
- 238000005457 optimization Methods 0.000 claims description 4
- 238000005265 energy consumption Methods 0.000 abstract description 6
- 238000013480 data collection Methods 0.000 abstract description 3
- 238000010845 search algorithm Methods 0.000 abstract 1
- 230000006870 function Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000009191 jumping Effects 0.000 description 3
- 230000006012 detection of carbon dioxide Effects 0.000 description 2
- 239000012467 final product Substances 0.000 description 2
- 239000002699 waste material Substances 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a collection method of mobile data in a wireless sensor network. The collection method of the mobile data in the wireless sensor network comprises A. based on accessibility between nodes, obtaining a covered node-set group of the wireless sensor network; B. according to the covered node-set group, utilizing a Greedy String Tiling (GST) algorithm to obtain a GST with the minimum length and supposing the GST with the minimum length to be T; C. based on T, starting from a mobile sink and obtaining an Euler diagram G<'>; D. taking the mobile sink as a starting point, utilizing a depth-first search algorithm to obtain an Euler path G<'> of the Euler diagram G<'>; and E. based on the Euler path G<'>, starting from a mobile sink v0, obtaining a Hamilton loop P, and regarding the Hamilton loop P as a mobile data collection path of the mobile sink v0. The collection method of the mobile data in the wireless sensor network can reduce energy consumption of the nodes in the process of mobile data collecting, improves reliability of data package transmission and practicability of the wireless sensor network.
Description
Technical field
The present invention relates to the wireless sensor network technology field, relate in particular to the acquisition method of Mobile data in a kind of wireless sensor network.
Background technology
At present, data collection problems is research one of the most extensive problem in the wireless sensor network, in general, dispose good wireless sensor network for one and be comprised of one group of wireless sensing node (usually providing electric power by battery), each wireless sensing node has assembled some dissimilar transducer such as temperature sensors, humidity sensor etc.Usually, disposing good sensor node for one has its fixing position, and it is taken a sample to surrounding enviroment, then packet is passed through a jumping or multi-hop transmission to predefined meeting point.Yet, consider the size of the wireless sensor network scale of deployment.For example, in the wireless sensor network for detection of carbon dioxide, two adjacent sensor nodes (being that they are adjacent in a jumping scope) are because Route Selection and task scheduling different, and the task quantity of execution can mutually far short of what is expected times.This will directly cause the node energy consumption of " key " quick on the one hand, reduce the life-span of network.On the other hand, when the data acquisition node in the network is pooled to the packet that gathers in the process of meeting point, because network congestion also can directly cause abandoning and loss situation of packet.For example, in the wireless sensor network for detection of carbon dioxide, nearly 20% packet will transmit more than ten five jumpings before arriving meeting point.Obviously, the missing data bag has transmitted very long distance, has caused the waste of Internet resources.Although the life cycle of the forwarding of packet can be alleviated this situation in the limiting network, the life cycle that package forward reasonably is set is a relatively hard problem.
In the Another application scheme of wireless sensor network, one group of sensor node is deployed in position fixing in the forest, and they monitors surrounding enviroment, and image data and store all local data periodically.Some forest management persons carry portable equipment and cruise in forest according to the route that designs, and when in the transmission range of some sensing nodes that their arrive to be disposed, portable equipment is with direct image data.In such application, particularly be deployed in the wireless sensor network of external environment condition for some, the accessibility of sensor node requires careful consideration, for example, some sensor nodes may be deployed in the water, perhaps steep cliff periphery, perhaps can not be easily concerning forest management person close deathtrap.Therefore, if some nodes can not be directly adjacent to (their data can't directly be obtained in other words), so just need to there be other nodes to bear responsibility into their forwarding data bag.
In addition, node (for example may have different performances in the wireless sensor network of anisotropic, different buffer size, different calculating and transmittability etc.), even in the wireless sense network of isotropic, after sensor node was deployed and moves a period of time, perhaps they had different dump energies.Under the circumstances, should allow in theory the more better nodes (having how available energy, larger buffer memory, longer transmission range etc.) of performance bear more data retransmission responsibility.Above-mentioned several situation is ubiquity in the Mobile data gatherer process of traditional wireless sensor networks, if solve the bad high energy consumption that will directly cause sensor node, the reliability that reduces data packet transmission and the practicality of whole wireless sensor network.
Summary of the invention
For above-mentioned technical problem, the object of the present invention is to provide the acquisition method of Mobile data in a kind of wireless sensor network, it can reduce the energy consumption of node in the Mobile data gatherer process, improves the reliability of data packet transmission, so that wireless sensor network has more practicality.
For reaching this purpose, the present invention by the following technical solutions:
The acquisition method of Mobile data in a kind of wireless sensor network makes the set V={v of node in the wireless sensor network
0, v
1, v
2..., v
n, wherein, v
0Be mobile meeting point, v
1, v
2..., v
nBe static node; When not considering static node v
iWith mobile meeting point v
0Between data transmission distance r the time, obtain mobile meeting point v
0The Mobile data method that gathers the path specifically comprise the steps:
A, based on the accessibility between the node, obtain the overlay node collection group C of wireless sensor network, wherein, 1≤i≤n, C={Cv
0, Cv
1..., Cv
n, Cv
0Be mobile meeting point v
0The overlay node collection, Cv
1..., Cv
nBe static node v
1, v
2..., v
nCorresponding overlay node collection;
B, according to described overlay node collection group C, utilize GST(Group Stennier Tree) algorithm obtains the GST of a minimum length, is assumed to be T, wherein, T has connected the node that each overlay node is concentrated among the overlay node collection group C, T=(V at least
T, E
T), V
T=V' ∩ V ", V' is the set of upper all static nodes of T, V " is the set of the upper Steiner node that adds of T, E
TSet for upper all limits of T;
C, based on T, from mobile meeting point v
0For setting out, obtain an Euler diagram G', wherein, described Euler diagram G ' refers to: from mobile meeting point v
0For setting out, every limit on the traversal T is once and only once just all over the loop of upper all nodes of T;
D, with mobile meeting point v
0Be starting point, utilize Depth Priority Algorithm (Depth First Search, DFS), obtain the Eulerian path G of Euler diagram G' ";
E, based on Eulerian path G ", from mobile meeting point v
0Set out, obtain a hamiltonian circuit P(Hamiltonian cycle), and with this hamiltonian circuit P as mobile meeting point v
0Mobile data gather the path, wherein, the forming process of described hamiltonian circuit P is as follows: based on Eulerian path G ", from mobile meeting point v
0Set out, only the static node among the V' is conducted interviews and only the access once, and to V " in node do not conduct interviews, obtain according to this hamiltonian circuit P.
Especially, when considering static node v
iWith mobile meeting point v
0Between data transmission distance r the time, obtain mobile meeting point v
0The Mobile data method that gathers the path specifically comprise the steps:
A, with step A, based on the accessibility between the node, obtain the overlay node collection group C of wireless sensor network, wherein, 1≤i≤n, C={Cv
0, Cv
1..., Cv
n, Cv
0Be mobile meeting point v
0The overlay node collection, Cv
1..., Cv
nBe static node v
1, v
2..., v
nCorresponding overlay node collection;
If b ε satisfies
Then to static node collection { v
1, v
2... v
nIn arbitrary node v
jFor the center of circle, data transmission distance r are that the circular boundary of radius carries out
Five equilibrium obtains to be positioned on the circular boundary
Individual dummy node
Wherein, ε is constant, and its large I is adjusted according to user's actual needs, || P
Opt|| be the length that optimum Mobile data gathers the path, n is the quantity of static node in the wireless sensor network;
C, for each the static node v among the overlay node collection group C
jAll use its corresponding dummy node
Substitute, thereby obtain new overlay node collection group G={Gv
0, Gv
1..., Gv
n, wherein, | Gv
0|=| Cv
0|,
1≤i≤n；
D, based on described new overlay node collection group G, " and the Hamilton's cycle P, and this Hamilton's cycle P gathered the path as the Mobile data of mobile meeting point of utilizing method identical among step B, C, D and the E to obtain minimum length GST, an Eulerian path G.
Especially, if node v
jBe v
iOverlay node collection Cv
iIn node, node v then
iPacket can be from node v
jCollect, also namely: node v
jBe node v
iOverlay node, node v
jWith node v
iBetween have accessibility.
Especially, described based on the accessibility between the node, obtain the overlay node collection group C of wireless sensor network, specifically comprise:
A1, determine corresponding coverage condition according to practical application scene and optimization aim;
A2, for V={v
0, v
1, v
2..., v
nIn arbitrary node v
i, search and satisfy described coverage condition among the V, even also coverage function Cov(v
j, v
i) equal all node v of 1
jSet Cv
i, wherein, 0≤i≤n, 0≤j≤n, Cv
iBe called node v
iThe overlay node collection;
A3, utilize described Cv
i, the overlay node collection group C of acquisition wireless sensor network, wherein, 0≤i≤n, C={Cv
0, Cv
1..., Cv
n, Cv
0Be mobile meeting point v
0The overlay node collection, its value is for { v
0, Cv
1..., Cv
nBe static node v
1, v
2..., v
nCorresponding overlay node collection.
The present invention can select rational Mobile data for mobile meeting point and gather the path, gather the collection that Mobile data is finished in the path according to this Mobile data, reduced the energy consumption of node in the Mobile data gatherer process, improved the reliability of data packet transmission, and so that wireless sensor network has more practicality.
Description of drawings
The acquisition method flow chart of Mobile data in the wireless sensor network in the first situation that Fig. 1 provides for the embodiment of the invention;
GST schematic diagram in the first situation that Fig. 2 a provides for the embodiment of the invention;
Eulerian path G " schematic diagram in the first situation that Fig. 2 b provides for the embodiment of the invention;
Hamiltonian circuit P schematic diagram in the first situation that Fig. 2 c provides for the embodiment of the invention;
The collection path schematic diagram based on the Mobile data of addressable point that Fig. 3 provides for the embodiment of the invention;
The acquisition method flow chart of Mobile data in the wireless sensor network in the second situation that Fig. 4 provides for the embodiment of the invention;
The dummy node schematic diagram of the alternative static node that Fig. 5 provides for the embodiment of the invention;
Fig. 6 proves exemplary plot for what the embodiment of the invention provided.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, the invention will be further described below in conjunction with drawings and Examples.
The set V={v of node in the assumed wireless sensor network
0, v
1, v
2..., v
n, wherein, v
0Be mobile meeting point, v
1, v
2..., v
nBe static node.Now in two kinds of situation the acquisition method of Mobile data in the wireless sensor network is described.
The first situation: do not consider static node v
iWith mobile meeting point v
0Between data transmission distance r, that is: gather static node v when needs
iPacket the time, mobile meeting point v
0Only move to static node v
iThe geometric position at place just can collect this node data bag.Need explanation to be, the first situation is not just considered the data transmission distance r between static node and the mobile meeting point, and the data transmission distance between the static node still is r.Described data transmission distance r refers to that static node can send the maximum distance of packet, and the data transmission range of static node is reduced to border circular areas take r as radius at this.
Please refer to shown in Figure 1, the acquisition method flow chart of Mobile data in the wireless sensor network in the first situation that Fig. 1 provides for the embodiment of the invention.
In the present embodiment in the wireless sensor network acquisition method of Mobile data comprise the steps:
Step S101, based on the accessibility between the node, obtain the overlay node collection group C of wireless sensor network, wherein, C={Cv
0, Cv
1..., Cv
n, Cv
0Be mobile meeting point v
0The overlay node collection, Cv
1..., Cv
nBe static node v
1, v
2..., v
nCorresponding overlay node collection.
Based on the accessibility between the node, the concrete steps of overlay node collection group C of obtaining wireless sensor network are as follows:
Step S1011, determine corresponding coverage condition according to practical application scene and optimization aim.
Step S1012, for V={v
0, v
1, v
2..., v
nIn arbitrary node v
i, search and satisfy described coverage condition among the V, even also coverage function Cov(v
j, v
i) equal all node v of 1
jSet Cv
i, wherein, 0≤i≤n, 0≤j≤n, Cv
iBe called node v
iThe overlay node collection.
Coverage condition between two nodes is different and different according to practical application scene and optimization aim.For example, when we attempt the transmission range of restricting data bag, whether satisfy coverage condition and depend on Euclidean distance between the node or the skip distance between them.If our purpose is to reduce the transmission time of packet in the network, important index may be exactly the quality of connection between the node in the coverage condition.When the better node of some performances of needs is born more responsibility in network, coverage condition will be the quality of combination property (for example, buffer size, bandwidth etc.) of node and present network condition.
Node v
jWith node v
iBetween coverage function Cov(v
j, v
i) expression.As node v
jWith node v
iBetween when satisfying coverage condition, Cov(v
j, v
i) value equal 1, otherwise, Cov(v
j, v
i) value equal 0.If Cov(v
j, v
i) value equal 1, node v then
iPacket can be from node v
jCollect, also namely: node v
jBe node v
iOverlay node, node v
jWith node v
iBetween have accessibility.For V={v
0, v
1, v
2..., v
nIn arbitrary node v
i, search and satisfy described coverage condition among the V, even also coverage function Cov(v
j, v
i) equal all node v of 1
jSet Cv
i, wherein, 0≤i≤n, 0≤j≤n, Cv
iBe called node v
iThe overlay node collection.
Step S1013, utilize described Cv
i, the overlay node collection group C of acquisition wireless sensor network, wherein, 0≤i≤n, C={Cv
0, Cv
1..., Cv
n, Cv
0Be mobile meeting point v
0The overlay node collection, its value is for { v
0, Cv
1..., Cv
nBe static node v
1, v
2..., v
nCorresponding overlay node collection.
Step S102, according to described overlay node collection group C, utilize GST(Group Stennier Tree) algorithm obtains the GST of a minimum length, is assumed to be T, wherein, T connects the node that each overlay node is concentrated among the overlay node collection group C, T=(V at least
T, E
T), V
T=V' ∩ V ", V' is the set of upper all static nodes of T, V " is the set of the upper Steiner node that adds of T, E
TSet for upper all limits of T.
Shown in Fig. 2 a, the GST schematic diagram in the first situation that Fig. 2 a provides for the embodiment of the invention.Wherein, described GST(Group Stennier Tree) algorithm draws from document: CHARIKAR, M., CHEKURI, C., GOEL, A., ANDGUHA, S.Rounding via trees:deterministic approximation algorithms for group steiner trees and k-median.In Proceedings of the thirtieth annual ACM symposium on Theory of computing (1998), ACM, pp.114-123.
Step S103, based on T, from mobile meeting point v
0For setting out, obtain an Euler diagram G ', wherein, described Euler diagram G' refers to: from mobile meeting point v
0For setting out, every limit on the traversal T is once and only once just all over the loop of upper all nodes of T.
Step S104, with mobile meeting point v
0Be starting point, utilize Depth Priority Algorithm (Depth First Search, DFS), obtain the Eulerian path G of Euler diagram G' ".Shown in Fig. 2 b, the Eulerian path G " schematic diagram in the first situation that Fig. 2 b provides for the embodiment of the invention.
Step S105, based on Eulerian path G ", from mobile meeting point v
0Set out, obtain a hamiltonian circuit P(Hamiltonian cycle), and with this hamiltonian circuit P as mobile meeting point v
0Mobile data gather the path, wherein, the forming process of described hamiltonian circuit P is as follows: based on Eulerian path G ", from mobile meeting point v
0Set out, only the static node among the V' is conducted interviews and only the access once, and to V " in node do not conduct interviews, obtain according to this hamiltonian circuit P.Shown in Fig. 2 c, the hamiltonian circuit P schematic diagram in the first situation that Fig. 2 c provides for the embodiment of the invention.
Need to prove, obtain hamiltonian circuit P and mobile meeting point v by above-mentioned steps S101-S105
0Optimum mobile route P
OptApproximate ratio be O (log
2N*logt*loglogn), wherein, n is the quantity of static node in the wireless sensor network, and t is the number of nodes of maximum overlay node collection among the overlay node collection group C.The concrete process of argumentation is as follows:
Suppose to integrate the optimum GST of group C acquisition as T based on overlay node
Opt, the mobile meeting point v of acquisition
0Optimum mobile route be P
OptBecause P
OptA hamiltonian circuit, so P
OptAt least than T
OptThe length on many limits.We remove P now
OptA limit e, thereby obtain a tree T', obviously, the same T of T '
OptThe same, connected at least the node that each overlay node is concentrated among the overlay node collection group C.Because T
OptBe optimum GST, then can get:
||T
opt||≤||T'||=||P
opt||-||e||≤||P
opt|| （1）
According to described overlay node collection group C, utilize the GST algorithm to obtain the GST of a minimum length.Represent GST with T, then have:
||T||=O(log
2n*logt*loglogn)||T
opt|| （2）
The detailed process of argumentation of formula (2) please refer to GST algorithm literature cited.The length of " being that every limit to T all travels through twice and obtains, so Eulerian path G " is the twice of T length again because Eulerian path G, that is: || G " ||=2||T||.And by triangle inequality, being easy to again proves that the length of Hamilton's cycle P is less than G " length, that is:
||P||≤||G"||=2||T|| （3）
Comprehensively can be got by formula (1), (2), (3): || P||=O (log
2N*logt*loglogn) || P
Opt||.
Hamiltonian circuit P and mobile meeting point v
0Optimum mobile route P
OptApproximate ratio be O (log
2N*logt*loglogn) must demonstrate,prove.
The below is based on obtaining mobile meeting point v in the first situation
0Mobile data gather the method in path, the second situation is described in detail.
The second situation: consider static node v
iWith mobile meeting point v
0Between data transmission distance r, that is: gather static node v when needs
iPacket the time, mobile meeting point v
0Only need to move to static node v
iData transmission range in get final product, and need not to move to static node v
iThe geometric position at place.Simultaneously, because the difference of the data transmission distance of static node does not affect realization of the present invention, therefore, will not consider the otherness of static node in the present embodiment, the data transmission distance of all static nodes all will be made as r.
At first the addressable point (access point) that hereinafter will use is defined.Addressable point: because node v
jAt node v
iData transmission range in can receive node v
iPacket, now can receive node v
iThe position of packet is called node v
iAddressable point or data access point.Mobile meeting point v
0Just can collect the packet of node as long as move to the addressable point of static node, and need not to move to the geometric position of node.
As shown in Figure 3, the collection path schematic diagram based on the Mobile data of addressable point that provides for the embodiment of the invention of Fig. 3.Two overlay node collection are arranged among Fig. 3: the overlay node that the overlay node that comprises node u integrates (among the figure with the broken circle of r as radius) and comprises node v integrates (among the figure with the broken circle of r as radius), and these two overlay node collection have covered nodes all in the network, that is to say: mobile meeting point v
0Only just can collect the packet of all nodes in the network by the addressable point of access node u and node v.P among the figure
uThe addressable point of expression node u, p
vThe addressable point of expression node v.
As shown in Figure 4, the acquisition method flow chart of Mobile data in the wireless sensor network in the second situation of providing for the embodiment of the invention of Fig. 4.
In the present embodiment in the wireless sensor network acquisition method of Mobile data comprise the steps:
Step S401, with step S101, based on the accessibility between the node, obtain the overlay node collection group C of wireless sensor network, wherein, C={Cv
0, Cv
1..., Cv
n, Cv
0Be mobile meeting point v
0The overlay node collection, Cv
1..., Cv
nBe static node v
1, v
2..., v
nCorresponding overlay node collection.
Step S402, all static nodes among the overlay node collection group C are all alternative with one group of dummy node corresponding with it obtains new overlay node collection group G.Detailed process is as follows:
If step S4021 ε satisfies
Then to static node collection { v
1, v
2... v
nIn arbitrary node v
jFor the center of circle, data transmission distance r are that the circular boundary of radius carries out
Five equilibrium obtains to be positioned on the circular boundary
Individual dummy node
Wherein, ε is constant, and it has embodied the present embodiment and has obtained the time in the collection path of Mobile data, the accuracy rate of mobile meeting point image data etc., and its large I is adjusted according to user's actual needs, || P
Opt|| be the length that optimum Mobile data gathers the path, n is the quantity of static node in the wireless sensor network.Obviously, owing to dummy node is positioned on the border of node data transmission range, so dummy node also is addressable point.
As shown in Figure 5, node v
jCan use
Individual dummy node
Substitute, the arc length among the figure between any two adjacent dummy nodes is ε, central angle is
Step S4022, for each the static node v among the overlay node collection group C
jAll use its corresponding dummy node
Substitute, thereby obtain new overlay node collection group G={Gv
0, Gv
1..., Gv
n, wherein, | Gv
0|=| Cv
0|,
1≤i≤n。
Step S403, based on described new overlay node collection group G, utilize method identical among step S102, S103, S104 and the S105 to obtain minimum length GST, an Eulerian path G " and Hamilton's cycle P, and with the Mobile data collection path of this Hamilton's cycle P as mobile meeting point.
Situation is obtained minimum length GST, Eulerian path G in second, and " method that reaches Hamilton's cycle P is compared with situation in first, just actual static node is used the one group dummy node corresponding with it to replace and is got final product.
Obtain hamiltonian circuit P with the first situation identical, obtain hamiltonian circuit P and mobile meeting point v by above-mentioned steps S401-S404
0Optimum mobile route P
OptApproximate ratio also be O (log
2N*logt*loglogn), wherein, n is the quantity of static node in the wireless sensor network, and t is the number of nodes of maximum overlay node collection among the overlay node collection group C.
In order to prove hamiltonian circuit P and mobile meeting point v
0Optimum mobile route P
OptApproximate ratio be O (log
2N*logt*loglogn), at first following argument is proved.
Argument: if optimum mobile route P
OptOn addressable point be not the full dummy node that is, so necessarily can find all addressable Mobile data that is dummy node to gather path P, P is satisfied: || P||≤|| P
Opt||+2 ε n.
Demonstration: suppose that optimum mobile route is P
Opt, node v
iWith node v
jP
OptTwo adjacent overlay nodes of access.As shown in Figure 6, among the figure
With
Be respectively node v
iWith node v
jThe set of dummy node.P
OptWith with node v
iFor the center of circle, data transmission distance r are that the intersection point of the circular boundary of radius is a, P
OptWith with node v
jFor the center of circle, data transmission distance r are that the intersection point of the circular boundary of radius is b, and hypothesis intersection point a and intersection point b all are not dummy nodes.So, we can find such straight line, and the length of this straight line is not more than || ab||+2 ε, and also a summit of this straight line is node v
iA dummy node, another summit is node v
jA dummy node.
Two end points that order comprises the circular arc of intersection point a are respectively dummy node v
i 1And v
i 2, two end points that comprise the circular arc of intersection point b are respectively dummy node v
j 1And v
j 2We are from { v
i 1, v
i 2And { v
j 1, v
j 2In select respectively a node (that select among Fig. 6 be v
i 2And v
j 2), because air line distance is the shortest between 2, so straight line v
i 2v
j 2Length be not more than straight line av
i 2, ab, bv
j 2The length sum, that is:
||v
i 2v
j 2||≤||ab||+||av
i 2||+||bv
j 2||≤||ab||+2ε （4）
Therefore, if we are at P
OptIn use v
i 2v
j 2Substitute ab, P
OptLength will increase at most 2 ε.When we with P
OptIn all and the similar straight line that does not namely use dummy node of ab, when the straight line of all using the dummy node corresponding with it to connect replaces, the node on the new mobile route P that obtains will be dummy node entirely.Because P
OptBe a loop, and each overlay node is accessed once at most, therefore, for the network that n static node arranged, P
OptOn n bar limit is arranged at most, in the time will obtaining described p, at most also just need to replace n bar limit.According to above-mentioned conclusion, be easy to get:
||P||≤||P
opt||+2εn （5）
Above-mentioned argument must be demonstrate,proved.
Below we will according to above-mentioned argument, prove: mobile route that this method obtains and mobile meeting point v
0Optimum mobile route P
OptApproximate ratio also be O (log
2N*logt*loglogn).
Proof: order utilize the GST of the minimum length of GST algorithm acquisition to represent with T, and optimum GST is T according to described overlay node collection group C
OptIdentical with the first situation, have equally:
||T||=O(log
2n*logt*loglogn)||T
opt|| （6）
At this, suppose that obtaining degree loop, Hami based on described T is H, all || H||≤2||T|| then in conjunction with formula (6), can get:
||H||≤2||T||=(O(log
2n*logt*loglog n))||T
opt|| （7）
Suppose the mobile meeting point v based on overlay node collection group C acquisition
0Optimum mobile route be P
OptCan get according to above-mentioned argument: || P||≤|| P
Opt||+2 ε n.Obviously, if ε satisfies
Then can get:
||P||=O(1)||P
opt|| （8）
Because all addressable points on the mobile route P are dummy node, can get: || T
Opt||≤|| P|| in conjunction with formula (7), (8), is easy to obtain again:
||H||=O(log
2n*logt*loglogn)||P
opt||
So far, the hamiltonian circuit that in second, obtains in the situation and mobile meeting point v
0Optimum mobile route P
OptApproximate ratio be O (log
2N*logt*loglogn) must demonstrate,prove.
The present invention can select rational Mobile data for mobile meeting point and gather the path, has reduced the energy consumption of node in the removable data gatherer process, has improved the reliability of data packet transmission and the practicality of wireless sensor network.
Above-mentioned only is preferred embodiment of the present invention and institute's application technology principle, anyly is familiar with those skilled in the art in the technical scope that the present invention discloses, and the variation that can expect easily or replacement all should be encompassed in protection scope of the present invention.
Claims (4)
1. the acquisition method of Mobile data in the wireless sensor network is characterized in that, makes the set V={v of node in the wireless sensor network
0, v
1, v
2..., v
n, wherein, v
0Be mobile meeting point, v
1, v
2..., v
nBe static node; When not considering static node v
iWith mobile meeting point v
0Between data transmission distance r the time, obtain mobile meeting point v
0The Mobile data method that gathers the path specifically comprise the steps:
A, based on the accessibility between the node, obtain the overlay node collection group C of wireless sensor network, wherein, 1≤i≤n, C={Cv
0, Cv
1..., Cv
n, Cv
0Be mobile meeting point v
0The overlay node collection, Cv
1..., Cv
nBe static node v
1, v
2..., v
nCorresponding overlay node collection;
B, according to described overlay node collection group C, utilize GST(Group Stennier Tree) algorithm obtains the GST of a minimum length, is assumed to be T, wherein, T has connected the node that each overlay node is concentrated among the overlay node collection group C, T=(V at least
T, E
T), V
T=V' ∩ V ", V' is the set of upper all static nodes of T, V " is the set of the upper Steiner node that adds of T, E
TSet for upper all limits of T;
C, based on T, from mobile meeting point v
0For setting out, obtain an Euler diagram G', wherein, described Euler diagram G ' refers to: from mobile meeting point v
0For setting out, every limit on the traversal T is once and only once just all over the loop of upper all nodes of T;
D, with mobile meeting point v
0Be starting point, utilize Depth Priority Algorithm (DepthFirst Search, DFS), obtain the Eulerian path G of Euler diagram G' ";
E, based on Eulerian path G ", from mobile meeting point v
0Set out, obtain a hamiltonian circuit P(Hamiltonian cycle), and with this hamiltonian circuit P as mobile meeting point v
0Mobile data gather the path, wherein, the forming process of described hamiltonian circuit P is as follows: based on Eulerian path G ", from mobile meeting point v
0Set out, only the static node among the V' is conducted interviews and only the access once, and to V " in node do not conduct interviews, obtain according to this hamiltonian circuit P.
2. the acquisition method of Mobile data in the wireless sensor network according to claim 1 is characterized in that, when considering static node v
iWith mobile meeting point v
0Between data transmission distance r the time, obtain mobile meeting point v
0The Mobile data method that gathers the path specifically comprise the steps:
A, with step A, based on the accessibility between the node, obtain the overlay node collection group C of wireless sensor network, wherein, 1≤i≤n, C={Cv
0, Cv
1..., Cv
n, Cv
0Be mobile meeting point v
0The overlay node collection, Cv
1..., Cv
nBe static node v
1, v
2..., v
nCorresponding overlay node collection;
If b ε satisfies
Then to static node collection { v
1, v
2... v
nIn arbitrary node v
jFor the center of circle, data transmission distance r are that the circular boundary of radius carries out
Five equilibrium obtains to be positioned on the circular boundary
Individual dummy node
Wherein, ε is constant, and its large I is adjusted according to user's actual needs, || P
Opt|| be the length that optimum Mobile data gathers the path, n is the quantity of static node in the wireless sensor network;
C, for each the static node v among the overlay node collection group C
jAll use its corresponding dummy node
Substitute, thereby obtain new overlay node collection group G={Gv
0, Gv
1..., Gv
n, wherein, | Gv
0|=| Cv
0|,
1≤i≤n；
D, based on described new overlay node collection group G, " and the Hamilton's cycle P, and this Hamilton's cycle P gathered the path as the Mobile data of mobile meeting point of utilizing method identical among step B, C, D and the E to obtain minimum length GST, an Eulerian path G.
3. the acquisition method of Mobile data in each described wireless sensor network according to claim 1 and 2 is characterized in that, if node v
jBe v
iOverlay node collection Cv
iIn node, node v then
iPacket can be from node v
jCollect, also namely: node v
jBe node v
iOverlay node, node v
jWith node v
iBetween have accessibility.
4. the acquisition method of Mobile data in the wireless sensor network according to claim 3 is characterized in that, and is described based on the accessibility between the node, obtains the overlay node collection group C of wireless sensor network, specifically comprises:
A1, determine corresponding coverage condition according to practical application scene and optimization aim;
A2, for V={v
0, v
1, v
2..., v
nIn arbitrary node v
i, search and satisfy described coverage condition among the V, even also coverage function Cov(v
j, v
i) equal all node v of 1
jSet Cv
i, wherein, 0≤i≤n, 0≤j≤n, Cv
iBe called node v
iThe overlay node collection;
A3, utilize described Cv
i, the overlay node collection group C of acquisition wireless sensor network, wherein, 0≤i≤n, C={Cv
0, Cv
1..., Cv
n, Cv
0Be mobile meeting point v
0The overlay node collection, its value is for { v
0, Cv
1..., Cv
nBe static node v
1, v
2..., v
nCorresponding overlay node collection.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310022128.3A CN103068020B (en) | 2013-01-21 | 2013-01-21 | The acquisition method of mobile data in wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310022128.3A CN103068020B (en) | 2013-01-21 | 2013-01-21 | The acquisition method of mobile data in wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103068020A true CN103068020A (en) | 2013-04-24 |
| CN103068020B CN103068020B (en) | 2016-12-28 |
Family
ID=48110439
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310022128.3A Expired - Fee Related CN103068020B (en) | 2013-01-21 | 2013-01-21 | The acquisition method of mobile data in wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103068020B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104168581A (en) * | 2014-09-05 | 2014-11-26 | 合肥工业大学 | Water surface mobile base-station path planning method based on Voronoi diagram structure |
| CN106209625A (en) * | 2016-07-15 | 2016-12-07 | 福州大学 | One supports central controlled highly effective algorithm in distributed network |
| CN103701705B (en) * | 2013-12-20 | 2017-02-22 | 河海大学常州校区 | Mobile sink data acquisition method based on binary tree inquiry in wireless sensor network |
| CN109347741A (en) * | 2018-08-01 | 2019-02-15 | 北京邮电大学 | The whole network path optimization traversal method and device based on band network telemetry |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107295531B (en) * | 2017-07-25 | 2019-10-08 | 厦门理工学院 | A kind of wireless self-organization network covering method based on covering contribution |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101778335A (en) * | 2009-01-14 | 2010-07-14 | 深圳市先进智能技术研究所 | Wearable monitoring system and method for community member monitoring |
| CN102098709A (en) * | 2010-11-04 | 2011-06-15 | 无锡泛联软件科技有限公司 | Gradient-based routing method in hybrid wireless sensor network |
| CN102573023A (en) * | 2011-11-18 | 2012-07-11 | 中国科学院上海微系统与信息技术研究所 | Data acquisition and dynamic topology control method based on SDMA (Space Division Multiple Access) in WSN (Wireless Sensor Network) |
| KR20120138341A (en) * | 2011-06-15 | 2012-12-26 | 주식회사 에스씨앤에스 | Ad-hoc communication system in the wireless network |
-
2013
- 2013-01-21 CN CN201310022128.3A patent/CN103068020B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101778335A (en) * | 2009-01-14 | 2010-07-14 | 深圳市先进智能技术研究所 | Wearable monitoring system and method for community member monitoring |
| CN102098709A (en) * | 2010-11-04 | 2011-06-15 | 无锡泛联软件科技有限公司 | Gradient-based routing method in hybrid wireless sensor network |
| KR20120138341A (en) * | 2011-06-15 | 2012-12-26 | 주식회사 에스씨앤에스 | Ad-hoc communication system in the wireless network |
| CN102573023A (en) * | 2011-11-18 | 2012-07-11 | 中国科学院上海微系统与信息技术研究所 | Data acquisition and dynamic topology control method based on SDMA (Space Division Multiple Access) in WSN (Wireless Sensor Network) |
Non-Patent Citations (3)
| Title |
|---|
| CHARIKAR,M.,CHEKURI,C.,GOEL,A.,ANDGUHA,S.: "Rounding via trees:deterministic approximation algorithms for group steiner trees and k-median", 《IN PROCEEDINGS OF THE THIRTIETH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING(1998)》 * |
| 赵斌洁，陈光喜: "一种基于移动无线传感器网络结构的数据采集协议", 《桂林电子科技大学学报》 * |
| 郭剑 等: "基于移动sink的无线传感器网络数据采集方案", 《通信学报》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103701705B (en) * | 2013-12-20 | 2017-02-22 | 河海大学常州校区 | Mobile sink data acquisition method based on binary tree inquiry in wireless sensor network |
| CN104168581A (en) * | 2014-09-05 | 2014-11-26 | 合肥工业大学 | Water surface mobile base-station path planning method based on Voronoi diagram structure |
| CN104168581B (en) * | 2014-09-05 | 2017-08-11 | 合肥工业大学 | The water surface movable base station path planing method of Wei Nuotu constructions |
| CN106209625A (en) * | 2016-07-15 | 2016-12-07 | 福州大学 | One supports central controlled highly effective algorithm in distributed network |
| CN106209625B (en) * | 2016-07-15 | 2019-07-09 | 福州大学 | One kind supporting central controlled high efficiency method in distributed network |
| CN109347741A (en) * | 2018-08-01 | 2019-02-15 | 北京邮电大学 | The whole network path optimization traversal method and device based on band network telemetry |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103068020B (en) | 2016-12-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ebrahimi et al. | Compressive data gathering using random projection for energy efficient wireless sensor networks | |
| Hou et al. | Rate allocation in wireless sensor networks with network lifetime requirement | |
| Prasad | Recent trend in wireless sensor network and its applications: a survey | |
| CN103068020A (en) | Collection method of mobile data in wireless sensor network | |
| Farooq et al. | Energy, traffic load, and link quality aware ad hoc routing protocol for wireless sensor network based smart metering infrastructure | |
| Lin et al. | Composable information gradients in wireless sensor networks | |
| CN103299705B (en) | Method and system for wireless sensor network information swarming | |
| Wang et al. | A UAV-assisted topology-aware data aggregation protocol in WSN | |
| Amiripalli et al. | Impact of trimet graph optimization topology on scalable networks | |
| Nesa et al. | SensorRank: An energy efficient sensor activation algorithm for sensor data fusion in wireless networks | |
| Bhattacharjee et al. | Exploring an energy-efficient DTN framework supporting disaster management services in post disaster relief operation | |
| Irish et al. | Efficient data collection using dynamic mobile sink in wireless sensor network | |
| Al-Turjman | Wireless sensor networks: Deployment strategies for outdoor monitoring | |
| He et al. | Greedy construction of load‐balanced virtual backbones in wireless sensor networks | |
| Pham et al. | Minimizing latency for data aggregation in wireless sensor networks: An algorithm approach | |
| Mishra et al. | Analyzing and evaluating the performance of 6L0WPAN and RPL using CONTIKI | |
| Materukhin et al. | An efficient method for collecting spatio-temporal data in the WSN using mobile sinks | |
| JP5679768B2 (en) | Route control method, communication system, wireless terminal and gateway terminal | |
| Praghash et al. | An enhanced Steiner hierarchy (E-SH) protocol to mitigate the Bottleneck in wireless sensor networks (WSN) | |
| Zhang et al. | Minimized delay with reliability guaranteed by using variable width tiered structure routing in WSNs | |
| Acharya et al. | Energy-aware virtual backbone tree for efficient routing in wireless sensor networks | |
| Kumar et al. | Data aggregation in wireless sensor networks | |
| Zhai et al. | Harnessing the flow of ecological data across networks, middleware, and applications | |
| Zhao et al. | Reliable graph routing in industrial wireless sensor networks | |
| He et al. | Wireless ad hoc and sensor networks: management, performance, and applications |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20161228 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |