Conflict resolution protocols for random multiple-access channels with binary feedback
Abstract
The problem of conflict resolution in a random multiple-access, time-slotted, packet-switched channel with binary feedback is considered. Conflict resolution algorithms (CRA) for two different types of binary feedback which informs the users only about whether or not there was a collision in the previous slot achieves a throughput of 0.442. The CRA proposed for the case in which the feedback informs the users about whether or not the previous slot was empty achieves a throughput of 0.279.
- Publication:
-
IN: Annual Allerton Conference on Communication
- Pub Date:
- 1982
- Bibcode:
- 1982ccc..proc..404B
- Keywords:
-
- Binary Data;
- Channel Capacity;
- Feedback Control;
- Packet Switching;
- Random Access;
- Time Division Multiple Access;
- Algorithms;
- Data Transmission;
- Fail-Safe Systems;
- Multichannel Communication;
- Resources Management;
- Stochastic Processes;
- Transmission Efficiency;
- Communications and Radar