CN104202772B - Mobile Sink collecting methods applied to the node memory resource-sharing of wireless sensor network - Google Patents
Mobile Sink collecting methods applied to the node memory resource-sharing of wireless sensor network Download PDFInfo
- Publication number
- CN104202772B CN104202772B CN201410455897.7A CN201410455897A CN104202772B CN 104202772 B CN104202772 B CN 104202772B CN 201410455897 A CN201410455897 A CN 201410455897A CN 104202772 B CN104202772 B CN 104202772B
- Authority
- CN
- China
- Prior art keywords
- node
- emergency
- tree
- sink
- spanning tree
- 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.)
- Expired - Fee Related
Links
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 kind of mobile Sink collecting methods of the node memory resource-sharing applied to wireless sensor network.Mobile Sink is moved along desired trajectory with constant speed.In network is uniformly distributed inRPPoint is resident, collection come fromRPPoint is formed by tree rootKJump the data of spanning tree interior joint.Caching is in an emergency defined in invention is in an emergency with the time, is in an emergency when caching occurs in node, can be by alleviating memory pressure with the neighbor node shared drive resource in same tree；It is in an emergency when caching occurs in tree, memory pressure can be alleviated by shared drive resource between neighbours tree.Memory source between node, which is shared, reduces the packet loss caused by node memory overflows.When time is in an emergency, packet that node is actively in an emergency to mobile Sink uplink times makes packet not exceed because of transmission delay by the time.
Description
Technical field
The invention belongs to wireless sensor network data acquisition technique, specifically jumps spanning tree in K the present invention relates to one kind
Memory source is shared between node on underlying topology, carries out local data's collection, and be applied to wireless sensor network
Mobile Sink collecting methods.
Background technology
Wireless sensor network is there is many applications in which playing an important role, such as conventional data acquisition, long-range malice position
Put monitoring, emergency response etc..Wireless sensor network is a large amount of miniature cheap sensor sections by being deployed in monitored area
Point is formed, and these nodes are generally all battery powered and memory resource limitation.In practical application, it is typically uneconomical to replace battery
It is and inoperable.Limited memory space limits the number of the storable perception data of node.Therefore, network life and
Two important parameters when cache overflow is Design of Wireless Sensor Network.
In typical wireless sensor network, static Sink node is located at network center, node by multi-hop mode to
Sink uploads perception data.The packet of oneself is not only sent to Sink by node, to be also responsible for forwarding other nodes to send
Packet.Therefore, the sensor node close to Sink is due to larger packet forwarding task, energy expenditure ratio distance Sink
Node energy consumption farther out is faster, and here it is so-called hot-zone problem.Hot-zone problem causes Sink node to be isolated to network
In other nodes outside, decline network performance.
Many researchers propose solve the problems, such as hot-zone in sensor network and improve data acquisition have using mobile Sink
Effect property.Po-Liang Lin and Ren-Song Ko were in 2012《International Journal of Distributed
Sensor Networks》On publish an article " An Efficient Data-Gathering Scheme for
Heterogeneous Sensor Networks via Mobile Sinks ", advised by TDD algorithms, allocation algorithm and path
Draw so that the internal memory of node overflows minimum within preset time.The sub-clustering of network is completed based on TDD algorithms, selects cluster head and cluster
Interior nodes (DH and DM).Node i calculates Telk[i], each one clock of node maintenance and from Telk[i] countdown, in clock meter
When terminate before, if do not receive from neighbor node DH broadcast message, oneself to surroundings nodes broadcast DH bags, receive
The node selection internal memory of the broadcast packet overflows time minimum cluster head and adds the cluster, and return one state bag that oneself is DM to
Cluster head.The time is overflowed in order to extend the internal memory of DH nodes, it is further proposed that allocation algorithm.By selecting data sampling rate maximum
Preceding k member node share the data that DH is collected, extend cluster internal memory overflow the time.Pass through DMWFS algorithms or DTSP
Algorithm is planned mobile Sink mobile route.The algorithm solves from the angle that nodal cache overflows to introducing mobile Sink
Network hotspot problem carries out algorithm design, and network is divided into the cluster of a jump, and traveling through all DH by mobile Sink carries out data acquisition；
When motion track determines, balanced internal memory overflows time and the minimum DH of two factors selection weights of displacement as next
Target location.Advantage can be efficiently reduced because nodal cache overflows the loss of the packet brought；But it is not suitable for big
Scale network, because the jump cluster head of traversal one carries out data acquisition and data transfer can be caused to be delayed for large scale network, so as to lead
Cause datagram overflow internal memory.
Xu Li et al. 2012 exist《IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS》On
It is proposed " Localized Geographic Routing to a Mobile Sink with Guaranteed Delivery
In Sensor Networks " algorithms, propose a kind of complete positioning service Routing Protocol ILSR mechanism (Integrated
Location Service and Routing).In the network of a connection, Sink is carried out so that relatively low speed is slowly mobile
Data Collection, remain in moving process and keep connecting between at least one network node.By sending out the node in network
The HELLO bags sent are intercepted, and Sink can know the positional information of the node in network.When Sink has found certain new link, or
Person has found certain link that will or be broken (as caused by Sink movement), by broadcasting flooding in a network
The two kinds of packets of type and routing type, the part of nodes into network issue oneself new positional information.Section
The next-hop node rather than the change of Sink accurate positional information that point is slowly communicated by maintenance change with Sink, have
The hop count of the reduction location update message of effect in a network, reduces energy expense；Further, since location update message band
The overhead issues come, article the forwarding scope of control new information in a network, have efficiently controlled energy by LC mechanism
Excessive overhead issues.Shortcoming is, although HELLO bags are little, the energy expenditure that the continuous propagation of HELLO message is brought accumulates meeting
Become over time big.
Liu Danpu et al. 2013 exist《Communications,China》On publish an article " Energy-
efficient transmission scheme for mobile data gathering in Wireless Sensor
Networks ", MIHOP mechanism is proposed, two kinds of mechanism of the virtual MIMO based on sub-clustering and Multi-Hop are combined, according to section
Whether hop count is more than one with reference to jumping figure value MH between point and Sink, determines the different communication modes between node and Sink.Sink
Moved along desired trajectory, in specific data of the point broadcast BEACON message cycle collections from node；Sink matches somebody with somebody
Two antennas are put, other nodes configure an antenna and carry out data upload.It is logical between different range node and Sink in order to determine
Letter pattern, in network formation stages, mobile Sink is stopped in each data collection point and is broadcasted a BEACON message, should
MH and K is included in BEACON message.MH and K represents the optimal maximum hop count of the node to be communicated according to multi-hop mode with Sink respectively
With the hop count of node to Sink；After all nodes determine the communication pattern with Sink, using TDMA mechanism, node is determined by Sink
The order of data transfer.The advantages of algorithm is to be layered network node according to node hop count different from Sink's, and different layers use
Different communication mechanisms, can the best adaptability using current mechanism to heterogeneous networks scale, by each level section in network
The energy consumption of point controls the life-span in reduced levels, extending whole network.Shortcoming is not account for putting down for different layers node energy consumption
Weighing apparatus property, it is understood that there may be a certain other layers of node layer observable index are fast, cause the appearance of network partition.
Kwnagcheol Shin and Soontae Kim were in 2012《The Journal of Supercomputing》
It is proposed " Predictive routing for mobile sinks in wireless sensor networks:a
milestone-based approach”.Sink determines to accuse into row positional information in moving process, according to oneself mobile status
The type known.If sink moving process does not change direction, Sink calculates newly enters oneself communication range to because mobile
Node send position prediction information, do not do the renewal of large-scale Sink position predictions；If occur in Sink moving process
Direction changes, then Sink is by the current milestone section of the coordinate news of the predicted position of calculating, previous milestone node
Point, after receiving the message, current milestone node can form a beacon message, and Sink prediction bits are included in the message
Put, the coordinate of time and previous milestone node caused by the coordinate of oneself, Sink location messages, it is previous according to what is obtained
Milestone node coordinate, in the way of greedy routing, beacon message is transmitted to previous milestone node.Participate in the section of forwarding
Point also can according to the information in beacon message to oneself store sink positions, time caused by position, beaconing nodes coordinate
It is updated.And the neighbor node of these forward node can be by way of intercepting, to obtain Sink latest position letter
Breath.The characteristics of algorithm is when Sink moving directions change, and small range renewal position prediction information, avoids broadcasting Sink on a large scale
Location update message, reduce energy expense；Periodic calibration Sink positional informations, improve the precision of location estimation.Shortcoming be by
It need to can be extended by neighbor node indirect gain Sink positional informations, data packet transmission path in part of nodes.
To sum up, common problem is when wireless sensor network data gathers at present：
1st, when mobile Sink carries out local data collection in a network, Sink needs all or part of sections in traverses network
Point, because mobile Sink speed is relatively low, cause data transfer delay larger；And pair data come because of Sink low speed moving belt pass
Situation of the packet beyond the deadline caused by defeated delay considers deficiency；
2nd, transmitted due to data to Sink and delay be present, node needs to cache the data perceived, by sensor
Node own hardware limits, it is understood that there may be internal memory, which overflows, causes data-bag lost；
The content of the invention
The invention aims to solve existing for node memory space finite data acquisition technique in the prior art not
Foot, propose that Sink collecting methods, node root are moved in a kind of node memory resource-sharing applied to wireless sensor network
According to the internal memory service condition between neighbor node, to can shared memory source the data that will overflow of neighbor node forwarding
Bag, so as to reduce packet packet loss caused by spilling.
In order to reach object above, the invention provides memory source between a kind of node applied to wireless sensor network
Shared mobile Sink collecting methods.Including two stages：Preparatory stage and data acquisition phase；
The preparatory stage, complete using predetermined RP points as the structure of the K jump trees of tree root and without data acquisition；The standard
The standby stage includes two subdivisions：The foundation of tree and isolated node add spanning tree；
The foundation of the tree refers to, mobile Sink enters first Round of network, according to desired trajectory in a network with
Constant speed movement, and the points of the RP to be uniformly deployed in network is tree roots, structure K jumps spanning tree；Wherein, Round refers to
Sink node is since original position up to turning again to the process of original position；RP points are artificially to specify in advance, are uniformly divided
It is distributed in the geographical position coordinates point for being resident progress data acquisition among network in this place for Sink；
The structure K jumps spanning tree：
Mobile Sink node reaches RP points, jumps tree to a hop neighbor node broadcasts K and establishes message Tree_Msg, is wrapped in message
Containing Hop, IDRP, IDi, Eresidual, wherein Hop, IDRP、IDi、EresidualRespectively node is to the hop counts of RP points, the ID marks of RP points
Know, the ID of sensor node marks, the dump energy of node；Mobile Sink Hop is set to 0, EresidualFor infinite；Initially
The Hop of all nodes is infinite under state；
Directly receive the node of mobile Sink broadcast message, by the Hop of oneself is set to 1 and will be in Tree_Msg message it is surplus
Complementary energy is substituted for the dump energy of oneself, continues to broadcast Tree_Msg to the hop neighbor node of oneself；
Intermediate node i receives the Tree_Msg from neighbor node j, if the HOP of node i is infinite, node i
Sending node j is added in father node list to be selected according to Hop ascending orders order；Finally, node i is selected from father node list to be selected
Select dump energy and be more than threshold value EthAnd the minimum node j of Hop numbers is as the father node of oneself；When multiple conditions of meeting being present
During father node, then the maximum node j of dump energy is chosen as the father node of oneself；If all father nodes to be selected of node i
Dump energy is respectively less than Eth, then the maximum node of dump energy is selected as the father node of oneself；After determining father node j, it will save
Point j Hop ← Hop+1 is assigned to node i, and by EresidualContinue to forward Tree_ after being substituted for the dump energy of node i oneself
Msg；
Work as Hop=K, stopping continues to forward Tree_Msg message, and the K using the RP as tree root jumps tree foundation and completed；Receive and
From different IDRPTree_Msg then ignore after the message that receives, so as to avoid node while belong to two or more trees；
The isolated node adds spanning tree：
Mobile Sink completes the sub-clustering of whole network after first Round；After T+ ε, the isolated node i in network
To surrounding neighbours node broadcasts Isolated message, the id information of oneself is included in message；Wherein, T travels through institute for mobile Sink
The time required to having RP points, ε is the time to be communicated once positioned at mobile Sink and K the jump set sensor node of RP points；Isolated node is
Refer to the node that the Hop states after T+ ε are still initial；
The non-orphaned node for receiving Isolated message returns to ACK message to the node immediately, and ACK message represents that response disappears
Breath, and turn into the father node of the node, the hop count information in message comprising the node to current mobile Sink positions；Simultaneously
Multiple ACK be present, node i selects the node of HOP minimums in ACK message as the father node of oneself；Isolated node by oneself
Clock is adjusted to and father node time synchronized；
The data acquisition phase is：
Spanning tree is established after completion, and mobile Sink enters line number evidence by all RP points of desired trajectory traversal in a network and adopted
Collection, collection are buffered in the data in each subtree；When appearance tree caching, which is in an emergency, is in an emergency with the time, node continues to gather after being in an emergency
The latest data bag arrived is route by shortest path to Sink；Mobile Sink presses desired trajectory and travels through all RP points, makes each node can
To estimate current mobile Sink position Loc according to time synchronized clock, so as to ensure that packet can be actively to movement
Sink is uploaded.
Further, the normal data of data acquisition phase, which uploads, is：
Do not occur in the case of caching is in an emergency and is in an emergency with the time, when mobile Sink reaches the RP points of i-th tree, according to the time
Synchronised clock, with RPiFor all nodes on the tree of tree root, direction in opposite direction is established along with tree, to mobile Sink sections
Point uploads packet, until mobile Sink starts to move to next RP points；
The caching, which is in an emergency, to be in an emergency and sets including nodal cache caching and be in an emergency；Wherein, nodal cache, which is in an emergency, refers to that node delays
The data deposited exceed the P% of itself capacity, and P value is set according to application requirement；Tree caching, which is in an emergency, refers to own on same one tree
Subtree, which can not find, can carry out the shared neighbours' subtree of memory source therewith；
The time, which is in an emergency, to be referred to, current time Distance-Tree deadline is tstopWhen, mobile Sink is not appeared in still certainly
Where oneself at the RP points of tree, wherein, tstopFor residence times of the Sink on a stationary point.
Further, the data that the nodal cache that the caching is in an emergency is in an emergency, which upload, is：
There is caching and is in an emergency in node i, and father node does not occur caching and is in an emergency, then node i is newest by what is received or perceive
Packet uploads to father node；
There is caching and is in an emergency in node i, and all father nodes are cached and are in an emergency and child node does not send internal memory and is in an emergency, then node
I shifts the latest data bag for receiving or perceiving to child node；
There is caching and is in an emergency in node i, and all father nodes and child node are cached and be in an emergency, then the subtree where node i
Leaf node, memory sharing request is sent to the neighbours' leaf node being subordinated in same tree in non-same subtree, if in neighbours' subtree
Leaf node exist can shared drive, then return to Response message, can be used for the interior of memory sharing comprising the node in message
Deposit resource information；After node i receives Response message, in Response message can shared drive resource, receive
Or the newest packet perceived is sent to respective neighbor node；If not receiving the Response message from neighbours' subtree,
Then show in neighbours' subtree that all nodes caching occur and are in an emergency, be now tree caching occur to be in an emergency phenomenon.
Further, the data that the tree caching that the caching is in an emergency is in an emergency, which upload, is：
There is tree caching to be in an emergency, leaf node sends that memory source is shared to the hop neighbor node for being subordinated to different trees please
Ask, receive request bag and the node on the different trees, if there is can shared drive resource, then return to Response message；
Receive the node of Response message in Response message can shared drive resource, it is newest what is received or perceive
Packet be sent to respective neighbor node；If the equal cluster caching of neighbor node in all jumps is in an emergency, will by leaf node
The newest packet for receiving or perceiving is actively to mobile Sink transmission.
Further, the time be in an emergency data upload be：
In given Vsink、NRP、DRPAnd tstopUnder the conditions of, if nodes time of occurrence is in an emergency, node is according to most short
Path is route, by the packet that time of occurrence in tree is in an emergency to mobile Sink active uploads, wherein, Vsink、NRP、DRP、tstopPoint
Do not refer to mobile Sink translational speeds, RP counts out, the residence time of distance, mobile Sink on RP points between RP points.
Beneficial effects of the present invention：Memory source is total between the present invention realizes node in the case of node memory resource-constrained
Enjoy, reduce the packet loss caused by internal memory overflows；By the consideration to hop count distance and residue energy of node when spanning tree is built,
Energy expenditure between weighing apparatus node.
Brief description of the drawings
Fig. 1 is inventive network model；
Fig. 2 is the workflow diagram of mobile Sink in the present invention；
Fig. 3 is that K of the present invention jumps spanning tree structure flow chart；
Fig. 4 moves schematic diagram in a network for the mobile Sink of the present invention according to desired trajectory；
Fig. 5 jumps spanning tree schematic diagram for K in the present invention.
Embodiment
The present invention carries out data acquisition in network design region by mobile Sink according to predetermined track, and according to institute
Preparatory stage and data acquisition phase are stated, proposes a kind of mobile Sink collecting methods applied to wireless sensor network.
Carry out the shared of memory source in the present invention between the main node for proposing to make memory resource limitation, and using RP points as
It is the upload that network topology carries out packet that the K of tree root, which jumps spanning tree,.K, which jumps spanning tree, has following features：
1) the more node of dump energy is located at the upper end of spanning tree, i.e., close to tree root, and possesses multiple child nodes；
2) the more node of dump energy undertakes heavier data forwarding task；
3) the less node of dump energy is located at spanning tree end as far as possible, i.e., away from tree root, and possesses less son section
Point；
4) the less node of dump energy undertakes relatively low data forwarding task；
Further description is done to the present invention below in conjunction with the accompanying drawings.
It is network model as shown in Figure 1, network includes mobile Sink node, RP points and sensor node.Mobile Sink
Node random placement general sensor nodes, these nodes in the resident progress data acquisition of RP points, network along desired trajectory
Geographical location information is, it is known that other nodes are irremovable in addition to mobile Sink.Mobile Sink is with constant speed VsinkEdge is predetermined
Move track.
The flow chart that mobile Sink carries out data acquisition is illustrated in figure 2, is specifically comprised the following steps：
Step 201, the K that mobile Sink is initiated using RP points as tree root jumps the foundation of spanning tree, is the preparatory stage；
Step 202, mobile Sink carries out data acquisition；
The step 201 refers to first Round of Sink in a network.Preparatory stage, the whole network is completed with predetermined RP points
For tree root K jump tree structure and without data acquisition.Preparatory stage includes two subdivisions：K jump spanning tree foundation and
Isolated node adds spanning tree.
The structure of K jumps spanning tree refers to that mobile Sink enters first Round of network, according to pre- orbit determination in step 201
Mark is moved with constant speed in a network, and the points of the RP to be uniformly deployed in network is tree roots, structure K jumps spanning tree；Its
In, Round refers to the process of move Sink node since original position up to turning again to original position；RP points are pre- ancestors
To be specified, it is uniformly distributed among network and is resident the geographical position coordinates point for carrying out data acquisition in this place for mobile Sink；
The structure that K jumps spanning tree specifically performs following steps, as shown in Figure 3：
Step 301, mobile Sink node initiates the structure that K jumps spanning tree：
As shown in figure 4, mobile Sink travels through all RP points according to desired trajectory in a network.Mobile Sink node often reaches
One RP point, jump tree to a hop neighbor node broadcasts K and establish message Tree_Msg, Hop, ID are included in messageRP, IDi,
Eresidual, wherein Hop, IDRP、IDi、EresidualRespectively node is to the hop counts of RP points, the ID marks of RP points, sensor node
ID mark, the dump energy of node.Mobile Sink Hop is set to 0, EresidualFor infinite.All sections under original state
The Hop of point is infinite；
Step 302, intermediate node selection father node and forwarding tree structure message：
Directly receive the node of mobile Sink broadcast message, by the Hop of oneself is set to 1 and will be in Tree_Msg message it is surplus
Complementary energy is substituted for the dump energy of oneself, continues to broadcast Tree_Msg to the hop neighbor node of oneself；
Intermediate node i receives the Tree_Msg from neighbor node j, if the HOP of node i is infinite, node i
Sending node j is added in father node list to be selected according to Hop ascending orders order.Finally, node i is selected from father node list to be selected
Select dump energy and be more than threshold value EthAnd the minimum node j of Hop numbers is as the father node of oneself；When multiple conditions of meeting being present
During father node, then the maximum node j of dump energy is chosen as the father node of oneself；If all father nodes to be selected of node i
Dump energy is respectively less than Eth, then the maximum node of dump energy is selected as the father node of oneself.After determining father node j, it will save
Point j Hop ← Hop+1 is assigned to node i, and by EresidualContinue to forward Tree_ after being substituted for the dump energy of node i oneself
Msg；
Step 303, terminate forwarding K jumps spanning tree and establish message：
Until Hop=K, stopping continues to forward Tree_Msg message, and the K using the RP as tree root jumps tree foundation and completed.Receive
From different IDRPTree_Msg then ignore after the message that receives, so as to avoid node while belong to two or more trees.
Step 304, isolated node adds spanning tree：
Mobile Sink completes the sub-clustering of whole network after first Round；After T+ ε, the isolated node i in network
To surrounding neighbours node broadcasts Isolated message, the id information of the node is included in message.Wherein, T is that Sink traversals are all
The time required to RP points, ε is the time to be communicated once positioned at mobile Sink and K the jump set sensor node of RP points；Isolated node refers to
Hop states are still initial node after T+ ε.The non-orphaned node for receiving Isolated message returns to the node immediately
ACK message containing the hop count information to RP, ACK message represents response message, and turns into the father node of the node, is wrapped in message
Hop count information containing the node to current mobile Sink positions；Multiple ACK simultaneously be present, node i is selected in ACK message
Node minimum Hop is as the father node of oneself.The clock of oneself is adjusted to and father node time synchronized by isolated node.
It is illustrated in figure 5 and jumps spanning tree by K formed by tree root of RP points according to mentioned above principle structure.
Data acquisition phase described in step 202 is that spanning tree is established after completion, and Sink carries out data acquisition in a network
Process.Data acquisition phase includes：Normal data upload, caching be in an emergency data upload and the time be in an emergency data upload；
Data acquisition phase, mobile Sink travel through each RP points with desired trajectory, and the data being buffered in each subtree are carried out
Collect.Occur tree caching be in an emergency be in an emergency with the time when, node by the packet for receiving or perceiving according to shortest path to
Sink is route.Mobile Sink presses desired trajectory and travels through all RP points, each node is estimated according to time synchronized clock current mobile
Sink positions Loc, so as to ensure that packet can be uploaded actively to mobile Sink.
The node estimates current mobile Sink position Loc according to time synchronized clock, is illustrated in figure 4 movement
Sink moves schematic diagram by track is subscribed.Mobile Sink is t in RP points residence timestop, translational speed is between 2 RP points
Vsink, Euclidean distance is D between adjacent two RP pointsRP, any time t, it may be determined that mobile Sink positional information.(if k-1) *
(tstop+DRP/Vsink)≤t≤(k-1)*(tstop+DRP/Vsink)+tstop, then Sink reside in ID be k RP points, k values be 1,
2 ... ..., NRP；(if k-1) * (tstop+DRP/Vsink)+tstop≤t≤k*(tstop+DRP/Vsink), then it is k to move Sink in ID
Moved between k+1 two RP points.Due to moving Sink only in RP point gathered datas, moved when moving Sink between two RP points
When, it is necessary to move radially the node of Sink transmission packets according to shortest path, wait t1=k* (tstop+DRP/Vsink)+tstop-t
After time, to mobile Sink transmission packets.
Data acquisition phase is described in detail below：
(1) normal data uploads
Do not occur caching to be in an emergency and in the case of the time is in an emergency, when mobile Sink reaches the RP points of i-th tree, according to the time
Synchronised clock, with RPiFor all nodes on the tree of tree root, direction in opposite direction is established along with tree, to mobile Sink sections
Point uploads packet, until mobile Sink starts to move to next RP points；
(2) data upload of being in an emergency is cached
The caching, which is in an emergency, to be in an emergency and sets including nodal cache caching and be in an emergency；
1) nodal cache be in an emergency data upload
When the data of nodal cache exceed the P% of itself capacity, P value is set according to application requirement, then claims nodal cache
It is in an emergency.When nodal cache is in an emergency, data upload process is as follows：
There is caching and is in an emergency in node i, and father node does not occur caching and is in an emergency, then the latest data bag that will be received or perceive
Upload to father node；
There is caching and is in an emergency in node i, and all father nodes are cached and are in an emergency and child node does not send internal memory and is in an emergency, then will be connect
The latest data bag received or perceived shifts to child node；
There is caching and is in an emergency in node i, and all father nodes and child node are cached and be in an emergency, then the subtree where node i
Leaf node, neighbours' leaf node into the same tree of subordinate in non-same subtree send memory sharing request.If leaf in neighbours' subtree
Node exist can shared drive, then return to Response message, the internal memory that can be used for memory sharing comprising the node in message provides
Source information；Receive the node of Response message in Response message can shared drive resource, receive or perceive
To newest packet be sent to respective neighbor node；If not receiving the Response message from neighbours' subtree, show
There is caching and are in an emergency in all nodes in neighbours' subtree, are now tree caching occur to be in an emergency phenomenon；
2) tree caching be in an emergency data upload
When all subtrees can not find and can carry out the shared neighbours' subtree of memory source therewith on same one tree, then claim tree
Caching is in an emergency.When tree caching is in an emergency, leaf node sends memory source sharing request to the hop neighbor node for being subordinated to different trees,
Receive request bag and the node on the different trees, if there is can shared drive resource, then return to response Response message.
Receive the node of Response message in Response message can shared drive resource, it is newest what is received or perceive
Packet be sent to respective neighbor node；If the equal cluster caching of neighbor node in all jumps is in an emergency, it will receive or feel
The newest packet known actively transmits to Sink.
(3) time be in an emergency data upload
Time, which is in an emergency, to be referred to, current time Distance-Tree deadline is tstopWhen, Sink is set where not appearing in oneself still
RP points.Wherein, tstopFor residence times of the Sink on a stationary point.It is in an emergency between when present, in given Vsink、NRP、DRP
Under the conditions of t, node is according to Shortest path routing, by the packet that time of occurrence in tree is in an emergency to Sink active uploads.Wherein,
Vsink、NRP、DRP、tstopRefer to Sink translational speeds respectively, RP counts out, distance, mobile Sink are resident on RP points between RP points
Time.
Claims (5)
1. a kind of mobile Sink collecting methods of node memory resource-sharing applied to wireless sensor network, its feature
It is to include two stages：Preparatory stage and data acquisition phase；
The preparatory stage, complete using predetermined RP points as the structure of the K jump spanning trees of tree root and without data acquisition；The standard
The standby stage includes two subdivisions：K jumps the foundation of spanning tree and isolated node adds K and jumps spanning tree；
The foundation that the K jumps spanning tree refers to that mobile Sink enters first Round of network, according to desired trajectory in network
In moved with constant speed, and the points of the RP to be uniformly deployed in network is tree roots, structure K jumps spanning tree；Wherein, Round
Refer to the process of move Sink since original position up to turning again to original position；RP points are artificially to specify in advance,
It is even to be distributed in the geographical position coordinates point for supplying mobile Sink to be resident progress data acquisition in this place among network；K is spanning tree
Depth；
The structure K jumps spanning tree：
Mobile Sink reaches RP points, jumps spanning tree to a hop neighbor node broadcasts K and establishes message Tree_Msg, is included in message
Hop, IDRP, IDi, Eresidual, wherein Hop, IDRP、IDi、EresidualRespectively node is to the hop counts of RP points, the ID marks of RP points
Know, the ID of node marks, the dump energy of node；Mobile Sink Hop is set to 0, EresidualFor infinite；Under original state
The Hop of all nodes is infinite；
The node of mobile Sink broadcast message is directly received, the Hop of oneself is set to 1 and by the residual energy in Tree_Msg message
Amount is substituted for the dump energy of oneself, continues to broadcast Tree_Msg to the hop neighbor node of oneself；
Intermediate node i receives the Tree_Msg from neighbor node j, if the HOP of node i is infinite, node i according to
Hop ascending orders order adds sending node j in father node list to be selected；Finally, node i selects surplus from father node list to be selected
Complementary energy is more than threshold value EthAnd the minimum node j of Hop numbers is as the father node of oneself；Saved when multiple fathers for meeting condition be present
During point, then the maximum node j of dump energy is chosen as the father node of oneself；If all father nodes to be selected of node i are remaining
Energy is respectively less than Eth, then the maximum node of dump energy is selected as the father node of oneself；After determining father node j, by node j's
Node i is assigned to after Hop values plus 1, and by EresidualContinue to forward Tree_Msg after being substituted for the dump energy of node i oneself；
Work as Hop=K, stopping continues to forward Tree_Msg message, and the K using the RP as tree root jumps spanning tree and establishes completion；Receive and
From different IDRPTree_Msg then ignore after the message that receives, jump generation so as to avoid node while belong to two or more K
Tree；
The isolated node adds K jumps spanning tree：
Mobile Sink completes the sub-clustering of whole network after first Round；After T+ ε, isolated node i in network is to week
Neighbor node broadcast Isolated message is enclosed, the id information of oneself is included in message；Wherein, T is that mobile Sink travels through all RP
The time required to point, ε is the time to be communicated once with K hop nodes positioned at the mobile Sink of RP points；Isolated node refers to after T+ ε
Hop states are still initial node；
The non-orphaned node for receiving Isolated message returns to ACK message to isolated node immediately, and ACK message represents that response disappears
Breath, and as the father node of isolated node, comprising receiving the non-orphaned node of Isolated message to current movement in message
The hop count information of Sink positions；Multiple ACK simultaneously be present, node i selects the node that HOP is minimum in ACK message to be used as certainly
Oneself father node；The clock of oneself is adjusted to and father node time synchronized by isolated node；
The data acquisition phase is：
Spanning tree is established after completion, and mobile Sink presses desired trajectory and travels through all RP points progress data acquisitions in a network, adopts
Data of the set cache in each sub- spanning tree；When occur spanning tree caching be in an emergency be in an emergency with the time when, node continues after being in an emergency
The latest data bag collected moves radially Sink routes by shortest path；Mobile Sink presses desired trajectory and travels through all RP points, makes
Each node can estimate current mobile Sink position Loc according to time synchronized clock, so as to ensure that packet can be actively
Uploaded to mobile Sink.
2. the mobile Sink data of the node memory resource-sharing according to claim 1 applied to wireless sensor network
Acquisition method, it is characterised in that the normal data of data acquisition phase, which uploads, is：
Do not occur in the case of caching is in an emergency and is in an emergency with the time, when mobile Sink reaches the RP points of i-th spanning tree, according to the time
Synchronised clock, with RPiFor all nodes in the spanning tree of tree root, direction in opposite direction, Xiang Yi are established along with spanning tree
Dynamic Sink node uploads packet, until mobile Sink starts to move to next RP points；
The caching is in an emergency to be in an emergency including nodal cache and is in an emergency with spanning tree caching；Wherein, nodal cache, which is in an emergency, refers to that node delays
The data deposited exceed the P% of itself capacity, and P value is set according to application requirement；Spanning tree caching, which is in an emergency, refers to same generation
All sub- spanning trees, which can not find, on tree can carry out the shared sub- spanning tree of neighbours of memory source therewith；
The time, which is in an emergency, to be referred to, current time is t apart from spanning tree deadlinestopWhen, mobile Sink does not appear in oneself still
At the RP points of place spanning tree, wherein, tstopFor residence times of the mobile Sink on a RP point.
3. the shared mobile Sink numbers of memory source between the node according to claim 2 applied to wireless sensor network
According to acquisition method, it is characterised in that the data that the nodal cache that the caching is in an emergency is in an emergency, which upload, is：
There is caching and is in an emergency in node i, and father node does not occur caching and is in an emergency, then the latest data that node i will be received or perceived
Wrap and pass to father node；
There is caching and is in an emergency in node i, and all father nodes are cached and are in an emergency and child node does not send internal memory and is in an emergency, then node i will
The latest data bag for receiving or perceiving shifts to child node；
There is caching and is in an emergency in node i, and all father nodes and child node are cached and be in an emergency, then the sub- spanning tree where node i
Leaf node, memory sharing request is sent to the neighbours' leaf node being subordinated in same spanning tree in non-same sub- spanning tree, if adjacent
Occupy leaf node in sub- spanning tree exist can shared drive, then return to Response message, can be used in message comprising the node
The memory source information of memory sharing；After node i receives Response message, in Response message can shared drive
Resource, the newest packet for receiving or perceiving is sent to respective neighbor node；If do not receive from the sub- spanning tree of neighbours
Response message, then show in the sub- spanning tree of neighbours that all nodes caching occur and are in an emergency, be now spanning tree occur
Cache phenomenon of being in an emergency.
4. the mobile Sink data of the node memory resource-sharing according to claim 2 applied to wireless sensor network
Acquisition method, it is characterised in that the data that the spanning tree caching that the caching is in an emergency is in an emergency, which upload, is：
There is spanning tree caching to be in an emergency, leaf node sends memory source to the hop neighbor node for being subordinated to different spanning trees and shared
Request, receive request and the node in the different spanning trees, if there is can shared drive resource, then return to Response and disappear
Breath；Receive the node of Response message in Response message can shared drive resource, what is received or perceive
Newest packet is sent to respective neighbor node；If the equal cluster caching of neighbor node in all jumps is in an emergency, by leaf segment
Point is by the newest packet for receiving or perceiving actively to mobile Sink transmission.
5. the mobile Sink data of the node memory resource-sharing according to claim 1 applied to wireless sensor network
Acquisition method, it is characterised in that the time be in an emergency data upload be：
In given Vsink、NRP、DRPAnd tstopUnder the conditions of, if nodes time of occurrence is in an emergency, node is according to shortest path
Route, by the packet that time of occurrence in spanning tree is in an emergency to mobile Sink active uploads, wherein, Vsink、NRP、DRP、tstopPoint
Do not refer to mobile Sink translational speeds, RP counts out, the residence time of distance, mobile Sink on RP points between RP points.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410455897.7A CN104202772B (en) | 2014-09-09 | 2014-09-09 | Mobile Sink collecting methods applied to the node memory resource-sharing of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410455897.7A CN104202772B (en) | 2014-09-09 | 2014-09-09 | Mobile Sink collecting methods applied to the node memory resource-sharing of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104202772A CN104202772A (en) | 2014-12-10 |
| CN104202772B true CN104202772B (en) | 2018-04-10 |
Family
ID=52087983
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410455897.7A Expired - Fee Related CN104202772B (en) | 2014-09-09 | 2014-09-09 | Mobile Sink collecting methods applied to the node memory resource-sharing of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104202772B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104469823B (en) * | 2014-12-17 | 2018-05-11 | 湖南大学 | A kind of WSN time delay optimization methods applied to transmission line of electricity on-line monitoring |
| CN104540173B (en) * | 2015-01-04 | 2018-08-03 | 河海大学常州校区 | A kind of wireless sensor network mobile data collection method based on tree-shaped clustering architecture |
| CN106102017A (en) * | 2016-05-31 | 2016-11-09 | 厦门纵行信息科技有限公司 | The network-building method of a kind of tree-shaped multihop network and Wireless Telecom Equipment |
| CN106658539B (en) * | 2016-12-23 | 2020-07-07 | 苏州工业职业技术学院 | Mobile path planning method for mobile data collector in wireless sensor network |
| CN108521634B (en) * | 2018-02-11 | 2020-09-15 | 南京邮电大学 | Mobile Sink data collection method based on energy consumption balance tree |
| CN109982283B (en) * | 2019-02-15 | 2021-10-22 | 江苏商贸职业学院 | Industrial cloud and mist architecture communication system oriented to expected transmission energy consumption |
| CN112637804B (en) * | 2020-11-19 | 2021-10-26 | 中国人民解放军国防科技大学 | Dynamic layered networking method for obstacle avoidance wireless sensor network |
| CN112689314B (en) * | 2020-12-22 | 2021-09-14 | 哈尔滨学院 | Multi-hop wireless sensor network data path optimization method based on memory allocation |
| CN114697005B (en) * | 2020-12-28 | 2024-06-07 | 科大国盾量子技术股份有限公司 | Distributed wide area quantum cryptography network group key distribution method and system |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101132351A (en) * | 2006-08-21 | 2008-02-27 | 北京邮电大学 | Wireless sensor network path establishing method and device thereof |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8630222B2 (en) * | 2011-02-24 | 2014-01-14 | The Hong Kong University Of Science And Technology | Delay-constrained and energy-efficient online routing for asynchronous sensor networks |
-
2014
- 2014-09-09 CN CN201410455897.7A patent/CN104202772B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101132351A (en) * | 2006-08-21 | 2008-02-27 | 北京邮电大学 | Wireless sensor network path establishing method and device thereof |
Non-Patent Citations (1)
| Title |
|---|
| Rendezvous Planning in Wireless Sensor Networks with Mobile Elements;Guoliang Xing，et al.;《IEEE TRANSACTIONS ON MOBILE COMPUTING》;20081231;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104202772A (en) | 2014-12-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104202772B (en) | Mobile Sink collecting methods applied to the node memory resource-sharing of wireless sensor network | |
| Bi et al. | HUMS: an autonomous moving strategy for mobile sinks in data-gathering sensor networks | |
| TW200408232A (en) | Intelligent communication node object beacon framework(ICBF) with temporal transition network protocol (TTNP) in a mobile AD hoc network | |
| CN106131912B (en) | The mobile Sink method of data capture of wireless sensor network based on tree-shaped cluster | |
| CN103200642B (en) | A kind of optimization method of mobile radio network Route Selection | |
| CN104507135B (en) | A kind of underwater sensor network method for routing of more mobile sink nodes | |
| CN109041127A (en) | The adaptive stabilizing cluster-dividing method and system of load balancing suitable for highly dynamic radio network | |
| CN105871717A (en) | Unmanned aerial vehicle ad hoc network routing method based on link stability | |
| CN101594281A (en) | Collecting network data of wireless sensor method, system and relevant device | |
| CN110167097B (en) | Mobile robot relay routing method based on weighted metric forwarding and path planning | |
| CN103415055A (en) | Wireless sensor network coordinator re-selection algorithm based on assistance of cellular network | |
| CN104202724B (en) | A kind of AANET joint route algorithms based on geographical location information | |
| CN108650137B (en) | Autonomous decision-making type routing protocol for wireless sensor network node | |
| CN114339936A (en) | Aircraft self-organizing network optimization link state routing mechanism based on Q learning | |
| CN108112050A (en) | Energy balance and deep-controlled Routing Protocol based on underwater wireless sensing network | |
| CN101895954A (en) | Opportunistic network routing method based on incremental transmission of packet index | |
| CN107172678A (en) | Wireless sensor network geography information opportunistic routing protocol | |
| Bo et al. | An energy aware routing algorithm for software defined wireless sensor networks | |
| CN107948315B (en) | Method and system for controlling coverage of area of Internet of things | |
| Macintosh et al. | Local Area Network Dynamic (LANDY) routing protocol: A position based routing protocol for MANET | |
| CN101867974B (en) | Data acquisition method in hybrid strip sensor network | |
| CN103260206A (en) | Mixing dynamic wireless router effective search convergence method based on influence degree factors | |
| CN103945483B (en) | Opportunity-network full-coverage low-time-delay routing method based on message ferry | |
| CN111565153B (en) | Method and system for maintaining routing table based on Q-learning algorithm and OLSR routing mechanism | |
| WO2014198120A1 (en) | Wireless mobile network data transmission method based on coverage maintenance and minimum spanning tree |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180410 Termination date: 20200909 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |