CN104202724B - A kind of AANET joint route algorithms based on geographical location information - Google Patents
A kind of AANET joint route algorithms based on geographical location information Download PDFInfo
- Publication number
- CN104202724B CN104202724B CN201410460463.6A CN201410460463A CN104202724B CN 104202724 B CN104202724 B CN 104202724B CN 201410460463 A CN201410460463 A CN 201410460463A CN 104202724 B CN104202724 B CN 104202724B
- Authority
- CN
- China
- Prior art keywords
- node
- mrow
- route
- msub
- neighbors
- 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
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of simple and effective joint route algorithm based on geographical location information, and the greedy forwarding strategies in Geographic routing and reaction equation route are combined.The present invention is directed to aeronautical Ad hoc networks high dynamic, greedy forwarding strategies in Geographic routing are made improvement by the characteristics of node density is low first, and new route metric not only allows for the geographical position of node, the relative velocity between node is also contemplated, eliminates unstable next-hop forward node.Secondly, the present invention, can the empty situation of more efficient processing route using the periphery forwarding mechanism in RREQ/RREP mechanism replacement Geographic routing with reference to the superperformance of conventional reactive type route.Compared with other methods, the advantages of present invention has been effectively combined two class algorithms, it is set to be more applicable for the network environment of aeronautical Ad hoc networks.
Description
Technical field：Routing algorithm
The present invention relates to the joint route algorithm based on geographical location information in a kind of AANET (aeronautical Ad hoc networks), has more
Body, it is related to a kind of routing algorithm for being combined geographic routing and reaction equation route, and by optimizing in Geographic routing
The route metric of greedy forward mode improves the performance of network.
Background technology：
Route technology is one of aeronautical Ad hoc networks key technology, and routing algorithm largely determines whole network
Performance.Typical Routing Protocol can be divided into two major classes：Routing Protocol based on topological structure and based on geographical location information
Routing Protocol.The annexation and chain between nodes are known by route exploration based on the Routing Protocol of topological structure
Road characteristic, thus come determine network route.Its further again can be divided into it is active, on demand type and mixed type route.Active road
By exchanging routing iinformation using periodic routing broadcast, the route of all nodes of node maintenance the whole network, effective routing are given
All the time exist, transmission delay is small, but its expense is larger and takes resource.On-demand routing enters on demand according to the needs of sending node
Row route discovery, occupancy resource is few, but time delay is larger.Mixed logic dynamic then combines the advantages of reactiver outing and Proactive routing, can
Autgmentability is preferable.Because modern Aviation aircraft all has been provided with GPS geo-location system substantially, node easily can obtain ground
Positional information is managed, the Routing Protocol based on geographical location information gets most of the attention, had broad application prospects in aviation field.Should
Class agreement needs that the position of oneself is obtained ahead of time, and one jumps the position of neighbors and the position of destination node.It need not send out
Send and safeguard routing table before packet or establish path.Therefore, in the case of network topology acute variation, Geographic routing
Preferable simplicity and scalability can also be kept.
In numerous Geographic routings, greedy periphery stateless Routing Protocol (GPSR) is that wherein most classical application is the widest
A kind of general Routing Protocol.GPSR agreements have two kinds of mode of operations, and it is operated in greedy pattern, chosen distance destination node first
Recently and nearer than oneself arriving point of destination one jumps neighbors as next-hop forward node.Just cut automatically when occurring and routeing empty
Periphery forward mode is changed to, network topology is first described as plan, is forwarded further according to right-hand rule.But GPSR is applied
Many problems are faced with when the air net of topological, the low node density of high dynamic.GPSR greedy forwarding strategies first are not examined
Consider the mobility of node, next takes periphery traversal to be proved to be poorly efficient to solve to route empty problem, in high dynamic environment
Under cause that packet is largely lost and time delay sharply increases.
Wherein seldom it is to be directed to aeronautical Ad hoc networks although having proposed substantial amounts of Routing Protocol for MANET at present
What specific objective was studied.Until in recent years, multi-hop wireless network is more and more paid attention in the research of aviation field,
What these researchs and the demand for the different aspect of aeronautical Ad hoc networks were carried out.Carried in the AANET projects of Australia
A kind of multipath Doppler Routing Protocol (MUDOR) is gone out, has judged to save using the relative velocity between Doppler frequency estimation node
It is close to each other or remote between point, and selects the minimum path of values of Doppler frequency shift to build route.The algorithm is effectively reduced
Network traffic load and propagation delay in real-time traffic transmission.ARPAM is one and is applied to commercial aviation based on AODV
The mixed type Routing Protocol of network, the agreement find shortest path using positional information and built between a source node and a destination node
Found complete end-to-end path.A kind of route for being referred to as geographical load shared (GLSR) has been used in the NEWSKY projects of European Union
Algorithm, it utilizes pace, that is, the measurement that the ratio of speed and queue time delay selects as next-hop, at the same meet from
Destination node is nearest and adds the principle of most short queue, effectively alleviates the congestion problems in GPSR agreements.
The content of the invention：
The characteristics of purpose of the present invention is to be directed to AANET topological structure high dynamics, and node density is low, there is provided one kind is more suitable for
In the method for routing based on geographical location information of the network, this method has been effectively combined Geographic routing and reaction equation route
The advantages of, and optimize the greedy forward mode in Geographic routing.Figure of description 1 shows the basic flow sheet of the algorithm.
What the joint route algorithm based on geography information was realized in：
1. first, each node in network obtains related geographical location information, include the position of oneself, one jumps adjacent section
The position of point and destination node positional information.It can be come respectively by GPS geo-location system, beaconing mechanism and location-based service
Obtain.
2. when proceeding by communication between node, greedy forward mode is operated in first, and each node maintains a week
The phase neighbor table of renewal tracks the positional information of a jump neighbors.According to new route metric MDT (Minimum duration
Time) next-hop forward node is selected.The route metric has considered position and the relative velocity of node so that selection
It route highly efficient stabilization.
3. route cavity (Figure of description 2 describes the situation in route cavity) is run into repeating process, automatically switch
To reaction equation route pattern, available path is found using RREQ/RREP mechanism.
Once 4. node around hole region and in its neighbors exist than oneself have smaller MDT values node,
Then return to greedy forward mode.
5. above step is repeated, until packet reaches destination node.
Compared with other technologies, the present invention has the following advantages that：
1. because modern Aviation aircraft all has been provided with GPS geo-location system substantially, node easily can obtain ground
Positional information is managed, the present invention efficiently utilizes geography information.
2. improved route metric not only allows for the geographic distance of node, while have also contemplated that the speed relatively between node
Degree, the strategy make next-hop forward node more reliable and more stable, and so as to improve communication quality, the aviation for more adapting to high dynamic is led to
Believe environment.
3. substituting the periphery forward mode in GPSR agreements using the RREQ/RREP mechanism of reaction equation route, avoided
Long routed path and route loop, it is more more efficient and reliable than periphery traversal forwarding strategy.
4. present invention incorporates Geographic routing and proactive by the advantages of, and optimize its route metric.
Brief description of the drawings：
The described in detail below of the present invention is read in conjunction with the figure, the present invention and its advantage may be better understood and other are special
Sign, wherein：
Fig. 1 shows the basic flow sheet of geographical joint route algorithm；
Fig. 2 shows a case that route cavity.
Embodiment：
For a better understanding of the present invention, the embodiment of the present invention is described more fully below.
1. each node in network maintains a routing table, table information includes the position of oneself, and one jumps neighbors
Position and destination node position.It can be obtained respectively by GPS geo-location system, beaconing mechanism and location-based service.
2. when proceeding by communication between node, greedy forward mode is operated in first, and each node maintains a week
The phase neighbor table of renewal tracks the positional information of a jump neighbors, is then redirected according to new route metric MDT selections are next
Send out node.
3. route metric MDT is defined below, the geographic distance S between nodes i and ji,jIt can be represented with following formula：
Wherein, (xi(t),xj(t)), (yi(t),yj(t)), (zi(t),zj(t) node i) is represented respectively, and j is at current time
T position coordinates.
Instantaneous relative velocity between node is：
WhereinNode i, speed of the j in current time t are represented respectively.
4. assume packet now to up to node i, node j is one of neighbors of node i, destination node d.In network
The wireless coverage of each node is R, then the range difference of two nodes to destination node is：
ΔSi,j(t)=Si,d(t)-Sj,d(t) (3)
5. in order to select effective next-hop node, both candidate nodes are firstly the need of following formula is met, to ensure that both candidate nodes exist
Within the wireless coverage of present node.
R ＞ Δs Si,j(t)·Rvi,j(t)/c+ΔSi,j(t) (4)
It is as follows that we define measurement MDT (minimum duration time)：
Wherein NiIt is the neighbors collection of node i.The geographic distance that measurement not only allows for node is improved, have also contemplated that simultaneously
Relative velocity between node.Source node calculates the MDT values of each neighbor node, selects the minimum neighbors of MDT values as next-hop
Forward node.The strategy makes the next-hop node of selection more stable and reliable, so as to improve communication quality, more adapts to high dynamic
The air communications environment of state.
8. when run into data forwarding process route it is empty when, substituted using reaction equation routing algorithm a kind of such as AODV all
Side ergodic algorithm.The intermediate node of greedy retransmission failure is opened route finding process and reached to find an effective route entry
Destination node, RREQ routing request packets are broadcasted in the range of restriction.When neighbors receives RREQ bags, RREQ bags are first checked for
Destination address, if destination address is itself, produces and return to a RREP routing reply bag；Otherwise, continuing broadcast should
RREQ is until reaching destination node.If not finding the path for reaching purpose within the time of restriction, go off the air and abandon this
Bag.
9. once node is around hole region and has the node for having smaller MDT values than oneself in its neighbors, then
Return to greedy forward mode.
10. above step is repeated, until completing data forwarding.
In summary, the joint route algorithm based on geographical location information not only remains greedy forwarding plan in Geographic routing
High efficiency and simplicity slightly, also it is combined with reaction equation route, establishes more efficient and stable path.
Claims (1)
1. the simple and effective joint route algorithm based on geographical location information in a kind of aeronautical Ad hoc networks AANET, its feature
It is to use following steps：
A, assume that all aircraft nodes are provided with GPS positioning system, node obtains required geographical location information first, including
The position of node itself, one jumps the positional information of the position of neighbors and destination node, and information above passes through the GPS whole world respectively
Alignment system, beaconing mechanism and location-based service algorithm obtain；
B, the joint route algorithm has two kinds of mode of operations, including greedy forward mode and reaction equation route pattern；
C, algorithm is operated in greedy forward mode first；In order to select effective next-hop node, both candidate nodes are firstly the need of full
Foot formula, to ensure both candidate nodes within the wireless coverage of present node, wherein assuming packet now to up to node
I, node j are one of neighbors of node i, destination node d, and the wireless coverage of each node is R, Δ S in networki,j
(t) it is i, j to destination node range difference, Rvi,j(t) the instantaneous relative velocity between node, c are the light velocity of free space；
R ＞ Δs Si,j(t)·Rvi,j(t)/c+ΔSi,j(t)
D, and then in candidate's neighbors, carried out according to the route metric MDT (minimum duration time) newly defined
Data forwarding, it is given by：
<mrow>
<mi>M</mi>
<mi>D</mi>
<mi>T</mi>
<mo>=</mo>
<munder>
<mrow>
<mi>m</mi>
<mi>i</mi>
<mi>n</mi>
</mrow>
<mrow>
<mi>k</mi>
<mo>&Element;</mo>
<mi>N</mi>
</mrow>
</munder>
<mo>{</mo>
<msub>
<mi>MDT</mi>
<mi>k</mi>
</msub>
<mo>}</mo>
<mo>=</mo>
<munder>
<mrow>
<mi>m</mi>
<mi>i</mi>
<mi>n</mi>
</mrow>
<mrow>
<mi>k</mi>
<mo>&Element;</mo>
<msub>
<mi>N</mi>
<mi>i</mi>
</msub>
</mrow>
</munder>
<mo>{</mo>
<mfrac>
<mrow>
<msub>
<mi>&Delta;S</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>d</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<msub>
<mi>Rv</mi>
<mrow>
<mi>k</mi>
<mo>,</mo>
<mi>d</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<mi>t</mi>
<mo>)</mo>
</mrow>
</mrow>
</mfrac>
<mo>}</mo>
<mo>,</mo>
<msub>
<mi>MDT</mi>
<mi>k</mi>
</msub>
<mo>></mo>
<mn>0</mn>
</mrow>
Wherein, NiIt is the neighbors collection of node i, the route metric considers position and the relative velocity of node, makes forward-path
More efficient stabilization；
E, when run into repeating process route it is empty when, route cavity be the node neighbors in be not present have than oneself
The node of smaller MDT values, is now switched to reaction equation route pattern, finds available path using RREQ/RREP mechanism and carries out
Data forwarding, if can not find active path in limiting time, abandon this bag；
Once F, node bypasses hole region, and the node for having smaller MDT values than oneself in its neighbors be present, then return
To greedy forward mode；
G, above step is repeated until completing data forwarding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410460463.6A CN104202724B (en) | 2014-09-11 | 2014-09-11 | A kind of AANET joint route algorithms based on geographical location information |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410460463.6A CN104202724B (en) | 2014-09-11 | 2014-09-11 | A kind of AANET joint route algorithms based on geographical location information |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104202724A CN104202724A (en) | 2014-12-10 |
| CN104202724B true CN104202724B (en) | 2017-11-10 |
Family
ID=52087937
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410460463.6A Expired - Fee Related CN104202724B (en) | 2014-09-11 | 2014-09-11 | A kind of AANET joint route algorithms based on geographical location information |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104202724B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108024200B (en) * | 2017-11-30 | 2020-08-18 | 北京大学深圳研究生院 | Self-adaptive method and system for intermittently connected unmanned aerial vehicle self-organizing network |
| CN108055684B (en) * | 2017-12-19 | 2020-05-19 | 河海大学 | Routing method for aviation self-organizing network |
| CN109688614B (en) * | 2019-01-14 | 2021-04-02 | 西安电子科技大学 | Implementation method and system for high-dynamic unmanned aerial vehicle ad hoc network routing protocol |
| CN110831105A (en) * | 2019-12-24 | 2020-02-21 | 中国人民解放军火箭军工程大学 | Method for selecting nodes with fewer neighbors in Ad Hoc route to reduce communication interference |
| CN110995509A (en) * | 2019-12-24 | 2020-04-10 | 中国人民解放军火箭军工程大学 | Method for reducing communication interference by selecting and using fewer nodes in Ad Hoc route |
| CN111181626B (en) * | 2019-12-31 | 2021-04-30 | 北京邮电大学 | Data transmission method and device for unmanned aerial vehicle self-organizing network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102131269A (en) * | 2011-04-29 | 2011-07-20 | 南京邮电大学 | Geographical-position-based routing method in wireless mesh network |
| CN102711207A (en) * | 2012-05-29 | 2012-10-03 | 重庆大学 | Route selection method used for transoccanic aeronautical communication |
-
2014
- 2014-09-11 CN CN201410460463.6A patent/CN104202724B/en not_active Expired - Fee Related
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102131269A (en) * | 2011-04-29 | 2011-07-20 | 南京邮电大学 | Geographical-position-based routing method in wireless mesh network |
| CN102711207A (en) * | 2012-05-29 | 2012-10-03 | 重庆大学 | Route selection method used for transoccanic aeronautical communication |
Non-Patent Citations (3)
| Title |
|---|
| GPSR greedy perimeter stateless routing for wireless networks;A_Karp B, Kung H T.;《International Conference on Mobile Computing and NETWORKING. ACM》;20051231;全文 * |
| 航空自组网贪婪地理路由协议研究;郑博，张衡阳，黄国策;《传感器与微系统》;20121231;全文 * |
| 跨洋民用航空自组网路由算法研究;李清莲;《重庆大学硕士学位论文》;20131031;第2-3章 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104202724A (en) | 2014-12-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ji et al. | SDGR: An SDN-based geographic routing protocol for VANET | |
| Gupta et al. | Review of various routing protocols for MANETs | |
| Luo et al. | A new cluster based routing protocol for VANET | |
| CN104202724B (en) | A kind of AANET joint route algorithms based on geographical location information | |
| Raw et al. | Performance comparison of Position based routing Protocols in vehicle-to-vehicle (V2V) Communication | |
| Hyeon et al. | A new geographic routing protocol for aircraft ad hoc networks | |
| Qureshi et al. | Topology based routing protocols for vanet and their comparison with manet | |
| Frank et al. | TrafRoute: A different approach to routing in vehicular networks | |
| Wu et al. | Geographic load balancing routing in hybrid vehicular ad hoc networks | |
| Cheng et al. | A design framework and taxonomy for hybrid routing protocols in mobile ad hoc networks | |
| Arianmehr et al. | HybTGR: a hybrid routing protocol based on topological and geographical information in vehicular ad hoc networks | |
| Alnabhan et al. | Performance Evaluation of Unicast Routing Protocols in MANETs-Current State and Future Prospects. | |
| Hsieh et al. | A road-based QoS-aware multipath routing for urban vehicular ad hoc networks | |
| Ramalakshmi et al. | Weighted dominating set based routing for ad hoc communications in emergency and rescue scenarios | |
| Nair | Analysis and comparative study of topology and position based routing protocols in VANET | |
| Cao et al. | A position based beaconless routing algorithm for mobile ad hoc networks | |
| Qureshi et al. | Study of efficient topology based routing protocols for vehicular ad-hoc network technology | |
| Jain et al. | An RSU Based Approach: A solution to overcome major issues of Routing in VANET | |
| Ramachandran et al. | An intersection based traffic aware routing with low overhead in vanet | |
| Umashankar et al. | A comparative study of Topology and Position based Routing protocols in Mobile Ad Hoc Networks | |
| Tomer et al. | An application of routing protocols for Vehicular Ad-hoc Networks | |
| KR100664685B1 (en) | Method for Decision of Greedy Packet Forwarding Path in Wireless Networks | |
| Brahmi et al. | Routing in vehicular ad hoc networks: towards road-connectivity based routing | |
| Hamid et al. | Routing for Wireless Multi Hop Networks–Unifying and Distinguishing Features | |
| Saifullah et al. | A new geographical routing protocol for heterogeneous aircraft ad hoc 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20171110 Termination date: 20180911 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |