OR2: A path tuning algorithm for routing in ad hoc networks

M. Saito, H. Aida, Y. Tobe, Y. Tamura, H. Tokuda

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

2 Citations (Scopus)

Abstract

This paper presents "OR2", an adaptive path tuning scheme for mobile ad hoc networks. In OR2, the active path adapts dynamically to node mobility without any link failures based on the local link quality. Most conventional routing protocols accommodate the change of network topology only when the link fails. Unless the movement of intermediate nodes leads to any link failures, they cannot adapt to the network topology even if other routes with less hop count become available. In contrast to these protocols, OR2 reduces the hop count of an active route while data packets are sent without link disconnection. Specifically, by introducing the notion of proximity that indicates the nearness of two communicating nodes, OR2 skips the upstream node in a proximity area and continues to shorten an active route as possible. For delay sensitive TCP flows, reducing the number of hops and path delay significantly improves the performance of TCP. We have implemented OR2 as an extension to DSR on FreeBSD. The experimental results have shown that OR2 is effective in enhancing TCP throughput and reducing end-to-end delay for all relevant flows.

Original languageEnglish
Title of host publicationConference on Local Computer Networks
Pages560-567
Number of pages8
Publication statusPublished - 2001
Event26th Conference on Local Computer Networks LCN 2001 - Tampa, FL, United States
Duration: 2001 Nov 142001 Nov 16

Other

Other26th Conference on Local Computer Networks LCN 2001
CountryUnited States
CityTampa, FL
Period01/11/1401/11/16

Fingerprint

Ad hoc networks
Tuning
Topology
Mobile ad hoc networks
Routing protocols
Throughput
Network protocols

ASJC Scopus subject areas

  • Software
  • Electrical and Electronic Engineering

Cite this

Saito, M., Aida, H., Tobe, Y., Tamura, Y., & Tokuda, H. (2001). OR2: A path tuning algorithm for routing in ad hoc networks. In Conference on Local Computer Networks (pp. 560-567)

OR2 : A path tuning algorithm for routing in ad hoc networks. / Saito, M.; Aida, H.; Tobe, Y.; Tamura, Y.; Tokuda, H.

Conference on Local Computer Networks. 2001. p. 560-567.

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

Saito, M, Aida, H, Tobe, Y, Tamura, Y & Tokuda, H 2001, OR2: A path tuning algorithm for routing in ad hoc networks. in Conference on Local Computer Networks. pp. 560-567, 26th Conference on Local Computer Networks LCN 2001, Tampa, FL, United States, 01/11/14.
Saito M, Aida H, Tobe Y, Tamura Y, Tokuda H. OR2: A path tuning algorithm for routing in ad hoc networks. In Conference on Local Computer Networks. 2001. p. 560-567
Saito, M. ; Aida, H. ; Tobe, Y. ; Tamura, Y. ; Tokuda, H. / OR2 : A path tuning algorithm for routing in ad hoc networks. Conference on Local Computer Networks. 2001. pp. 560-567
@inproceedings{cf968967c1194e3eb7650444df102602,
title = "OR2: A path tuning algorithm for routing in ad hoc networks",
abstract = "This paper presents {"}OR2{"}, an adaptive path tuning scheme for mobile ad hoc networks. In OR2, the active path adapts dynamically to node mobility without any link failures based on the local link quality. Most conventional routing protocols accommodate the change of network topology only when the link fails. Unless the movement of intermediate nodes leads to any link failures, they cannot adapt to the network topology even if other routes with less hop count become available. In contrast to these protocols, OR2 reduces the hop count of an active route while data packets are sent without link disconnection. Specifically, by introducing the notion of proximity that indicates the nearness of two communicating nodes, OR2 skips the upstream node in a proximity area and continues to shorten an active route as possible. For delay sensitive TCP flows, reducing the number of hops and path delay significantly improves the performance of TCP. We have implemented OR2 as an extension to DSR on FreeBSD. The experimental results have shown that OR2 is effective in enhancing TCP throughput and reducing end-to-end delay for all relevant flows.",
author = "M. Saito and H. Aida and Y. Tobe and Y. Tamura and H. Tokuda",
year = "2001",
language = "English",
pages = "560--567",
booktitle = "Conference on Local Computer Networks",

}

TY - GEN

T1 - OR2

T2 - A path tuning algorithm for routing in ad hoc networks

AU - Saito, M.

AU - Aida, H.

AU - Tobe, Y.

AU - Tamura, Y.

AU - Tokuda, H.

PY - 2001

Y1 - 2001

N2 - This paper presents "OR2", an adaptive path tuning scheme for mobile ad hoc networks. In OR2, the active path adapts dynamically to node mobility without any link failures based on the local link quality. Most conventional routing protocols accommodate the change of network topology only when the link fails. Unless the movement of intermediate nodes leads to any link failures, they cannot adapt to the network topology even if other routes with less hop count become available. In contrast to these protocols, OR2 reduces the hop count of an active route while data packets are sent without link disconnection. Specifically, by introducing the notion of proximity that indicates the nearness of two communicating nodes, OR2 skips the upstream node in a proximity area and continues to shorten an active route as possible. For delay sensitive TCP flows, reducing the number of hops and path delay significantly improves the performance of TCP. We have implemented OR2 as an extension to DSR on FreeBSD. The experimental results have shown that OR2 is effective in enhancing TCP throughput and reducing end-to-end delay for all relevant flows.

AB - This paper presents "OR2", an adaptive path tuning scheme for mobile ad hoc networks. In OR2, the active path adapts dynamically to node mobility without any link failures based on the local link quality. Most conventional routing protocols accommodate the change of network topology only when the link fails. Unless the movement of intermediate nodes leads to any link failures, they cannot adapt to the network topology even if other routes with less hop count become available. In contrast to these protocols, OR2 reduces the hop count of an active route while data packets are sent without link disconnection. Specifically, by introducing the notion of proximity that indicates the nearness of two communicating nodes, OR2 skips the upstream node in a proximity area and continues to shorten an active route as possible. For delay sensitive TCP flows, reducing the number of hops and path delay significantly improves the performance of TCP. We have implemented OR2 as an extension to DSR on FreeBSD. The experimental results have shown that OR2 is effective in enhancing TCP throughput and reducing end-to-end delay for all relevant flows.

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

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

M3 - Conference contribution

AN - SCOPUS:0035215154

SP - 560

EP - 567

BT - Conference on Local Computer Networks

ER -