OR2: A Path Tuning Algorithm for Routing in Ad Hoc Networks

  • Authors:
  • Masato Saito;Hiroto Aida;Yoshito Tobe;Yosuke Tamura;Hideyuki Tokuda

  • Affiliations:
  • -;-;-;-;-

  • Venue:
  • LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents \OR2", an adaptive path tuningscheme for mobile ad hoc networks.In OR2, the activepath adapts dynamically to node mobility without anylink failures based on the local link quality.Most con-ventional routing protocols accommodate the change ofnetwork topology only when the link fails.Unless themovement of intermediate nodes leads to any link fail-ures, they cannot adapt to the network topology even ifother routes with less hop count become available.Incontrast to these protocols, OR2 reduces the hop countof an active route while data packets are sent with-out link disconnection.Specifically, by introducing thenotion of proximity that indicates the nearness of twocommunicating nodes, OR2 skips the upstream node ina proximity area andcontinues to shorten an activeroute as possible.For delay sensitive TCP fows, reduc-ing the number of hops and path delay significantly im-proves the performance of TCP.We have implementedOR2 as an extension to DSR on FreeBSD. The experi-mental results have shown that OR2 is effective in en-hancingTCP throughput and reducing end-to-end delayfor all relevant flows.