A limited sensing random-access algorithm with binary success-failure feedback

The authors consider the problem of random access communication over a time-slotted channel, with binary success/failure feedback. The feedback informs the users only whether or not there was a success (single transmission) in the previous slot. They propose and analyze a limited feedback-sensing algorithm (each user is required to observe the channel feedback, from the time he generates a packet to the time that this packet is successfully transmitted). The algorithm requires central control implemented by a central receiver. The limit Poisson user model is adopted. The algorithm achieves a throughput of 0.322 and induces low delays for relatively low input rates. >

[1]  Panayota Papantoni-Kazakos,et al.  A 0.487 throughput limited sensing algorithm , 1987, IEEE Trans. Inf. Theory.

[2]  Lazaros F. Merakos,et al.  A Method for the Delay Analysis of Random Multiple-Access Algorithms Whose Delay Process is Regenerative , 1987, IEEE J. Sel. Areas Commun..

[3]  Toby Berger,et al.  Poisson multiple-access contention with binary feedback , 1984, IEEE Trans. Inf. Theory.

[4]  Donald F. Towsley,et al.  Random Multiple-Access Communication and Group Testing , 1984, IEEE Trans. Commun..

[5]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

[6]  Frank Thomson Leighton,et al.  Analysis of backoff protocols for multiple access channels , 1987, STOC '87.

[7]  Robert G. Gallager,et al.  A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.

[8]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[9]  Panayota Papantoni-Kazakos,et al.  On the Relation Between the Finite and the Infinite Population Models for a Class of RAA's , 1987, IEEE Trans. Commun..

[10]  Wojciech Szpankowski.  Bounds for Queue Lengths in a Contention Packet Broadcast System , 1986, IEEE Trans. Commun..

[11]  David J. Aldous.  Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels , 1987, IEEE Trans. Inf. Theory.

[12]  D. Kazakos,et al.  On retransmission control policies in multiple-access communication networks , 1985, IEEE Transactions on Automatic Control.

[13]  Pierre A. Humblet.  On the Throughput of Channel Access Algorithms with Limited Sensing , 1986, IEEE Trans. Commun..

[14]  Frank Kelly,et al.  Stochastic Models of Computer Communication Systems , 1985 .