Routing Algorithms in All-Mobile Wireless Networks

Abstract

In networks with mobile radio nodes in which connectivity varies rapidly with time, it is necessary to develop algorithms for identifying and maintaining paths between communicating pairs of nodes. Motivated by earlier work that accomplishes such a task for data-gram packet service, we develop a similar algorithm for connection-oriented service. The algorithm establishes circuit routes for initial connection based on a mechanism of short packets exchange and takes advantage of the possibility to convert a connectivity change into a "soft" failure to maintain and re-route on-going sessions. In this paper we give a presentation of the algorithm which is currently undergoing extensive simulation-based evaluation.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1997
Accession Number
ADA440810

Entities

People

  • Anastassios Michail
  • Anthony Ephremides

Organizations

  • University of Maryland

Tags

Communities of Interest

  • Energy and Power Technologies
  • Space

DTIC Thesaurus Topics

  • Algorithms
  • Availability
  • Bandwidth
  • Communication Networks
  • Communication Systems
  • Construction
  • Decoding
  • Department Of Defense
  • Electrical Engineering
  • Maintenance
  • Military Research
  • Multiple Access
  • Network Architecture
  • Networks
  • Symbols
  • Transceivers
  • Wireless Networks

Fields of Study

  • Computer science

Readers

  • Computer Networking