Bypass routing: An on-demand local recovery protocol for ad hoc networks

Cigdem Sengul, Robin Kravets

Research output: Contribution to journalArticlepeer-review

Abstract

On-demand routing protocols for ad hoc networks reduce the cost of routing in high mobility environments. However, route discovery in on-demand routing is typically performed via network-wide flooding, which consumes a substantial amount of bandwidth. In this paper, we present bypass routing, a local recovery protocol that aims to reduce the frequency of route request floods triggered by broken routes. Specifically, when a broken link is detected, a node patches the affected route using local information, which is acquired on-demand, and thereby bypasses the broken link. We implemented SLR (Source Routing with Local Recovery) as a prototype of our approach. Simulation studies show that SLR achieves efficient and effective local recovery while maintaining acceptable overhead.

Original languageEnglish (US)
Pages (from-to)380-397
Number of pages18
JournalAd Hoc Networks
Volume4
Issue number3
DOIs
StatePublished - May 2006

Keywords

  • Ad hoc networks
  • Local recovery
  • On-demand routing

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Bypass routing: An on-demand local recovery protocol for ad hoc networks'. Together they form a unique fingerprint.

Cite this