An Efficient Routing Protocol for Wireless Networks

Abstract

We present the wireless routing protocol (WRP). In WRP, routing nodes communicate the distance and second-to-last hop for each destination. WRP reduces the number of cases in which a temporary routing loop can occur, which accounts for its fast convergence properties. A detailed proof of correctness is presented and its performance is compared by simulation with the performance of the distributed Bellman-Ford algorithm (DBF), DUAL (a loop-free distance-vector algorithm) and an ideal link-state algorithm (ILS), which represent the state of the art of internet routing. The simulation results indicate that WRP is the most efficient of the alternatives analyzed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2006
Accession Number
ADA457192

Entities

People

  • J.J. Garcia-Luna-Aceves
  • Shree Murthy

Organizations

  • University of California, Santa Cruz

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computer Networks
  • Computers
  • Convergence
  • Internet
  • Internet Routing
  • Mesh Networks
  • Mobile Phones
  • Network Architecture
  • Network Simulation
  • Network Topology
  • Networks
  • Recovery
  • Routing Protocols
  • Simulations
  • Time Intervals
  • Wireless Networks

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Medical Imaging.