Efficient Routing in Packet-Radio Networks Using Link-State Information

Abstract

We present the source-tree adaptive routing (STAR) protocol, which we show through simulation experiments to be far more efficient than the Dynamic Source Routing (DSR) protocol, which has been shown to be one of the best performing on-demand routing protocols. A router in STAR communicates to its neighbors the parameters of its source routing tree, which consists of each link that the router needs to reach every destination. To conserve transmission bandwidth and energy, a router transmits changes to its source routing tree only when the router detects new destinations, the possibility of looping, or the possibility of node failures or network partitions.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1999
Accession Number
ADA458849

Entities

People

  • J.J. Garcia-Luna-Aceves
  • Marcelo Spohn

Organizations

  • University of California, Santa Cruz

Tags

Communities of Interest

  • Counter WMD
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Ad Hoc Networks
  • Algorithms
  • Bandwidth
  • Computer Networks
  • Mesh Networks
  • Network Protocols
  • Network Topology
  • Networks
  • Routing Protocols
  • Sequences
  • Simulations
  • Simulators
  • Topology
  • Wireless Networks
  • Workload

Fields of Study

  • Computer science

Readers

  • Computer Networking