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 -