On-demand Loop-Free Routing in Ad Hoc Networks Using Source Sequence Numbers

Abstract

In any on-demand routing protocol, sources flood route requests (RREQ) to build routes to destinations, and each new RREQ is identified uniquely with a source-sequenced label (SSL) consisting of the source identifier and a locally generated sequence number. As a RREQ propagates, it creates a directed acyclic graph (DAG), because nodes relay each RREQ only once. We present the first framework for loop-free on-demand routing in ad hoc networks that is based directly on SSLs, rather than on independent mechanisms, which has been the way in which prior on-demand routing protocols have been designed. Extensive simulation results for simple protocol instantiations of our new framework operating in scenarios with 50 and 100-nodes under different traffic patterns show that our new protocols outperform AODV (Ad hoc On Demand Distance Vector), DSR (Dynamic Source Routing), and OLSR (Optimized Link State Routing).

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 2005
Accession Number
ADA457400

Entities

People

  • Hari Rangarajan
  • J.J. Garcia-Luna-Aceves

Organizations

  • University of California, Santa Cruz

Tags

Communities of Interest

  • Counter WMD

DTIC Thesaurus Topics

  • Ad Hoc Networks
  • Cellular Networks
  • Computations
  • Computers
  • Engineering
  • Floods
  • Information Operations
  • Mathematics
  • Mesh Networks
  • Military Research
  • Mobile Phones
  • Mobility
  • Networks
  • Routing Protocols
  • Sequences
  • Simulations
  • Switches

Fields of Study

  • Computer science

Readers

  • Computer Networking