IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v66y2017i1d10.1007_s11235-016-0273-0.html
   My bibliography  Save this article

Towards combining admission control and link scheduling in wireless mesh networks

Author

Listed:
  • J. Dromard

    (University of Technology of Troyes)

  • L. Khoukhi

    (University of Technology of Troyes)

  • R. Khatoun

    (Telecom Paristech)

  • Y. Begriche

    (Telecom Paristech)

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.

Suggested Citation

  • J. Dromard & L. Khoukhi & R. Khatoun & Y. Begriche, 2017. "Towards combining admission control and link scheduling in wireless mesh networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 66(1), pages 39-54, September.
    • Handle: RePEc:spr:telsys:v:66:y:2017:i:1:d:10.1007_s11235-016-0273-0
    DOI: 10.1007/s11235-016-0273-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-016-0273-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-016-0273-0?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:66:y:2017:i:1:d:10.1007_s11235-016-0273-0. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.