Reservation MAC protocols for Ad-Hoc Networks: Analysis of the Approaches

Reservation MAC protocols for Ad-Hoc Networks: Analysis of the Approaches

Ghalem Boudour, Cédric Teyssié, Mammeri Zoubir
Copyright: © 2009 |Pages: 16
DOI: 10.4018/jbdcn.2009040104
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Multimedia and real-time applications require bandwidth guarantees, which may be achieved by resource reservation. Several researches were done to propose efficient reservation MAC protocols for ad-hoc networks. In these schemes, channel is segmented into super-frames composed of fixed number of slots. They allocate slots to each traffic source, and make sure that neighbor nodes record the reservation in order to ensure consistency of reservations between neighbor nodes. However, resource reservation in ad-hoc networks remain a very challenging task due to the instability of radio channels, node mobility and lack of coordination between mobile nodes. Proposed reservation MAC protocols like CATA, FPRP, R-CSMA and SRMA/PA have limitations and are suitable only for particular situations. In this paper, we propose a comparative analysis of the most representative reservation MAC protocols. We identify the major issues unresolved by reservation MAC protocols. A performance evaluation and comparative analysis with the IEEE 802.11e are achieved through the NS-2 simulator.

Complete Article List

Search this Journal:
Reset
Volume 20: 1 Issue (2025): Forthcoming, Available for Pre-Order
Volume 19: 1 Issue (2024)
Volume 18: 2 Issues (2022): 1 Released, 1 Forthcoming
Volume 17: 2 Issues (2021)
Volume 16: 2 Issues (2020)
Volume 15: 2 Issues (2019)
Volume 14: 2 Issues (2018)
Volume 13: 2 Issues (2017)
Volume 12: 2 Issues (2016)
Volume 11: 2 Issues (2015)
Volume 10: 4 Issues (2014)
Volume 9: 4 Issues (2013)
Volume 8: 4 Issues (2012)
Volume 7: 4 Issues (2011)
Volume 6: 4 Issues (2010)
Volume 5: 4 Issues (2009)
Volume 4: 4 Issues (2008)
Volume 3: 4 Issues (2007)
Volume 2: 4 Issues (2006)
Volume 1: 4 Issues (2005)
View Complete Journal Contents Listing