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 - Jan 1 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

Fingerprint

Random Access
Multiplicity
Throughput
Collision
Communication Channels
Sharing

ASJC Scopus subject areas

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

Cite this

Panwar, S. (1991). On achieving a throughput of one for a random access channel with collisions of known multiplicity. In Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991 [695393] (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.1991.695393

On achieving a throughput of one for a random access channel with collisions of known multiplicity. / Panwar, Shivendra.

Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991. Institute of Electrical and Electronics Engineers Inc., 1991. 695393 (IEEE International Symposium on Information Theory - Proceedings).

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

Panwar, S 1991, On achieving a throughput of one for a random access channel with collisions of known multiplicity. in Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991., 695393, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., 1991 IEEE International Symposium on Information Theory, ISIT 1991, Budapest, Hungary, 6/24/91. https://doi.org/10.1109/ISIT.1991.695393
Panwar S. On achieving a throughput of one for a random access channel with collisions of known multiplicity. In Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991. Institute of Electrical and Electronics Engineers Inc. 1991. 695393. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.1991.695393
Panwar, Shivendra. / On achieving a throughput of one for a random access channel with collisions of known multiplicity. Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991. Institute of Electrical and Electronics Engineers Inc., 1991. (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{46df0cf95c764408943cc44ee945dd32,
title = "On achieving a throughput of one for a random access channel with collisions of known multiplicity",
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.",
author = "Shivendra Panwar",
year = "1991",
month = "1",
day = "1",
doi = "10.1109/ISIT.1991.695393",
language = "English (US)",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
booktitle = "Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991",

}

TY - GEN

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

AU - Panwar, Shivendra

PY - 1991/1/1

Y1 - 1991/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=34648833359&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34648833359&partnerID=8YFLogxK

U2 - 10.1109/ISIT.1991.695393

DO - 10.1109/ISIT.1991.695393

M3 - Conference contribution

T3 - IEEE International Symposium on Information Theory - Proceedings

BT - Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991

PB - Institute of Electrical and Electronics Engineers Inc.

ER -