Robustness Properties of FS-ALOHA++: A Contention Resolution Algorithm for Dynamic Bandwidth Allocation

This paper studies the robustness of FS-ALOHA++, a contention resolution algorithm used to reserve uplink bandwidth in wireless centralized LANs. The model takes into account errors on the contention channel, the capture effect and allows packets to arrive according to a general Markovian arrival process. Where channel errors and capture are typical for a wireless channel. Several analytical models are developed, using matrix analytical methods, allowing us to calculate the delay distribution of a request packet under different circumstances. Using these analytical models, we demonstrate that both FS-ALOHA and FS-ALOHA++ perform well under bursty and correlated arrivals. FS-ALOHA++ is shown to be more robust towards errors and capture. Moreover, it is concluded that implementing multiple instances of FS-ALOHA++ improves significantly the delays and sensitivity of the algorithm towards errors.