CN104244357A - Mobile wireless sensing routing updating method based on controllable local flooding - Google Patents
Mobile wireless sensing routing updating method based on controllable local flooding Download PDFInfo
- Publication number
- CN104244357A CN104244357A CN201410482063.5A CN201410482063A CN104244357A CN 104244357 A CN104244357 A CN 104244357A CN 201410482063 A CN201410482063 A CN 201410482063A CN 104244357 A CN104244357 A CN 104244357A
- Authority
- CN
- China
- Prior art keywords
- node
- anchor
- mobile sink
- root
- 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.)
- Pending
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)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention belongs to the technical field of wireless sensing network protocols, and particularly relates to a routing updating method oriented towards a wireless sensing network with a mobile aggregation node. The method specifically includes the steps that in the wireless sensing network with the single mobile aggregation node, the shortest routing generating tree of the whole network is reconstructed through periodicity, the local shortest routing generating tree is constructed in a limited flooding mode with an anchor node determined by the current position of the single mobile aggregation node as the root, and low-cost real-time data forwarding is achieved on the basis of the shortest routing generating tree of the whole network and the local shortest routing generating tree. According to the method, the characteristic of random mobility of the mobile aggregation node is utilized sufficiently, data transmission reliability and high efficiency are guaranteed, updating expenses are reduced, and the service life of the network is prolonged.
Description
Technical field
The invention belongs to radio sensing network protocol technology field, being specifically related to a kind of wireless sense network route update scheme towards having mobile sink node.The program is fully in conjunction with the mobility of aggregation node, by distributed structure wireless sense network the whole network routing tree structure with dynamically update based on the localized routing of controlled inundation, routing update expense is reduced, prolong network lifetime while guarantee data transmission credibility and high efficiency.
Background technology
In the last few years, the relevant group network technology in wireless multi-hop network (as wireless sensor network, mobile Ad hoc network, wireless mesh network etc.) field obtained the extensive concern of academia and industrial quarters, and achieved great development.Because wireless sensor node has, cost is low, volume is little, not easily change the features such as battery after deployment, and therefore power saving is that wireless sensor network applies the subject matter faced.
Employing mobile sink node effectively can avoid the hot spot region problem in static aggregation node wireless sense network.Hot spot region problem refers to that the wireless sensor node around static aggregation node needs to bear collection and the forwarding task of whole network data, thus becomes the energy bottleneck node in network.Existing research display is disposed mobile sink node and is replaced static aggregation node can avoid the excessive use of energy bottleneck node, extends the network life of several times.
The mobility of mobile sink node can cause the topological structure of target Sensor Network to be difficult to change, the data transfer path inefficacy of prediction, causes tradition cannot be applied to towards the Routing Protocol that static aggregation node designs and has in the wireless sensor network of mobile sink node.Owing to needing extra signaling mechanism to upgrade at the wireless sensor network with mobile sink node and safeguarding that information source sensor node is to the routing iinformation of mobile sink node and routing infrastructure, while how reducing the expense of Dynamic Maintenance network routing infrastructure, ensure that the reliability of transfer of data and high efficiency become the key of mobile wireless Sensor Network Protocol Design.
Summary of the invention:
The present invention is a kind of wireless sensor network Route establishment and update scheme.The program is mainly used in having in the wireless sense network of mobile sink node, and anchor node is determined in the position according to mobile sink node, and the specified node periodically setting up the to change most short-path spanning tree T that is root and then determine the path of data retransmission.Along with the change of mobile sink node position, dynamically determine the anchor node associated by it, and according to anchor node tree T on position and around topological structure, upgraded the partial structurtes of tree T by local inundation mode dynamic local, thus the path that each sensor node of operative constraint arrives mobile sink node effectively controls control signal expense simultaneously.
Network configuration forms
Wireless sensor network is made up of multiple fixed wireless sensor node and a mobile sink node, and mobile sink node can adopt any move mode to move in wireless sense network deployment region.
Periodically set up whole network data route spanning tree
Feature of the present invention carries out local updating to form up-to-date data routing tree in an existing whole network data route spanning tree.For prolong network lifetime, this data routing tree can carry out cycle rotation.The cycle presetting replacement shortest path footpath tree is t
round, as t
roundit is 1 hour or 1 day.When each cycle starts, network Stochastic choice or network manager are by the root vertex of a sensor node in certain regular specified network as T.This root node sets up most short-path spanning tree by the whole network inundation mode.In network, each node is+∞ to the initial value of the path of this root node, during beginning, root node sends broadcasting packet information to its neighbor node, and neighbor node upgrades root node after receiving that message to the path of oneself and continues forwarding messages.Every bar message carries this sending node to the current path information of root node.By the exchange of internodal message information, each non-root node i may learn many information from root node, then it therefrom selects minimum, and as it to it to the shortest path length of root node, and using forwarding the node of this message as tool father node, be denoted as A
i.Whenever path or father node A
iwhen changing, node i all can broadcast its neighbor node of message notice.We remember that the root node of l cycle selection is u
l, corresponding data route spanning tree is designated as
can carry a sequence number in the broadcast that root node sends, this sequence number is when often taking turns data route spanning tree and setting up, and value adds 1, and the routing information with new sequence number can replace old routing information, thus completes the renewal of data route spanning tree simultaneously.
Anchor node is selected and is safeguarded
Certain neighbours' sensor node can be selected in mobile sink node moving process as the anchor node of oneself.The effect of anchor node is the role temporarily serving as aggregation node in network, and by data retransmission to mobile sink node.Time initial, mobile sink node can select sensor node that in neighbor node, signal strength signal intensity is maximum as first anchor node, and carries out localized routing first and upgrade.Each mobile sink node changes anchor node, needs to re-start a localized routing and upgrades.Localized routing upgrades
In order to reduce frequency, the reduction routing update expense of routing update, present invention employs anchor node chain maintenance mechanism.Note node v is anchor node, and its neighbor node collection is designated as NBR (v).When (as 3 seconds) in mobile sink node certain hour do not receive the ACK bag of v, it infers to the link of v disconnected.Note current time is t
1, now the neighbor node of mobile sink node integrates as NBR (MS, t
1), wherein MS represents mobile sink node, if
namely there are the neighbours of anchor node v in current neighbours.Then select wherein signal power to be worth maximum node as first of v from anchor node, and be designated as v
1.V
1send NOTIFY to v, set up anchor node chain, the packet that v receives afterwards is all transmitted to v
1, and then be transmitted to mobile sink node.If now
then mobile sink node reselects signal power and is worth maximum node as new anchor node from its surrounding neighbours node.When mobile sink node is at t
2time moves out from anchor node v
1communication range outer after, it will from NBR (MS, t
2) ∩ NBR (v
1) select new for anchor node v
2.Mobile sink node in like manner can be set up more from anchor node, then v and it from anchor node v
1..., v
kform an anchor node chain.Last node on anchor node chain needs periodically to send ACK bag, to notice adjacency between the two to mobile sink node.When k value is greater than K, then mobile sink node needs to select new anchor node from the neighbor node of oneself, and K+1 represents the length (that is: comprising anchor node v) of anchor node chain.As K=4, then the length of anchor node chain is K+1=4+1=5.Each replacing anchor node, anchor node all needs to the whole network shortest path tree
root node send a notice message, the neighbor node that the node receiving this message all needs local record to receive this message arrives the father node of mobile sink node as it.
Local inundation routing update
Each mobile sink node selects new anchor node, and can initiate once local inundation and upgrade, each inundation upgrades sets up the local shortest path tree that is root with new anchor node, and with the most short-path spanning tree set up in advance
remainder form complete data acquisition tree together.During beginning, new anchor node is broadcasted a routing update message to its neighbor node and is continued by neighbours to forward.Every bar updating message carries two information, and sending node is to the known shortest path length of new anchor node, and initial value is 0, and new anchor node is to most short-path spanning tree
the shortest path length of tree root.Remembering that new anchor node is v, is that local data's routing tree of root is denoted as T with v
v,, the link range between node i, j is designated as d (i, j), and node i, j are at T
kon beeline be designated as
node i, j are at T
kon beeline known be up to now designated as
when node i (i ≠ v) receives the updating message from anchor node v of neighbor node j, node i performs following routing update algorithm: the first, if the updating message newly received brings the shorter path from v to i, then and corresponding renewal
with the parent information of i, further, if
ratio be less than λ, then i continue to its neighbor node broadcast with
value and upgrade after
the updating message be worth.
Specific code is as follows:
In above-mentioned code, the effect of parameter lambda is the path ratio of elongation of control message forward node (or claiming magnification), if λ is larger, then to T
vupper pathway length requirement is looser, and node more likely upgrades and forwarding messages, and thus the scope of local inundation is larger, and node is shorter to the path of anchor node v simultaneously.Wherein,
λ is a positive number being less than 1.
Claims (10)
1. based on the mobile wireless routing of sensor networks update method of localization shortest path tree, it is characterized in that: in the wireless sense network with single mobile sink node, utilize and periodically re-construct the whole network shortest route spanning tree, construct local shortest path tree for root by limited inundation mode with the determined anchor node of mobile sink node current location, forwarded in real time by both data realizing low-cost that combine.
2. method according to claim 1, is characterized in that: wireless sensor network is made up of multiple fixed wireless sensor node and a mobile sink node, and mobile sink node can adopt any move mode to move in wireless sense network deployment region.
3. method according to claim 1, is characterized in that: every t
roundtime periodically re-constructs the shortest route spanning tree that covers the whole network; When each cycle starts, certain sensor node in specified network is as the root vertex of the whole network spanning tree; Remember that the root node that l cycle select is u
l, corresponding data route spanning tree is designated as
the shortest route spanning tree of each structure the whole network, its root node can Stochastic choice, also can be specified by network manager.
4. method according to claim 3, is characterized in that: root node u
lmost short-path spanning tree is set up by the whole network inundation mode, in network, each node is set to+∞ to the initial value of the path of this root node, during beginning, root node sends broadcasting packet information to its neighbor node, also claim shortest path tree structure message, neighbor node upgrades the path oneself arriving root node after receiving that message also to be continued to forward this message; Every bar message carries the current shortest path length information of this root node to sending node; By the exchange of message information between adjacent node, each non-root node i may learn many routing iinformations from root node, then its therefrom selecting paths length is minimum, and as it to it to the shortest path length of root node, and using forwarding the node of this message as its father node, be denoted as A
i; Whenever path or father node A
iwhen changing, node i all can be broadcasted a fresh information and notify its neighbor node.
5. method according to claim 4, it is characterized in that: in the shortest path tree structure message that root node sends, a sequence number can be carried simultaneously, this sequence number is when often taking turns data route spanning tree and setting up, value adds 1, the routing information with new sequence number can replace old routing information, thus completes the renewal of data route spanning tree.
6. method according to claim 1, it is characterized in that: certain neighbours' sensor node can be selected in the process of mobile sink node movement as the association anchor node of oneself, anchor node is responsible for the role temporarily serving as aggregation node in network, and gives real mobile sink node by data retransmission; Time initial, the sensor node that in mobile sink node selection surrounding neighbours, signal strength signal intensity is maximum as first anchor node, and carries out localized routing renewal first; Each replacing anchor node, needs to re-start a localized routing and upgrades; Each replacing anchor node, anchor node all needs to the whole network shortest path tree
root node send a notice message, the node receiving this notice message all needs local record to receive the neighbor node of this message, and it can be used as and oneself arrive the father node of mobile sink node current location.
7. method according to claim 6, is characterized in that: note node v is initial selected anchor node, and its neighbor node collection is designated as NBR (v); When not receiving the ACK bag of v in mobile sink node certain hour, it infers to the link of v disconnected; Note current time is t
1, now the neighbor node of mobile sink node integrates as NBR (MS, t
1), wherein MS represents mobile sink node, if
namely there are the neighbours of anchor node v in current neighbours; Then select wherein signal power to be worth maximum node as first of v from anchor node, and be designated as v
1; v
1send NOTIFY to v, set up anchor node chain, the packet that v receives afterwards is all transmitted to v
1, and then by v
1be transmitted to mobile sink node; If now
then mobile sink node reselects signal power and is worth maximum node as new anchor node from its surrounding neighbours node; When mobile sink node is at t
2time shifts out from anchor node v
1communication range outer after, it will from NBR (MS, t
2) ∩ NBR (v
1) select new for anchor node, be denoted as v
2; In like manner, mobile sink node, in moving process, can be set up more from anchor node, then v and it from anchor node v
1..., v
kform an anchor node chain; Last node on anchor node chain needs periodically to send ACK bag, to notice adjacency between the two to mobile sink node.
8. method according to claim 7, is characterized in that: when k value is greater than K, then mobile sink node needs to select new anchor node from the neighbor node of oneself, and K+1 represents the length of anchor node chain.
9. method according to claim 1, it is characterized in that: each mobile sink node selects new anchor node, can initiate once range limited local inundation to upgrade, each inundation upgrades sets up the local shortest path tree that take anchor node as root, and with the whole network most short-path spanning tree
remainder form complete data acquisition tree together.
10. method according to claim 9, is characterized in that: the new anchor node that mobile sink node is selected at every turn is broadcasted a routing update message to its neighbor node and continued by neighbours to forward; Every bar updating message carries two information, and sending node is to the known shortest path length of new anchor node, and initial value is 0, and new anchor node is to most short-path spanning tree
the shortest path length of root vertex; Remember that new anchor node is v, it is also the anchor node of new anchor node chain, is that local data's routing tree of root is denoted as T with v
v,, make the link range between node i, j be designated as d (i, j), make node i, j at tree T
kon beeline be designated as
node i, j are at T
kon beeline be up to now designated as
when node i receives the updating message from new anchor node v of neighbor node j, and i ≠ v, node i performs following routing update algorithm: the first, if the updating message newly received brings the shorter path from v to i, then and corresponding renewal
with the parent information of i, further, if
with
ratio be less than λ, then i continue to oneself neighbor node broadcast with
value and upgrade after
the updating message of value; λ is a positive number being less than 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410482063.5A CN104244357A (en) | 2014-09-19 | 2014-09-19 | Mobile wireless sensing routing updating method based on controllable local flooding |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410482063.5A CN104244357A (en) | 2014-09-19 | 2014-09-19 | Mobile wireless sensing routing updating method based on controllable local flooding |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104244357A true CN104244357A (en) | 2014-12-24 |
Family
ID=52231498
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410482063.5A Pending CN104244357A (en) | 2014-09-19 | 2014-09-19 | Mobile wireless sensing routing updating method based on controllable local flooding |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104244357A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104902530A (en) * | 2015-06-10 | 2015-09-09 | 东南大学 | Location aided routing method applied to wireless Mesh network |
| CN106658410A (en) * | 2016-12-08 | 2017-05-10 | 上海复旦通讯股份有限公司 | Low-power anchor node rotation method in mobile ad hoc network |
| CN106792969A (en) * | 2017-01-23 | 2017-05-31 | 浙江工商大学 | A kind of hybrid wireless sensor network routing method of Energy Efficient |
| CN109691183A (en) * | 2016-08-02 | 2019-04-26 | 昕诺飞控股有限公司 | Secure report in wireless mesh network |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008027668A1 (en) * | 2006-08-29 | 2008-03-06 | Cisco Technology, Inc. | Method and apparatus for automatic sub-division of areas that flood routing information |
| CN102857975A (en) * | 2012-10-19 | 2013-01-02 | 南京大学 | Load balance CTP (Collection Tree Protocol) routing protocol |
| CN103002535A (en) * | 2012-11-30 | 2013-03-27 | 广东工业大学 | Multi-aggregation-node wireless sensor network routing method based on inquiry |
| CN103402236A (en) * | 2013-06-28 | 2013-11-20 | 南京邮电大学 | Constructive interference based wireless sensor network flooding mechanism |
-
2014
- 2014-09-19 CN CN201410482063.5A patent/CN104244357A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008027668A1 (en) * | 2006-08-29 | 2008-03-06 | Cisco Technology, Inc. | Method and apparatus for automatic sub-division of areas that flood routing information |
| CN102857975A (en) * | 2012-10-19 | 2013-01-02 | 南京大学 | Load balance CTP (Collection Tree Protocol) routing protocol |
| CN103002535A (en) * | 2012-11-30 | 2013-03-27 | 广东工业大学 | Multi-aggregation-node wireless sensor network routing method based on inquiry |
| CN103402236A (en) * | 2013-06-28 | 2013-11-20 | 南京邮电大学 | Constructive interference based wireless sensor network flooding mechanism |
Non-Patent Citations (1)
| Title |
|---|
| ZHANGJIANG LI等: "《Exploiting Ubiquitous Data Collection for Mobile Users in Wireless Sensor Networks》", 《IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104902530A (en) * | 2015-06-10 | 2015-09-09 | 东南大学 | Location aided routing method applied to wireless Mesh network |
| CN104902530B (en) * | 2015-06-10 | 2018-06-01 | 东南大学 | A kind of location-aided routing protocols method applied in Wireless Mesh network |
| CN109691183A (en) * | 2016-08-02 | 2019-04-26 | 昕诺飞控股有限公司 | Secure report in wireless mesh network |
| CN106658410A (en) * | 2016-12-08 | 2017-05-10 | 上海复旦通讯股份有限公司 | Low-power anchor node rotation method in mobile ad hoc network |
| CN106658410B (en) * | 2016-12-08 | 2020-04-10 | 上海复旦通讯股份有限公司 | Low-power-consumption anchor node rotation method in mobile self-organizing network |
| CN106792969A (en) * | 2017-01-23 | 2017-05-31 | 浙江工商大学 | A kind of hybrid wireless sensor network routing method of Energy Efficient |
| CN106792969B (en) * | 2017-01-23 | 2019-09-06 | 浙江工商大学 | A kind of energy efficient hybrid wireless sensor network routing method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104486715B (en) | A kind of mobile sensor network cluster-dividing method based on geographical location information | |
| CN104244357A (en) | Mobile wireless sensing routing updating method based on controllable local flooding | |
| CN101662777B (en) | Wireless sensor network distributed hibernation method based on probability statistics | |
| CN101945460B (en) | Energy-saving AODV routing method used in Ad Hoc network environment | |
| CN103458487B (en) | Network code perception cross-layer energy-saving routing method in wireless sense network | |
| CN104320796A (en) | Wireless sensor network data transmission method based on LEACH protocol | |
| US10219319B2 (en) | Device and method for controlling a node of a wireless network | |
| CN103813364B (en) | Mobile self-organizing network interrupt data recovery method based on area perception | |
| TW200408232A (en) | Intelligent communication node object beacon framework(ICBF) with temporal transition network protocol (TTNP) in a mobile AD hoc network | |
| CN102088666B (en) | Multicast route method of mobile self-organizing network system | |
| CN102196527B (en) | Route recovery method and recovery protocol for mobile Sink wireless sensor network | |
| CN103260211B (en) | A kind of AOMDV method for routing of improvement | |
| CN102761931A (en) | Method for carrying out dynamic data transmission in asynchronous duty ratio wireless sensor network | |
| CN104202772A (en) | Mobile Sink data collection method applied to wireless sensor network and used for node internal-memory resource sharing | |
| WO2011017276A3 (en) | System, apparatus and method for seamless roaming through the use of routing update messages | |
| Stefanović et al. | Urban infrastructure-to-vehicle traffic data dissemination using UEP rateless codes | |
| La et al. | Link reversal and reactive routing in Low Power and Lossy Networks | |
| CN103139073A (en) | Cognitive routing method based on Ad Hoc network form | |
| CN103974365A (en) | Ad Hoc mobile network route restoring method | |
| CN105376824A (en) | Mobile sensor network low-power route method used for filed monitoring | |
| CN101827422A (en) | Simple network data collecting method of mobile wireless sensor | |
| CN103391595A (en) | Mine emergency rescue wireless mesh network routing method based on cross-layer link state feedback | |
| CN106068027B (en) | The system adaptive recognition method of Situation Awareness in chance intelligent perception network | |
| CN105007570A (en) | Mobile ad-hoc network congestion control method based on OLSR protocol | |
| CN102594509A (en) | Wireless sensor network coding data collection method based on node classification strategy |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20141224 |
|
| WD01 | Invention patent application deemed withdrawn after publication |