Multiple-Coupled Random Access Techniques for Packet Radio Networks

Abstract

The random accessing problem for packet radio networks is considered. The contention resolving tree algorithm of Capetanakis is applied to a model in which packets are transmitted by terminals and received by repeaters, with the possibility of geometries in which more than one repeater hears a single terminal. It is shown that naive applications of the tree algorithm of this multiple-coupled random access problem lead to algorithms which deadlock. A deadlock-free algorithm, restricted-entry algorithm for the multiple-coupled random access problem, is developed. The deadlock-free property is proved. An algorithm describing how new terminals join the network is presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1978
Accession Number
ADA056550

Entities

People

  • Lawrence Charles Siegel

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Communication Channels
  • Computer Communications
  • Computer Science
  • Computers
  • Electrical Engineering
  • Electronics Laboratories
  • Engineering
  • Geometry
  • Information Processing
  • Information Systems
  • Massachusetts
  • Mathematics
  • Military Research
  • Multiple Access
  • New York
  • Radio Equipment

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Computer Networking
  • Radio communications and signal processing.