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

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.