CN102098755B - Delay-constrained low-cost routing method for wireless sensor network - Google Patents
Delay-constrained low-cost routing method for wireless sensor network Download PDFInfo
- Publication number
- CN102098755B CN102098755B CN2011100314486A CN201110031448A CN102098755B CN 102098755 B CN102098755 B CN 102098755B CN 2011100314486 A CN2011100314486 A CN 2011100314486A CN 201110031448 A CN201110031448 A CN 201110031448A CN 102098755 B CN102098755 B CN 102098755B
- Authority
- CN
- China
- Prior art keywords
- delay
- node
- path
- slot
- packet
- 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
Abstract
The invention discloses a delay-constrained low-cost routing method for a wireless sensor network. The method comprises the following steps that: sensor nodes are synchronous and work in a low duty cycle mode; a sink node broadcasts an interest message packet over the whole network to initiate path establishment; a plurality of non-dominance paths from the sensor nodes to the sink node are established in the diffusion process of the packet; when one sensor node determines to forward the interest packet to the adjacent nodes, the packets are forwarded sequentially according to the working time slot of each of the adjacent nodes; according to the next hop information of the plurality of established non-dominance paths and the related path information, the path meeting the minimum hop number is selected by the nodes held by the packet; the nodes receiving the packet continuously forward the packet hop by hop until the packet arrives at the sink node; and if the path meeting the delay constraint does not exist, the packet is discarded. The method has distribution characteristics, the delay-constrained low-cost path from each sensor node to the sink node can be quickly established, and the packet can be forwarded conveniently.
Description
Technical field
The invention belongs to the sensor network technology field, be specifically related to a kind of low duty ratio wireless sense network service quality method for routing based on scheduling.
Background technology
In existing radio sensing network, based on the routing plan of qos constraint, comprise based on bandwidth constraint with based on deferred constraint two classes a class after the invention belongs to.The existing routing plan of wireless network based on deferred constraint all is based on what is called " average delay ", described " average delay " is exactly: the average link based on medium access such as CSMA postpones to bring into to seek in the route algorithm of footpath, finds the route that meets average retardation.Still do not study in the low duty ratio wireless sensor network in existing hop-by-hop routing plan, how to realize meeting the low-cost hop-by-hop packet forwarding mechanism of clear and definite deferred constraint.
Summary of the invention
How to realize quality-of-service based routing issue in the wireless sense network that is based on scheduling that the present invention mainly solves.The method for routing that the present invention relates to, can be when reducing node energy consumption towards the low duty ratio wireless sense network, and the Optimizing Network Resources utilization meets the quality of service requirement of applying simultaneously.
Method of the present invention comprises path establishment method and the packet-forwarding method of by sink, being initiated.
Described path establishment method is: contain sensor node, sink node in radio sensing network, sensor node is synchronous and is operated under the low duty ratio pattern; Interest message bag of sink node the whole network broadcasting is initiated path and is set up, this message bag comprises sink node ID, this grouping passed by delay in path of jumping figure, this grouping in path of having passed by, and this message wraps in diffusion process many non-mastery paths of setting up from sensor node to the sink node; When a sensor node determined to forward the interest bag to adjacent node, the working time slot according to each adjacent node forwarded successively.
Packet-forwarding method is: according to non-mastery multipath next hop information and the associated pathway information set up, grouping is held node and is therefrom selected to meet packetization delay requirement and the minimum path of cost (that is: jumping figure).The node of receiving this grouping continues this process of forwarded hop-by-hop based on deferred constraint, until grouping arrives the sink node; If do not have path to meet above-mentioned deferred constraint, abandon this grouping.
Preferably set up in the process of non-mastery path the delay that at first will calculate the link on a pair of adjacent sensors node.
Calculate the method for above-mentioned link delay: suppose that the timeslot number in a frame is F, for a pair of adjacent sensors node x and y, the Delay computing method on the link from x to y is as follows: establish Slot
xAnd Slot
yIt is respectively the working time slot number of x and y.If Slot
x＜Slot
y, Delay (x, y)=Slot
y-Slot
xOtherwise Delay (x, y)=F+Slot
y-Slot
x
The method for building up in preferred non-mastery path is: for two paths P1 and P2 from a sensor node to the sink node, and with the jumping figure of HopCount (P) expression path P, the end-to-end delay of Delay (P) expression P; If " HopCount (P1)＞HopCount (P2); but Delay (P1)＜Delay (P2) ", perhaps " HopCount (P1)＜HopCount (P2); but Delay (P1)＞Delay (P2) ", path P 1 and path P 2 have non-mastery; If HopCount (P1)＞HopCount (P2), but Delay (P1)＞Delay (P2), path P 1 is arranged by P2.
While having mulitpath, its non-mastery each other also can judge in twos, and the path of being arranged by any paths need not to preserve.
Above-mentioned path is set up and forwarding of packets has all adopted the hop-by-hop method for routing, has simplicity and extensibility.The inventive method has distributed nature, can pass through hop-by-hop mode Rapid Establishment from each sensor node to the limited low-cost of the delay of sink node path, and can realize easily that the hop-by-hop formula postpones limited low-cost forwarding of packets.
Embodiment
The method for routing that the present invention relates to is towards the low duty ratio wireless sensor network, and described wireless sensor network is comprised of sensor node and sink node.
The present invention is based on following setting:
1) node adopts powered battery, and recharging, i.e. its limited energy in the course of the work.
2) node does not need to understand positional information, does not understand the flow distribution information in Global Topological and network.
3) node in network is synchronous, and the time is divided into continuous frame, and each frame is comprised of a lot of time slots; Each node is fixed and is selected certain time slot as its working time slot without bumping method in the double bounce scope, each node can receive data in own determined working time slot, and other time slots can be selected sleep.For convenience's sake, the working time slot of note node x is Slot
xThe sink node is in active state always.The timeslot number of each frame is more, is enough to realize in double bounce without the scheduling of conflict low duty ratio.
4) each node is understood the working time slot of own neighbor node.
5) data that in network, sensor node produces are comparatively rare.Therefore few situation that network congestion occurs,, even accidentally occur, also be easy to quick elimination.
The grouping of data, it postpones to require as D, and the unit of D is timeslot number, is meeting under the condition of deferred constraint, and the present invention is intended to complete forwarding of packets from the information source sensor node to the sink node by minimum hop count.
Introduce non-mastery (non-dominance) concept in a path: two connections are with path P 1 and the P2 of a pair of source node and destination node, with the jumping figure of HopCount (P) expression path P, and the end-to-end delay of Delay (P) expression P.If " HopCount (P1)＞HopCount (P2); but Delay (P1)＜Delay (P2) " or " HopCount (P1)＜HopCount (P2); but Delay (P1)＞Delay (P2) ", path P 1 and P2 have non-mastery; If HopCount (P1)＞HopCount (P2) and Delay (P1)＞Delay (P2), claim path P 1 to be arranged by P2.
And in seeking the footpath process, the shortest delay note from certain sensor node x to sink that has found is MinimumDelaySoFar
x, apparent, for arbitrary node x, its initial value MinimumDelaySoFar
x=∞.Suppose that a timeslot number in frame is F, for a pair of adjacent sensors node x and y, the Delay computing method on the link from x to y is as follows: if Slot
x＜Slot
y, Delay (x, y)=Slot
y-Slot
xOtherwise Delay (x, y)=F+Slot
y-Slot
x
Method for routing of the present invention both had been fit to single sink network, also was fit to many sink network.For convenience's sake, we describe as an example of single sink network example.
The method for routing that the present invention relates to is comprised of two parts.A part is to set up process by the path from the sensor node to sink that sink initiates, and another part is limited hop-by-hop data forwarding process from sensor node to the delay of sink node.
Under initial situation, each sensor node (as x) is to the jumping figure distance H opCount of sink node
x=∞, Delay
x=∞.
(1) process is set up in the path of sink node initiation
When the node in network complete synchronous after, and after each node determined own working time slot separately, the sink node generated an interest and wraps, this bag comprises has passed by sink node ID, this grouping (initial value has been HopSoFar for the jumping figure in path
s=0), this grouping has been passed by, and (initial value is DelaySoFar for the delay in path
s=0).For convenience's sake, we do node 0 to sink node note, and sensor node is numbered 1,2 ..., n.
The Sink node sends interest message bag according to the working time slot of each neighbours' sensor node to this sensor node respectively, receive that the node (as node x) of interest bag carries out following operation: with the sink node as oneself to the next-hop node on the sink path, and charge to local routing table; The jumping figure in the path that this grouping has been passed by is designated as 1 and jumps, and is denoted as: HopCount
x=1, the delay in the path that this grouping has been passed by is designated as 1 time slot---delay of neighbor node from x to sink as sink is 1 time slot---that is to say the data received can forwarding immediately to sink node, that is: Delay
x=1.Therefore, for the neighbor node of sink, its shortest path to sink and minimum delay path are identical, are all the modes of directly with sink, communicating by letter.The neighbor node of each sink will continue just to the interest bag be transmitted to own each neighbor node (except sink)---specifically enforcement is to send according to these neighbours' working time slot---namely, for node y, with Slot
ySend.
When a sensor node (as x) is received an interest message from neighbours' sensor node (as y), will carry out following operation.Note, delay on the path of passing by that this interest packets of information is carried is in all interest bags that node y receives when node y sends this interest, postpone that minimum path of passing by and the jumping figure distance in this path, note is Delay respectively
yAnd HopCount
y
At first node x clicks principle and calculates delay and the jumping figure distance that arrives sink via y:
DelaySoFar
x=Delay
y+Delay(x,y)
HopCountSoFar=HopCount
y+1；
If DelaySoFar
xThe delay in the value path of passing by less than the interest that receives before node x, will by the path note that y arrives sink do up to now arrive the minimum delay path of sink from x, and the down hop in this path, path delay and jumping figure distance are charged to routing table;
The path that arrives sink via y else if all has non-domination characteristic with all non-mastery paths of receiving before, will charge in the routing table of x via the new route that y arrives sink so.
Otherwise, the path that arrives sink via y be one by predominating path, in this case, directly discard this interest grouping.
After a node is completed interest packets of information of forwarding, will no longer forward same interest and wrap---the purpose of doing like this is in order to suppress expense.But this is that the interest packets of information from neighbours still can be accepted and process to this node.
According to above-mentioned rule, each sensor node may find 1 to many non-predominating paths from own to the sink node.
(2) quality-of-service based hop-by-hop formula forwarding of packets process
Postpone requirement for one and be the grouping of D, grouping is held node (note is x) and is at first consulted local routing table,, if in table, the delay in the path of the delay minimum of record, greater than D, does not meet the path of above-mentioned delay requirement in network, directly loses this grouping; Otherwise node x finds out the non-predominating path that postpones less than D and Least-cost from routing table, then gives next-hop node (as y) on this path forwarding of packets.After y receives this grouping, will continue to carry out said process, unique variation is to postpone to require to become D-Delay (x, y) this moment.This process is sustained, until grouping arrives the sink node.
Claims (4)
1. the limited low-cost method for routing of the delay of a wireless sense network, is characterized in that: comprise path establishment method and the packet-forwarding method of by sink, being initiated;
Described path establishment method is: contain sensor node, sink node in radio sensing network, sensor node is synchronous and is operated under the low duty ratio pattern; Interest message bag of sink node the whole network broadcasting is initiated path and is set up, this message bag comprises the passed by delay in path of jumping figure, this message bag in path of having passed by of sink node ID, this message bag, and this message wraps in diffusion process many non-mastery paths of setting up from sensor node to the sink node; The method for building up in non-mastery path is: for two paths P1 and P2 from a sensor node to the sink node, and with the jumping figure of HopCount (P) expression path P, the end-to-end delay of Delay (P) expression P; If " HopCount (P1)＞HopCount (P2); but Delay (P1)＜Delay (P2) ", perhaps " HopCount (P1)＜HopCount (P2); but Delay (P1)＞Delay (P2) ", path P 1 and path P 2 have non-mastery; When a sensor node determined to forward interest message bag to adjacent node, the working time slot according to each adjacent node forwarded successively;
The message package transmitting method is: according to non-mastery multipath next hop information and the associated pathway information set up, message embraces node and therefrom selects to meet the path of packetization delay requirement and Least-cost; The node of receiving this message bag continues this process of forwarded hop-by-hop based on deferred constraint, until the message bag arrives the sink node; , if do not have path to meet above-mentioned deferred constraint, abandon this interest message bag.
2. the limited low-cost method for routing of the delay of a kind of wireless sense network according to claim 1, is characterized in that: set up in the process of non-mastery path the delay that at first will calculate the link on a pair of adjacent sensors node.
3. the limited low-cost method for routing of the delay of a kind of wireless sense network according to claim 1, it is characterized in that: if the timeslot number in frame is F, for a pair of adjacent sensors node x and y, the Delay computing method on the link from node x to y is: establish Slot
xAnd Slot
yRespectively the working time slot number of x and y, if Slot
x＜Slot
y, Delay (x, y)=Slot
y-Slot
xOtherwise Delay (x, y)=F+Slot
y-Slot
x
4. the limited low-cost method for routing of the delay of a kind of wireless sense network according to claim 1, it is characterized in that, if HopCount (P1)＞HopCount (P2), but Delay (P1)＞Delay (P2), path P 1 is arranged by P2; While having mulitpath, its non-mastery each other can judge in twos, and the path of being arranged by any paths need not to preserve.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100314486A CN102098755B (en) | 2011-01-28 | 2011-01-28 | Delay-constrained low-cost routing method for wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011100314486A CN102098755B (en) | 2011-01-28 | 2011-01-28 | Delay-constrained low-cost routing method for wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102098755A CN102098755A (en) | 2011-06-15 |
| CN102098755B true CN102098755B (en) | 2013-11-20 |
Family
ID=44131569
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011100314486A Expired - Fee Related CN102098755B (en) | 2011-01-28 | 2011-01-28 | Delay-constrained low-cost routing method for wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102098755B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101282299A (en) * | 2008-05-16 | 2008-10-08 | 熊猫电子集团有限公司 | Method for measuring displacement speed of motion body in multi-hop network |
| CN101409940A (en) * | 2008-08-26 | 2009-04-15 | 中国人民解放军海军工程大学 | Route selection method for wireless sensor network facing to target tracking application |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20060006583A (en) * | 2004-07-16 | 2006-01-19 | 아주대학교산학협력단 | Directional flooding method in wireless sensor networks |
-
2011
- 2011-01-28 CN CN2011100314486A patent/CN102098755B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101282299A (en) * | 2008-05-16 | 2008-10-08 | 熊猫电子集团有限公司 | Method for measuring displacement speed of motion body in multi-hop network |
| CN101409940A (en) * | 2008-08-26 | 2009-04-15 | 中国人民解放军海军工程大学 | Route selection method for wireless sensor network facing to target tracking application |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102098755A (en) | 2011-06-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100399772C (en) | Ad hot network subsequent multi-path route method based on load balance | |
| Reddy et al. | Quality of service provisioning in ad hoc wireless networks: a survey of issues and solutions | |
| Tekaya et al. | Multipath routing with load balancing and QoS in ad hoc network | |
| CN101854697B (en) | Multi-constraint quality-of-service control routing method and system for wireless mesh network | |
| Chaba et al. | Simulation based performance analysis of on-demand routing protocols in MANETs | |
| CN106209669A (en) | Towards SDN data center network maximum of probability path stream scheduling method and device | |
| Sharma et al. | Performance evaluation of reactive routing protocols in MANET networks using GSM based voice traffic applications | |
| CN102447686A (en) | Routing protocol of AODV (Ad hoc On-Demand Distance Vector Routing) application | |
| CN101977414A (en) | Simultaneous transmission slot time distribution method of wireless sensor network | |
| Jaiswal et al. | An optimal QoS-aware multipath routing protocol for IoT based wireless sensor networks | |
| Wenxing et al. | Energy-efficient algorithm based on multi-dimensional energy space for software-defined wireless sensor networks | |
| Li et al. | A reliable node-disjoint multipath routing with low overhead in wireless ad hoc networks | |
| CN102595458B (en) | Distributed multi-path route-healing method | |
| Voicu et al. | Multiple path infrastructure-less networks a cooperative approach | |
| CN103108372A (en) | Interference sensing cross-layer routing method based on node sending and receiving capacity | |
| CN102083164A (en) | Method for opportunistic routing of wireless sensor network (WSN) based on energy perception | |
| Di Stasi et al. | Combining multi-path forwarding and packet aggregation for improved network performance in wireless mesh networks | |
| Liu et al. | Research of QoS-aware routing protocol with load balancing for mobile ad hoc networks | |
| Naeimi et al. | Directional multi–hop clustering routing protocol for wireless sensor networks | |
| CN102098755B (en) | Delay-constrained low-cost routing method for wireless sensor network | |
| CN103096411A (en) | Internet of things communication method based on reverse power restriction route protocol | |
| CN102316527A (en) | Multi-path ad hoc on-demand distance vector (AODV) routing method based on service quality sensing | |
| Cao et al. | Path cost metrics for multi-hop network routing | |
| Bhoge et al. | Cross-layer approach for energy & communication efficient protocol of mobile ad hoc networks | |
| Vidhyashankar et al. | Slot allocation schemes for delay sensitive traffic support in asynchronous wireless mesh networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20131120 Termination date: 20150128 |
|
| EXPY | Termination of patent right or utility model |