Bounds on the performance of protocols for a multiple-access broadcast channel
- 1 March 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 27 (2) , 145-151
- https://doi.org/10.1109/tit.1981.1056332
Abstract
A general model is presented for synchronous protocols that resolve conflicts among message transmissions to a multiple-access broadcast channel. An information-theoretic method is used now to show that if only finitely many types of conflicts can be distinguished by the protocol, utilization of the channel at rates approaching capacity is impossible. A random-coding argument is used to show that if the number of conflicting transmissions can be determined (which requires distinguishing infinitely many types of conflicts) then utilization of the channel at rates arbitrarily close to capacity can be achieved.Keywords
This publication has 4 references indexed in Scilit:
- Tree algorithms for packet broadcast channelsIEEE Transactions on Information Theory, 1979
- An Adaptive Technique for Local DistributionIEEE Transactions on Communications, 1978
- The Throughput of Packet Broadcasting ChannelsIEEE Transactions on Communications, 1977
- Ein Satz ber Untermengen einer endlichen MengeMathematische Zeitschrift, 1928