An Admission Control Scheme Based on Links’ Activity Scheduling for Wireless Mesh Networks

  • Juliette Dromard
  • Lyes Khoukhi
  • Rida Khatoun
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7363)


Wireless Mesh Networks (WMNs) are low cost, easily deployed and high performance solution to last mile broadband Internet access, however they have to deal with a lack of bandwidth which prevents the deployment of applications with strict constraints. To overcome this limitation, we introduce a novel WMN model integrating both a transmission scheduling algorithm and a bandwidth-based admission control scheme. Most existing admission control schemes under-exploit the channel’s capacity (due to approximations in node’s bandwidth and flows consumption estimation) and under exploit the possibilities of parallel transmissions. In this paper, we propose a network model based on relation between links to get an accurate estimation of nodes bandwidth and flows consumption. Based on this model, we present an admission control scheme which relies on a transmissions scheduling algorithm favouring parallel transmissions, and on an advertisements scheme enabling nodes to be aware of the activities going on in their vicinities. Thus, nodes gain control over their channel and can thus estimate more precisely their bandwidth and exploit the spatial reuse from parallel transmissions. The overall network capacity and fairness is so improved.


Admission Control Route Discovery Wireless Mesh Network Packet Loss Ratio Spatial Reuse 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Wireless mesh networks: a survey. Computer Networks 47(4), 445–487 (2005)Google Scholar
  2. 2.
    Aoun, B., Boutaba, R.: Max-min fair capacity of wireless mesh networks. In: 2006 IEEE International Conference on Mobile Adhoc and Sensor Systems (MASS), pp. 21–30 (2006)Google Scholar
  3. 3.
    Hanzo, L., Tafazolli, R.: Admission control schemes for 802.11-based multi-hop mobile ad hoc networks: a survey. IEEE Communications Surveys & Tutorials 11(4), 78–108 (2009)CrossRefGoogle Scholar
  4. 4.
    Jun, J., Sichitiu, M.L.: The nominal capacity of wireless mesh networks. IEEE Wireless Communications [see also IEEE Personal Communications] 10(5), 8–14 (2003)Google Scholar
  5. 5.
    Luo, L., Gruteser, M., Liu, H., Raychaudhuri, D., Huang, K., Chen, S.: A qos routing and admission control scheme for 802.11 ad hoc networks. In: Proceedings of the 2006 Workshop on Dependability Issues in Wireless ad hoc Networks and Sensor Networks, DIWANS 2006, pp. 19–28. ACM, New York (2006)CrossRefGoogle Scholar
  6. 6.
    Perkins, C., Belding-Royer, E., Das, S.: Ad hoc on-demand distance vector (aodv) routing (2003)Google Scholar
  7. 7.
    Rezgui, J., Hafid, A., Gendreau, M.: Distributed admission control in wireless mesh networks: Models, algorithms, and evaluation. IEEE Transactions on Vehicular Technology 59(3), 1459–1473 (2010)CrossRefGoogle Scholar
  8. 8.
    Shen, Q., Fang, X., Li, P., Fang, Y.: Admission control based on available bandwidth estimation for wireless mesh networks. IEEE Transactions on Vehicular Technology 58(5), 2519–2528 (2009)CrossRefGoogle Scholar
  9. 9.
    Xu, K., Gerla, M., Bae, S.: How effective is the ieee 802.11 rts/cts handshake in ad hoc networks, vol. 1, pp. 72–76 (2002)Google Scholar
  10. 10.
    Yang, Y., Kravets, R.: Contention-aware admission control for ad hoc networks. IEEE Transactions on Mobile Computing 4(4), 363–377 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Juliette Dromard
    • 1
  • Lyes Khoukhi
    • 1
  • Rida Khatoun
    • 1
  1. 1.Troyes University of TechnologyTroyes CedexFrance

Personalised recommendations