An altitude based dynamic routing scheme for ad hoc networks

Authors:
Rei-Heng Cheng;Tung-Kuang Wu;Chang Wu Yu;Chun-Hung Kuo
Affiliations:
Department of Information Management, Hsuan Chuang University, Hsin-Chu, Taiwan , R.O.C;Department of Information Management, National Changhua University of Education, Chang-Hua, Taiwan , R.O.C;Department of Computer Science and Information Engineering, Chung Hua University, Hsin-Chu, Taiwan , R.O.C;Department of Information Management, Hsuan Chuang University, Hsin-Chu, Taiwan , R.O.C
Venue:
WASA'06 Proceedings of the First international conference on Wireless Algorithms, Systems, and Applications
Year:
2006

Citing 4
Cited 1

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Proximity-Based Dynamic Path Shortening Scheme for Ubiquitous Ad Hoc Networks

ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
On-demand link-state routing in ad hoc networks

On-demand link-state routing in ad hoc networks

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

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ad-hoc On-Demand Distance Vector Routing (AODV) is a famous routing protocol for mobile ad hoc networks. Routing path established with AODV remains unchanged during data transmission unless the link fails. Due to the mobile nature of nodes in an ad hoc network, the network topology changes frequently. As a result, some intermediate nodes of an earlier established path may later become redundant and results in packet routing through longer link. In addition, a path established at one time may later be broken due to some intermediate nodes of the path move out of the range. In this paper, we propose an ad hoc network routing protocol with both dynamic link shortening and broken avoidance features. Each node only needs to turn on its overhearing function and keeps minimal extra information. The simulation results show that the proposed protocol does improve the performance of the AODV protocol in terms of data delivery ratio, average delay time, and the network overhead.