A Proximity-Based Path Compression Protocol for Mobile Ad Hoc Networks

Masato SAITO; Hiroto AIDA; Yoshito TOBE; Hideyuki TOKUDA

A Proximity-Based Path Compression Protocol for Mobile Ad Hoc Networks

Masato SAITO, Hiroto AIDA, Yoshito TOBE, Hideyuki TOKUDA

Full Text Views

0

Share
Cite this

Summary :

This paper presents a path compression protocol for on-demand ad hoc network routing protocols, which is called dynamic path shortening (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 messages. 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 which is the conventional prominent on-demand ad hoc routing protocol significantly reduces the end-to-end packet latency up to 50-percent and also the number of routing packets up to 70-percent over the pure DSR, in heavy traffic cases. We also demonstrate the other simulation results obtained by using our two novel mobility models which generate more realistic node mobility than the standard random waypoint mobility model: 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).

Publication: IEICE TRANSACTIONS on Communications Vol.E87-B No.9 pp.2484-2492

Publication Date: 2004/09/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Networking Technologies for Mobile Internet Systems)

Category: Ad Hoc Network

Cite this

Copy

Masato SAITO, Hiroto AIDA, Yoshito TOBE, Hideyuki TOKUDA, "A Proximity-Based Path Compression Protocol for Mobile Ad Hoc Networks" in IEICE TRANSACTIONS on Communications, vol. E87-B, no. 9, pp. 2484-2492, September 2004, doi: .
Abstract: This paper presents a path compression protocol for on-demand ad hoc network routing protocols, which is called dynamic path shortening (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 messages. 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 which is the conventional prominent on-demand ad hoc routing protocol significantly reduces the end-to-end packet latency up to 50-percent and also the number of routing packets up to 70-percent over the pure DSR, in heavy traffic cases. We also demonstrate the other simulation results obtained by using our two novel mobility models which generate more realistic node mobility than the standard random waypoint mobility model: 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).
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e87-b_9_2484/_p

Copy

@ARTICLE{e87-b_9_2484,
author={Masato SAITO, Hiroto AIDA, Yoshito TOBE, Hideyuki TOKUDA, },
journal={IEICE TRANSACTIONS on Communications},
title={A Proximity-Based Path Compression Protocol for Mobile Ad Hoc Networks},
year={2004},
volume={E87-B},
number={9},
pages={2484-2492},
abstract={This paper presents a path compression protocol for on-demand ad hoc network routing protocols, which is called dynamic path shortening (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 messages. 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 which is the conventional prominent on-demand ad hoc routing protocol significantly reduces the end-to-end packet latency up to 50-percent and also the number of routing packets up to 70-percent over the pure DSR, in heavy traffic cases. We also demonstrate the other simulation results obtained by using our two novel mobility models which generate more realistic node mobility than the standard random waypoint mobility model: 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).},
keywords={},
doi={},
ISSN={},
month={September},}

Copy

TY - JOUR
TI - A Proximity-Based Path Compression Protocol for Mobile Ad Hoc Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2484
EP - 2492
AU - Masato SAITO
AU - Hiroto AIDA
AU - Yoshito TOBE
AU - Hideyuki TOKUDA
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2004
AB - This paper presents a path compression protocol for on-demand ad hoc network routing protocols, which is called dynamic path shortening (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 messages. 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 which is the conventional prominent on-demand ad hoc routing protocol significantly reduces the end-to-end packet latency up to 50-percent and also the number of routing packets up to 70-percent over the pure DSR, in heavy traffic cases. We also demonstrate the other simulation results obtained by using our two novel mobility models which generate more realistic node mobility than the standard random waypoint mobility model: 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).
ER -