A New Approach to On-Demand Loop-Free Routing in Ad Hoc Networks

Abstract

A new protocol is presented for on-demand loop-free routing in ad hoc networks. The new protocol called labeled distance routing (LDR) protocol uses a distance invariant to establish all ordering criterion and per-destination sequence numbers to reset the invariant resulting in loop-freedom at every instant. The distance invariant allows nodes to change their next hops or distances to destinations without creating routing-table loops. The destination sequence number which only the destination may increment permits nodes to reset the values of their distance invariants. The performance of LDR is compared against the performance of three other protocols that are representative of the state-of-the-art namely AODV, DSR, and OLSR.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2003
Accession Number
ADA461647

Entities

People

  • Charles E. Perkins
  • J.J. Garcia-Luna-Aceves
  • Marc Mosko

Organizations

  • University of California, Santa Cruz

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Abstracts
  • Ad Hoc Networks
  • California
  • Computers
  • Distributed Computing
  • Engineering
  • Hard Copy
  • Information Operations
  • Mesh Networks
  • Network Protocols
  • Networks
  • Schools
  • Sequences
  • Universities

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Statistical inference.