An altitude based dynamic routing scheme for ad hoc networks

Rei Heng Cheng, Tung Kuang Wu, Chang Wu Yu, Chun Hung Kuo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationWireless Algorithms, Systems, and Applications - First International Conference, WASA 2006, Proceedings
PublisherSpringer Verlag
Pages609-619
Number of pages11
ISBN (Print)3540371893, 9783540371892
Publication statusPublished - 2006 Jan 1
EventFirst International Conference on Wireless Algorithms, Systems, and Applications, WASA 2006 - Xi'an, China
Duration: 2006 Aug 152006 Aug 17

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4138 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherFirst International Conference on Wireless Algorithms, Systems, and Applications, WASA 2006
CountryChina
CityXi'an
Period06-08-1506-08-17

Fingerprint

Dynamic Routing
Ad hoc networks
Ad Hoc Networks
Routing protocols
Routing Protocol
Path
Routing
Vertex of a graph
Network routing
Mobile ad hoc networks
Packet Routing
Data communication systems
Telecommunication links
Network Protocols
Time delay
Delay Time
Mobile Ad Hoc Networks
Data Transmission
Topology
Network Topology

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Cheng, R. H., Wu, T. K., Yu, C. W., & Kuo, C. H. (2006). An altitude based dynamic routing scheme for ad hoc networks. In Wireless Algorithms, Systems, and Applications - First International Conference, WASA 2006, Proceedings (pp. 609-619). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4138 LNCS). Springer Verlag.
Cheng, Rei Heng ; Wu, Tung Kuang ; Yu, Chang Wu ; Kuo, Chun Hung. / An altitude based dynamic routing scheme for ad hoc networks. Wireless Algorithms, Systems, and Applications - First International Conference, WASA 2006, Proceedings. Springer Verlag, 2006. pp. 609-619 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{71da5d6f18da4fd6b5cf68900febb437,
title = "An altitude based dynamic routing scheme for ad hoc networks",
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.",
author = "Cheng, {Rei Heng} and Wu, {Tung Kuang} and Yu, {Chang Wu} and Kuo, {Chun Hung}",
year = "2006",
month = "1",
day = "1",
language = "English",
isbn = "3540371893",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "609--619",
booktitle = "Wireless Algorithms, Systems, and Applications - First International Conference, WASA 2006, Proceedings",
address = "Germany",

}

Cheng, RH, Wu, TK, Yu, CW & Kuo, CH 2006, An altitude based dynamic routing scheme for ad hoc networks. in Wireless Algorithms, Systems, and Applications - First International Conference, WASA 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4138 LNCS, Springer Verlag, pp. 609-619, First International Conference on Wireless Algorithms, Systems, and Applications, WASA 2006, Xi'an, China, 06-08-15.

An altitude based dynamic routing scheme for ad hoc networks. / Cheng, Rei Heng; Wu, Tung Kuang; Yu, Chang Wu; Kuo, Chun Hung.

Wireless Algorithms, Systems, and Applications - First International Conference, WASA 2006, Proceedings. Springer Verlag, 2006. p. 609-619 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4138 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - An altitude based dynamic routing scheme for ad hoc networks

AU - Cheng, Rei Heng

AU - Wu, Tung Kuang

AU - Yu, Chang Wu

AU - Kuo, Chun Hung

PY - 2006/1/1

Y1 - 2006/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33749673460&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749673460&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33749673460

SN - 3540371893

SN - 9783540371892

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 609

EP - 619

BT - Wireless Algorithms, Systems, and Applications - First International Conference, WASA 2006, Proceedings

PB - Springer Verlag

ER -

Cheng RH, Wu TK, Yu CW, Kuo CH. An altitude based dynamic routing scheme for ad hoc networks. In Wireless Algorithms, Systems, and Applications - First International Conference, WASA 2006, Proceedings. Springer Verlag. 2006. p. 609-619. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).