Robustness properties of FS-ALOHA++: a contention resolution algorithm for dynamic bandwidth allocation

Authors:
B. Van Houdt;C. Blondia
Affiliations:
University of Antwerp, Department of Mathematics and Computer Science, Performance Analysis of Telecommunication Systems Research Group, Universiteitsplein, 1, B-2610 Antwerp, Belgium;University of Antwerp, Department of Mathematics and Computer Science, Performance Analysis of Telecommunication Systems Research Group, Universiteitsplein, 1, B-2610 Antwerp, Belgium
Venue:
Mobile Networks and Applications
Year:
2003

Citing 5
Cited 0

Wireless information networks

Wireless information networks
A review of contention resolution algorithms for IEEE 802.14 networks

IEEE Communications Surveys & Tutorials
An investigation into HFC MAC protocols: Mechanisms, implementation, and research issues

IEEE Communications Surveys & Tutorials
Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models

Operations Research Letters
Polling- and contention-based schemes for TDMA-TDD access to wireless ATM networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.