Towards combining admission control and link scheduling in wireless mesh networks

Abstract : Wireless mesh networks (WMNs) have emerged recently as a key solution for next-generation wireless networks; they are low cost and easily deployed technology. However, WMNs have to deal with a low bandwidth which prevents them from guaranteeing the requirements of applications with strict constraints. To overcome this limitation, we propose in this paper a new admission control model which integrates a dynamic link scheduling scheme, named ACLS, in order to optimize the network bandwidth use. We formulate the admission control problem as a binary linear programming problem (BL2P). The proposed admission control integrates an algorithm, based on the Dakin’s branch and bound (B&B) method, which respects the bandwidth and delay required by the flows. The proposed ACLS solution has been validated on ns2, and the simulation results showed that ACLS model has better performance than the reference solution BRAWN; it accepts more flows while guaranteeing their delay and bandwidth.
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02274879
Contributor : Jean-Baptiste Vu Van <>
Submitted on : Friday, August 30, 2019 - 12:00:00 PM
Last modification on : Monday, September 16, 2019 - 4:36:03 PM

Identifiers

Collections

Citation

Juliette Dromard, Lyes Khoukhi, Rida Khatoun, Youcef Begriche. Towards combining admission control and link scheduling in wireless mesh networks. Telecommunication Systems, Springer Verlag (Germany), 2017, 66 (1), pp.39-54. ⟨10.1007/s11235-016-0273-0⟩. ⟨hal-02274879⟩

Share

Metrics

Record views

6