An efficient admission control model based on dynamic link scheduling in wireless mesh networks

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Background: Wireless mesh networks (WMNs) are a very attractive new field of research. They are low cost, easily deployed, and a high-performance solution to last-mile broadband Internet access. In WMNs, admission control (AC) is one of the key traffic management mechanisms that should be deployed to provide quality of service (QoS) support for real-time traffic. Results: In this paper, we introduce a novel admission control model, based on bandwidth and delay parameters, which integrates a dynamic link scheduling scheme. The proposed model is built on two different methods to access the medium: on a contention-based channel access method for control packets and on a dynamic time division multiple access (DTDMA) for data packets. Each time a new flow is admitted in the network, the WMN's link scheduling is modified according to the flows' requirement and network conditions while respecting the signal-to-interference-plus-noise ratio (SINR); this allows establishing collision-free transmissions. Conclusions: Using extensive simulations, we demonstrate that our model achieves high resource utilization by improving throughput, establishing collision-free transmission, as well as respecting requirements of admitted flows in terms of delay and bandwidth. © 2013 Stolojescu-Crisan and Isar; licensee Springer.

Cite

CITATION STYLE

APA

Dromard, J., Khoukhi, L., & Khatoun, R. (2013). An efficient admission control model based on dynamic link scheduling in wireless mesh networks. Eurasip Journal on Wireless Communications and Networking, 2013(1). https://doi.org/10.1186/1687-1499-2013-288

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free