CN103874162B - A kind of downhole wireless sensing network routing method on demand - Google Patents
A kind of downhole wireless sensing network routing method on demand Download PDFInfo
- Publication number
- CN103874162B CN103874162B CN201410109457.6A CN201410109457A CN103874162B CN 103874162 B CN103874162 B CN 103874162B CN 201410109457 A CN201410109457 A CN 201410109457A CN 103874162 B CN103874162 B CN 103874162B
- Authority
- CN
- China
- Prior art keywords
- node
- rreq
- path
- energy
- angle
- 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
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of On-demand routing algorithm of radio sensing network, is related to radio sensing network energy-efficient routing technical field.The present invention is to give the determination method in forwarding domain：1）It is determined that forwarding domain angle；It is combined into if RREQ is forwarded the packet to the collection of the neighbors of this node,Interior joint number is more than or equal to 1；When there was only a node in set, the angle for forwarding domain is 360o, but critical edge does not include the line of this node and this node, that is to say that this node can only forward to the node outside set interior joint；When the node more than one in set, if wantonly two node is with angle determined by this node, compare the size of angle, the angle for forwarding domain is, 2）It is determined that forwarding domain critical edge；Critical edge is to determineThe respective line with this node of two nodes at angle；Forwarding domain is determined by determining angle and the critical edge of forwarding, the forwarding scope of control RREQ packets, it is simply sent to not to the node of this forwarded over packet of this node.
Description
Technical field
The present invention relates to radio sensing network energy-efficient routing technical field, more particularly to a kind of downhole wireless sensing network is pressed
Need method for routing.
Background technology
At present, wireless sensor network (WSN) technology is moved to maturity increasingly, and very big effect has been played in numerous areas.
Wherein, the pernicious gases such as gas are monitored using wireless sensor network in mine.Mostly below mine is long and narrow tunnel,
Environment relative risk, sensor node are not easy often to change.So the problem of a set of applicable algorithm of selection becomes very core.
The routing algorithm of existing radio sensing network has many kinds, differs from one another, but it is possible to be completely combined the objective of underground coal mine
Situation, is adapted to the algorithm of the radio sensing network of underground not have but.
The content of the invention
It is an object of the invention to provide a kind of downhole wireless sensing network routing method on demand, referred to as SEADR (simple
And energy-aware on demand routing), this agreement supports ZigBee two kinds of nodes of FFD and RFD, is routeing
It was found that proposing the concept in forwarding domain in mode, the quantity of control packet is reduced.
The present invention is realized with following technical scheme：A kind of downhole wireless sensing network routing method on demand, colliery lane
Road routing nodes position is fixed, and each node in network can obtain oneself current positional information, with coordinate representation；
Increase a field in RREQ packets, for storing the coordinate for the previous hop node that RREQ is sent to this node；RREQ is grouped
Update and be grouped without point of addition；On the basis of traditional algorithm that floods, the concept in forwarding domain is proposed, and gives forwarding domain
Determine method：Comprise the following steps that：
1) forwarding domain angle is determined；If RREQ is forwarded the packet and is combined into S [n] to the collection of the neighbors of this node, in S [n]
Node number is more than or equal to 1；When there was only a node in set, this node can only turn to the node outside set interior joint
Hair；When the node more than one in set, if wantonly two node is α with angle determined by this node, compare the size of angle,
The angle in forwarding domain is the π-max α of β=2,
2) forwarding domain critical edge is determined；Critical edge is to determine two nodes at α angles each line with this node；
Forwarding domain is determined by determining angle and the critical edge of forwarding, the forwarding scope of control RREQ packets, makes it
It is simply sent to not to the node of this forwarded over packet of this node.
In order to extend the life-span of whole network, energy consumption has been effectively saved, while route discovery is carried out in forwarding domain,
The concept of energy threshold is proposed, while considers the dump energy of node and the gross energy of institute's routing path consumption, specifically such as
Under：
The routing cost function of an energy that consumption is jumped on hop count and node one is defined, its construction process is as follows：With
n1For source node, with ndFor the path j=n of purpose node1,n2,...ndIf its hop count is Hj, by each jump of node is consumed
Energy it is not necessarily identical, therefore, if it is E that node one, which jumps consumed energy,x；
Hj=d-1 (1)
RouteCostj=Ex×Hj=Ex×(d-1) (2)
In SEADR agreements, routing node is when selecting path, it is necessary to path original during RREQ packets and RREP are grouped
Expense (Path cost) domain be used for store packet institute through the battery consumption on path, that is, according to formula (2) calculating being passed through
The battery consumption in path；
It is grouped when destination node receives first RREQ, RREP packets will not be responded immediately to, and reached after being to wait for
RREQ is grouped；It is grouped for the RREQ for repeating to receive, during the sequence number for comparing them and each RREQ are grouped by destination node
Value in Path cost domains, if sequence number is big, then it represents that have new route finding process, now only need comparative sequences phase
Same RREQ is grouped, and the minimum paths of the value in Path cost domains are optimal path, that is to say the consumption of this paths
Gross energy is minimum, after determining the minimum path of consumed energy, it is possible to reply RREP and be grouped；
When every jump route power consumption is identical, the road of the route namely searching minimum hop count of total path energy consumption minimization is found
By that is to say the route found at first.
The beneficial effects of the invention are as follows：Routing information request RREQ forwarding scope can be effectively reduced, is had good
Robustness；Consider balancing energy simultaneously on the premise of domain is forwarded, both reduced the forwarding scope of RREQ packets, saved route
The expense of control packet in agreement, solves the problems, such as node energy equilibrium again, extends the life-span of whole network.
Brief description of the drawings
Fig. 1 is SEADR route establishment process figures；
Fig. 2 is node 3RREQ broadcasting process figure；
Fig. 3 is the mathematical modeling figure that node 3RREQ broadcasting process takes out；
Fig. 4 is the variation diagram with interstitial content increase routing cost；
Fig. 5 is node life span figure.
Embodiment
Invention is described in further detail below in conjunction with the accompanying drawings.
A kind of downhole wireless sensing network routing method on demand, it is assumed that have n routing node in coal mine roadway, due to route
Node location is fixed, therefore each node in network can obtain oneself current positional information, with coordinate representation.In order to
The positional information of enough interactive adjacent node, increases a field in RREQ packets, RREQ is sent into this node for storing
Previous hop node coordinate.In mine, the position of mobile substation is fixed, so the positional information entrained by RREQ packets is
Certain, update and be grouped without point of addition.
Routing node leads to the route of destination node in order to find, and traditional method is source node by by way of flooding
A route requests packet RREQ is broadcasted to surroundings nodes, receives information of the RREQ intermediate node in RREQ, foundation is arrived
The route of source node --- increase a route entry in the routing table, be referred to as " reverse route ".The purpose of reverse route entry
Node is the source node for broadcasting RREQ, and next-hop node is the neighbors that RREQ is sent to this node.Then it is again to surrounding
This packet of node broadcasts, so on, until destination node receives RREQ.
During broadcast, as shown in Figure 1, it is assumed that node 2 will send packet to node 5, but in routing table
The route of node 5 is not reached, node 2 will initiate route establishment process, in figure ● represent FFD, zero represents RFDRepresent wide
Path is broadcast, ← reverse path is represented,Represent packet transmitting path.Node 2 is grouped to surroundings nodes broadcast RREQ
As schemed (a), node 0,1,4 establishes the reverse route to node 2 after receiving RREQ packets, and continues to broadcast RREQ to surroundings nodes
Packet such as figure (b).It can be seen that, node 3 starts to week after it have received the packets of the RREQ from node 0,1,4 from figure (c)
Node broadcasts RREQ packets are enclosed, the node around it has 0,1,4,5,8,9, wherein, node 0,1,4 repeats to have received RREQ points again
Group, this not only will not play a part of promotion to finding path, can make route test message amount in network too many on the contrary, reduce
The performance of network.The packet transmitting path of node 2 to node 5 is as shown in schemed (d).
In the present invention, using the method for determining to forward domain, that is, the forwarding scope of RREQ packets is controlled, it is sent to
Not to the node of this forwarded over packet of this node.
(1) determination of domain angle is forwarded
By taking Fig. 1 interior joints 3 as an example, in order that RREQ packets no longer are repeated to be sent to node 0,1,4 by node 3, we are just
The grey lines regions shield determined jointly by node 1,3,4 is fallen, node 3 is forwarded packet to the node outside this region.
We represent in this region in mathematical modeling, such as Fig. 2：A points represent node 4, and B points represent node 1, and C points represent node 3, D points
Represent node 0.
Assuming that A point coordinates is (xa, ya), B point coordinates is (xb, yb), C point coordinates is (xc, yc), D point coordinates is (xd,yd),
Angle α is calculated first1Size：
Make xa-xc=m1 ya-yc=n1 xb-xc=m2 yb-yc=n2
Then
Angle α2And α3Can similarly it try to achieve.Compare the size at three angles, it is known that α1Maximum, therefore forward the angle beta in domain to lead to
Following formula is crossed to try to achieve：
(2) determination of domain critical edge is forwarded
Due to angle it has been determined that the node for trying to achieve this angle also just can determine that still by taking node 3 as an example, critical edge is exactly
Side CA and CB.
As shown in figure 3, the forwarding domain of node 3 isWithAnd the region that angle beta determines jointly, but do not include and face
Boundary side.
After being determined in forwarding domain, when a source node is wanted to reach a destination node, it initiates a route discovery
Process and broadcast RREQ.But when intermediate node receives RREQ, it must be the residue of oneself before this bag is forwarded
Energy is compared with some threshold T Hr.If dump energy Er is Er higher than threshold value>THr, it is with regard to broadcast request to all
Neighbor node, in other cases, node conclude that dump energy not enough forwards the bag of other nodes, therefore, node refusal RREQ
Bag, and ignore request, it that is to say the present invention while consider the dump energy of node and the gross energy of institute's routing path consumption.
First, the routing cost function of an energy that consumption is jumped on hop count and node one is defined, its construction process is such as
Under：With n1For source node, with ndFor the path j=n of purpose node1,n2,...ndIf its hop count is Hj, due to each jump of node
The energy consumed is not necessarily identical, therefore, if it is E that node one, which jumps consumed energy,x。
Hj=d-1 (5)
RouteCostj=Ex×Hj=Ex×(d-1) (6)
It is grouped when destination node receives first RREQ, RREP packets will not be responded immediately to, and reached after being to wait for
RREQ is grouped.It is grouped for the RREQ for repeating to receive, during the sequence number for comparing them and each RREQ are grouped by destination node
Value in Path cost domains, if sequence number is big, then it represents that have new route finding process, now only need comparative sequences phase
Same RREQ is grouped, and the minimum paths of the value in Path cost domains are optimal path, that is to say the consumption of this paths
Gross energy is minimum.After determining the minimum path of consumed energy, it is possible to reply RREP and be grouped.
Still by taking Fig. 1 as an example.
Assuming that each jump consumed energy is identical, then the routed path for finding minimal energy consumption is just changed into finding minimum hop count
Route.Node 2 will transmit data to node 5, and node 2 first will send route requests packet to its neighbor node 1,0,4
RREQ, such as Fig. 1 (a), node 1,0,4 after this RREQ message is received, to consider respective dump energy with it is set in advance
The comparison of threshold value.Now our point situations are described：
Node 4 is considered first, and as seen from the figure, when node 2 reaches node 5 through node 4, route jumping figure is minimum.It is if remaining
ENERGY E r4>THr, then node 4 forwards the neighbor node 0,3,5,7 in domain to continue to forward RREQ packets to it, when node 4 will
When RREQ is forwarded the packet to node 5, route finding process terminates.Even if the path of node 5 can be established by node 0,1,
Also because hop count is larger, the value in Path cost domains is larger and deleted in RREQ packets；If dump energy Er4<THr, node 4
RREQ packets are abandoned, route finding process is not involved in, preserves the energy of oneself.At this moment it is necessary to finding path by node 0,1.
As shown in Figure 1, node 0 and 1 wants the path established to node 5, must be requested that node 3 carries out forwarding control point
Group, in Er3>On the premise of THr, if the energy of node 0 and node 1 is all sufficient, two nodes are all into respective forwarding domain
RREQ packets are forwarded, after node 3 receives this control packet, the node 5,8,9 continued into oneself forwarding domain forwards, when node 5
After the RREQ control packets for receiving first arrival, RREP packets are replied, route finding process terminates；If the residue of node 0
ENERGY E r0<THr, node 0 abandon RREQ packets, are not involved in route finding process, preserve the energy of oneself.When node 0 abandons
After RREQ packets, if Er1>THr, then neighbor node 0,3 forwarding RREQ packet of the node 1 into its forwarding domain, node 3 continue to turn
Hair, last Route establishment success, conversely, Route establishment fails；If the dump energy Er of node 11<THr, node 1 abandon
RREQ is grouped, and is not involved in route finding process, is preserved the energy of oneself.After node 1 abandons RREQ packets, if Er0>THr, then
Node 0 forwards the neighbor node 0,3 in domain to forward RREQ packets to it, and node 3 continues to forward, last Route establishment success, instead
It, Route establishment failure.
Above node 0,1 is established on the premise of path is successfully built upon the dump energy abundance of node 3, if Er3<
THr, even if node 0,1 energy are sufficient, it is also not possible to establish routed path.
When route is final establishes failure, the node for having dump energy low in all possible paths is that is to say, now, section
The increase sequence number of point 2, resends same route request information, and asking for sequence number is added when intermediate node receives this
After seeking message, its threshold T Hr is turned down d, can thus continue to forward the message.
As shown in Figure 4,5, using NS2 emulation platforms, by the present invention and Z-AODV agreement comparative analyses, the results showed that,
In the case of source node number identical, the routing cost of SEADR agreements is significantly lower than Z-AODV agreements；During the survival of SEADR nodes
Between it is substantially longer than Z-AODV.Advantage is shown in routing cost and substantially in terms of the node time-to-live, be effectively saved
Energy consumption, extend life-span of radio sensing network.
The SEADR agreements of the present invention propose to forward the concept in domain, the forwarding model of limitation RREQ packets in terms of route discovery
Enclose；In order that the energy of routing node can be consumed balancedly, SEADR agreements avoid being turned using the low node of dump energy
Data are sent out, but the transmission of row information is entered in the minimum path of wastage in bulk or weight energy in the routed path for selecting to find.Based on road on demand
By the thought of agreement, the routed path do not fixed before data is transmitted, routing node freely can be added and exitted network.
Claims (1)
- A kind of 1. downhole wireless sensing network routing method on demand, it is characterised in that：Coal mine roadway routing nodes position is fixed, Each node in network can obtain oneself current positional information, with coordinate representation；Increase a word in RREQ packets Section, for storing the coordinate for the previous hop node that RREQ is sent to this node；RREQ packets update without point of addition to be grouped； On the basis of traditional algorithm that floods, the concept in forwarding domain is proposed, and gives the determination method in forwarding domain：Specific steps are such as Under：1) forwarding domain angle is determined；If RREQ is forwarded the packet and is combined into S [n], S [n] interior joint to the collection of the neighbors of this node Number is more than or equal to 1；When there was only a node in set, this node can only forward to the node outside set interior joint；When During node more than one in set, if wantonly two node is α with angle determined by this node, compare the size of angle, forward The angle in domain is the π-max α of β=2,2) forwarding domain critical edge is determined；Critical edge is to determine two nodes at α angles each line with this node；Forwarding domain is determined by determining angle and the critical edge of forwarding, the forwarding scope of control RREQ packets, sends out it Give not to the node of this forwarded over packet of this node；While route discovery is carried out in forwarding domain, the concept of energy threshold is proposed, while consider the dump energy of node It is specific as follows with the gross energy of institute routing path consumption：The routing cost function of an energy that consumption is jumped on hop count and node one is defined, its construction process is as follows：With n1For source Node, with ndFor the path j=n of purpose node1,n2,...ndIf its hop count is Hj, consumed energy is jumped by node is each It is not necessarily identical, therefore, if it is E that node one, which jumps consumed energy,x；Hj=d-1 (1)RouteCostj=Ex×Hj=Ex×(d-1) (2)In this method agreement, routing node is when selecting path, it is necessary to which path original in RREQ packets and RREP packets is opened Pin (Path cost) domain be used for store packet institute through the battery consumption on path, that is, according to formula (2) calculating institute's pathway The battery consumption in footpath；It is grouped when destination node receives first RREQ, RREP packets will not be responded immediately to, and the RREQ reached after being to wait for divides Group；Be grouped for repeating the RREQ that receives, destination node the sequence number for comparing them and each RREQ are grouped in Path Value in cost domains, if sequence number is big, then it represents that have new route finding process, now only need comparative sequences identical RREQ is grouped, and the minimum paths of the value in Path cost domains are optimal path, that is to say the total energy of this paths consumption Amount is minimum, after determining the minimum path of consumed energy, it is possible to reply RREP and be grouped；When every jump route power consumption is identical, the route of the route namely searching minimum hop count of total path energy consumption minimization is found, It is the route found at first.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410109457.6A CN103874162B (en) | 2014-03-21 | 2014-03-21 | A kind of downhole wireless sensing network routing method on demand |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410109457.6A CN103874162B (en) | 2014-03-21 | 2014-03-21 | A kind of downhole wireless sensing network routing method on demand |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103874162A CN103874162A (en) | 2014-06-18 |
| CN103874162B true CN103874162B (en) | 2018-01-05 |
Family
ID=50912201
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410109457.6A Expired - Fee Related CN103874162B (en) | 2014-03-21 | 2014-03-21 | A kind of downhole wireless sensing network routing method on demand |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103874162B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105979528B (en) * | 2016-06-23 | 2019-04-09 | 重庆邮电大学 | A kind of Cognitive-Cooperation network association resource allocation methods based on efficiency optimization |
| CN108495249B (en) * | 2018-02-05 | 2019-12-03 | 西安电子科技大学 | Ad hoc network method for routing based on location information low-power consumption |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101827413A (en) * | 2009-03-05 | 2010-09-08 | 赵欣 | Dynamic multipath routing algorithm based on mobility prediction |
| EP2262188A1 (en) * | 2009-06-12 | 2010-12-15 | Hitachi Ltd. | Method and apparatus for disseminating a data packet via multi-hop communication in a communication network |
| CN101977413A (en) * | 2010-11-10 | 2011-02-16 | 北京握奇数据系统有限公司 | Routing method and device of self-organizing network |
-
2014
- 2014-03-21 CN CN201410109457.6A patent/CN103874162B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101827413A (en) * | 2009-03-05 | 2010-09-08 | 赵欣 | Dynamic multipath routing algorithm based on mobility prediction |
| EP2262188A1 (en) * | 2009-06-12 | 2010-12-15 | Hitachi Ltd. | Method and apparatus for disseminating a data packet via multi-hop communication in a communication network |
| CN101977413A (en) * | 2010-11-10 | 2011-02-16 | 北京握奇数据系统有限公司 | Routing method and device of self-organizing network |
Non-Patent Citations (1)
| Title |
|---|
| Energy-Effective Relay Selection by Utilizing Spacial Diversity for Random Wireless Sensor Networks;Bin Li;《IEEE COMMUNICATIONS LETTERS》;20131010;第1972-1975页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103874162A (en) | 2014-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Jain et al. | Geographical routing using partial information for wireless ad hoc networks | |
| Bakht | Survey of routing protocols for mobile ad-hoc network | |
| Tsiachris et al. | Junction-based geographic routing algorithm for vehicular ad hoc networks | |
| CN105722176A (en) | Connection method of Internet of Vehicles massive heterogeneous network with infrastructure in city scene | |
| CN110995599A (en) | Satellite self-organizing network route anti-damage method based on link survival time | |
| Manjhi et al. | Signal strength based route selection in MANETs | |
| CN104602302A (en) | ZigBee network energy balance routing method based on cluster structure | |
| CN104202724B (en) | A kind of AANET joint route algorithms based on geographical location information | |
| Denardin et al. | A geographic routing hybrid approach for void resolution in wireless sensor networks | |
| You et al. | Virtual position based geographic routing for wireless sensor networks | |
| CN103874162B (en) | A kind of downhole wireless sensing network routing method on demand | |
| Mahmood et al. | Hybrid on-demand greedy routing protocol with backtracking for mobile ad-hoc networks | |
| Banka et al. | Angle routing protocol: location aided routing for mobile ad-hoc networks using dynamic angle selection | |
| CN104837173B (en) | A kind of metropolitan area Vehicular communication system of band parking node | |
| KR100955246B1 (en) | Group dynamic source routing method for wireless mobile ad hoc network | |
| CN103096411B (en) | Based on the Internet of Things communication means of reverse power restriction route protocol | |
| CN101437303B (en) | Method for routing and forwarding Ad Hoc network data packet | |
| Peng et al. | An energy-aware random multi-path routing protocol for MANETs | |
| Marwaha et al. | Biologically inspired ant-based routing in mobile ad hoc networks (MANET): a survey | |
| CN114390631A (en) | Multipath routing protocol method for unmanned aerial vehicle ad hoc network mobility prediction | |
| CN104394554B (en) | A kind of prediction type low delay Geographic routing method | |
| Chuang et al. | Efficient vehicular ad‐hoc networks routing based on junctions | |
| Zhang et al. | PCAR: A power controlled routing protocol for wireless ad hoc networks | |
| KR100686973B1 (en) | Cross-layer protocol design method for energy-efficient routing in power-controlled multihop wireless networks | |
| Lakshmi et al. | Comparative analysis of QoS routing protocols in MANETS: Unicast &Multicast |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200102 Address after: 211500 9th floor, Yuting square, No. 59, Wangqiao Road, Xiongzhou street, Liuhe District, Nanjing City, Jiangsu Province Patentee after: Nanjing Urban Underground Space Engineering Research Institute Co., Ltd. Address before: 221000 No. nine Li Xiang Road, Xuzhou, 1, Jiangsu Patentee before: Xuzhou Institute of Industry Technology |
|
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180105 Termination date: 20210321 |