CN102447686A - Routing protocol of AODV (Ad hoc On-Demand Distance Vector Routing) application - Google Patents
Routing protocol of AODV (Ad hoc On-Demand Distance Vector Routing) application Download PDFInfo
- Publication number
- CN102447686A CN102447686A CN2010105079469A CN201010507946A CN102447686A CN 102447686 A CN102447686 A CN 102447686A CN 2010105079469 A CN2010105079469 A CN 2010105079469A CN 201010507946 A CN201010507946 A CN 201010507946A CN 102447686 A CN102447686 A CN 102447686A
- Authority
- CN
- China
- Prior art keywords
- node
- route
- routing
- priority
- path
- 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.)
- Pending
Links
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A routing protocol of AODV (Ad hoc On-Demand Distance Vector Routing) application relates to a routing protocol applied in AdHoc (Ad hoc On-Demand Distance Vector Routing) network. The invention is suitable for a topology fast changing environment, is capable of finding available routing protocol after interruption of the link. The invention adopts the idea of backup routings:(1) establishing multiple routings between the source node and the target node, determining priority for these paths according to the hops, when the source node sends data, choosing a routing with the highest priority to communicate, when the main routing (i.e. the highest priority routing) interrupts, choosing a routing with a higher priority to communicate; because of multiple routings between the source node and the target node, when the main route is interrupted, it is capable of choosing suboptimal routing, reducing the cost for finding routing again; (2) saving two jumps of the neighbor node information in the routing table of each node, when a link is broken, the upstream node of the broken link tries to repair in the range of two jumps; (3) in the Hello information of BRTAODV(Ad hoc On-Demand Distance Vector Routing) , adding information of neighbor nodes, and maintaining the routing.
Description
Technical field:
A kind of AODV uses Routing Protocol and relates to a kind of Routing Protocol of in the AdHoc network environment, using.
Background technology:
The AdHoc network has the important use potentiality in particular surroundings, Routing Protocol is a most important technology among the AdHoc.In Ad Hoc, route mainly is divided into table drive-type route, Constraint-based Routing [1] and route etc. as required.AODV is most important a kind of [2] in the route as required; The AODV Routing Protocol is a kind of Routing Protocol of distance vector as required; In this agreement; Each node in the network just sends routing packets when needs communicate, and not periodically exchanging routing information to obtain the route of other All hosts.The AODV agreement has some characteristics of distance vector Routing Protocol, and promptly each node route list is only safeguarded the route of this node to other node, and need not grasp the full mesh topology structure.It is through application target sequence node number, realize loop free by, and avoided the problem of infinite counting.For fear of the faulty operation that one way link causes, agreement has been introduced a blacklist, putting into blacklist with the neighbor node that oneself is one way link.In the AODV agreement, when source node will send packet to destination node, if in the route-caching of oneself, do not find the route of this destination node, this node will send RREQ grouping startup route finding process so.Traditional AODV route has shortcomings such as link repair poor performance, data transfer delay is big, the route reconstruction time is long after network topology structure changes.
Summary of the invention:
In order to address the above problem, a kind of environment that is applicable to that network topology change is fast is provided, can after link down, find the agreement of available route rapidly.
To achieve these goals; The present invention adopts following technical scheme, and the present invention has adopted the thought of route stand-by: set up mulitpath between (1) source node and destination node, and determine the priority in these paths according to jumping figure; When source node sends data; The path that selection has higher priority communicates, and when main road is interrupted by (being the highest route of priority), selects the routing to communicate of time high priority.Owing to have mulitpath between source node and destination node, when main road when interrupting, can select sub-optimal path communication, reduced the expense of heavily looking for route; (2) information of two-hop neighbor node under needing in the storing path in the path in the routing table of each node, when link down, the upstream node that opens circuit is attempted in the double bounce scope, repairing; (3) through in the Hello of B-RTAODV information, add the information of neighbor node, safeguard the path.
Beneficial effect of the present invention:
The present invention is adapted to the fast environment of change in topology, and can after link down, find available route rapidly.
Description of drawings
Below in conjunction with accompanying drawing the present invention is further specified.
Fig. 1 router recovers sketch map.
Embodiment
The present invention has adopted the thought of route stand-by: set up mulitpath between (1) source node and destination node; And according to the priority in these paths of jumping figure decision; When source node sends data; The path that selection has higher priority communicates, and when main road is interrupted by (being the highest route of priority), selects the routing to communicate of time high priority.Owing to have mulitpath between source node and destination node, when main road when interrupting, can select sub-optimal path communication, reduced the expense of heavily looking for route; (2) information of two-hop neighbor node under needing in the storing path in the path in the routing table of each node, when link down, the upstream node that opens circuit is attempted in the double bounce scope, repairing; (3) through in the Hello of B-RTAODV information, add the information of neighbor node, safeguard the path.
The B-RTAODV Routing Protocol has adopted route stand-by thought in route finding process: preserve the mulitpath between source node and destination node, wherein one is main path, and all the other are backup path, and main path and backup path are just distinguished according to priority; Main path priority is the highest, and value is that 1, the first backup path priority is taken second place, and value is 2, by that analogy.The priority height decides according to the path jumping figure.
B-RTAODV improves at aspects such as route foundation, route maintenance, route Interrupt Process and route recoveries; When (1) route is set up source node and is had data to send; The mechanism that the cancellation intermediate node is replied RREP; Do not reply RREP even if intermediate node has to the route of destination node yet, reply by destination node is unified.When destination node is received first RREQ, will start RREQ buffer memory timer, all RREQ that buffer memory was received in a period of time thereafter from same source node; The RREQ timer expiry of destination node buffer memory will calculate the priority of each RREQ respective path by choice mechanism according to main road, and reply successively according to the priority height; RREP.Carry the priority rt_pri intermediate node of corresponding route among the RREP and receive the RREP that destination node is replied, with the route that is established to destination node, and the path priority rt_pri that carries among the record RREP.Source node is received the RREP that destination node is replied, and is established to the route of destination node, and record path priority; When source node was received all RREP of destination node answer, the road construction process finished.Since then, source node and destination node have been set up many route stand-bies that have priority; After route was set up, source node selected the highest path of priority to send data.(2) the route maintenance main road by and the maintenance of route stand-by identical with the original mechanism of AODV; The way that adopts timed sending hello to divide into groups is confirmed the link between adjacent node, generally when next jumping give out a contract for a project uses perhaps through the link layer announcement next jumps whether attempting sending data in the passive affirmation mode monitor channel; (3) the route interruptions has been owing to preserved mulitpath, when main road when interrupting, as long as still have other path between source node and destination node, do not send RREQ and look for the road again, select sub-optimal path communication.Have only when all available paths between source node and destination node all interrupt, just send RREQ and look for the road again; (4) the route recovery route repair is responsible for by the upstream node of link, if the route that the node discovery is being used breaks down between this node and next-hop node.Node will be according to routing iinformation, and combines the nodal information in the double bounce scope, carries out route repair; Route A-B-E-D-F fracture at link B-E place, Node B will be responsible for route repair, and Node B is according to routing iinformation, and the following double bounce of knowing the route of destination node F is node D; So B seeks the public neighbor node C of a B and D from the information of neighbor nodes of management.After finding, Node B is adapted to the route of F, and E replaces with C with next-hop node, and the route term of validity is changed to the life cycle of link B-C; Then, B just divides into groups with revised routing forwarding.After C receives grouping,, then divide into groups with the routing forwarding of oneself if it has the effective route to F; If there is not effective route, then grouping is transmitted to the node D that Node B illustrates in " two hop nodes down " territory of grouping.After D receives grouping, continue the public neighbor node C that transmits.After finding, Node B is adapted to the route of F, and E replaces with C with next-hop node, and the route term of validity is changed to the life cycle of link B-C; Then, B just divides into groups with revised routing forwarding; After C receives grouping,, then divide into groups with the routing forwarding of oneself if it has the effective route to F; If there is not effective route, the node D that then in " the two hop nodes down " territory of dividing into groups, explains to Node B packet forward.After D receives grouping, continue to transmit.
Claims (3)
1. an AODV uses Routing Protocol; It is characterized in that adopting the technical scheme of route stand-by: set up mulitpath between (1) source node and destination node; And according to the priority in these paths of jumping figure decision, when source node sent data, the path of selecting to have higher priority communicated; When main road is interrupted by (being the highest route of priority), select the routing to communicate of time high priority; Owing to have mulitpath between source node and destination node, when main road when interrupting, can select sub-optimal path communication, reduced the expense of heavily looking for route; (2) information of two-hop neighbor node under needing in the storing path in the path in the routing table of each node, when link down, the upstream node that opens circuit is attempted in the double bounce scope, repairing; (3) through in the Hello of B-RTAODV information, add the information of neighbor node, safeguard the path.
2. in the agreement according to claim 1; It is characterized in that the B-RTAODV Routing Protocol has adopted route stand-by thought in route finding process: preserve the mulitpath between source node and destination node; Wherein one is main path; All the other are backup path, and main path and backup path are just distinguished according to priority; Main path priority is the highest, and value is that 1, the first backup path priority is taken second place, and value is 2, by that analogy.The priority height decides according to the path jumping figure.
3. in the agreement according to claim 1; It is characterized in that B-RTAODV improves at aspects such as route foundation, route maintenance, route Interrupt Process and route recoveries; When (1) route is set up source node and is had data to send; The mechanism that the cancellation intermediate node is replied RREP is not replied RREP even if intermediate node has to the route of destination node yet, replys by destination node is unified.When destination node is received first RREQ, will start RREQ buffer memory timer, all RREQ that buffer memory was received in a period of time thereafter from same source node; The RREQ timer expiry of destination node buffer memory will calculate the priority of each RREQ respective path by choice mechanism according to main road, and reply successively according to the priority height; RREP.Carry the priority rt_pri of corresponding route among the RREP; Intermediate node is received the RREP that destination node is replied, with the route that is established to destination node, and the path priority rt_pri that carries among the record RREP.Source node is received the RREP that destination node is replied, and is established to the route of destination node, and record path priority; When source node was received all RREP of destination node answer, the road construction process finished.Since then, source node and destination node have been set up many route stand-bies that have priority; After route was set up, source node selected the highest path of priority to send data.(2) the route maintenance main road by and the maintenance of route stand-by identical with the original mechanism of AODV; The way that adopts timed sending hello to divide into groups is confirmed the link between adjacent node, generally when next jumping give out a contract for a project uses perhaps through the link layer announcement next jumps whether attempting sending data in the passive affirmation mode monitor channel; (3) the route interruptions has been owing to preserved mulitpath, when main road when interrupting, as long as still have other path between source node and destination node, do not send RREQ and look for the road again, select sub-optimal path communication.Have only when all available paths between source node and destination node all interrupt, just send RREQ and look for the road again; (4) the route recovery route repair is responsible for by the upstream node of link, if the route that the node discovery is being used breaks down between this node and next-hop node.Node will be according to routing iinformation, and combines the nodal information in the double bounce scope, carries out route repair; Route A-B-E-D-F fracture at link B-E place, Node B will be responsible for route repair, and Node B is according to routing iinformation, and the following double bounce of knowing the route of destination node F is node D; So B seeks the public neighbor node C of a B and D from the information of neighbor nodes of management.After finding, Node B is adapted to the route of F, and E replaces with C with next-hop node, and the route term of validity is changed to the life cycle of link B-C; Then, B just divides into groups with revised routing forwarding.After C receives grouping,, then divide into groups with the routing forwarding of oneself if it has the effective route to F; If there is not effective route, then grouping is transmitted to the node D that Node B illustrates in " two hop nodes down " territory of grouping.After D receives grouping, continue the public neighbor node C that transmits.After finding, Node B is adapted to the route of F, and E replaces with C with next-hop node, and the route term of validity is changed to the life cycle of link B-C; Then, B just divides into groups with revised routing forwarding; After C receives grouping,, then divide into groups with the routing forwarding of oneself if it has the effective route to F; If there is not effective route, the node D that then in " the two hop nodes down " territory of dividing into groups, explains to Node B packet forward after D receives grouping, continues to transmit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105079469A CN102447686A (en) | 2010-10-15 | 2010-10-15 | Routing protocol of AODV (Ad hoc On-Demand Distance Vector Routing) application |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105079469A CN102447686A (en) | 2010-10-15 | 2010-10-15 | Routing protocol of AODV (Ad hoc On-Demand Distance Vector Routing) application |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102447686A true CN102447686A (en) | 2012-05-09 |
Family
ID=46009777
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010105079469A Pending CN102447686A (en) | 2010-10-15 | 2010-10-15 | Routing protocol of AODV (Ad hoc On-Demand Distance Vector Routing) application |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102447686A (en) |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102739567A (en) * | 2012-07-03 | 2012-10-17 | 苏州阔地网络科技有限公司 | Inter-process communication method and system |
| CN103533506A (en) * | 2012-09-26 | 2014-01-22 | 深圳市友讯达科技发展有限公司 | Method, network system and nodes for establishing return path |
| WO2014019116A1 (en) * | 2012-07-30 | 2014-02-06 | Harman International Industries, Incorporated | Collision avoidance system for mobile slotted aloha protocol |
| CN103856399A (en) * | 2014-03-17 | 2014-06-11 | 山东大学 | Ad Hoc backup route algorithm based on stability |
| WO2015001393A1 (en) * | 2013-07-05 | 2015-01-08 | Pismo Labs Technology Ltd. | Methods and systems for transmitting packets through aggregated end-to-end connection |
| US9585175B2 (en) | 2013-07-05 | 2017-02-28 | Pismo Labs Technology Limited | Methods and systems for transmitting packets through aggregated end-to-end connection |
| CN106658650A (en) * | 2016-12-06 | 2017-05-10 | 上海斐讯数据通信技术有限公司 | Method and device for maintaining routing information based on ZigBee network |
| WO2018103738A1 (en) * | 2016-12-08 | 2018-06-14 | 中兴通讯股份有限公司 | Route establishment method and device |
| CN110661550A (en) * | 2019-09-27 | 2020-01-07 | 青岛联众智芯科技有限公司 | Method, device, storage medium and electronic equipment for forwarding message in HPLC communication link |
| CN111130913A (en) * | 2019-12-31 | 2020-05-08 | 联想(北京)有限公司 | Information processing method and device |
| US11005685B2 (en) | 2009-12-23 | 2021-05-11 | Pismo Labs Technology Limited | Methods and systems for transmitting packets through aggregated end-to-end connection |
| CN113037627A (en) * | 2021-03-03 | 2021-06-25 | 烽火通信科技股份有限公司 | Method and device for selecting network service line resources |
| CN113170373A (en) * | 2018-12-18 | 2021-07-23 | 索尼集团公司 | Multi-hop routing protocol with alternate routing in WLAN networks |
| CN114585046A (en) * | 2022-01-17 | 2022-06-03 | 厦门大学 | Marine environment monitoring underwater acoustic network routing method |
-
2010
- 2010-10-15 CN CN2010105079469A patent/CN102447686A/en active Pending
Cited By (26)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11005685B2 (en) | 2009-12-23 | 2021-05-11 | Pismo Labs Technology Limited | Methods and systems for transmitting packets through aggregated end-to-end connection |
| CN102739567A (en) * | 2012-07-03 | 2012-10-17 | 苏州阔地网络科技有限公司 | Inter-process communication method and system |
| US9743400B2 (en) | 2012-07-30 | 2017-08-22 | Harman International Industries, Incorporated | Collision avoidance system for mobile slotted aloha protocol |
| WO2014019116A1 (en) * | 2012-07-30 | 2014-02-06 | Harman International Industries, Incorporated | Collision avoidance system for mobile slotted aloha protocol |
| CN104380680B (en) * | 2012-07-30 | 2017-12-29 | 哈曼国际工业有限公司 | For moving the conflict avoidance system of CDMA slotted ALOHA agreement |
| CN104380680A (en) * | 2012-07-30 | 2015-02-25 | 哈曼国际工业有限公司 | Collision avoidance system for mobile slotted aloha protocol |
| CN103533506A (en) * | 2012-09-26 | 2014-01-22 | 深圳市友讯达科技发展有限公司 | Method, network system and nodes for establishing return path |
| CN103533506B (en) * | 2012-09-26 | 2015-06-24 | 深圳友讯达科技股份有限公司 | Method, network system and nodes for establishing return path |
| GB2519443A (en) * | 2013-07-05 | 2015-04-22 | Pismo Labs Technology Ltd | Methods and systems for transmitting packets through aggregated end-to-end connection |
| GB2519443B (en) * | 2013-07-05 | 2021-07-21 | Pismo Labs Technology Ltd | Methods and systems for transmitting packets through network interfaces |
| US9585175B2 (en) | 2013-07-05 | 2017-02-28 | Pismo Labs Technology Limited | Methods and systems for transmitting packets through aggregated end-to-end connection |
| CN105579989B (en) * | 2013-07-05 | 2018-07-10 | 柏思科技有限公司 | Pass through the method and system of the end to end connection transmission packet of concentration |
| CN105579989A (en) * | 2013-07-05 | 2016-05-11 | 柏思科技有限公司 | Methods and systems for transmitting packets through aggregated end-to-end connection |
| WO2015001393A1 (en) * | 2013-07-05 | 2015-01-08 | Pismo Labs Technology Ltd. | Methods and systems for transmitting packets through aggregated end-to-end connection |
| CN103856399A (en) * | 2014-03-17 | 2014-06-11 | 山东大学 | Ad Hoc backup route algorithm based on stability |
| CN103856399B (en) * | 2014-03-17 | 2017-02-01 | 山东大学 | Ad Hoc backup route algorithm based on stability |
| CN106658650A (en) * | 2016-12-06 | 2017-05-10 | 上海斐讯数据通信技术有限公司 | Method and device for maintaining routing information based on ZigBee network |
| CN106658650B (en) * | 2016-12-06 | 2021-01-08 | 台州市吉吉知识产权运营有限公司 | Routing information maintenance method and device based on ZigBee network |
| WO2018103738A1 (en) * | 2016-12-08 | 2018-06-14 | 中兴通讯股份有限公司 | Route establishment method and device |
| CN113170373A (en) * | 2018-12-18 | 2021-07-23 | 索尼集团公司 | Multi-hop routing protocol with alternate routing in WLAN networks |
| CN110661550A (en) * | 2019-09-27 | 2020-01-07 | 青岛联众智芯科技有限公司 | Method, device, storage medium and electronic equipment for forwarding message in HPLC communication link |
| CN110661550B (en) * | 2019-09-27 | 2021-08-31 | 青岛联众芯云科技有限公司 | Method, device, storage medium and electronic equipment for forwarding message in HPLC communication link |
| CN111130913A (en) * | 2019-12-31 | 2020-05-08 | 联想(北京)有限公司 | Information processing method and device |
| CN111130913B (en) * | 2019-12-31 | 2021-11-16 | 联想(北京)有限公司 | Information processing method and device |
| CN113037627A (en) * | 2021-03-03 | 2021-06-25 | 烽火通信科技股份有限公司 | Method and device for selecting network service line resources |
| CN114585046A (en) * | 2022-01-17 | 2022-06-03 | 厦门大学 | Marine environment monitoring underwater acoustic network routing method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102447686A (en) | Routing protocol of AODV (Ad hoc On-Demand Distance Vector Routing) application | |
| US8139504B2 (en) | System, device, and method for unifying differently-routed networks using virtual topology representations | |
| CN1645838B (en) | Self network organized and distance concerned multi-routing method for complete route information | |
| CN101945460B (en) | Energy-saving AODV routing method used in Ad Hoc network environment | |
| CN103260211B (en) | A kind of AOMDV method for routing of improvement | |
| Ding et al. | A node-disjoint multipath routing protocol based on AODV | |
| CN106686659A (en) | AOMDV-based energy aware node-disjoint multipath routing algorithm | |
| CN102769885B (en) | Method for realizing routing in sensor network and sensor network | |
| Rishiwal et al. | Stable and energy efficient routing for mobile adhoc networks | |
| CN103974365A (en) | Ad Hoc mobile network route restoring method | |
| CN101938804A (en) | Multipath routing protocol suitable for wireless sensing network | |
| CN102573000B (en) | Wireless self-organizing network protection routing generation algorithm based on direct/indirect matrixes | |
| CN103096411B (en) | Based on the Internet of Things communication means of reverse power restriction route protocol | |
| Zhai et al. | A reliable and adaptive AODV protocol based on cognitive routing for Ad hoc networks | |
| CN103415033A (en) | Ad Hoc network on-demand routing protocol establishing and maintaining method based on path collecting | |
| CN101409905A (en) | Routing method for mobile multi-hop grouping wireless network based on random broadcast mode | |
| Peng et al. | An energy-aware random multi-path routing protocol for MANETs | |
| Margaryan et al. | Development of an Adaptive Routing Algorithm in MANET | |
| Srinivasan et al. | Stability and energy aware multipath routing for mobile ad hoc networks | |
| Ramakrishnan et al. | Mathematical modeling of routing protocol selection for optimal performance of MANET | |
| Barange et al. | Review paper on implementation of multipath reactive routing protocol in manet | |
| Chen et al. | Shortcut anycast tree routing in MANETs | |
| CN104735712A (en) | Ad Hoc network route maintenance method | |
| Naseem et al. | Distributed bandwidth guarantee using multi-path routing protocol in mobile ad hoc network | |
| Sharma et al. | Provisioning of quality of service in MANETs by performance analysis and comparison of AODV and OLSR |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| DD01 | Delivery of document by public notice |
Addressee: Xue Ying Document name: Notification of Publication of the Application for Invention |
|
| DD01 | Delivery of document by public notice |
Addressee: Xue Ying Document name: Notification of before Expiration of Request of Examination as to Substance |
|
| DD01 | Delivery of document by public notice |
Addressee: Xue Ying Document name: Notification that Application Deemed to be Withdrawn |
|
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20120509 |