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

Shivendra S. Panwar

doi:10.1109/ISIT.1991.695393

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

Shivendra S. Panwar

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Proceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991
Publisher	Institute of Electrical and Electronics Engineers Inc.
Number of pages	1
ISBN (Electronic)	0780300564
DOIs	https://doi.org/10.1109/ISIT.1991.695393
State	Published - 1991
Event	1991 IEEE International Symposium on Information Theory, ISIT 1991 - Budapest, Hungary Duration: Jun 24 1991 → Jun 28 1991

Publication series

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

Conference

Conference	1991 IEEE International Symposium on Information Theory, ISIT 1991
Country	Hungary
City	Budapest
Period	6/24/91 → 6/28/91

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.1991.695393

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

Panwar, S. 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 S.

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 proceeding › Conference contribution

Panwar, SS 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 SS. 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

@inproceedings{da47bcfffd0541c8bf3b78c380b03488,

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 = "Panwar, {Shivendra S.}",

year = "1991",

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",

note = "1991 IEEE International Symposium on Information Theory, ISIT 1991 ; Conference date: 24-06-1991 Through 28-06-1991",

}

TY - GEN

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

AU - Panwar, Shivendra S.

PY - 1991

Y1 - 1991

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

AN - SCOPUS:34648833359

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.

T2 - 1991 IEEE International Symposium on Information Theory, ISIT 1991

Y2 - 24 June 1991 through 28 June 1991

ER -