CN107071850A - A kind of improved AODV Routing Protocols for being suitable for different motion scene - Google Patents
A kind of improved AODV Routing Protocols for being suitable for different motion scene Download PDFInfo
- Publication number
- CN107071850A CN107071850A CN201611122427.4A CN201611122427A CN107071850A CN 107071850 A CN107071850 A CN 107071850A CN 201611122427 A CN201611122427 A CN 201611122427A CN 107071850 A CN107071850 A CN 107071850A
- Authority
- CN
- China
- Prior art keywords
- node
- route
- destination node
- bags
- hello
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
- H04W40/14—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on stability
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
Abstract
The invention discloses a kind of improved AODV Routing Protocols for being suitable for different motion scene, it is characterised in that comprises the following steps：Step 1, the route discovery stage；Step 2, Route Selection；Step 3, route activation；Step 4, route maintenance；The gps signal that the present invention is carried by each unmanned plane can obtain each unmanned plane and close on the average relative motion speed of unmanned plane, and then judge that network topology structure changes speed；By judging that the speed that network topology structure changes selects different Routing Protocols, different improved AODV Routing Protocols are selected according to unmanned plane average relative motion speed, the unmanned plane topological structure of conversion is adapted to, mitigate the bandwidth of network, end-to-end time delay is reduced, packet loss rate is reduced.
Description
Technical field
The invention belongs to Ad Hoc networks field, specifically refer to a kind of be suitable for the improved of different motion scene
AODV Routing Protocols.
Background technology
Unmanned plane is the optimal selection for performing uninteresting severe or hot mission.The development that unmanned plane have passed through decades is gone through
Journey, the comparative maturity in terms of technical standpoint.Its advantage is that cost is low, steerable, with high degree of flexibility, can be carried
Important equipment completes special duty from aerial, such as aerial monitoring, air surveillance, aerial transfering the letter, talk through aircraft loudspeaker, emergency relief
Deng.When performing special duty, casualties is not resulted in typically, and survival ability is strong, and mobility is good, easy to use.
Blocked due to sensor sight, the influence of the factor such as flying area limitation, single rack unmanned plane is typically not enough to realize
Lasting monitoring to extensive area, needs multiple UAVs cooperation to perform task.For single rack unmanned plane, more nobody
Machine is performed in unison with task and will be provided with following advantage：1) quality for coordinating the completion of raising task each other can be passed through；2)
The ability of task can be performed by the shared extension of resource and information；3) can be complete by the parallel execution shortening task of task
Into time, improve tasks carrying efficiency；4) when a certain frame unmanned plane breaks down, can be reassigned by task increases
The probability of Mission Success.Therefore, multiple no-manned plane coordination technique is the inexorable trend of Development of UAV.
Ad Hoc networks, i.e. mobile ad hoc network, be it is a kind of with highly dynamic topological structure, node arbitrarily move from group
Knitmesh network, it is realized by the free networking of mobile node and communicated, and use distributed pipes independently of fixed infrastructure
Reason, that is, automatically create, organize automatically and self-management.The features such as Ad Hoc networks have multi-hop, self-organizing, non-stop layer.Many
In unmanned plane collaboration, the communication single unmanned plane regarded as in the node of mobile ad hoc network, therefore multiple no-manned plane coordination technique is
Ad Hoc networks.
AODV Routing Protocols are a kind of plan range vector route agreements on demand, are set up in DSDV (purpose sequence number distance arrows
Quantity algorithm) on.Substantially, AODV is DSR and DSDV synthesis, it borrowed DSR agreements based on on-demand routing find and
The Basic application of on-demand route maintenance mechanism, and DSDV hop-by-hop (hop-by-hop) route, serial number and route maintenance
The cycle update mechanism in stage.The each node of AODV agreements safeguards routing table, the information of in store next-hop node, thus number
No longer need to carry complete route according to packet header, extensive larger mobile ad hoc network, in this agreement, section can be suitable for
Point simultaneously need not periodically maintain a routing table, but just start route finding process, Er Qielu when there is communication requirement
There is certain lifetime (TTL) by information, if certain route is not needed, can be deleted.AODV agreements are by RREQ bags, RREP
Wrap with RERR bags to complete route discovery and route maintenance procedure.When source node receives newest RREP bags, source node leads to
Cross MACT messages and activate a minimum route to destination node of unique hop count.AODV is network section by Hello message
Point provides the information on link connection state.
Stability is to weigh the metric of path or link stability size.One paths are made up of a series of links, road
The stability in footpath depends on the stability of each bar link.The definition of conventional link stability mainly has：Based on " link it is more old more
It is stable ", based on remaining life time, based on signal intensity, based on global positioning system, based on mobility prediction model etc..Assuming that
Separate between each link in path, then the stability in path is the product of each link.By the GPS device of each unmanned plane,
The location variation of adjacent node in the set time can be obtained, the average relative motion speed of unmanned plane is tried to achieve.Utilize simultaneously
Relative position information can be in the hope of link stable factor.As shown in figure 1, have two unmanned plane node is, j, the transmission radius of two nodes
It is equal, i.e. Ri=Rj.Node i is in moment tkPosition vector be：
pos(i,tk)=(xi,k,yi,k,zi,k)
Node j is in moment tkPosition vector be：
pos(j,tk)=(xj,k,yj,k,zj,k)
In T=tk-tk-1In time, adjacent node i and j relative position variable quantity are：
ΔSij=pos (i, j, T)=| | pos (i, j, tk)||-||pos(i,j,tk-1)||
Stable factorS_
linkijIt is bigger, represent that local topology of the node i with respect to j is more stable.S_linkijValue is smaller, represents part of the node i with respect to j
Change in topology is fierce, and stability is low.Therefore it is from source node to the stable factor in destination node path：
In Ad Hoc networks, the frequent movement of node causes the frequent change of network topology, and that sets up originally saves from source
Point is faced with the danger of fracture to the AODV routes of destination node at any time.The fracture of link will cause to route using initial AODV
Route maintenance phase has substantial amounts of Hello message in the case of agreement, and substantial amounts of rerouting process, it is complete in rerouting
Into period, the change of network topology would potentially result in certain link breakdown in newly-built route, it is impossible to uses, will considerably increase
End-to-end time delay, adds packet loss rate, while easily causing network congestion.
Therefore, in the change of network topology, mitigate the bandwidth of network, reduce end-to-end time delay, reduce packet loss
Rate, it is to avoid non-link breakdown and initiate mistake rerouting, it is to avoid cause unnecessary bandwidth burden to cause network congestion one
It is directly those skilled in the art's technical barrier to be solved.
The content of the invention
The present invention is directed to problems of the prior art, it is proposed that a kind of to be suitable for the improved of different motion scene
AODV Routing Protocols, different improved AODV Routing Protocols are selected according to unmanned plane average relative motion speed, by judging
The speed of network topology structure change selects different Routing Protocols, is adapted to the unmanned plane topological structure of conversion, mitigates net
The bandwidth of network, reduces end-to-end time delay, reduces packet loss rate.
The present invention is achieved in that a kind of improved AODV Routing Protocols for being suitable for different motion scene, its feature
It is, comprises the following steps：
Step 1, the route discovery stage；
Step 2, Route Selection；
Step 3, route activation；
Step 4, route maintenance.
Further, described step 1 comprises the following steps：
1.1, source node routing table has the effective routing for reaching destination node, then directly transmits packet；If not provided,
Packet then is stored in into the data of source node to send in buffer area, route finding process is performed；
1.2, source node broadcast RREQ bags；
If the node for receiving RREQ bags is not the effective routing that destination node and this intermediate node do not arrive destination node,
Then broadcast RREQ bags are to next-hop node, while set up the reverse route to source node, until destination node or have to purpose section
The intermediate node of point route；
If the node for receiving RREQ bags is not destination node, but intermediate node has the effective routing to destination node,
Then generation RREP bags can give upper hop node, until source node, while setting up the positive road from destination node to intermediate node
By；
1.3, if the node for receiving RREQ bags is destination node, destination node generation RREP bags give upper hop node,
Until destination node；When source node is to destination node transmission RREQ bags, the location variation of adjacent node is passed into purpose section
Point, the speed of related movement V of destination node calculate nodei, and average relative motion speedIf velocity constant is V；
WhenWhen, destination node calculates link stable factor while sending RREP bags；
WhenWhen, do not calculate link stable factor now.
Further, described step 2 comprises the following steps：
2.1, whenWhen, choose the route of maximum path stable factor and maximum destination node sequence number；In proportion
Reduce the Allowed_Hello_Loss and Hello_Interval of Hello message in AODV agreements；
2.2, whenWhen, the route that selection hop count is small and destination node sequence number is maximum；In proportionIncrease
The Allowed_Hello_Loss and Hello_Interval of Hello message in AODV agreements.
Further, described step 3 is specially：Establish source node to destination node route when,
Work as ViDuring ＞ V, source node sends maximum sequence number and maximum path of the MACT activation from source node to destination node
The active path of stable factor；
Work as ViDuring≤V, source node sends maximum sequence number and minimum hop count of the MACT activation from source node to destination node
Active path.
Further, described step 4 is specially：One node is come from by being confirmed whether to receive within the defined time
Whether the Hello message of its neighbor node is effective to determine link up to the neighbor node；If link is effectively, node increases
Plus the life span of the route, the increase time is at least Allowed_Hello_Loss × Hello_Interval.
The present invention is relative to the beneficial effect of prior art：The gps signal that the present invention is carried by each unmanned plane can
Obtain each unmanned plane and close on the average relative motion speed of unmanned plane, and then judge that network topology structure changes speed；Pass through
Judge that the speed of network topology structure change selects different Routing Protocols, i.e., selected according to unmanned plane average relative motion speed
Different improved AODV Routing Protocols, are adapted to the unmanned plane topological structure of conversion, mitigate the bandwidth of network, reduce end and arrive
Terminal delay time, reduces packet loss rate.
Brief description of the drawings
Fig. 1 is two unmanned plane node locations change in background of invention；
AODV route finding process in Fig. 2 present invention；
Response of the improved AODV Routing Protocols interior joint to control information in Fig. 3 present invention.
Embodiment
The present invention provides a kind of improved AODV Routing Protocols for being suitable for different motion scene, to make the mesh of the present invention
, technical scheme and effect it is clearer, clearly, and referring to the drawings and give an actual example that the present invention is described in more detail.Should
When point out it is described herein specific implementation only to explain the present invention, be not intended to limit the present invention.
Step 1) the route discovery stage：
As shown in Fig. 2 when source node sends RREQ bags and finds effective routing, generating destination node to the anti-of source node
To route, when destination node sends RREP bags to source node, source node is generated to the forward route of destination node.
When source node has communication requirement, first check for whether source node routing table has the effective routing for reaching destination node,
If then directly transmitting packet.Send in buffer area, hold if it is not, packet is stored in into the data of source node
Row route finding process.Source node broadcasts RREQ bags, and neighbor node receives RREQ bags.As shown in figure 3, node judges what is received
Bag, it is whether equal by comparing the Did in No. ID of this node and RREQ bags when judged result is RREQ, and then judge this
Whether node is destination node.If the node is purpose node, this node is to source node loopback RREP bags.When neighbours section
Point is not destination node, and according to Sid, Request id judge whether received mistake RREQ bags.If received,
Then abandon the RREQ bags.Conversely, caching RREQ package informatins, set up reverse route.If this intermediate node does not arrive destination node
During effective routing, broadcast the RREQ bags to its neighbor node, while set up the reverse route to source node, until destination node or
There is the intermediate node being route to destination node.If the node is not destination node, but intermediate node has and arrives destination node
Effective routing, then upper hop node can be given by generating RREP bags, until source node, while setting up from destination node to intermediate node
Forward route.
Each node obtains the geographical location information of oneself by GPS, and timing broadcasts oneself to the neighbor node of oneself
Newest geographical location information.When source node is to destination node transmission RREQ bags, the location variation of adjacent node is passed to
Destination node, destination node calculates the speed of related movement of all nodes
When destination node receives RREQ bags,When, show that network topology change is fast, now destination node is sent
RREP bags are to source node, while link stable factor is calculated, it is final to obtain path stable factor.WhenWhen, show network
Change in topology is slow, and now destination node only sends RREP bags to source node, and link stable factor is not calculated.
Step 2) Route Selection；Receive the node of RREP bags as shown in figure 3, working as purpose node,When, choose most
Big path stable factor and maximum destination node sequence number route；WhenWhen, select Minimal routing hop count and maximum purpose section
The route of point sequence number.When receive RREP bags node be not source node,When, unicast RREP to route next-hop,
The forward direction route of destination node is set up, link stable factor is calculated.When receive RREP bags node be not source node,
When, unicast RREP to next-hop node, the forward direction set up to destination node is route.
Step 3) route activation；When establish source node to destination node route when, whenWhen, source node is sent
A unique active path for maximum sequence number and maximum path stable factor of the MACT activation from source node to destination node.WhenWhen, source node sends unique one of maximum sequence number and minimum hop count of the MACT activation from source node to destination node
Active path.
Step 4) route maintenance.After routing table foundation, route interior joint needs to perform times of route maintenance, routing management
Business, realizes forwarded hop-by-hop.During routing table is safeguarded, in addition to deleting the route being no longer required, when discovery has link
During interruption, upstream node can send the node that RRER bags notify more upstream.As shown in figure 3, in RRER bags, specifying due to chain
The IP address for the destination node that road is interrupted and can not reached, each node remains a precursor list to help through RRER bags
Smoothly reach the process of source node.When node receives RRER bags, by affected route deletion, judge this node whether be
Source node, if source node then terminates, otherwise, forwarding RRER to predecessor node.When Hello message can carry for network node
For the information on link connection state.If a node be an active ways by part, then it can only be used
Hello information confirms the connection status of network link.Cycle time (Hello_ of the node every a Hello message
Interval, Hello_Interval are changed into originalTimes), node checks whether broadcast message.Hello message allows to lose
The Allowed_Hello_Loss of number of times be changed intoTimes, Lifetime thresholdings are set to Allowed_Hello_Loss × Hello_
Interval.If certain node is not received by within Allowed_Hello_Loss × Hello_Interval times in route
Any message from neighbor node, then the link that the node is considered as reaching the neighbor node has been interrupted, if do not had
Other arrive the effective routing of destination node, then this node initiates rerouting.I.e. one node is by being confirmed whether defined
The Hello message from its neighbor node is received in time, it is whether effective to determine link up to the neighbor node.Such as
Effectively, node increases the life span of the route to fruit link, and the increase time is at least Allowed_Hello_Loss × Hello_
Interval。
Claims (5)
1. a kind of improved AODV Routing Protocols for being suitable for different motion scene, it is characterised in that comprise the following steps：
Step 1, the route discovery stage；
Step 2, Route Selection；
Step 3, route activation；
Step 4, route maintenance.
2. a kind of improved AODV Routing Protocols for being suitable for different motion scene according to claim 1, its feature exists
In described step 1 comprises the following steps：
1.1, source node routing table has the effective routing for reaching destination node, then directly transmits packet；If it is not, will
The data of packet deposit source node are sent in buffer area, perform route finding process；
1.2, source node broadcast RREQ bags；
If the node for receiving RREQ bags is not the effective routing that destination node and this intermediate node do not arrive destination node, extensively
RREQ bags are broadcast to next-hop node, while set up the reverse route to source node, until destination node or are had to destination node road
By intermediate node；
If the node for receiving RREQ bags is not destination node, but intermediate node has the effective routing to destination node, then gives birth to
Upper hop node can be given into RREP bags, until source node, while setting up the forward route from destination node to intermediate node；
1.3, if the node for receiving RREQ bags is destination node, destination node generation RREP bags give upper hop node, until
Destination node；When source node is to destination node transmission RREQ bags, the location variation of adjacent node is passed into destination node, mesh
Node calculate node speed of related movement Vi, and average relative motion speedIf velocity constant is V；
WhenWhen, destination node calculates link stable factor while sending RREP bags；
WhenWhen, do not calculate link stable factor now.
3. a kind of improved AODV Routing Protocols for being suitable for different motion scene according to claim 2, its feature exists
In described step 2 comprises the following steps：
2.1, whenWhen, choose the route of maximum path stable factor and maximum destination node sequence number；
In proportionReduce the Allowed_Hello_Loss and Hello_Interval of Hello message in AODV agreements；
2.2, whenWhen, minimum and destination node sequence number maximum the route of selection hop count；
In proportionIncrease the Allowed_Hello_Loss and Hello_Interval of Hello message in AODV agreements.
4. a kind of improved AODV Routing Protocols for being suitable for different motion scene according to claim 3, its feature exists
In described step 3 is specially：Establish source node to destination node route when,
Work as ViDuring ＞ V, source node send MACT maximum sequence numbers of the activation from source node to destination node and maximum path it is stable because
The active path of son；
Work as ViDuring≤V, source node sends the effective of maximum sequence number and minimum hop count of the MACT activation from source node to destination node
Path.
5. a kind of improved AODV Routing Protocols for being suitable for different motion scene according to claim 1, its feature exists
In described step 4 is specially：One node is received from its neighbor node by being confirmed whether within the defined time
Whether Hello message is effective to determine link up to the neighbor node；If effectively, node increases the life of the route to link
Deposit the time, the increase time is at least Allowed_Hello_Loss × Hello_Interval.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611122427.4A CN107071850B (en) | 2016-12-08 | 2016-12-08 | Improved AODV routing protocol capable of adapting to different motion scenes |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611122427.4A CN107071850B (en) | 2016-12-08 | 2016-12-08 | Improved AODV routing protocol capable of adapting to different motion scenes |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107071850A true CN107071850A (en) | 2017-08-18 |
| CN107071850B CN107071850B (en) | 2020-07-07 |
Family
ID=59619504
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611122427.4A Active CN107071850B (en) | 2016-12-08 | 2016-12-08 | Improved AODV routing protocol capable of adapting to different motion scenes |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107071850B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108092707A (en) * | 2017-12-21 | 2018-05-29 | 广东工业大学 | A kind of data transmission method and device based on unmanned plane ad hoc network |
| CN108366017A (en) * | 2018-01-23 | 2018-08-03 | 北京交通大学 | A kind of AODV method for routing for distributed satellite network |
| CN108684063A (en) * | 2018-05-11 | 2018-10-19 | 湖北大学 | A kind of on-demand routing protocol improved method based on network topology change |
| CN109688614A (en) * | 2019-01-14 | 2019-04-26 | 西安电子科技大学 | Realization method and system for high dynamic unmanned plane Routing for On-Demand Protocol in MANET |
| CN110493843A (en) * | 2019-08-20 | 2019-11-22 | 西安电子科技大学 | 3D-GPSR method for routing based on circular ring shape omnidirectional antenna model |
| JP2021106322A (en) * | 2019-12-26 | 2021-07-26 | 沖電気工業株式会社 | Radio communication device, radio communication program, and radio communication system |
| CN113411908A (en) * | 2021-06-23 | 2021-09-17 | 成都坤恒顺维科技股份有限公司 | Self-organizing wireless broadband network transceiving system based on collision avoidance |
| CN113727415A (en) * | 2021-07-22 | 2021-11-30 | 桂林电子科技大学 | Method for dynamically sensing unmanned aerial vehicle ad hoc network to improve AODV routing protocol |
| CN113727408A (en) * | 2021-07-26 | 2021-11-30 | 桂林电子科技大学 | Unmanned aerial vehicle ad hoc network improved AODV routing method based on speed and energy perception |
| CN114520783A (en) * | 2022-01-06 | 2022-05-20 | 同致电子科技（厦门）有限公司 | Method for automatically adapting different communication routing tables |
| CN115883685A (en) * | 2022-11-25 | 2023-03-31 | 电子科技大学 | Path recovery method |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070153737A1 (en) * | 2005-12-30 | 2007-07-05 | Samsung Electronics Co., Ltd. | Link mobility tracking and its application to mobile ad hoc networks |
| CN101232458A (en) * | 2008-01-31 | 2008-07-30 | 重庆邮电大学 | Multi path extension method based on MAODV protocol |
| CN101267403A (en) * | 2008-05-13 | 2008-09-17 | 北京科技大学 | A measuring system and method for routing stability of wireless self-organized network |
| CN101394357A (en) * | 2008-10-29 | 2009-03-25 | 北京大学 | Route establishing and link detecting method and device for mobile Ad hoc network |
| CN101827413A (en) * | 2009-03-05 | 2010-09-08 | 赵欣 | Dynamic multipath routing algorithm based on mobility prediction |
| CN102404819A (en) * | 2012-01-04 | 2012-04-04 | 南京大学 | Routing method based on hops and relative moving velocity of nodes in wireless ad hoc network |
| CN105451291A (en) * | 2014-09-16 | 2016-03-30 | 国家电网公司 | AODV routing method, node equipment and system |
-
2016
- 2016-12-08 CN CN201611122427.4A patent/CN107071850B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070153737A1 (en) * | 2005-12-30 | 2007-07-05 | Samsung Electronics Co., Ltd. | Link mobility tracking and its application to mobile ad hoc networks |
| CN101232458A (en) * | 2008-01-31 | 2008-07-30 | 重庆邮电大学 | Multi path extension method based on MAODV protocol |
| CN101267403A (en) * | 2008-05-13 | 2008-09-17 | 北京科技大学 | A measuring system and method for routing stability of wireless self-organized network |
| CN101394357A (en) * | 2008-10-29 | 2009-03-25 | 北京大学 | Route establishing and link detecting method and device for mobile Ad hoc network |
| CN101827413A (en) * | 2009-03-05 | 2010-09-08 | 赵欣 | Dynamic multipath routing algorithm based on mobility prediction |
| CN102404819A (en) * | 2012-01-04 | 2012-04-04 | 南京大学 | Routing method based on hops and relative moving velocity of nodes in wireless ad hoc network |
| CN105451291A (en) * | 2014-09-16 | 2016-03-30 | 国家电网公司 | AODV routing method, node equipment and system |
Non-Patent Citations (1)
| Title |
|---|
| 柳松: "无线Ad hoc网络节能路由协议研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108092707A (en) * | 2017-12-21 | 2018-05-29 | 广东工业大学 | A kind of data transmission method and device based on unmanned plane ad hoc network |
| CN108366017A (en) * | 2018-01-23 | 2018-08-03 | 北京交通大学 | A kind of AODV method for routing for distributed satellite network |
| CN108366017B (en) * | 2018-01-23 | 2020-06-23 | 北京交通大学 | AODV routing method for distributed satellite network |
| CN108684063A (en) * | 2018-05-11 | 2018-10-19 | 湖北大学 | A kind of on-demand routing protocol improved method based on network topology change |
| CN108684063B (en) * | 2018-05-11 | 2020-12-01 | 湖北大学 | On-demand routing protocol improvement method based on network topology change |
| CN109688614A (en) * | 2019-01-14 | 2019-04-26 | 西安电子科技大学 | Realization method and system for high dynamic unmanned plane Routing for On-Demand Protocol in MANET |
| CN110493843B (en) * | 2019-08-20 | 2022-03-04 | 西安电子科技大学 | 3D-GPSR routing method based on circular omnidirectional antenna model |
| CN110493843A (en) * | 2019-08-20 | 2019-11-22 | 西安电子科技大学 | 3D-GPSR method for routing based on circular ring shape omnidirectional antenna model |
| JP2021106322A (en) * | 2019-12-26 | 2021-07-26 | 沖電気工業株式会社 | Radio communication device, radio communication program, and radio communication system |
| CN113411908A (en) * | 2021-06-23 | 2021-09-17 | 成都坤恒顺维科技股份有限公司 | Self-organizing wireless broadband network transceiving system based on collision avoidance |
| CN113727415A (en) * | 2021-07-22 | 2021-11-30 | 桂林电子科技大学 | Method for dynamically sensing unmanned aerial vehicle ad hoc network to improve AODV routing protocol |
| CN113727415B (en) * | 2021-07-22 | 2023-12-19 | 桂林电子科技大学 | Method for improving AODV routing protocol by dynamically perceived unmanned aerial vehicle ad hoc network |
| CN113727408A (en) * | 2021-07-26 | 2021-11-30 | 桂林电子科技大学 | Unmanned aerial vehicle ad hoc network improved AODV routing method based on speed and energy perception |
| CN113727408B (en) * | 2021-07-26 | 2024-03-01 | 桂林电子科技大学 | Speed and energy perception-based unmanned aerial vehicle ad hoc network improved AODV routing method |
| CN114520783A (en) * | 2022-01-06 | 2022-05-20 | 同致电子科技（厦门）有限公司 | Method for automatically adapting different communication routing tables |
| CN114520783B (en) * | 2022-01-06 | 2023-07-11 | 同致电子科技（厦门）有限公司 | Method for automatically adapting different communication routing tables |
| CN115883685A (en) * | 2022-11-25 | 2023-03-31 | 电子科技大学 | Path recovery method |
| CN115883685B (en) * | 2022-11-25 | 2024-04-19 | 电子科技大学 | Path recovery method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107071850B (en) | 2020-07-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107071850A (en) | A kind of improved AODV Routing Protocols for being suitable for different motion scene | |
| Ji et al. | SDGR: An SDN-based geographic routing protocol for VANET | |
| CN110139319A (en) | High dynamic time-delay network propagation delay time minimizes method for routing | |
| US20090161578A1 (en) | Data routing method and device thereof | |
| Singh et al. | Comparative performance analysis of LANMAR, LAR1, DYMO and ZRP routing protocols in MANET using Random Waypoint Mobility Model | |
| CN108449271B (en) | Routing method for monitoring path node energy and queue length | |
| Gupta et al. | Comparison of various routing algorithms for VANETS | |
| CN104202724B (en) | A kind of AANET joint route algorithms based on geographical location information | |
| CN101867973B (en) | Multidimensional network and data transmission method thereof | |
| CN106941447A (en) | Free space optical network routing method based on Ants model | |
| Bashir et al. | An energy-efficient collaborative scheme for UAVs and VANETs for dissemination of real-time surveillance data on highways | |
| CN103929790A (en) | Two-layer routing method for Ad Hoc network | |
| Wankhade et al. | Ant based techniques for qos routing in mobile ad hoc network: an overview | |
| Kannan et al. | Ant colony optimization for routing in mobile ad-hoc networks | |
| CN110300426A (en) | Route selection method and device in a kind of wireless self-networking | |
| Roy et al. | Performance optimization of Ad Hoc on demand vector routing protocol in cognitive radio network | |
| Akshay et al. | Bandwidth optimized multicast routing algorithm based on hybrid mesh and tree structure with collision control in MANET using lempel-ziv-oberhumer method | |
| Parekh et al. | Effects of Traffic Load and Mobility on AODV, DSR and DSDV Routing Protocols in MANET | |
| Patil et al. | Performance enhancement of reactive on demand routing protocol in wireless Ad Hoc network | |
| Lanjwar et al. | Performance analysis of routing protocols for battlefield monitoring system | |
| Mhatre et al. | Performance analysis of prediction and priority based routing protocol for MANET's | |
| Oh | A hybrid routing protocol for wireless Mesh Networks | |
| Guidoum et al. | Enhancing performance AODV routing protocol to avoid congestion | |
| Lakshmi et al. | Energy aware multicast opportunistic routing protocol (Eamor) to optimize lifetime of MANET | |
| Ismail et al. | Reducing broadcasting route request packet through LF-AODC |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |