Mercury-like routing for high mobility wireless ad hoc networks

Ai Hua Ho, Yao-Hua Ho, Kien Hua

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

4 Citations (Scopus)

Abstract

Supporting high mobility is essential to mobile ad hoc networks in a wide range of emerging applications such as vehicular networks. Communication links of an established communication path that extends between source and destination nodes are often broken under a high mobility environment. Although a new communication route can be established when a break in the communication path occurs, repeatedly reestablishing new routes incurs delay and substantial overhead. To address this limitation, we introduce the Communication Path abstraction in this paper. A communication path is a dynamically-created geographical area that connects the source and destination nodes. The routing functionality of a communication path is provided by the physical nodes (i.e., mobile devices) currently within the geographical region served by the path. These physical nodes take turns in forwarding data packets for the path. Since a path can be supported by many alternative nodes, this scheme is much less susceptible to node mobility. Our simulation results show the Communication Path approach can achieve several times better performance than traditional approach based on a fixed sequence of physical links.

Original languageEnglish
Title of host publicationProceedings of the 36th Annual IEEE Conference on Local Computer Networks, LCN 2011
Pages537-545
Number of pages9
DOIs
Publication statusPublished - 2011 Dec 1
Event36th Annual IEEE Conference on Local Computer Networks, LCN 2011 - Bonn, Germany
Duration: 2011 Oct 42011 Oct 7

Publication series

NameProceedings - Conference on Local Computer Networks, LCN

Other

Other36th Annual IEEE Conference on Local Computer Networks, LCN 2011
CountryGermany
CityBonn
Period11/10/411/10/7

Fingerprint

Wireless ad hoc networks
Communication
Geographical regions
Mobile ad hoc networks
Mobile devices
Telecommunication links

Keywords

  • Communication Path
  • Link Break
  • Mobile Ad-hoc Networks
  • Node Mobility

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Ho, A. H., Ho, Y-H., & Hua, K. (2011). Mercury-like routing for high mobility wireless ad hoc networks. In Proceedings of the 36th Annual IEEE Conference on Local Computer Networks, LCN 2011 (pp. 537-545). [6115505] (Proceedings - Conference on Local Computer Networks, LCN). https://doi.org/10.1109/LCN.2011.6115505

Mercury-like routing for high mobility wireless ad hoc networks. / Ho, Ai Hua; Ho, Yao-Hua; Hua, Kien.

Proceedings of the 36th Annual IEEE Conference on Local Computer Networks, LCN 2011. 2011. p. 537-545 6115505 (Proceedings - Conference on Local Computer Networks, LCN).

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

Ho, AH, Ho, Y-H & Hua, K 2011, Mercury-like routing for high mobility wireless ad hoc networks. in Proceedings of the 36th Annual IEEE Conference on Local Computer Networks, LCN 2011., 6115505, Proceedings - Conference on Local Computer Networks, LCN, pp. 537-545, 36th Annual IEEE Conference on Local Computer Networks, LCN 2011, Bonn, Germany, 11/10/4. https://doi.org/10.1109/LCN.2011.6115505
Ho AH, Ho Y-H, Hua K. Mercury-like routing for high mobility wireless ad hoc networks. In Proceedings of the 36th Annual IEEE Conference on Local Computer Networks, LCN 2011. 2011. p. 537-545. 6115505. (Proceedings - Conference on Local Computer Networks, LCN). https://doi.org/10.1109/LCN.2011.6115505
Ho, Ai Hua ; Ho, Yao-Hua ; Hua, Kien. / Mercury-like routing for high mobility wireless ad hoc networks. Proceedings of the 36th Annual IEEE Conference on Local Computer Networks, LCN 2011. 2011. pp. 537-545 (Proceedings - Conference on Local Computer Networks, LCN).
@inproceedings{08bca448f993425fa01618307c79e00f,
title = "Mercury-like routing for high mobility wireless ad hoc networks",
abstract = "Supporting high mobility is essential to mobile ad hoc networks in a wide range of emerging applications such as vehicular networks. Communication links of an established communication path that extends between source and destination nodes are often broken under a high mobility environment. Although a new communication route can be established when a break in the communication path occurs, repeatedly reestablishing new routes incurs delay and substantial overhead. To address this limitation, we introduce the Communication Path abstraction in this paper. A communication path is a dynamically-created geographical area that connects the source and destination nodes. The routing functionality of a communication path is provided by the physical nodes (i.e., mobile devices) currently within the geographical region served by the path. These physical nodes take turns in forwarding data packets for the path. Since a path can be supported by many alternative nodes, this scheme is much less susceptible to node mobility. Our simulation results show the Communication Path approach can achieve several times better performance than traditional approach based on a fixed sequence of physical links.",
keywords = "Communication Path, Link Break, Mobile Ad-hoc Networks, Node Mobility",
author = "Ho, {Ai Hua} and Yao-Hua Ho and Kien Hua",
year = "2011",
month = "12",
day = "1",
doi = "10.1109/LCN.2011.6115505",
language = "English",
isbn = "9781612849287",
series = "Proceedings - Conference on Local Computer Networks, LCN",
pages = "537--545",
booktitle = "Proceedings of the 36th Annual IEEE Conference on Local Computer Networks, LCN 2011",

}

TY - GEN

T1 - Mercury-like routing for high mobility wireless ad hoc networks

AU - Ho, Ai Hua

AU - Ho, Yao-Hua

AU - Hua, Kien

PY - 2011/12/1

Y1 - 2011/12/1

N2 - Supporting high mobility is essential to mobile ad hoc networks in a wide range of emerging applications such as vehicular networks. Communication links of an established communication path that extends between source and destination nodes are often broken under a high mobility environment. Although a new communication route can be established when a break in the communication path occurs, repeatedly reestablishing new routes incurs delay and substantial overhead. To address this limitation, we introduce the Communication Path abstraction in this paper. A communication path is a dynamically-created geographical area that connects the source and destination nodes. The routing functionality of a communication path is provided by the physical nodes (i.e., mobile devices) currently within the geographical region served by the path. These physical nodes take turns in forwarding data packets for the path. Since a path can be supported by many alternative nodes, this scheme is much less susceptible to node mobility. Our simulation results show the Communication Path approach can achieve several times better performance than traditional approach based on a fixed sequence of physical links.

AB - Supporting high mobility is essential to mobile ad hoc networks in a wide range of emerging applications such as vehicular networks. Communication links of an established communication path that extends between source and destination nodes are often broken under a high mobility environment. Although a new communication route can be established when a break in the communication path occurs, repeatedly reestablishing new routes incurs delay and substantial overhead. To address this limitation, we introduce the Communication Path abstraction in this paper. A communication path is a dynamically-created geographical area that connects the source and destination nodes. The routing functionality of a communication path is provided by the physical nodes (i.e., mobile devices) currently within the geographical region served by the path. These physical nodes take turns in forwarding data packets for the path. Since a path can be supported by many alternative nodes, this scheme is much less susceptible to node mobility. Our simulation results show the Communication Path approach can achieve several times better performance than traditional approach based on a fixed sequence of physical links.

KW - Communication Path

KW - Link Break

KW - Mobile Ad-hoc Networks

KW - Node Mobility

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

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

U2 - 10.1109/LCN.2011.6115505

DO - 10.1109/LCN.2011.6115505

M3 - Conference contribution

AN - SCOPUS:84856140146

SN - 9781612849287

T3 - Proceedings - Conference on Local Computer Networks, LCN

SP - 537

EP - 545

BT - Proceedings of the 36th Annual IEEE Conference on Local Computer Networks, LCN 2011

ER -