On achieving a throughput of one for a random access channel with collisions of known multiplicity

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider the problem of a group of users sharing a common communication channel. The channel is slotted and the slot size corresponds to a packet length. At the end of each slot, every user is informed whether the slot was idle, contained a successful packet transmission, or experienced a collision of multiplicity k, k ≥ 2. Throughput is defined to be the expected fraction of slots with successful transmissions. It has been shown, via a non-constructive proof, that a throughput of one can be achieved. We will present a collision resolution algorithm (CRA) which achieves, in the limit, a throughput of one.

Original languageEnglish (US)
Title of host publicationProceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages1
ISBN (Electronic)0780300564
DOIs
StatePublished - 1991
Event1991 IEEE International Symposium on Information Theory, ISIT 1991 - Budapest, Hungary
Duration: Jun 24 1991Jun 28 1991

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1991 IEEE International Symposium on Information Theory, ISIT 1991
CountryHungary
CityBudapest
Period6/24/916/28/91

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'On achieving a throughput of one for a random access channel with collisions of known multiplicity'. Together they form a unique fingerprint.

Cite this