A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels,

Abstract

A discrete time multiaccess channel is considered where the outcome of a transmission is either idle, success or collision, depending on the number of users transmitting simultaneously. Messages involved in a collision must be retransmitted. An efficient access allocation policy is developed for the case where infinitely many sources generate traffic in a Poisson manner and can all observe the outcomes of the previous transmissions. Its rate of success is 0.48776. Modifications are presented for the cases where the transmission times depend on the transmission outcomes and where observations are noisy. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1982
Accession Number
ADA113840

Entities

People

  • Jeannine Mosely
  • Pierre Humblet

Organizations

  • Massachusetts Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Collisions
  • Communication Systems
  • Demographic Cohorts
  • Electrical Engineering
  • Feedback
  • Intervals
  • Markov Processes
  • Multiple Access
  • Optimization
  • Probability
  • Random Variables
  • Security
  • Sequences
  • Splitting
  • Theorems
  • Throughput

Readers

  • Computer Networking
  • Mathematical Modeling and Probability Theory.