Unidirectional Link-State Routing With Propagation Control

Abstract

Abstract Unidirectional links can occur in wireless networks and mixed-media networks. However, the vast majority of routing algorithms proposed to date require bidirectional links to operate. We present an efficient link-state routing algorithm, which we call ULPC, that operates with unidirectional links. ULPC is based on the concept of inclusive cycle of a link, which is the distance that link-state updates about the link must propagate to ensure correct routing within the network. ULPC incrementally disseminates and selectively utilizes unidirectional link-state information to build correct routing tables. ULPC is verified to be correct. Simulations on a 20-node network with unidirectional links show that ULPC is superior over the traditional link-state routing algorithms relying on topology broadcast.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2000
Accession Number
ADA461672

Entities

People

  • J.J. Garcia-Luna-Aceves
  • Lichun Bao

Organizations

  • University of California, Santa Cruz

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Communication Networks
  • Communication Systems
  • Computations
  • Computer Science
  • Electronic Mail
  • Engineering
  • Information Operations
  • Network Topology
  • Networks
  • Routing Protocols
  • Sequences
  • Simulations
  • Topology
  • Unidirectional
  • Wireless Networks

Fields of Study

  • Computer science

Readers

  • Neural Network Machine Learning.
  • Radio communications and signal processing.