AU2021104118A4 - A novel route maintenance and re-route discovery method based on aodv routing protocol - Google Patents
A novel route maintenance and re-route discovery method based on aodv routing protocol Download PDFInfo
- Publication number
- AU2021104118A4 AU2021104118A4 AU2021104118A AU2021104118A AU2021104118A4 AU 2021104118 A4 AU2021104118 A4 AU 2021104118A4 AU 2021104118 A AU2021104118 A AU 2021104118A AU 2021104118 A AU2021104118 A AU 2021104118A AU 2021104118 A4 AU2021104118 A4 AU 2021104118A4
- Authority
- AU
- Australia
- Prior art keywords
- node
- neighbor
- route
- nodes
- priority value
- 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.)
- Ceased
Links
- 238000000034 method Methods 0.000 title claims abstract description 73
- 238000012423 maintenance Methods 0.000 title claims abstract description 26
- 230000008439 repair process Effects 0.000 claims abstract description 12
- 230000008569 process Effects 0.000 claims description 22
- 230000008531 maintenance mechanism Effects 0.000 abstract description 2
- 230000008901 benefit Effects 0.000 description 9
- 238000004088 simulation Methods 0.000 description 6
- 238000011144 upstream manufacturing Methods 0.000 description 5
- 230000000694 effects Effects 0.000 description 3
- 230000008263 repair mechanism Effects 0.000 description 3
- 235000008694 Humulus lupulus Nutrition 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
Classifications
-
- 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/28—Connectivity information management, e.g. connectivity discovery or connectivity update for reactive routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to novel route maintenance and re-route
discovery method based on AODV routing protocol. During link break,
alternate paths are made available at neighbor nodes by overhearing the
traffic. The route maintenance mechanism repairs a route locally by selecting
a neighbor on the basis of a new parameter, priority. The novel re-route
discovery method helps in avoiding reroute discoveries and averting the
overhead caused by control packets, inherent congestion and delay.
18
_ CC
-oE
3 WW4
E 4 CO
47 E
a L
E E2
EU 0
Description
-oE 3 WW4
E 4 CO
47 E
a L
E E2 0 EU
The present invention relates routing techniques in mobile ad hoc networks. In particular, the present invention relates to novel route maintenance and re-route discovery method based on AODV routing protocol.
AODV is a popular reactive routing protocol used in mobile ad-hoc networks. A route in AODV may be repaired locally only if the link break is closer to the destination, otherwise the source may restart the route discovery process. Rediscovering a new route in large networks incur a great deal of overhead on the network, gravely affecting the performance by increasing routing overhead, and decreasing the throughput and packet delivery ratio. Hence, relying on hop count for route selection in dense network may lead to poor network performance.
In the view of the forgoing discussion, it is clearly portrayed that there is a need to have novel route maintenance and re-route discovery method. The present invention aims to enhance the performance of the network by selecting a node as the next node based on a parameter called priority.
The present disclosure seeks to provide novel route maintenance and re route discovery method based on AODV routing protocol. The route maintenance mechanism repairs a route by selecting a neighbor on the basis of the traffic being handled by it. A new parameter, priority, is introduced to segregate the nodes into high traffic and low traffic nodes. Alternate paths are made available at neighbor nodes by overhearing the traffic. The novel re-route discovery method helps in avoiding reroute discoveries by selecting neighbors and averting the overhead caused by control packets, inherent congestion and delay.
In an embodiment, a novel route maintenance and re-route discovery method based on AODV routing protocol, comprises establishing an active route between a source node and a destination node in a mobile ad-hoc network, wherein the mobile ad-hoc network comprising a plurality of nodes connected through links and each node of the plurality of nodes is configured to store a routing table with entries associated with paths from the node to other nodes and each node of the plurality of nodes is configured to store a neighbor table with entries associated with a plurality of neighbor nodes which are neighbors of the node. The method further comprises detecting a link break in the active route. The method further comprises determining a given criterion, wherein the given criterion is comparison of number of link breaks to length of the active route. The method further comprises determining if the given criterion is met, it results in invalidation of the active route and starting a re-route discovery process.The method further comprises determining if the given criterion is not met then searching a neighbor node with a high priority value from the neighbor table, wherein the high priority value is 1.The method further comprises determining if such neighbor node exists then sending data packets to the neighbor node wherein the neighbor node further checks an alternate route table for data delivery information and copies an entry of the alternate route table to the routing table. The method further comprises determining if such neighbor does not exist. The method further comprises determining if the link break is a local repair then initializing a local repair of the link break otherwise starting the re-route discovery process.
In another embodiment, a novel route maintenance and re-route discovery method based on AODV routing protocol further comprises an initializing step of modifying data structure of AODV Routing Protocol characterized by creating an alternate routing table for the network having a destination address, a next hop address and an expiry period by an overhearing node that overhears data packets of the active route; introducing a priority value into a hello packet header wherein the priority value is associated with the node which sends the hello packet; and introducing a priority value into a neighbor table wherein the neighbor table stores neighbor information and associated priorities of the neighbors nodes; wherein the priority value of a node is initialized to 0 and is updated periodically on the basis of entries of the routing table and the alternate route table.
In another embodiment, the re-route discovery process comprises determining a neighbor node with a high priority value from the neighbor table of the source node, wherein the high priority value is 1. The re-route discovery process further comprises determining if such neighbor node exists then relaying a control request packet to all such neighbor nodes until the control request packet reaches the destination node. The re-route discovery process further comprises determining if such neighbor node does not exist, then broadcasting the control request packet to all the nodes in the neighbor table of the source node, wherein each node further determines a neighbor node with a high priority value from their neighbor table, until a node is found which has a high priority value.
To further clarify advantages and features of the present disclosure, a more particular description of the invention will be rendered by reference to specific embodiments thereof, which is illustrated in the appended drawings.
It is appreciated that these drawings depict only typical embodiments of the invention and are therefore not to be considered limiting of its scope. The invention will be described and explained with additional specificity and detail with the accompanying drawings.
These and other features, aspects, and advantages of the present disclosure will become better understood when the following detailed description is read with reference to the accompanying drawings in which like characters represent like parts throughout the drawings, wherein:
Figure 1 illustrates a flow chart of novel route maintenance and re route discovery method based on AODV routing protocol in accordance with an embodiment of the present disclosure.
Figure 2 illustrates a flow chart of route maintenance process of AODV routing protocol in accordance with an embodiment of the present disclosure.
Figure 3 illustrates format of the alternate route table used in novel route maintenance and re-route discovery method in accordance with an embodiment of the present disclosure.
Figure 4 illustrates format of the modified hello packet header used in novel route maintenance and re-route discovery method in accordance with an embodiment of the present disclosure.
Figure 5 illustrates format of the modified neighbor table used in novel route maintenance and re-route discovery method in accordance with an embodiment of the present disclosure.
Figure 6 illustrates a flow chart of priority based route maintenance method of present invention in accordance with an embodiment of the present disclosure.
Figure 7 illustrates a flow chart of controlled re-route discovery method of present invention in accordance with an embodiment of the present disclosure.
Figure 8 illustrates graphs denoting the effect of the number of link breaks on the different metrics while using the three route repair mechanisms - AODV, RLLR and P-AODV (present invention). The different metrics used were: (a) Routing Overhead, (b) Packet Delivery Ratio, (c) Throughput (kbps), (d) End-to-end delay (sec).
Further, skilled artisans will appreciate that elements in the drawings are illustrated for simplicity and may not have necessarily been drawn to scale. For example, the flow charts illustrate the method in terms of the most prominent steps involved to help to improve understanding of aspects of the present disclosure. Furthermore, in terms of the construction of the device, one or more components of the device may have been represented in the drawings by conventional symbols, and the drawings may show only those specific details that are pertinent to understanding the embodiments of the present disclosure so as not to obscure the drawings with details that will be readily apparent to those of ordinary skill in the art having benefit of the description herein.
For the purpose of promoting an understanding of the principles of the invention, reference will now be made to the embodiment illustrated in the drawings and specific language will be used to describe the same. It will nevertheless be understood that no limitation of the scope of the invention is thereby intended, such alterations and further modifications in the illustrated system, and such further applications of the principles of the invention as illustrated therein being contemplated as would normally occur to one skilled in the art to which the invention relates.
It will be understood by those skilled in the art that the foregoing general description and the following detailed description are exemplary and explanatory of the invention and are not intended to be restrictive thereof.
Reference throughout this specification to "an aspect", "another aspect" or similar language means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present disclosure. Thus, appearances of the phrase "in an embodiment", "in another embodiment" and similar language throughout this specification may, but do not necessarily, all refer to the same embodiment.
The terms "comprises", "comprising", or any other variations thereof, are intended to cover a non-exclusive inclusion, such that a process or method that comprises a list of steps does not include only those steps but may include other steps not expressly listed or inherent to such process or method. Similarly, one or more devices or sub-systems or elements or structures or components proceeded by "comprises...a" does not, without more constraints, preclude the existence of other devices or other sub systems or other elements or other structures or other components or additional devices or additional sub-systems or additional elements or additional structures or additional components.
Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The system, methods, and examples provided herein are illustrative only and not intended to be limiting.
Embodiments of the present disclosure will be described below in detail with reference to the accompanying drawings.
Figure 1 illustrates a flow chart of novel route maintenance and re route discovery method based on AODV routing protocol in accordance with an embodiment of the present disclosure.
At step 102, a novel route maintenance and re-route discovery method 100 based on AODV routing protocol, comprises establishing an active route between a source node and a destination node in a mobile ad-hoc network, wherein the mobile ad-hoc network comprising a plurality of nodes connected through links and each node of the plurality of nodes is configured to store a routing table with entries associated with paths from the node to other nodes and each node of the plurality of nodes is configured to store a neighbor table with entries associated with a plurality of neighbor nodes which are neighbors of the node. At step 104, the method 100 further comprises detecting a link break in the active route. At step 106, the method further comprises determining a given criterion, wherein the given criterion is comparison of number of link breaks to length of the active route. At step
108, the method further comprises determining if the given criterion is met, it results in invalidation of the active route and starting a re-route discovery process. At step 110, the method further comprises determining if the given criterion is not met then searching a neighbor node with a high priority value from the neighbor table, wherein the high priority value is 1. At step 112, the method further comprises determining if such neighbor node exists then sending data packets to the neighbor node wherein the neighbor node further checks an alternate route table for data delivery information and copies an entry of the alternate route table to the routing table. At step 114, the method further comprises determining if such neighbor does not exist. At step 116, the method further comprises determining if the link break is a local repair then initializing a local repair of the link break otherwise starting the re-route discovery process.
In another embodiment, a novel route maintenance and re-route discovery method based on AODV routing protocol further comprises an initializing step of modifying data structure of AODV Routing Protocol characterized by creating an alternate routing table for the network having a destination address, a next hop address and an expiry period by an overhearing node that overhears data packets of the active route; introducing a priority value into a hello packet header wherein the priority value is associated with the node which sends the hello packet; and introducing a priority value into a neighbor table wherein the neighbor table stores neighbor information and associated priorities of the neighbors nodes; wherein the priority value of a node is initialized to 0 and is updated periodically on the basis of entries of the routing table and the alternate route table.
In another embodiment, the re-route discovery process comprises determining a neighbor node with a high priority value from the neighbor table of the source node, wherein the high priority value is 1. The re-route discovery process further comprises determining if such neighbor node exists then relaying a control request packet to all such neighbor nodes until the control request packet reaches the destination node. The re-route discovery process further comprises determining if such neighbor node does not exist, then broadcasting the control request packet to all the nodes in the neighbor table of the source node, wherein each node further determines a neighbor node with a high priority value from their neighbor table, until a node is found which has a high priority value.
Figure 2 illustrates a flow chart of route maintenance process of AODV routing protocol in accordance with an embodiment of the present disclosure. In AODV routing protocol, a route is 'discovered' on demand: the source broadcasts route request (RREQ) packets and the node(s) respond to these packets by sending back route reply (RREP) packet, creating backward and forward paths in the process. Either the destination or the node(s) which have information about the destination reply back with the RREP packet, which travels back to the source through the backward path. Link break is a common issue in a dynamic network which affects the overall performance of routing protocols. In a network after invalidation of active node from neighbor table an upstream node confirms the link break and initializes the route maintenance process by sending route error (RERR) message. A route in AODV may be repaired locally if the link break is closer to the destination, otherwise the source may restart the route discovery process. This approach is highly inefficient if only a single link is broken. If the routes are very long, having multiple hops, the frequency of link breaks increases as there are too many hops in the route. Hence, hop count is not the suitable metric for node selection in long routes in a dense network.
Figure 3 illustrates format of the alternate route table used in novel route maintenance and re-route discovery method in accordance with an embodiment of the present disclosure. The present invention uses overhearing mechanism in which the neighbor nodes overhear the data packets of a route. A neighbor is selected as the next node by the upstream node based on a parameter called priority. The neighbor which overhears packets creates an ART (if not already created) and adds the entry for the node which it overheard, along with the destination information. Entries in an ART are helpful during route repairs.
Figure 4 illustrates format of the modified hello packet header used in novel route maintenance and re-route discovery method in accordance with an embodiment of the present disclosure.
Figure 5 illustrates format of the modified neighbor table used in novel route maintenance and re-route discovery method in accordance with an embodiment of the present disclosure. The nodes will set their priority values periodically and send these values in hello packets to their neighbors. Each node sets its own priority based on the number of routes it is part of and the availability of alternate route table (ART) with it. A node which is not a part of any data session (Standalone node) and has an ART, will set its priority as 1(high). All the remaining nodes will set their priorities as 0 (low). The neighbor table is modified to keep the information of the priority values of the neighbors. The nodes which are relatively less busy with data transmission will have higher priorities. Selecting such high priority nodes during link break will increase the lifetime of the route as well as improve the performance of the network.
Figure 6 illustrates a flow chart of priority based route maintenance method of present invention in accordance with an embodiment of the present disclosure. The present invention does not consider distance of the link break to the destination for performing the local repair, i.e., a link can be repaired locally irrespective of its location in the route. This means, irrespective of the location of the link break in the active route, the upstream node always tries to repair it locally by choosing the highest priority neighbor from its neighbor table. For long routes, stability of the path is much more important than the path length. Choosing a stable path is favorable than opting for a smaller one, to avoid congestion, delay, and packet drop. Such a tradeoff also improves bandwidth utilization, data transmission and saves the battery power of nodes by avoiding them to handle more than a stipulated number of data sessions simultaneously. If such a node's battery gets down, then all the active routes associated will be affected. Our proposed method avoids such a situation and balances the load, thereby optimizing the network lifetime. The novel method of route maintenance goes one step ahead by selecting the nodes on the basis of their priority rather than the hop count, during the subsequent route discovery phases also (This is not the case in the beginning as initially as none of the nodes have their priority values set). This ensures stable routes and proper bandwidth utilization; preserves battery power of nodes, thereby providing a network with the maximum possible number of active nodes till the end.
Figure 7 illustrates a flow chart of controlled re-route discovery method of present invention in accordance with an embodiment of the present disclosure.
In case of unsuccessful local repair upstream node sends failure notification to source node to reconstruct the route. In the novel method for re-route discovery, upstream node sends the RREQ packet only to those neighbors which have high priority value. The node which receives this RREQ packet again relays it only to those neighbors which have high priority value. If no such neighbor is found then the packet is broadcast by the node. Here, the relay of RREQ packets on the basis of the priorities of the neighbor nodes during re-route discovery (on the unavailability of suitable neighbor) reduces the number of control (RREQ) packets in the entire network.
Figure 8 illustrates graphs denoting the effect of the number of link breaks on the different metrics while using the three route repair mechanisms - AODV, RLLR and P-AODV (present invention). The different metrics used were: (a) Routing Overhead, (b) Packet Delivery Ratio, (c) Throughput (kbps), (d) End-to-end delay(sec).
To measure the performance of the proposed method in various scenarios, the algorithms were implemented in AODV code of network simulator, ns 2.34, and the results were compared with the existing route maintenance methods of AODV, and RLLR. IEEE standard 802.11 was used as the MAC layer protocol. Two ray ground radio propagation model, 250 m radio range and 2 Mb/sec radio bandwidth were used in the simulations. A network size of 50 nodes spread in an area of 1200 9 800 was implemented for simulations. In each simulation, two (or more) chain topologies were created so that some of the intermediate nodes of (at least) two of the chains were neighbors to each other. Remaining free nodes were scattered and some of them were also neighbors to the nodes in the chains. Constant bit rate (CBR) traffic was used and the sources in the chains trans- mitted 2048 B data packets at a rate of four packets per second. Some of the intermediate nodes and free nodes were allowed to move with a speed 5 to 40 m/sec. Simulations were run to monitor the effects of the number of link breaks. The results were averaged at each point in the graphs. In both the cases, metrics: routing overhead, end-to- end delay, throughput and packet delivery ratio were evaluated and compared for the three route repair mechanisms. Each simulation ran for 600 s. The simulation results show significant improvement in routing overhead reduction, packet delivery ratio, and considerable improvement in throughput and end-to-end delay (reduction) on comparison of present invention with existing AODV routing protocol.
The drawings and the forgoing description give examples of embodiments. Those skilled in the art will appreciate that one or more of the described elements may well be combined into a single functional element. Alternatively, certain elements may be split into multiple functional elements. Elements from one embodiment may be added to another embodiment. For example, orders of processes described herein may be changed and are not limited to the manner described herein. Moreover, the actions of any flow diagram need not be implemented in the order shown; nor do all of the acts necessarily need to be performed. Also, those acts that are not dependent on other acts may be performed in parallel with the other acts. The scope of embodiments is by no means limited by these specific examples. Numerous variations, whether explicitly given in the specification or not, such as differences in structure, dimension, and use of material, are possible. The scope of embodiments is at least as broad as given by the following claims.
Benefits, other advantages, and solutions to problems have been described above with regard to specific embodiments. However, the benefits, advantages, solutions to problems, and any component(s) that may cause any benefit, advantage, or solution to occur or become more pronounced are not to be construed as a critical, required, or essential feature or component of any or all the claims.
Claims (3)
1. A novel route maintenance and re-route discovery method based on AODV routing protocol, comprising steps: establishing an active route between a source node and a destination node in a mobile ad-hoc network, wherein the mobile ad-hoc network comprising a plurality of nodes connected through links, wherein each node of the plurality of nodes is configured to store a routing table with entries associated with paths from the node to other nodes and wherein each node of the plurality of nodes is configured to store a neighbor table with entries associated with a plurality of neighbor nodes which are neighbors of the node
detecting a link break in the active route;
determining a given criterion, wherein the given criterion is comparison of number of link breaks to length of the active route;
determining if the given criterion is met, it results in invalidation of the active route and starting a re-route discovery process;
determining if the given criterion is not met then searching a neighbor node with a high priority value from the neighbor table, wherein the high priority value is 1;
determining if such neighbor node exists then sending data packets to the neighbor node wherein the neighbor node further checks an alternate route table for data delivery information and copies an entry of the alternate route table to the routing table;
determining if such neighbor does not exist; and determining if the link break is a local repair then initializing a local repair of the link break otherwise starting the re-route discovery process.
2. The method as claimed in claim 1 further comprises an initializing step of modifying data structure of AODV Routing Protocol characterized by creating an alternate routing table for the network having a destination address, a next hop address and an expiry period by an overhearing node that overhears data packets of the active route;
introducing a priority value into a hello packet header wherein the priority value is associated with the node which sends the hello packet; and
introducing a priority value into a neighbor table wherein the neighbor table stores neighbor information and associated priorities of the neighbors nodes,
wherein the priority value of a node is initialized to 0 and is updated periodically on the basis of entries of the routing table and the alternate route table.
3. The method as claimed in claim 1 wherein the re-route discovery process comprising steps: determining a neighbor node with a high priority value from the neighbor table of the source node, wherein the high priority value is 1;
determining if such neighbor node exists , then relaying a control request packet to all such neighbor nodes until the control request packet reaches the destination node; and determining if such neighbor node does not exist, then broadcasting the control request packet to all the nodes in the neighbor table of the source node, wherein each node further determines a neighbor node with a high priority value from their neighbor table, until a node is found which has a high priority value.
Figure 5
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| AU2021104118A AU2021104118A4 (en) | 2021-07-14 | 2021-07-14 | A novel route maintenance and re-route discovery method based on aodv routing protocol |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| AU2021104118A AU2021104118A4 (en) | 2021-07-14 | 2021-07-14 | A novel route maintenance and re-route discovery method based on aodv routing protocol |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| AU2021104118A4 true AU2021104118A4 (en) | 2022-04-07 |
Family
ID=80932732
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| AU2021104118A Ceased AU2021104118A4 (en) | 2021-07-14 | 2021-07-14 | A novel route maintenance and re-route discovery method based on aodv routing protocol |
Country Status (1)
| Country | Link |
|---|---|
| AU (1) | AU2021104118A4 (en) |
-
2021
- 2021-07-14 AU AU2021104118A patent/AU2021104118A4/en not_active Ceased
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7551562B2 (en) | Determining bidirectional path quality within a wireless mesh network | |
| Wu et al. | Performance study of a multipath routing method for wireless mobile ad hoc networks | |
| JP5252150B2 (en) | Method and system for setting up a cooperative route in a wireless network | |
| Guo et al. | Analysis of general network coding conditions and design of a free-ride-oriented routing metric | |
| EP2083535B1 (en) | Method for enhancement of multicasting forwarding protocol in a wireless network | |
| EP2106073A1 (en) | Method and apparatus for increasing throughput in a communication network | |
| Wu et al. | Design of fast restoration multipath routing in VANETs | |
| Sharma et al. | P-AODV: a priority based route maintenance process in mobile ad hoc networks | |
| Cheng et al. | Virtual backbone-based routing in multihop ad hoc wireless networks | |
| Ali et al. | Multipath routing backbones for load balancing in Mobile Ad hoc Networks | |
| Bai et al. | Salvaging route reply for on-demand routing protocols in mobile ad-hoc networks | |
| CN104053208B (en) | Method for routing based on channel distribution, device in wireless self-networking | |
| Lee et al. | A reliable and hybrid multi-path routing protocol for multi-interface tactical ad hoc networks | |
| Joshi et al. | A novel multi-cast routing protocol for VANET | |
| AU2021104118A4 (en) | A novel route maintenance and re-route discovery method based on aodv routing protocol | |
| Basavaraju et al. | ECARP: an efficient congestion adaptive routing protocol for mobile Ad hoc networks | |
| Tabar et al. | Quality of service in vehicular ad hoc networks | |
| Le et al. | An efficient hybrid routing approach for hybrid wireless mesh networks | |
| Lengliz et al. | Enhancing AODV and DSR with the RLT strategy for efficient routing in VANETs | |
| Khimsara et al. | AM-AOMDV: adaptive multi-metric ad-hoc on-demand multipath distance vector routing | |
| Ismail et al. | Reducing broadcasting route request packet through LF-AODC | |
| Guidoum et al. | Enhancing performance AODV routing protocol to avoid congestion | |
| Mirza et al. | Reliable multipath multi-channel route migration over multi link-failure in wireless ad hoc networks | |
| Lalwani et al. | Optimized Ad-hoc on Demand Distance Vector Routing Protocol | |
| Al-Kasasbeh | A Modified On-Demand Vector Distance Routing Protocol Incorporating Alternate Vehicle-RSU-Vehicle and Vehicle-RSU-RSU Paths |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FGI | Letters patent sealed or granted (innovation patent) | ||
| MK22 | Patent ceased section 143a(d), or expired - non payment of renewal fee or expiry |