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

Masato Saito, Hiroto Aida, Yoshito Tobe, Hideyuki Tokuda

Research output: Contribution to conferencePaper

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
Pages390-397
Number of pages8
Publication statusPublished - 2004 Jun 1
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

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'A proximity-based dynamic path shortening scheme for ubiquitous ad hoc networks'. Together they form a unique fingerprint.

  • Cite this

    Saito, M., Aida, H., Tobe, Y., & Tokuda, H. (2004). A proximity-based dynamic path shortening scheme for ubiquitous ad hoc networks. 390-397. Paper presented at Proceedings - 24th International Conference on Distributed Computing Systems, Hachioji, Tokyo, Japan.