Analysis of Routing Strategies for Packet Radio Networks

Abstract

This paper presents a comparative analysis of network routing schemes for large-scale packet radio networks (PRNET) with mobile nodes. This analysis is aimed at determining two things: 1) the time required to obtain consistent routing tables in all the nodes of a PRNET after topological changes, and 2) the optimality of the routing decisions made by a node in terms of the length of the paths chosen to remote destinations. We make minimal assumptions about the routing protocols used and the topology of the PRNET to obtain upper bounds on the length of shortest paths and on the time required for routing-table updating after topological changes in PRNETs with hierarchical organizations. Such bounds are used to analyze the optimization of network topology and as guidelines for the design of hierarchical routing schemes for large PRNETs. Such results extend previous ones obtained by Kamoun (KAMO-76), Hagouel (HAGO-83), and Baratz and Jaffe (BARA-83) for land-based networks.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1984
Accession Number
ADA221468

Entities

People

  • J. J. Garcia-luna-aceves

Organizations

  • SRI International

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Boundaries
  • Classification
  • Computer Science
  • Contracts
  • Contrast
  • Convergence
  • Diameters
  • Equations
  • Numbers
  • Optimization
  • Radio Links
  • Security
  • Stationary
  • Topology
  • United States
  • United States Government

Fields of Study

  • Computer science

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Neural Network Machine Learning.
  • Radio communications and signal processing.