A proximity-based dynamic path shortening scheme for ubiquitous ad hoc networks

Saito, Masato; Aida, Hiroto; Tobe, Yoshito; Tokuda, Hideyuki

doi:10.1109/icdcs.2004.1281604

Cited by 8 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, it is not efficient because the reply may take many hops to reach the source node. Saito et al [9] presented a proximity-based dynamic path shortening scheme. In this scheme, each node in the active route monitors its local link quality and estimates whether to enter the proximity of its neighboring node to shorten the active route.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

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

Cheng

2009

Wireless Netw

View full text Add to dashboard Cite

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.

show abstract

Section: Related Workmentioning

confidence: 99%

“…With respect to the first scenario, some researches worked on shortening the routing path by reducing the number of intermediate nodes in between the source and destination [9][10][11]. However, this also implies that the distance between two adjacent routing nodes increases, which may also result in a link that is more vulnerable to breaking.…”

mentioning

confidence: 99%

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

Cheng

2009

Wireless Netw

View full text Add to dashboard Cite

show abstract

Cross-Layer Simulation and Optimization for Mobile Ad-Hoc Networks

Beylot

Dhaou

Gauthier³

et al. 2005

IFIP International Federation for Information Processing

View full text Add to dashboard Cite

This paper introduces cross-layer implementation with a multi-rate aware routing scheme and shows that SNR is an important information to use in a routing protocol. The existing routing protocol attempts to minimize the number of hops between source-destination pairs. We use a new metric definition to route the packets and to select the best available link along the path in a multi-rate protocol senario. The new metric is created with information coming from interlayer interaction between the routing layer and the MAC layer. We use SNR as an information about link quality. We show through simulation that for communications using muti-rate protocol in ad hoc networks, throughput is highly affected as soon as the route goes through low-rate link.

show abstract

An Altitude Based Dynamic Routing Scheme for Ad Hoc Networks

Cheng

et al. 2006

Wireless Algorithms, Systems, and Applications

View full text Add to dashboard Cite

A proximity-based dynamic path shortening scheme for ubiquitous ad hoc networks

Abstract: Abstract

Cited by 8 publications

References 12 publications

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

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

Cross-Layer Simulation and Optimization for Mobile Ad-Hoc Networks

An Altitude Based Dynamic Routing Scheme for Ad Hoc Networks

Contact Info

Product

Resources

About