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

Masato Saito, Hiroto Aida, Yoshito Tobe, Hideyuki Tokuda

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

11 Citations (Scopus)

Abstract

This paper describes the design, implementation, and evaluation of a proximity-based dynamic path shortening scheme, called DPS. In DPS, active route paths adapt dynamically to node mobility based on the "local" link quality estimation at each own node, without exchanging periodic control packets such as Hello packets. Each node monitors its own local link quality only when receiving packets and estimates whether to enter the "proximity" of the neighbor node to shorten active paths in a distributed manner. Simulation results of DPS in several scenarios of various node mobility and traffic flows reveal that adding DPS to DSR and AODV (conventional prominent on-demand ad hoc routing protocols) significantly reduces the end-to-end packet latency up to 50-percent and also the number of routing packets up to 70-percent over DSR, particularly in heavy traffic cases. We also demonstrate the more simulation results obtained by using our two novel mobility models which generate realistic node mobility: Random Orientation Mobility and Random Escape Mobility models. Finally, simple performance experiments using DPS implementation on FreeBSD OS demonstrate that DPS shortens active routes in the order of milliseconds (about 5 ms).

Original languageEnglish
Title of host publicationProceedings - International Conference on Distributed Computing Systems
Pages390-397
Number of pages8
Volume24
Publication statusPublished - 2004
EventProceedings - 24th International Conference on Distributed Computing Systems - Hachioji, Tokyo, Japan
Duration: 2004 Mar 242004 Mar 26

Other

OtherProceedings - 24th International Conference on Distributed Computing Systems
CountryJapan
CityHachioji, Tokyo
Period04/3/2404/3/26

Fingerprint

Ad hoc networks
Routing protocols
Experiments

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Saito, M., Aida, H., Tobe, Y., & Tokuda, H. (2004). A proximity-based dynamic path shortening scheme for ubiquitous ad hoc networks. In Proceedings - International Conference on Distributed Computing Systems (Vol. 24, pp. 390-397)

A proximity-based dynamic path shortening scheme for ubiquitous ad hoc networks. / Saito, Masato; Aida, Hiroto; Tobe, Yoshito; Tokuda, Hideyuki.

Proceedings - International Conference on Distributed Computing Systems. Vol. 24 2004. p. 390-397.

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

Saito, M, Aida, H, Tobe, Y & Tokuda, H 2004, A proximity-based dynamic path shortening scheme for ubiquitous ad hoc networks. in Proceedings - International Conference on Distributed Computing Systems. vol. 24, pp. 390-397, Proceedings - 24th International Conference on Distributed Computing Systems, Hachioji, Tokyo, Japan, 04/3/24.
Saito M, Aida H, Tobe Y, Tokuda H. A proximity-based dynamic path shortening scheme for ubiquitous ad hoc networks. In Proceedings - International Conference on Distributed Computing Systems. Vol. 24. 2004. p. 390-397
Saito, Masato ; Aida, Hiroto ; Tobe, Yoshito ; Tokuda, Hideyuki. / A proximity-based dynamic path shortening scheme for ubiquitous ad hoc networks. Proceedings - International Conference on Distributed Computing Systems. Vol. 24 2004. pp. 390-397
@inproceedings{e45b98a6cb8d49318d27da926ba4e583,
title = "A proximity-based dynamic path shortening scheme for ubiquitous ad hoc networks",
abstract = "This paper describes the design, implementation, and evaluation of a proximity-based dynamic path shortening scheme, called DPS. In DPS, active route paths adapt dynamically to node mobility based on the {"}local{"} link quality estimation at each own node, without exchanging periodic control packets such as Hello packets. Each node monitors its own local link quality only when receiving packets and estimates whether to enter the {"}proximity{"} of the neighbor node to shorten active paths in a distributed manner. Simulation results of DPS in several scenarios of various node mobility and traffic flows reveal that adding DPS to DSR and AODV (conventional prominent on-demand ad hoc routing protocols) significantly reduces the end-to-end packet latency up to 50-percent and also the number of routing packets up to 70-percent over DSR, particularly in heavy traffic cases. We also demonstrate the more simulation results obtained by using our two novel mobility models which generate realistic node mobility: Random Orientation Mobility and Random Escape Mobility models. Finally, simple performance experiments using DPS implementation on FreeBSD OS demonstrate that DPS shortens active routes in the order of milliseconds (about 5 ms).",
author = "Masato Saito and Hiroto Aida and Yoshito Tobe and Hideyuki Tokuda",
year = "2004",
language = "English",
volume = "24",
pages = "390--397",
booktitle = "Proceedings - International Conference on Distributed Computing Systems",

}

TY - GEN

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

AU - Saito, Masato

AU - Aida, Hiroto

AU - Tobe, Yoshito

AU - Tokuda, Hideyuki

PY - 2004

Y1 - 2004

N2 - This paper describes the design, implementation, and evaluation of a proximity-based dynamic path shortening scheme, called DPS. In DPS, active route paths adapt dynamically to node mobility based on the "local" link quality estimation at each own node, without exchanging periodic control packets such as Hello packets. Each node monitors its own local link quality only when receiving packets and estimates whether to enter the "proximity" of the neighbor node to shorten active paths in a distributed manner. Simulation results of DPS in several scenarios of various node mobility and traffic flows reveal that adding DPS to DSR and AODV (conventional prominent on-demand ad hoc routing protocols) significantly reduces the end-to-end packet latency up to 50-percent and also the number of routing packets up to 70-percent over DSR, particularly in heavy traffic cases. We also demonstrate the more simulation results obtained by using our two novel mobility models which generate realistic node mobility: Random Orientation Mobility and Random Escape Mobility models. Finally, simple performance experiments using DPS implementation on FreeBSD OS demonstrate that DPS shortens active routes in the order of milliseconds (about 5 ms).

AB - This paper describes the design, implementation, and evaluation of a proximity-based dynamic path shortening scheme, called DPS. In DPS, active route paths adapt dynamically to node mobility based on the "local" link quality estimation at each own node, without exchanging periodic control packets such as Hello packets. Each node monitors its own local link quality only when receiving packets and estimates whether to enter the "proximity" of the neighbor node to shorten active paths in a distributed manner. Simulation results of DPS in several scenarios of various node mobility and traffic flows reveal that adding DPS to DSR and AODV (conventional prominent on-demand ad hoc routing protocols) significantly reduces the end-to-end packet latency up to 50-percent and also the number of routing packets up to 70-percent over DSR, particularly in heavy traffic cases. We also demonstrate the more simulation results obtained by using our two novel mobility models which generate realistic node mobility: Random Orientation Mobility and Random Escape Mobility models. Finally, simple performance experiments using DPS implementation on FreeBSD OS demonstrate that DPS shortens active routes in the order of milliseconds (about 5 ms).

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

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

M3 - Conference contribution

VL - 24

SP - 390

EP - 397

BT - Proceedings - International Conference on Distributed Computing Systems

ER -