CN101471864B - Data forwarding method based on receiver route in wireless self-organizing network - Google Patents
Data forwarding method based on receiver route in wireless self-organizing network Download PDFInfo
- Publication number
- CN101471864B CN101471864B CN2007103045767A CN200710304576A CN101471864B CN 101471864 B CN101471864 B CN 101471864B CN 2007103045767 A CN2007103045767 A CN 2007103045767A CN 200710304576 A CN200710304576 A CN 200710304576A CN 101471864 B CN101471864 B CN 101471864B
- Authority
- CN
- China
- Prior art keywords
- node
- receiving node
- forwarding
- packet
- receiving
- 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
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a receiver routing-based data forwarding method in a wireless Ad hoc network. The method calculates forwarding priority of a receiving node by comprehensive consideration of three factors including the distance from the receiving node to a target node, the additional coverage area of the receiving node and the residual energy of the receiving node; and the receiving node starts a timer to conduct data forwarding according to the calculation result of the forwarding priority. In the method, the priority calculation is easier, which is favorable for timely selecting a proper receiving node as a forwarding node of a next hop and improving the probability of success and the reliability of data forwarding.
Description
Technical field
The present invention relates to a kind of in wireless self-organization network data forwarding method, relate in particular in a kind of wireless self-organization network based on the data forwarding method of recipient's route, belong to wireless communication field.
Background technology
In wireless self-organization network,, cause the network topology structure dynamic change, even do not have a data transfer path end to end in moment between two nodes sometimes because node motion, node failure or Radio Link are subjected to the interference of environment.If adopt static end-to-end routing mechanism, or the sender specifies next redirect to send out node, and the route maintenance expense is big, data transmission efficiency is low, even transfer of data is difficult to realize.
Routing mechanism based on the recipient is a kind of comparatively novel Data Transport Protocol, sending node does not specify certain specific neighbor node to transmit data in this quasi-protocol, but the forwarding power of competing next jumping according to oneself state information (as to the distance of destination node, self rest energy etc.) by the neighbor node that receives data, the node that competition is won becomes next-hop node and is responsible for forwarding of data.Do not need to set up and safeguard overall route from the source node to the destination node based on recipient's Routing Protocol, do not need sending node to know in advance yet which neighbor node is arranged, therefore can be applicable to wireless self-organization network, particularly the wireless self-organization network of Yi Donging.
In wireless self-organization network, node often adopts powered battery, and the energy that node carries is very limited.In Routing Protocol, data forwarding will take into full account the dump energy of node simultaneously, allows the many nodes of dump energy bear more forwarding task, helps the equilibrium consumption of whole network energy like this, prolongs the life cycle of whole network.
Relate to based on recipient's routing mechanism and to transmit relative importance value, transmit and suppress and problem that the aspect such as is gone beyond in the route cavity.Transmit relative importance value and be meant that the node that receives packet calculates according to oneself state and ownly send out the priority of node as next redirect, the high receiving node of priority is for transmitting the next-hop node of packet.Transmit one of the core technology that relative importance value is based on recipient's routing mechanism, it will embody the appropriate level that node is transmitted, and has the property distinguished preferably, low computation complexity and be beneficial to the equilibrium use etc. of network energy.
Several routing mechanisms based on the recipient have been proposed at present.Holger Fubler etc. propose based on the host-host protocol CBF (Contention-based Forwarding) of competition in (reference: H Fussler, J Widmer, M Kasemann, M Mauve, H Hartenstein, Contention-based forwarding for mobile ad-hoc networks, Ad Hoc NetworksJournal (Elsevier), 2003,1 (4): 351-369), sending node is called the forwarding zone to the zone of the near single-hop scope of destination node relatively.When receiving a data grouping, the node of transmitting in the zone is set a timer according to self to the distance of destination node, when timer then and not listens to other nodes when sending the relevant information of this packet, node is defaulted as and self obtains to transmit power, send echo message to sending node, and suppress other node and respond in the follow-up moment.The forwarding relative importance value of CBF agreement has only been considered the distance of node to destination node; Hour transmission delay is bigger when network node density.
Michele Zorzi etc. has proposed Routing Protocol GeRaF (the Geographic Random Forwarding that transmits at random, reference: M Zorzi, R R Rao, Geographic Random Forwarding (GeRaF) for ad hoc and sensornetworks:energy and latency performance.Trans.on Mobile Computing, 2003,2 (4): 349-365).This agreement is divided into a plurality of banded subregions with the forwarding zone of sending node, and each subregion distributes a time slot, receives in the same subregion that power is transmitted in the competition of node equality in distributed time slot of packet.The node that its competition is won becomes next redirect and sends out node.Transmit relative importance value in the GeRaF agreement and also only considered the distance of node to destination node, many wheels competitive way of Cai Yonging is not enough to some extent aspect forwarding time delay and communication overhead simultaneously.
People such as Brain M.Blum have proposed the geographical host-host protocol IGF of implication (Implicit Geographic Forwarding, reference: B M Blum, T He, S Son, J A Stankovic, IGF:A robust state-free communication protocol forsensor networks, in:Technical report CS-2003-11, CS Department, University of Virginia, 2003).This agreement will be transmitted in the sector region that the zone is limited to one 60 degree subtended angle, and set the time of the delay of response sending node from the distance of destination node and the dump energy of self according to receiving node.The IGF agreement is transmitted relative importance value and has been considered capacity factor, but transmit regional restriction meeting nodes that some are fit to the forwarding data is originally foreclosed, and has reduced the reportedly defeated probalility of success of next jumping figure; When network node density is low, can cause bigger transmission delay.
Existing routing mechanism is being transmitted the information of not taking all factors into consideration node aspect the relative importance value calculating, does not particularly consider the position (node distribution) of node, is unfavorable for that next redirect of selecting timely and accurately to be fit to sends out node.
Summary of the invention
Main purpose of the present invention is the deficiency of calculating based on the forwarding relative importance value of recipient's route at existing, proposes in a kind of wireless self-organization network the data forwarding method based on recipient's route.The multiple information that the present invention takes all factors into consideration node self is come the forwarding relative importance value of computing node, the grade of fit that the result of calculation of relative importance value and node are sent out node as next redirect is corresponding, and is near from the destination node distance, neighbor node is many and node that dump energy is many has high forwarding priority; Simultaneously, the calculating of relative importance value is simpler.Like this, help in time selecting the forward node of suitable receiving node as next jumping.
The present invention is when calculating the forwarding relative importance value of receiving node, and taken all factors into consideration following three factors: receiving node is from the distance of destination node, the extra coverage of receiving node and the dump energy of node.Receiving node is to transmit the important factor in order of relative importance value to the distance of destination node, as shown in Figure 1, effectively transmit nearest from destination node of receiving node i in the zone (Valid Forwarding Area), therefore receiving node i is suitable as the forward node of next jumping most under square one.
The extra coverage of receiving node is meant that the communication range of this node removes rest parts behind the overlapping region with the sending node communication range.As shown in Figure 2, receiving node i and j equate from the distance of destination node, but the extra coverage of node i is much larger than the extra coverage of node j.Under the certain prerequisite of network average nodal density, the extra coverage of node means that greatly the desired value of neighbor node number is also big, therefore in the data forwarding process of next jumping, node i is bigger than the probability of the successful forwarding of node j, should be higher than node j so it transmits relative importance value.Because the area of the extra coverage of node calculates comparatively complicated, for reducing computation complexity, the present invention adopts receiving node to come the extra coverage of approximate representation node to the distance of sending node.
The node of wireless self-organization network moves often, by carrying the powered battery of finite energy, therefore, is necessary to consider capacity factor when computing node is transmitted relative importance value, allows the node of energy abundance preferentially transmit data under the equal conditions.
It is as follows that the node that the present invention proposes is transmitted the relative importance value computational methods:
Pr in the formula
iBe the forwarding relative importance value of receiving node i, d is the distance of sending node to destination node, d
iAnd r
iBe respectively the distance of receiving node i, E to destination node and sending node
iAnd E
0Be respectively dump energy and the primary power of receiving node i, R is the communication distance of node, supposes that the communication radius of all nodes is identical.
Fig. 3 has provided under the situation that all residue energy of node equate, transmits the relative importance value distribution situation in the sending node communication range, and the coordinate of sending node is (50,50), communication radius R=100.
The above analysis, the technical scheme that the present invention proposes is:
Based on the data forwarding method of recipient's route, the steps include: in a kind of wireless self-organization network
1) packet comprises the location information field of sending node and the location information field of destination node, and sending node is written to the positional information of itself location information field of sending node for the packet that will send; Data source nodes writes the positional information of destination node the location information field of destination node;
2) receive the receiving node of packet according to the positional information of sending node, the positional information of destination node and the positional information of self, calculate sending node to destination node apart from d, receiving node to destination node apart from d
i, receiving node to destination node apart from d
i, between receiving node and the sending node apart from r
iThe primary power E of oneself when wherein receiving node is recorded in network startup
0, and communication radius R;
3) as distance d＞d
iThe time, receiving node reads current self dump energy E
i, according to formula
D-d
i＞0 (Pr
i∈ [0,1]) the forwarding relative importance value Pr of setting node self
i
4) timer is set in the receiving node, the value of described timer is set according to the value of transmitting relative importance value, reduce in unpromising zero process at timer value, receive that other node becomes the information that node is sent out in next redirect, then this receiving node is abandoned becoming next redirect and is sent out node; Be reduced in zero process at timer value, do not receive that other node becomes the information that node is sent out in next redirect, then node is sent out in next redirect that becomes this packet when timer numerical value is zero of this receiving node, and announcing oneself becomes next redirect and send out node, the forwarding of the line data of going forward side by side grouping.
Described apart from d≤d
iThe time, setting described receiving node relative importance value is 0, abandons the packet that is received.
The send mode of described packet is a broadcast mode, and the mac-layer address of described packet is a broadcast address.
Good effect of the present invention:
The present invention is in the forwarding relative importance value of node calculates, considered the dump energy factor of node, the node that dump energy is high under the square one obtains higher forwarding relative importance value, the energy consumption that helps node in the equalizing network, node to the dump energy deficiency is effectively protected, thereby reaches the purpose that prolongs network lifetime; In addition, transmit the extra coverage of having considered node in the relative importance value calculating, the extra coverage of node is big more, just means that also the desired value of this node neighbor node number is big more, thereby also big more at next jumping figure according to the probability of success in the repeating process, strengthened the reliability of data forwarding.
Description of drawings
Fig. 1 effectively transmits area schematic;
Fig. 2 is the extra coverage schematic diagram of node;
Fig. 3 is a distribution map of transmitting relative importance value;
Fig. 4 transmits the process flowchart of relative importance value.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, below in conjunction with specific embodiment, and with reference to the handling process Fig. 4 that transmits relative importance value, the present invention is described in more detail.
1) in order to calculate the forwarding relative importance value, the communication radius R of all nodes records oneself, and when network startup oneself primary power E
0
2) packet comprises the location information field of sending node and the location information field of destination node.For the packet that needs to send (or forwarding), sending node is written to the positional information of oneself location information field of sending node in the packet.If sending node is a data source nodes, the positional information of destination node is write the location information field of destination node in the packet; If sending node is a node of transmitting packet, the location information field of destination node has been the positional information of destination node in the packet, need not to revise.Simultaneously, send packet by broadcast mode, the mac-layer address of packet is a broadcast address;
3) receive the receiving node i of packet, according to the positional information of sending node in the packet, the positional information of destination node and the positional information of self, calculate sending node to destination node apart from d, receiving node i to destination node apart from d
i, and between receiving node i and the sending node apart from r
i
4) receiving node i judgement itself is to the distance of destination node, if receiving node i arrives the distance of destination node, that is: d≤d to the distance of destination node more than or equal to sending node
iThe time, receiving node is lost this packet, does not further process.Otherwise, changed for the 5th step over to;
5) receiving node i reads current self dump energy E
i, calculate its forwarding relative importance value Pr according to following formula
i:
6) receiving node i starts a timer and carries out data forwarding according to the result of calculation of transmitting relative importance value, and the initial value of timer is inversely proportional to the numerical value of relative importance value.
Each transmits relative importance value greater than all starting a timer in zero the receiving node, timer is worked according to the minimizing mode: if reduce in unpromising zero process at timer value, receive that other node becomes next redirect and sends out the information of node (sending the announcement statement as other node oneself is that node is sent out in next redirect of this packet, or other node is transmitted this packet etc.), this receiving node is abandoned becoming next redirect and is sent out node; If be reduced in zero process at timer value, do not receive that other node becomes the information that node is sent out in next redirect, this receiving node becomes next redirect of this packet and sends out node when timer numerical value is zero.
Claims (4)
- In the wireless self-organization network based on the data forwarding method of recipient's route, the steps include:1) carries the positional information of itself and the positional information of destination node in the packet that sending node sends;2) receive the receiving node of packet according to the positional information of sending node, the positional information of destination node and the positional information of self, calculate sending node to destination node apart from d, receiving node to destination node apart from d i, between receiving node and the sending node apart from r iThe primary power E of oneself when wherein receiving node is recorded in network startup 0, and communication radius R;3) as distance d＞d iThe time, receiving node reads current self dump energy E i, according to formulaD-d i＞0 (Pr i∈ [0,1]) the forwarding relative importance value Pr of setting node self i
4) timer is set in the receiving node, the value of described timer is set according to the value of transmitting relative importance value, reduce in unpromising zero process at timer value, receive that other node becomes the information that node is sent out in next redirect, then this receiving node is abandoned becoming next redirect and is sent out node; Be reduced in zero process at timer value, do not receive that other node becomes the information that node is sent out in next redirect, then node is sent out in next redirect that becomes this packet when timer numerical value is zero of this receiving node, and announcing oneself becomes next redirect and send out node, the forwarding of the line data of going forward side by side grouping. - 2. the method for claim 1 is characterized in that described packet comprises the location information field of sending node and the location information field of destination node.
- 3. method as claimed in claim 2 is characterized in that described apart from d≤d iThe time, setting described receiving node relative importance value is 0, abandons described packet.
- 4. the method for claim 1, the send mode that it is characterized in that described packet is a broadcast mode, the mac-layer address of described packet is a broadcast address.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007103045767A CN101471864B (en) | 2007-12-28 | 2007-12-28 | Data forwarding method based on receiver route in wireless self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2007103045767A CN101471864B (en) | 2007-12-28 | 2007-12-28 | Data forwarding method based on receiver route in wireless self-organizing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101471864A CN101471864A (en) | 2009-07-01 |
| CN101471864B true CN101471864B (en) | 2011-10-05 |
Family
ID=40829001
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007103045767A Expired - Fee Related CN101471864B (en) | 2007-12-28 | 2007-12-28 | Data forwarding method based on receiver route in wireless self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101471864B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104009927B (en) * | 2014-03-07 | 2017-02-22 | 浙江工商大学 | Cooperative broadcasting method based on distance in mobile Ad Hoc network |
| CN104735743B (en) * | 2015-03-18 | 2018-02-16 | 无锡士康通讯技术有限公司 | The routing optimization method of embedded radio self-organizing network |
| CN106789735B (en) * | 2016-12-26 | 2020-03-13 | 上海大学 | Concurrent processing method based on energy priority of data transmission terminal |
| CN107371124A (en) * | 2017-07-29 | 2017-11-21 | 陈剑桃 | A kind of public safety monitoring system on micro explosive |
| CN108092707B (en) * | 2017-12-21 | 2021-01-26 | 广东工业大学 | Data transmission method and device based on unmanned aerial vehicle ad hoc network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1606292A (en) * | 2003-07-14 | 2005-04-13 | 三星电子株式会社 | Route update protocol for a wireless sensor network |
| CN101005422A (en) * | 2006-12-07 | 2007-07-25 | 中国科学院计算技术研究所 | Method for establishing radio sensor network rout ebased on route neighbour list |
| CN101094131A (en) * | 2006-06-21 | 2007-12-26 | 中兴通讯股份有限公司 | Method for selecting hierarchy type route of wireless sensor network based on game theory |
-
2007
- 2007-12-28 CN CN2007103045767A patent/CN101471864B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1606292A (en) * | 2003-07-14 | 2005-04-13 | 三星电子株式会社 | Route update protocol for a wireless sensor network |
| CN101094131A (en) * | 2006-06-21 | 2007-12-26 | 中兴通讯股份有限公司 | Method for selecting hierarchy type route of wireless sensor network based on game theory |
| CN101005422A (en) * | 2006-12-07 | 2007-07-25 | 中国科学院计算技术研究所 | Method for establishing radio sensor network rout ebased on route neighbour list |
Non-Patent Citations (1)
| Title |
|---|
| 孙利民等.传感器网络的路由机制.《计算机科学》.2004,第31卷(第3期),54-57. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101471864A (en) | 2009-07-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Gong et al. | Energy-efficient clustering in lossy wireless sensor networks | |
| CN102821437B (en) | Ad-hoc on-demand distance vector routing method | |
| US9491684B2 (en) | Density-aware zone-based packet forwarding in vehicular networks | |
| CN102223671B (en) | Method and communication equipment for data transmission in wireless multihop network | |
| KR100586233B1 (en) | An optimal direction-based flooding method for mobile ad-hoc networks | |
| JP3947370B2 (en) | Wireless communication system | |
| CN104038965A (en) | Opportunistic routing method capable of efficiently utilizing energy, for mobile wireless sensor network | |
| CN101711048A (en) | Method for choosing gateway in integrating process of mobile self-organization network and Internet | |
| CN101827421B (en) | DSR cooperative routing method based on channel state information and router | |
| Mishra et al. | Study of cluster based routing protocols in wireless sensor networks | |
| CN101471864B (en) | Data forwarding method based on receiver route in wireless self-organizing network | |
| Liu et al. | Energy-efficient guiding-network-based routing for underwater wireless sensor networks | |
| CN102802230A (en) | Energy-efficient wireless sensor network routing algorithm | |
| CN109803342B (en) | Unmanned aerial vehicle self-organizing network routing method oriented to energy balance | |
| KR101083391B1 (en) | Method for transmitting data from a transmission vehicle to a destination vehicle in vehicle Ad-hoc network | |
| Casari et al. | ALBA: An adaptive load-balanced algorithm for geographic forwarding in wireless sensor networks | |
| KR100915555B1 (en) | Query-based ZigBee Mesh Routing Protocol | |
| CN105072586A (en) | Management method for forwarding of broadcast message in embedded wireless ad hoc network | |
| CN104159265A (en) | Data transmission method for low-speed wireless Ad Hoc network | |
| Gruber et al. | Ad hoc routing for cellular coverage extension | |
| CN112423356B (en) | Unmanned equipment cluster AODV routing method based on energy balance | |
| Rabarijaona et al. | Hierarchical mesh tree protocol for efficient multi-hop data collection | |
| Jisha et al. | Comprehensive study on mobile ad-hoc routing protocols: Olsr, aodv and dsdv | |
| CN109495946B (en) | Data transmission method and device of wireless sensor network | |
| CN104869605A (en) | Emergency communication-based AODV route stability algorithm improvement method |
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: 20111005 Termination date: 20171228 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |