CN103874162A - Downhole wireless sensor network on-demand routing algorithm - Google Patents

Downhole wireless sensor network on-demand routing algorithm Download PDF

Info

Publication number
CN103874162A
CN103874162A CN201410109457.6A CN201410109457A CN103874162A CN 103874162 A CN103874162 A CN 103874162A CN 201410109457 A CN201410109457 A CN 201410109457A CN 103874162 A CN103874162 A CN 103874162A
Authority
CN
China
Prior art keywords
node
territory
rreq
grouping
route
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
Application number
CN201410109457.6A
Other languages
Chinese (zh)
Other versions
CN103874162B (en
Inventor
高媛
朱涛
凌启东
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing Urban Underground Space Engineering Research Institute Co., Ltd.
Original Assignee
Xuzhou College of Industrial Technology
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xuzhou College of Industrial Technology filed Critical Xuzhou College of Industrial Technology
Priority to CN201410109457.6A priority Critical patent/CN103874162B/en
Publication of CN103874162A publication Critical patent/CN103874162A/en
Application granted granted Critical
Publication of CN103874162B publication Critical patent/CN103874162B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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 downhole wireless sensor network on-demand routing algorithm, and relates to the field of wireless sensor network energy-saving routing technologies. A method for determining a forwarding domain includes the steps that firstly, the angle of the forwarding domain is determined, and a set of neighbor nodes for forwarding an RREQ packet to a current node is set as S[n], wherein the number of nodes in S[n] is larger than or equal to one; when only one node exists in the set, the angle of the forwarding domain is 360 degrees, but a critical edge does not include a connecting line of the current node and the only one node, namely the current node can only be forwarded to nodes except the node in the set; when the number of the nodes in the set is more than one, the determined included angles between any two nodes and the current node are set as alpha, the included angles are compared, and the angle of the forwarding domain is beta, wherein beta is equal to 2 pi-max alpha; secondly, the critical edge of the forwarding domain is determined, wherein the critical edge is the connecting lines of the two nodes determining the angle alpha and the current node; the forwarding domain is determined by determining the angle and the critical edge of the forwarding domain, the forwarding range of the RREQ packet is controlled, and the RREQ packet is made to be only sent to the nodes which do not forward the packet to the current node.

Description

A kind of downhole wireless sensing network On-demand routing algorithm
Technical field
The present invention relates to the energy-conservation route technology of radio sensing network field, particularly a kind of downhole wireless Sensor Network
Network On-demand routing algorithm.
Background technology
At present, wireless sensor network (WSN) technology moves to maturity increasingly, has brought into play very large effect at numerous areas.Wherein, in mine, use wireless sensor network to monitor pernicious gases such as gas.Below mine, be mostly long and narrow tunnel, environment relative risk, sensor node is difficult for often changing.So select a set of applicable algorithm to become the very problem of core.The routing algorithm of existing radio sensing network has a variety of, differs from one another, still, and can be completely in conjunction with the objective circumstances under coal mine, the algorithm that is applicable to the radio sensing network of down-hole does not but have.
Summary of the invention
The object of this invention is to provide a kind of downhole wireless sensing network On-demand routing algorithm, referred to as SEADR(simple and energy-aware on demand routing), this agreement is supported FFD and two kinds of nodes of RFD of ZigBee, in route discovery mode, propose to forward the concept in territory, reduce the quantity of control packet.
The present invention realizes with following technical scheme: a kind of downhole wireless sensing network On-demand routing algorithm, and in coal mine roadway, route node location is fixed, and the each node in network can obtain own current positional information, represents with coordinate; In RREQ grouping, increase a field, be used for storing the coordinate that RREQ is sent to the previous dive node of this node; RREQ grouping is upgraded grouping without point of addition; Traditional flooding on algorithm basis, propose to forward the concept in territory, and provided the definite method that forwards territory: concrete steps are as follows:
1) determine and forward territory angle; If be RREQ forwarding of packets to the set of the neighbors of this node
Figure 89604DEST_PATH_IMAGE001
, middle node number is more than or equal to 1.In the time only having a node in set, the angle that forwards territory is 360 o, but critical edge does not comprise this node line of node therewith, that is to say that this node can only forward to the node outside node in set; In the time of more than one of node in set, establish the determined angle of wantonly two nodes and this node and be , the relatively size of angle, the angle that forwards territory is
Figure 66634DEST_PATH_IMAGE003
,
2) determine and forward territory critical edge; Critical edge is definite
Figure 408492DEST_PATH_IMAGE004
two nodes at angle separately with the line of this node;
Determine forwarding territory by angle and the critical edge of determining forwarding, controlled the forwarding scope of RREQ grouping, made it send to the node that did not forward this grouping to this node.
In order to extend the life-span of whole network, effectively save energy consumption, carry out route discovery in forwarding territory in, the concept of energy threshold value is proposed, consider the dump energy of node and the gross energy that selected routed path consumes simultaneously, specific as follows:
Define a route cost function of jumping the energy consuming about jumping figure and node one, its construction process is as follows: with
Figure 377060DEST_PATH_IMAGE005
for source
Node, with
Figure 947719DEST_PATH_IMAGE006
for the path of destination node
Figure 763972DEST_PATH_IMAGE007
, establish its jumping figure and be
Figure 778195DEST_PATH_IMAGE008
, due to node each to jump the energy that consumes not necessarily identical, therefore, establish node one and jump consumed energy and be
Figure 821279DEST_PATH_IMAGE009
;
Figure 756481DEST_PATH_IMAGE010
（1）
（2）
In SEADR agreement, routing node is in the time of selecting paths, original path cost (Path cost) territory in RREQ grouping and RREP grouping need to be used for stores packets battery expense on path, namely according to formula (2) calculating through the battery expense in path;
Receive first RREQ grouping when destination node, can not reply immediately RREP grouping, but the RREQ grouping arriving after waiting for; For the RREQ grouping that repeats to receive, destination node is by the value in the Path cost territory in their sequence number of comparison and each RREQ grouping, if sequence number is large, indicate new route finding process, now only need comparative sequences number identical RREQ grouping, a paths of the value minimum in Path cost territory is optimal path, that is to say the gross energy minimum that this paths consumes, determine behind the path of consumed energy minimum, just can reply RREP and divide into groups;
When every jumping route consumes energy when identical, the route of finding total path energy consumption minimization is namely found the route of minimum hop count, that is to say the route of finding at first.
The invention has the beneficial effects as follows: can effectively reduce the forwarding scope of routing information request RREQ, there is good robustness; Under the prerequisite that forwards territory, consider balancing energy simultaneously, both reduced the forwarding scope of RREQ grouping, saved the expense of control packet in Routing Protocol, solved again the problem of node energy equilibrium, extend the life-span of whole network.
Accompanying drawing explanation
Fig. 1 is SEADR Route establishment procedure chart;
Fig. 2 is the broadcasting process figure of node 3 RREQ;
Fig. 3 is the Mathematical Modeling figure that the broadcasting process of node 3 RREQ takes out;
Fig. 4 is the variation diagram that increases routing cost with interstitial content;
Fig. 5 is node life span figure.
Embodiment
Below in conjunction with accompanying drawing, invention is described in further detail.
A kind of downhole wireless sensing network On-demand routing algorithm, supposing has n routing node in coal mine roadway, and because routing node position is fixed, therefore the each node in network can obtain own current positional information, represents with coordinate.For the positional information of adjacent node alternately, in RREQ grouping, increase a field, be used for storage RREQ to be sent to the coordinate of the previous dive node of this node.In mine, the position of mobile substation is fixed, so RREQ divides into groups, entrained positional information is certain, upgrades grouping without point of addition.
Routing node is in order to find the route towards destination node, traditional method is that source node is by the route requests grouping RREQ of node broadcasts towards periphery of the mode by flooding, receive that the intermediate node of RREQ is according to the information in RREQ, be established to the route of source node---in routing table, increase a route entry, be called " oppositely route ".Oppositely the destination node of route entry is the source node of broadcast RREQ, and next-hop node is the neighbors that RREQ is sent to this node.Then its this grouping of node broadcasts towards periphery again, so goes down, until destination node is received RREQ.
In the process of broadcast, as shown in Figure 1, to suppose that node 2 will send packet to node 5, but in routing table, do not arrive the route of node 5, node 2 will be initiated Route establishment process, in figure represent FFD,
Figure 371505DEST_PATH_IMAGE013
represent RFD
Figure 172714DEST_PATH_IMAGE014
represent broadcast route, represent reverse path,
Figure 430837DEST_PATH_IMAGE016
representative data packet transfer route.Node 2 node broadcasts RREQ grouping towards periphery as figure (a), node 0,1,4 is established to the reverse route of node 2 after receiving RREQ grouping, and continues node broadcasts RREQ grouping towards periphery as figure (b).From figure (c), can see, node 3 is after the RREQ grouping of having received from node 0,1,4, start node broadcasts RREQ grouping towards periphery, its node around has 0,1,4,5,8,9, wherein, node 0,1,4 repeats again to have received RREQ grouping, and this not only can not play to finding path the effect of promotion, can make on the contrary in network route control message amount too many, reduce the performance of network.Node 2 arrives the packet transfer path of node 5 as shown in figure (d).
In the present invention, adopt and determine the method that forwards territory, control the forwarding scope of RREQ grouping, make it can only send to the node that did not forward this grouping to this node.
(1) forward determining of territory angle
Take node in Fig. 13 as example, in order to make node 3 no longer RREQ grouping be repeated to send to node 0,1,4, we make node 3 forward grouping to this extra-regional node just being fallen by the common definite grey lines regions shield of node 1,3,4.We represent this region in Mathematical Modeling, as Fig. 2: A point represents node 4, and B point represents node 1, C point expression node 3, D point expression node 0.
Suppose A point coordinates for (
Figure 471081DEST_PATH_IMAGE017
,
Figure 954277DEST_PATH_IMAGE018
), B point coordinates be ( ,
Figure 985611DEST_PATH_IMAGE020
), C point coordinates be (
Figure 155561DEST_PATH_IMAGE021
,
Figure 176869DEST_PATH_IMAGE022
), D point coordinates be (
Figure 535781DEST_PATH_IMAGE023
, ), first calculate angle
Figure 641589DEST_PATH_IMAGE025
size:
Figure 699543DEST_PATH_IMAGE026
（1）
Figure 991591DEST_PATH_IMAGE027
（2）
Figure 312851DEST_PATH_IMAGE028
Figure 614651DEST_PATH_IMAGE029
Order
Figure 849550DEST_PATH_IMAGE031
Figure 826865DEST_PATH_IMAGE032
Figure 629342DEST_PATH_IMAGE033
Figure 294679DEST_PATH_IMAGE034
Figure 108789DEST_PATH_IMAGE035
Figure 771851DEST_PATH_IMAGE036
（3）
Angle with
Figure 451466DEST_PATH_IMAGE039
can in like manner try to achieve.Relatively the size at three angles, known
Figure 82168DEST_PATH_IMAGE025
maximum, therefore forward the angle in territory
Figure 924484DEST_PATH_IMAGE040
can try to achieve by following formula:
（4）
(2) forward determining of territory critical edge
Because angle is determined, try to achieve the node of this angle and also just can determine, still take node 3 as example, critical edge is exactly limit CA and CB.
Figure 94227DEST_PATH_IMAGE026
Figure 397294DEST_PATH_IMAGE027
As shown in Figure 3, the forwarding territory of node 3 is
Figure 959863DEST_PATH_IMAGE042
with
Figure 269228DEST_PATH_IMAGE043
and angle
Figure 600852DEST_PATH_IMAGE040
definite region jointly, but do not comprise critical edge.
After forwarding territory is determined, when a source node wants to arrive a destination node, it initiates a route finding process and broadcast RREQ.But in the time that intermediate node is received RREQ, before forwarding this bag, it must be the dump energy of oneself and certain threshold value
Figure 278083DEST_PATH_IMAGE044
compare.If dump energy
Figure 327948DEST_PATH_IMAGE045
higher than threshold value be
Figure 362375DEST_PATH_IMAGE045
>
Figure 253233DEST_PATH_IMAGE044
, it arrives all neighbor nodes with regard to broadcast request, in other cases, node concludes that dump energy forwards the bag of other nodes not, therefore, and node refusal RREQ bag, and ignored request, that is to say that the present invention considers the dump energy of node and the gross energy that selected routed path consumes simultaneously.
First, define a route cost function of jumping the energy consuming about jumping figure and node one, its construction process is as follows: with
Figure 662218DEST_PATH_IMAGE005
for source node, with
Figure 619285DEST_PATH_IMAGE006
for the path of destination node
Figure 211066DEST_PATH_IMAGE046
, establish its jumping figure and be
Figure 226205DEST_PATH_IMAGE047
, due to node each to jump the energy that consumes not necessarily identical, therefore, establish node one and jump consumed energy and be
Figure 432190DEST_PATH_IMAGE009
.
Figure 456647DEST_PATH_IMAGE048
（5）
Figure 645926DEST_PATH_IMAGE011
（6）
Receive first RREQ grouping when destination node, can not reply immediately RREP grouping, but the RREQ grouping arriving after waiting for.For the RREQ grouping that repeats to receive, destination node is by the value in the Path cost territory in their sequence number of comparison and each RREQ grouping, if sequence number is large, indicate new route finding process, now only need comparative sequences number identical RREQ grouping, one paths of the value minimum in Path cost territory is optimal path, that is to say the gross energy minimum that this paths consumes.Determine behind the path of consumed energy minimum, just can reply RREP and divide into groups.
[still, take Fig. 1 as example, suppose that each jumping consumed energy is identical, the routed path of finding minimal energy consumption just becomes the route of finding minimum hop count.Node 2 will transmit data to node 5, first node 2 will send route requests grouping RREQ to its neighbor node 1,0,4, as Fig. 1 (a), node 1,0,4 receiving after this RREQ message, consider dump energy separately and the comparison of predefined threshold value.Now our point situation is described:
First consider node 4, as seen from the figure, node 2 is in the time that node 4 arrives node 5, and path jumping figure is minimum.If dump energy
Figure 806649DEST_PATH_IMAGE049
>
Figure 58901DEST_PATH_IMAGE044
, the neighbor node 0,3,5,7 that node 4 forwards in territory to it so continues to forward RREQ grouping, and when node 4 is by RREQ forwarding of packets during to node 5, route finding process finishes.Even if can be established to the path of node 5 by node 0,1, also because jumping figure is larger, in RREQ grouping, the value in Path cost territory is compared with large and deleted; If dump energy
Figure 305075DEST_PATH_IMAGE049
<
Figure 298045DEST_PATH_IMAGE044
, node 4 abandons RREQ grouping, does not participate in route finding process, preserves the energy of oneself.At this moment, will find path by node 0,1.
As shown in Figure 1, node 0 and 1 wants to be established to the path of node 5, necessarily requires node 3 to forward control packet,
Figure 578854DEST_PATH_IMAGE050
>
Figure 939690DEST_PATH_IMAGE044
prerequisite under, if the energy of node 0 and node 1 is all sufficient, two nodes all forward RREQ grouping in forwarding territory separately, node 3 is received after this control packet, continue to forward to the node 5,8,9 oneself forwarding in territory, when node 5 is received after the RREQ control packet of first arrival, reply RREP grouping, route finding process finishes; If the dump energy of node 0 <
Figure 204242DEST_PATH_IMAGE044
, node 0 abandons RREQ grouping, does not participate in route finding process, preserves the energy of oneself.When node 0 abandons after RREQ grouping, if
Figure 27972DEST_PATH_IMAGE052
> , the neighbor node 0,3 that node 1 forwards in territory to it forwards RREQ grouping, and node 3 continues to forward, last Route establishment success, otherwise, Route establishment failure; If the dump energy of node 1
Figure 902180DEST_PATH_IMAGE052
<
Figure 239883DEST_PATH_IMAGE044
, node 1 abandons RREQ grouping, does not participate in route finding process, preserves the energy of oneself.When node 1 abandons after RREQ grouping, if
Figure 495284DEST_PATH_IMAGE051
> , the neighbor node 0,3 that node 0 forwards in territory to it forwards RREQ grouping, and node 3 continues to forward, last Route establishment success, otherwise, Route establishment failure.
It is to be successfully based upon under the prerequisite of node 3 dump energy abundances that above node 0,1 is set up path, if
Figure 388208DEST_PATH_IMAGE050
<
Figure 28137DEST_PATH_IMAGE044
even if node 0,1 energy abundance, also can not set up routed path.
Finally set up when failed when route, that is to say in all possible paths and have the node that dump energy is low, now, node 2 increases sequence number, resend same route request information, when intermediate node receives after this request message that has increased sequence number, its threshold value
Figure 636579DEST_PATH_IMAGE044
turn down d, so just can continue to have forwarded this message.
As shown in Figure 4,5, utilize NS2 emulation platform, by the present invention and the comparative analysis of Z-AODV agreement, result shows, in the situation that source node number is identical, the routing cost of SEADR agreement is starkly lower than Z-AODV agreement; The time-to-live of SEADR node is obviously than the length of Z-AODV.Obviously having shown advantage aspect routing cost and node time-to-live, effectively save energy consumption, extend the life-span of radio sensing network.
SEADR agreement of the present invention proposes to forward the concept in territory aspect route discovery, the forwarding scope of restriction RREQ grouping; For the energy that makes routing node can balancedly consume, SEADR agreement avoids using the node that dump energy is low to carry out forwarding data, but in the routed path of selecting to find, the transmission of information is carried out in the minimum path of wastage in bulk or weight energy.Based on the thought of on-demand routing protocol, before transmission data, there is no fixing routed path, routing node can freely add and exit network.

Claims (2)

1. a downhole wireless sensing network On-demand routing algorithm, is characterized in that: in coal mine roadway, route node location is fixed, and the each node in network can obtain own current positional information, represents with coordinate; In RREQ grouping, increase a field, be used for storing the coordinate that RREQ is sent to the previous dive node of this node; RREQ grouping is upgraded grouping without point of addition; Traditional flooding on algorithm basis, propose to forward the concept in territory, and provided the definite method that forwards territory: concrete steps are as follows:
1) determine and forward territory angle; If be RREQ forwarding of packets to the set of the neighbors of this node
Figure 629748DEST_PATH_IMAGE002
,
Figure 247943DEST_PATH_IMAGE002
middle node number is more than or equal to 1; In the time only having a node in set, the angle that forwards territory is 360 o, but critical edge does not comprise this node line of node therewith, that is to say that this node can only forward to the node outside node in set; In the time of more than one of node in set, establish the determined angle of wantonly two nodes and this node and be
Figure 924518DEST_PATH_IMAGE004
, the relatively size of angle, the angle that forwards territory is
Figure 888932DEST_PATH_IMAGE006
,
2) determine and forward territory critical edge; Critical edge is definite
Figure 2014101094576100001DEST_PATH_IMAGE007
two nodes at angle separately with the line of this node;
Determine forwarding territory by angle and the critical edge of determining forwarding, controlled the forwarding scope of RREQ grouping, made it send to the node that did not forward this grouping to this node.
2. require described a kind of downhole wireless sensing network On-demand routing algorithm according to right 1, it is characterized in that: carry out route discovery in forwarding territory in, propose the concept of energy threshold value, consider the dump energy of node and the gross energy that selected routed path consumes simultaneously, specific as follows:
Define a route cost function of jumping the energy consuming about jumping figure and node one, its construction process is as follows: with
Figure 2014101094576100001DEST_PATH_IMAGE009
for source
Node, with for the path of destination node
Figure 2014101094576100001DEST_PATH_IMAGE013
, establish its jumping figure and be , due to node each to jump the energy that consumes not necessarily identical, therefore, establish node one and jump consumed energy and be
Figure 2014101094576100001DEST_PATH_IMAGE017
;
Figure 2014101094576100001DEST_PATH_IMAGE019
（1）
Figure 2014101094576100001DEST_PATH_IMAGE021
（2）
In SEADR agreement, routing node is in the time of selecting paths, original path cost (Path cost) territory in RREQ grouping and RREP grouping need to be used for stores packets battery expense on path, namely according to formula (2) calculating through the battery expense in path;
Receive first RREQ grouping when destination node, can not reply immediately RREP grouping, but the RREQ grouping arriving after waiting for; For the RREQ grouping that repeats to receive, destination node is by the value in the Path cost territory in their sequence number of comparison and each RREQ grouping, if sequence number is large, indicate new route finding process, now only need comparative sequences number identical RREQ grouping, a paths of the value minimum in Path cost territory is optimal path, that is to say the gross energy minimum that this paths consumes, determine behind the path of consumed energy minimum, just can reply RREP and divide into groups;
When every jumping route consumes energy when identical, the route of finding total path energy consumption minimization is namely found the route of minimum hop count, that is to say the route of finding at first.
CN201410109457.6A 2014-03-21 2014-03-21 A kind of downhole wireless sensing network routing method on demand Expired - Fee Related CN103874162B (en)

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 true CN103874162A (en) 2014-06-18
CN103874162B 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)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105979528A (en) * 2016-06-23 2016-09-28 重庆邮电大学 Cognitive cooperative network united resource allocation method based on energy efficiency optimization
CN108495249A (en) * 2018-02-05 2018-09-04 西安电子科技大学 Ad hoc network method for routing based on location information low-power consumption

