A Routing Protocol for Packet Radio Networks

Abstract

The authors present a new distance-vector routing protocol for a packet radio network. The new distributed routing protocol, Wireless Routing Protocol (WRP), works on the notion of second-to-last hop node to a destination. WRP reduces the number of cases in which a temporary routing loop can occur and also provides a mechanism for the reliable transmission of update messages. The performance of WRP has been compared quantitatively by simulations with that of distributed Bellman-Ford (DBF), DUAL (a loop-free, distance-vector algorithm), and an ideal link-state algorithm (ILS) that represents the state of the art of Internet routing in a highly dynamic environment. The simulation results indicate that WRP is the most efficient of the algorithms simulated in a wireless environment.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1995
Accession Number
ADA457720

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
  • Engineering
  • Environment
  • Internet Routing
  • Mesh Networks
  • Mobility
  • Network Architecture
  • Network Protocols
  • Network Topology
  • Networks
  • Recovery
  • Retransmission
  • Routing Protocols
  • Simulations
  • Wireless Networks

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Forest Ecology