A highly topology adaptable ad hoc routing protocol with complementary preemptive link breaking avoidance and path shortening mechanisms

Abstract

Ad-hoc on-demand distance vector routing (AODV) is a well-known routing protocol for mobile ad hoc networks. The original AODV protocol works in a semi-dynamic fashion, by establishing a route on demand and using that route until it breaks. However, to suit the changing network topology of ad hoc networks, more aggressive and adaptable routing strategies are required. A number of researches have proposed improving AODV performance by locally repairing broken links, predicting and replacing potentially vulnerable links, or shortening a link through removing redundant nodes from the transmission path. Although local repair may relieve some problems, it usually results in longer paths and thus a considerable performance drop in heavy traffic conditions. There are also issues regarding packet loss and communication delay due to route rebuilding once the link is broken. Predicting and replacing potentially vulnerable links may require special hardware, additional tables to maintain, or other extra overhead. Finally, path shortening may result in shorter and more efficient routes, but there is no guarantee that the new paths will be robust. This paper proposes integrating preemptive link breaking avoidance and path shortening mechanisms into a modified AODV protocol. However, the difficult issue lies in determining the right timing to initiate the two independent mechanisms so that the two dynamically and complementarily operating mechanisms can work together to improve the routing performance. Through numerical analysis and simulation, we have arranged a simple parameter setting for controlling the activation of each mechanism at the appropriate time. The proposed combination is a highly dynamic ad hoc routing protocol that is capable of adapting itself to the changing network topology and achieving extremely good performance in various routing performance metrics. Extensive simulations show that each of the two schemes alone improves AODV performance. More importantly, the integrated protocol performs even better in terms of data delivery rate, average delay time, and network overhead. To be more specific, in the best cases our protocol can reduce up to 82% in control overhead and 66% in delay time, while achieving 12% more in data delivery rate comparing to AODV.

BI-Filtered Forwarding: A Quasi-Optimal Routing Algorithm for Query Delivery in Wireless Sensor Networks

“…ODVA achieved the goal of a high packet delivery ratio, a long network lifetime and efficient usage of energy in comparison with other prevalent schemes. As another example for overcoming the hole problem, Cheng et al [23] proposed a highly topology adaptable ad hoc routing protocol with complementary preemptive link breaking avoidance and path shortening mechanisms. To be noticed, in comparison with the above hole-avoidance routing protocol, broadcast-based routing can handle the hole problem without introducing extra message consumption in wireless sensor networks.…”

Pro-Reactive Route Recovery with Automatic Route Shortening in Wireless Ad Hoc Networks

“…Proactive route recovery attempts to initiate the route recovery procedure before the route really breaks [4][5] [13]. The preventive mechanism is realized by judging the received signal power of packets [4].…”

Pass-Over Problem in Wireless Sensor Networks

“…S crescent =2×A grid +A vertical +A horizontal If we compute the area of these geometries (the area of the intersected region can be calculated by using the equation (1) in [8]), then we can obtain p 1 , p 2 , and p 3 as follows.…”