CN102098709A - Gradient-based routing method in hybrid wireless sensor network - Google Patents
Gradient-based routing method in hybrid wireless sensor network Download PDFInfo
- Publication number
- CN102098709A CN102098709A CN201110039714XA CN201110039714A CN102098709A CN 102098709 A CN102098709 A CN 102098709A CN 201110039714X A CN201110039714X A CN 201110039714XA CN 201110039714 A CN201110039714 A CN 201110039714A CN 102098709 A CN102098709 A CN 102098709A
- Authority
- CN
- China
- Prior art keywords
- node
- sink
- mobile
- gradient
- mobile sink
- 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
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a gradient-based routing method in a hybrid wireless sensor network. The wireless network comprises a sensor node, a fixed sink node and a mobile sink node, wherein the fixed sink node is utilized to create a hop-based sensor node gradient; the mobile sink node and the sensor node are in charge of neighbour maintenance; the mobile sink node marks a moving state in a broadcast HELLO packet; and a mobile sink-oriented data report path is locally created by combining the gradient information of the fixed sink node and the moving state of the mobile sink node, three-level path dynamic refreshing is carried out, and data can be directly forwarded. In the invention, an optimized data report path is created between the sensor node and the sink nodes, the mobility of the mobile sink node is fully utilized, the network performance is optimized, and the protocol overhead in a path creating process is effectively inhibited.
Description
Technical field
The invention belongs to wireless sensor network Routing Protocol field.Be specifically related to a kind of data report route method of in the wireless sensor network of mobile collection node and fixedly acquisition node coexistence, setting up.
Background technology
In the wireless sensor network, wireless sensor node is the terminal that information produces, and is again the node of route---and be responsible for other wireless sensor nodes and transmit data.Wireless sensor node has characteristics such as communication range is limited, finite energy.Introduce the flow distribution of mobile collection node (mobile sink) in can the efficient balance network, reduce the fixedly data forwarding pressure of acquisition node (sink) close region sensor node, the raising wireless sensor network performance.On the other hand, fixedly the existence of acquisition node sink can guarantee that under worst case, sensor node possesses the data upload passage.Do not causing under the situation about obscuring that in this patent, we claim that fixedly the wireless sensor network of acquisition node sink and mobile collection node (mobile sink) coexistence is the hybrid wireless sensor network.
Therefore, design surface is to the wireless sensor network of fixedly sink and mobile sink coexistence, and design high efficient mixed Routing Protocol has great importance.
In the prior art, note for the Routing Protocol of mixed wireless network is existing.As Chinese scholar Tian Ke, in the paper of delivering in June, 2010 " efficient wireless multi-hop network Research of Routing Protocols ", proposed a kind of method for routing based on track: based on the wireless sense network route agreement TRAIL of mobile sink track, this agreement is towards underloading mobile wireless sensing net.The TRAIL agreement has organically combined random walk and based on the packet forwarding mechanism of track, has had and realize advantages such as simple, that data acquisition route maintenance expense is low.The TRAIL agreement comprises track generation, the data forwarding based on track, path learning, track refreshes and the several chief components of random walk.TRAIL both can be used for single sink sensing net, also can be used for many sink sensing net.
In addition, also proposed dimension promise division methods based on anchor node in the literary composition: the method is at disposing the application scenarios that one or more mobile collection nodes (mobile sink) carry out data collection in the radio sensing network.This method uses dynamically dimension promise to divide the machine-processed sensor node of keeping to the shortest path from own nearest sink, and agreement is stablized shielding sink node moving among a small circle by dynamic anchor node choice mechanism, thus reduction agreement control expense.Also introduced trunking mechanism in the design of protocol process and the sink neighbor node directly reports mechanism.
This method can significantly reduce the route refresh number of times, improve forward efficiency and data delivery success rate.
On the other hand, a kind of gradient notion at this mixed wireless network is arranged, introduce the gradient notion.As Directed Diffusion method: each in the network fixedly sink periodically to Web broadcast Interest bag (note is made the Interest-I bag).Each Interest bag carries and initiates node ID, gradient information (the jumping figure information in the path of being passed by just)---initial value is 0, and the gradient of sink is 0.Interest-I wraps in the network in the diffusion process, whenever walks a jumping, and gradient information adds 1.The distance that the Interest-I bag is passed by is exactly to receive the Grad of the sensor node of this bag.If a sensor node is received a plurality of Interest-I bags, then select the wherein Grad of a conduct oneself of Grad minimum.For a specific I nterest-I bag, each sensor node only needs to transmit once at most.If the Grad of a current storage of sensor node is less than the entrained Grad of the Interest-I that receives, will no longer continue to transmit the Interest-I bag of receiving---this mechanism can be so that each sensor node all belongs to the dimension promise bunch (Voronoi Cluster) with oneself the most contiguous fixedly sink.
Summary of the invention
(or claim: mobile sink) and the fixing hybrid wireless sensor network that coexists of sink node (or claim: fixedly sink), purpose is to design the simple and efficient Routing Protocol that can give full play to gradient effect towards the mobile sink node in the present invention.
For reaching above-mentioned purpose, the present invention has designed a kind of method for routing of the gradient based on wireless sensor network.
In the sensor network of the present invention, the wireless sensor node of comprising, fixedly sink node, mobile sink node are arranged.At first, fixedly the sink node is set up the sensor node gradient based on jumping figure;
Then, mobile sink node and sensor node carry out neighbours' maintenance; The mobile sink node is in own neighbours' sensor node, and the strongest node of received signal is as the anchor node of oneself;
The 3rd, the mobile sink node is judged the mobile rank of oneself, then the mobile status of mark self in the HELLO of broadcasting bag;
The 4th, the gradient information of in sensor network, setting up in conjunction with fixing sink node, and the mobile status of mobile sink, local foundation towards the data of mobile sink reported the path, the walking along the street footpath dynamic refresh of going forward side by side;
At last, sensor node carries out data forwarding in the following order:
(1) if no matter fixedly it have a sink as its neighbor node (sink or mobile sink), it all will directly send to grouping this sink neighbor node; When it has a plurality of such neighbours, can therefrom select one to carry out data and send at random;
(2) if sensor node has the fixedly gradient information of sink node and mobile sink node simultaneously, it therefrom selects the direction of gradient minimum to carry out data to send; The node of receiving this grouping will continue said process.
The path method for refreshing based on gradient of preferred step 4 of the present invention, the mobile sink node is judged to be high, medium and low three grades with the speed of oneself, and the path is refreshed employing and is refreshed for three grades:
I, high-speed mobile sink situation: the sink node in the high-speed mobile does not send the Interest bag;
II, middle low speed mobile sink: this type of sink will be periodically to the anchor node transmission Interest of own appointment bag (note is made the Interest-II bag), anchor node will continue this Interest-II bag of broadcasting, mobile sink is according to the definite respectively broadcasting area of self rate travel rank, the broadcasting area of middling speed mobile sink is K1, low speed mobile sink broadcasting area is K2, jump as K1=2, K2=3 jumps.
II(a) broadcasting area of Interest-II bag is those identical with the anchor node gradient (relative fixed sink), and it is own to arriving the fixedly sensor node of the last jumping of sink to be that those have downstream node to adopt.That is: gradient is identical but need not transmit Interest-II bag as the sensor node of leaf (leaf).The result of this operation is the interest information with broadcasting mobile sink on the identical contour of relative fixed sink gradient.
II(b) arrive the fixedly gradient of sink if Interet-II wraps the gradient of the arrival mobile sink of record greater than this sensor node, this sensor node also will no longer continue to transmit this Interest-II bag.
II(c) if the gradient of anchor node is 1 situation, anchor node does not need to broadcast the Interest-II bag.Because in this case, as fixedly neighbours' sensor node of sink need be around fixedly sink is next to mobile sink forwarding data.
Utilize method for routing of the present invention, can between sensor node and sink node, set up and optimize data and report the path, and make full use of the mobility of mobile sink, optimize network performance, and effectively suppress the path and set up protocol overhead in the process.
Embodiment
The present invention towards sensor network in contain wireless sensor node, fixedly sink node, mobile sink node.Wireless sensor node can not move, adopt omnidirectional antenna to carry out radio communication, and communication range is limited, the data of sensor node collection need be reported the sink node, send to management node by the sink node again, this report both can be reported fixedly sink, also can report mobile sink.
At first, set up gradient,Fixedly the sink node will be according to Directed Diffusion method among the present invention, and foundation is based on the sensor node gradient of jumping figure.
Then, carry out neighbours' maintenance, based on neighbours' maintaining method of mobile sink node:
Mobile sink: mobile sink periodically (as each 3 seconds) sends the HELLO bag, writes down self ID, HELLO packet number (increasing progressively) in the bag.When mobile sink when considerably less (be long-time neighbours' sensor node do not change or change) after a certain place stops the long period, mobile sink can reduce HELLO bag frequency greatly; And when mobile sink after the transmission behavior that newly listens to more new sensor node (send or signaling sends) as the data of sensor node, mobile sink can return to the HELLO bag transmission behavior of upper frequency again.After mobile sink sends a grouping (as an interest bag or data), this sink node HELLO bag transmission timer of can resetting.
Sensor node:
Receive that the sensor node of the HELLO bag that the mobile sink node sends regards this mobile sink as the neighbor node of oneself.After continuous several times (as 3 times) is not received the HELLO bag of certain mobile sink, a sensor node will no longer be regarded this mobile sink as the neighbor node of oneself.
Receive the HELLO bag of mobile sink transmission when a sensor node after, this node will periodically send HELLO bag (the record self ID is also safeguarded a numbering that increases progressively).After a sensor node continuous several times is not received the HELLO bag of mobile sink, this sensor node will no longer be broadcasted the HELLO bag, thus the normal condition of returning to.
Mobile sink is in own neighbours' sensor node, and the strongest node of received signal is as the anchor node of oneself; After mobile sink exceeds the anchor node communication range, mobile sink will select a new anchor node again from the neighbours of oneself.
The 3rd, mobile sink translational speed rank method of discrimination:
According to the rate of change of neighbours' sensor node of mobile sink, as the different neighbours' of mobile sink in the time T ratio; The perhaps rate travel information that provides of GPS receiving equipment.
After mobile sink is judged the mobile rank of oneself, the mobile status of mark self in will wrapping at the HELLO of broadcasting.This patent adopts three grades of translational speed ranks: low speed, middling speed, at a high speed.If the sensor node communication radius is R, as R=50 rice, rate travel＜R/30 is a low speed, and speed [R/30, R/15] is middling speed, speed〉R/15 is at a high speed.The rate travel rank can be decided as the case may be.
Sink node in the high-speed mobile does not send the Interest bag.Middle low speed mobile sink will be periodically to the anchor node transmission Interest bag (note is Interest-II and is wrapped) of own appointment, and anchor node will continue this Interest-II bag of broadcasting.Mobile sink is according to the definite respectively broadcasting area of self rate travel rank.The broadcasting area of middling speed mobile sink is K1, and low speed mobile sink broadcasting area is K2, jumps as K1=2, and K2=3 jumps.
The 4th, based on three grades of formula gradient method for refreshing of gradient:
The gradient information that the present invention will set up in sensor network in conjunction with fixing sink, mobile behavior in conjunction with mobile sink, local foundation towards the data of mobile sink reported the path, and dynamically refresh, shorten the length that data are reported the path in the hope of effective, and reduce the control signaling consumption in the network.It should be noted that:, will not consider the HELLO bag quantity that mobile sink sends in the statistic processes because the resource of mobile sink is comparatively sufficient.
I, high-speed mobile sink situation: the sink node in the high-speed mobile does not send the Interest bag;
II, middle low speed mobile sink: this type of sink will be periodically to the anchor node transmission Interest of own appointment bag (note is made the Interest-II bag), anchor node will continue this Interest-II bag of broadcasting, mobile sink is according to the definite respectively broadcasting area of self rate travel rank, the broadcasting area of middling speed mobile sink is K1, low speed mobile sink broadcasting area is K2, jump as K1=2, K2=3 jumps.
II(a) broadcasting area of Interest-II bag is those identical with the anchor node gradient (relative fixed sink), and it is own to arriving the fixedly sensor node of the last jumping of sink to be that those have downstream node to adopt.That is: gradient is identical but need not transmit Interest-II bag as the sensor node of leaf (leaf).The result of this operation is the interest information with broadcasting mobile sink on the identical contour of relative fixed sink gradient.
II(b) arrive the fixedly gradient of sink if Interet-II wraps the gradient of the arrival mobile sink of record greater than this sensor node, this sensor node also will no longer continue to transmit this Interest-II bag.
II(c) if the gradient of anchor node is 1 situation, anchor node does not need to broadcast the Interest-II bag.Because in this case, as fixedly neighbours' sensor node of sink need be around fixedly sink is next to mobile sink forwarding data.
By above-mentioned mechanism, can reduce controlling packet quantity in the network greatly.
At last, the data forwarding mechanism of sensor node in hybrid sensor network of the present invention is:
For a sensor node, when it has a packets need to transmit, it will be transmitted along following order:
(1) if no matter fixedly it have a sink as its neighbor node (sink or mobile sink), it all will directly send to grouping this sink neighbor node.When it has a plurality of such neighbours, can therefrom select one to carry out data and send at random.
(2) if sensor node has the fixedly gradient information of sink and mobile sink simultaneously, it therefrom selects the direction of gradient minimum to carry out data to send.The node of receiving this grouping will continue said process.
Claims (5)
- Based on gradient the hybrid wireless sensor network routing method, in the described hybrid wireless sensor network, contain wireless sensor node, fixedly sink node, mobile sink node, it is characterized in that method for routing is as follows:At first, fixedly the sink node is set up the sensor node gradient based on jumping figure;Then, mobile sink node and sensor node carry out neighbours' maintenance; The mobile sink node is in own neighbours' sensor node, and the strongest node of received signal is as the anchor node of oneself;Step 3, the mobile sink node is judged the mobile rank of oneself, then the mobile status of mark self in the HELLO of broadcasting bag;Step 4, the gradient information of in sensor network, setting up in conjunction with fixing sink node, and the mobile status of mobile sink, local foundation towards the data of mobile sink reported the path, the walking along the street footpath dynamic refresh of going forward side by side;At last, sensor node carries out data forwarding in the following order:(1) if no matter fixedly it have a sink as its neighbor node (sink or mobile sink), it all will directly send to grouping this sink neighbor node; When it has a plurality of such neighbours, can therefrom select one to carry out data and send at random;(2) if sensor node has the fixedly gradient information of sink node and mobile sink node simultaneously, it therefrom selects the direction of gradient minimum to carry out data to send; The node of receiving this grouping will continue said process.
- 2. method for routing according to claim 1 is characterized in that the path method for refreshing based on gradient of step 4 is: the mobile sink node is judged to be high, medium and low three grades with the speed of oneself, and the path is refreshed employing and refreshed for three grades:I, high-speed mobile sink situation: the sink node in the high-speed mobile does not send the Interest bag;II, middle low speed mobile sink situation: this type of sink will be periodically to the anchor node transmission Interest-II of own appointment bag, anchor node will continue this Interest-II bag of broadcasting, mobile sink is according to the definite respectively broadcasting area of self rate travel rank, the broadcasting area of middling speed mobile sink is K1, and low speed mobile sink broadcasting area is K2;II(a) broadcasting area of Interest-II bag is that those are identical with the anchor node gradient, and be that those have downstream node to adopt own conduct to arrive the fixedly sensor node of the last jumping of sink, that is: gradient is identical but need not transmit Interest-II bag as the sensor node of leaf (leaf), the interest information of broadcasting mobile sink on the identical contour of relative fixed sink gradient;II(b) arrive the fixedly gradient of sink if Interet-II wraps the gradient of the arrival mobile sink of record greater than this sensor node, this sensor node also will no longer continue to transmit this Interest-II bag;II(c) if the gradient of anchor node is 1 situation, anchor node does not need to broadcast the Interest-II bag.
- 3. method for routing according to claim 2 is characterized in that: mobile sink is judged the mobile rank of oneself according to the rate of change of neighbours' sensor node of mobile sink.
- 4. method for routing according to claim 2 is characterized in that: the rate travel information that mobile sink provides according to the GPS receiving equipment is judged the mobile rank of oneself.
- 5. method for routing according to claim 1 is characterized in that: after mobile sink exceeds the anchor node communication range, mobile sink will select a new anchor node again from the neighbours of oneself.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110039714.XA CN102098709B (en) | 2010-11-04 | 2011-02-17 | Gradient-based routing method in hybrid wireless sensor network |
Applications Claiming Priority (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010532080 | 2010-11-04 | ||
| CN201010532080.7 | 2010-11-04 | ||
| CN201110039714.XA CN102098709B (en) | 2010-11-04 | 2011-02-17 | Gradient-based routing method in hybrid wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102098709A true CN102098709A (en) | 2011-06-15 |
| CN102098709B CN102098709B (en) | 2014-03-26 |
Family
ID=44131527
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110039714.XA Expired - Fee Related CN102098709B (en) | 2010-11-04 | 2011-02-17 | Gradient-based routing method in hybrid wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102098709B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103068020A (en) * | 2013-01-21 | 2013-04-24 | 无锡清华信息科学与技术国家实验室物联网技术中心 | Collection method of mobile data in wireless sensor network |
| CN103607732A (en) * | 2013-10-25 | 2014-02-26 | 肖湘蓉 | Active diagnosis method based on information hiding technology in wireless sensor network |
| CN103648138A (en) * | 2013-12-03 | 2014-03-19 | 江苏大学 | WSN opportunity routing method based on node speed variability |
| CN104717645A (en) * | 2015-02-15 | 2015-06-17 | 江西警察学院 | Method and system for ensuring data transmission of wireless sensor network |
| CN106792969A (en) * | 2017-01-23 | 2017-05-31 | 浙江工商大学 | A kind of hybrid wireless sensor network routing method of Energy Efficient |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101202680A (en) * | 2006-10-31 | 2008-06-18 | 清华大学 | Moving assemblage,wireless sensor network having the same |
| CN101815337A (en) * | 2010-04-21 | 2010-08-25 | 无锡泛联软件科技有限公司 | Wireless ad hoc network reactive route method based on probability |
-
2011
- 2011-02-17 CN CN201110039714.XA patent/CN102098709B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101202680A (en) * | 2006-10-31 | 2008-06-18 | 清华大学 | Moving assemblage,wireless sensor network having the same |
| CN101815337A (en) * | 2010-04-21 | 2010-08-25 | 无锡泛联软件科技有限公司 | Wireless ad hoc network reactive route method based on probability |
Non-Patent Citations (2)
| Title |
|---|
| ELYES BEN HAMIDA ET AL.: "Strategies for Data Dissemination to Mobile Sinks in Wireless Sensor Networks", 《SUBMITTED TO IEEE COMMUNICATIONS MAGAZINE》 * |
| THEOFANIS P. LAMBROU ET AL.: "A Survey on Routing Techniques supporting Mobility in Sensor Networks", 《2009 FIFTH INTERNATIONAL CONFERENCE ON MOBILE AD-HOC AND SENSOR NETWORKS》 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103068020A (en) * | 2013-01-21 | 2013-04-24 | 无锡清华信息科学与技术国家实验室物联网技术中心 | Collection method of mobile data in wireless sensor network |
| CN103068020B (en) * | 2013-01-21 | 2016-12-28 | 无锡清华信息科学与技术国家实验室物联网技术中心 | The acquisition method of mobile data in wireless sensor network |
| CN103607732A (en) * | 2013-10-25 | 2014-02-26 | 肖湘蓉 | Active diagnosis method based on information hiding technology in wireless sensor network |
| CN103648138A (en) * | 2013-12-03 | 2014-03-19 | 江苏大学 | WSN opportunity routing method based on node speed variability |
| CN103648138B (en) * | 2013-12-03 | 2017-03-29 | 江苏大学 | A kind of WSN chance method for routing variable based on node speed |
| CN104717645A (en) * | 2015-02-15 | 2015-06-17 | 江西警察学院 | Method and system for ensuring data transmission of wireless sensor network |
| CN104717645B (en) * | 2015-02-15 | 2018-11-16 | 江西警察学院 | Guarantee the data transmission method and its system of wireless sensor 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102098709B (en) | 2014-03-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mottaghi et al. | Optimizing LEACH clustering algorithm with mobile sink and rendezvous nodes | |
| Shi et al. | DDRP: an efficient data‐driven routing protocol for wireless sensor networks with mobile sinks | |
| CN102098709B (en) | Gradient-based routing method in hybrid wireless sensor network | |
| CN101895955B (en) | Wireless multimedia sensor network-oriented multipath and multistage routing method | |
| Wang et al. | TIBCRPH: traffic infrastructure based cluster routing protocol with handoff in VANET | |
| CN103856399B (en) | Ad Hoc backup route algorithm based on stability | |
| CN101977414A (en) | Simultaneous transmission slot time distribution method of wireless sensor network | |
| CN103974442A (en) | Low-delay scheduling method suitable for wireless sensor network | |
| CN101835099B (en) | Large-scale sensor network routing method based on cluster and RREP broadcast | |
| CN101827422A (en) | Simple network data collecting method of mobile wireless sensor | |
| Ahmed et al. | EENC-energy efficient nested clustering in UASN | |
| CN102123472A (en) | Clustering-based data acquisition method of strip wireless sensor network | |
| Gurupriya et al. | Multi-Faceted Clustering with Enhanced Multi-channel Allocation for Optimal Path Selection in Wireless Sensor Networks | |
| Liu et al. | Grid routing: an energy-efficient routing protocol for WSNs with single mobile sink | |
| CN102932799B (en) | The optimization method of a kind of cognitive sensor network model and life cycle thereof | |
| CN102685917B (en) | Capacity expansion-oriented wireless sensor network multi-channel scheduling method | |
| Arshad et al. | Energy efficient cluster based routing scheme for mobile wireless sensor networks | |
| Salim et al. | Impact of using mobile sink on hierarchical routing protocols for wireless sensor networks | |
| Usha et al. | Node density based clustering to maximize the network lifetime of WSN using multiple mobile elements | |
| CN103476088A (en) | Method for achieving routing communication of next-generation wireless sensor network | |
| CN105430620A (en) | Data collection method of mobile wireless sensor networks (MWSN) | |
| Furat et al. | A energy-efficient routing algorithm in ZigBee-based cluster tree wireless sensor networks | |
| Zhongyi et al. | GOSR: geographical opportunistic source routing for VANETs | |
| CN103686916A (en) | Multi-path data transmission method of industrial wireless sensor network based on surplus energy and expected transmission count | |
| Bharti et al. | Comparative study of clustering based routing protocols for wireless sensor network |
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: 20140326 Termination date: 20150217 |
|
| EXPY | Termination of patent right or utility model |