An Efficient Random Access Algorithm for Packet Broadcast Channels with Long Propagation Delays.

Abstract

This paper introduces and analyzes an efficient algorithm for the random accessing of a broadcast channel by a large number of packet-transmitting, bursty users. The algorithm uses a mini-slot overhead, per packet, to extract detailed information regarding possible packet collisions. In the event of a collision, this information is used by the algorithm for accelerating the collision resolution process. The maximum stable throughput and the mean packet delay induced by the algorithm are evaluated via a systematic analysis method. The packet delay characteristics indicate that the proposed algorithm is well suited for operation on satellite channels, over a wide range of input traffic rates. Keywords: Feedback; throughput. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1985
Accession Number
ADA162152

Entities

People

  • L. Merakos
  • M. Georgiopoulos
  • P. Papantoni-kazakos

Organizations

  • University of Connecticut

Tags

Communities of Interest

  • Space

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Satellites
  • Channel Capacity
  • Coefficients
  • Collisions
  • Communication Channels
  • Computations
  • Computer Science
  • Electrical Engineering
  • Engineering
  • Multiple Access
  • Numbers
  • Probability
  • Probability Distributions
  • Random Variables
  • Real Numbers
  • Sequences

Fields of Study

  • Computer science

Readers

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

Technology Areas

  • Space