Limited Sensing Random Multiple Access Using Binary Feedback.

Abstract

The authors consider the random-accessing problem of a single, collision-type, slotted, packet-switched communication channel by a large number of independent, data transmitting bursty users. They propose and analyze an easy-to-implement algorithm under the realistic assumption that each user inspects the channel outcome feedback only whenever he is blocked. Assumed is binary feedback which informs the users only about whether or not there was a collision in the previous slot. It is shown that the algorithm results in finite average delays for transmission at rates less than 0.36 packets per channel slot, and an exact upper bound for the average delay is given. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1983
Accession Number
ADA129251

Entities

People

  • Demetrios Kazakos
  • Lazaros Merakos

Organizations

  • University of Virginia

Tags

Communities of Interest

  • Biomedical
  • Space

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Business Administration
  • Collisions
  • Communication Channels
  • Computer Communications
  • Electrical Engineering
  • Engineering
  • Information Science
  • Materials Science
  • Mathematics
  • Multiple Access
  • Probability
  • Random Variables
  • Schools
  • Scientific Research
  • Universities

Fields of Study

  • Computer science

Readers

  • Radio communications and signal processing.