Citations (3)

* Cited by examiner, † Cited by third party
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

Patent Citations (3)

* Cited by examiner, † Cited by third party
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)

* Cited by examiner, † Cited by third party
Title
BIN LI: "Energy-Effective Relay Selection by Utilizing Spacial Diversity for Random Wireless Sensor Networks", 《IEEE COMMUNICATIONS LETTERS》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105979528A (en) * 2016-06-23 2016-09-28 重庆邮电大学 Cognitive cooperative network united resource allocation method based on energy efficiency optimization
CN105979528B (en) * 2016-06-23 2019-04-09 重庆邮电大学 A kind of Cognitive-Cooperation network association resource allocation methods based on efficiency optimization
CN108495249A (en) * 2018-02-05 2018-09-04 西安电子科技大学 Ad hoc network method for routing based on location information low-power consumption
CN108495249B (en) * 2018-02-05 2019-12-03 西安电子科技大学 Ad hoc network method for routing based on location information low-power consumption

Also Published As

Publication number Publication date
CN103874162B (en) 2018-01-05

Similar Documents

Publication Publication Date Title
CN103621144B (en) For the method for finding route set in a network
US7924758B2 (en) Energy-aware routing apparatus and method
US8856227B2 (en) Communication method and apparatus using virtual sink node in wireless sensor network
Kafhali et al. Effect of Mobility and Traffic Models on the energy consumption in MANET Routing Protocols
Tashtoush et al. Fibonacci sequence based multipath load balancing approach for mobile ad hoc networks
CN101711048A (en) Method for choosing gateway in integrating process of mobile self-organization network and Internet
CN105577547A (en) Multi-Qos based route selection method in mobile self-organizing network
CN106792838B (en) DTN relay node candidate set selection method
CN108093457B (en) Route searching method and system for wireless ad hoc network
CN102781060B (en) A kind of method, forward node and wireless network realizing route in the wireless network
Mu An improved AODV routing for the zigbee heterogeneous networks in 5G environment
Mahajan et al. A novel chain based wireless data sensor network (ECBSN) technique
KR101378496B1 (en) Wireless sensor network node and method for transferring data thereof
CN102340840A (en) Method, device and node for establishing route
EP3261388A1 (en) Wireless communication system, base station device, mobile station device, and wireless communication control method
CN103874162A (en) Downhole wireless sensor network on-demand routing algorithm
Das et al. A game-theory based secure routing mechanism in mobile ad hoc network
Peng et al. An energy-aware random multi-path routing protocol for MANETs
CN109699060A (en) A kind of means of communication and device of wireless sensor network
Setty et al. Comparative study of energy aware QoS for proactive and reactive routing protocols for mobile ad-hoc networks
Miller et al. Reliable and efficient reprogramming in sensor networks
CN106162790B (en) The multipath Geographic routing optimization method of code-on-demand migration sink in a kind of wireless sense network
Acharya et al. Energy-aware virtual backbone tree for efficient routing in wireless sensor networks
CN102547899A (en) Self-adapting routing selection method applied to wireless sensing network
KR100686973B1 (en) Cross-layer protocol design method for energy-efficient routing in power-controlled multihop wireless 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
GR01 Patent grant
GR01 Patent grant
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

TR01 Transfer of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20180105

Termination date: 20210321

CF01 Termination of patent right due to non-payment of annual fee