The n-ary stack algorithm for the wireless random access channel

Authors:
Chatschik C. Bisdikian
Affiliations:
IBM T.J. Watson Research Center, Hawthorne, NY
Venue:
Mobile Networks and Applications - Special issue on channel access in wireless networks
Year:
1997

Citing 3
Cited 2

Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels

IEEE Transactions on Information Theory
Multiple access protocols: performance and analysis

Multiple access protocols: performance and analysis
MLAP: a MAC level access protocol for the HFC 802.14 network

IEEE Communications Magazine

A comprehensive approach to signaling, transmission, and traffic management for wireless ATM networks

Wireless Networks
Stable protocols for the medium access control in wireless networks

DNCOCO'09 Proceedings of the 8th WSEAS international conference on Data networks, communications, computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

The emergence of wireless and personal communication networks has brought random access protocols for packet radio networks back to the research forefronts. Most such protocols are based on the ever popular ALOHA protocol. Unfortunately, this protocol is inherently unstable and requires sophisticated schemes to stabilize it. Another class of random access schemes, called limited sensing or stack algorithms, has been proposed that is stable and allows for the dynamic incorporation of new stations into the network. In this paper, we will review the simple to implement n-ary stack algorithm, and we will study its performance under various system parameters in the presence of capture, and also in the presence of feedback errors. Finally, we will investigate its maximum system throughput under various traffic generation processes.