5th International ICST Conference on Broadband Communications, Networks, and Systems

Research Article

A Distributed Admission Control Scheme for Wireless Mesh Networks

  • @INPROCEEDINGS{10.1109/BROADNETS.2008.4769148,
        author={Jihene Rezgui and Abdelhakim Hafid and Michel Gendreau},
        title={A Distributed Admission Control Scheme for Wireless Mesh Networks},
        proceedings={5th International ICST Conference on Broadband Communications, Networks, and Systems},
        publisher={IEEE},
        proceedings_a={BROADNETS},
        year={2010},
        month={5},
        keywords={Admission control WMNs Multi-channels Quality of Service stochastic.},
        doi={10.1109/BROADNETS.2008.4769148}
    }
    
  • Jihene Rezgui
    Abdelhakim Hafid
    Michel Gendreau
    Year: 2010
    A Distributed Admission Control Scheme for Wireless Mesh Networks
    BROADNETS
    IEEE
    DOI: 10.1109/BROADNETS.2008.4769148
Jihene Rezgui1,*, Abdelhakim Hafid1,*, Michel Gendreau2,*
  • 1: NRL, University of Montreal, Canada
  • 2: CIRRELT, University of Montreal, Canada
*Contact email: rezguiji@iro.umontreal.ca, ahafid@iro.umontreal.ca, michel.gendreau@cirrelt.ca

Abstract

Admission control is a key management function in wireless networks, particularly Wireless Mesh Networks (WMNs), in order to support multimedia applications that require Quality of Service (QoS) guarantees. Even using state of the art schemes to provide QoS, if the amount of traffic in the network is allowed to increase in an uncontrolled manner, network performance will deteriorate significantly degrading the QoS for all network traffic. With admission control, a new flow is admitted only if the QoS requirements of all flows in the network still can be met after the new flow begins. This paper introduces a distributed admission control scheme, called RCAC (Routing on Cliques Admission Control) for WMNs. We propose an analytical model that enables computing the appropriate admission ratio to guarantee that the loss rate in the network does not exceed a target value; the model also allows computing end-to-end delay necessary to process flow requests with delay constraints. RCAC achieves scalability since it partitions the network into cliques; only clique heads are involved in the admission control procedure. Simulations, using ns-2, demonstrate that RCAC accepts new incoming flows only when the network target loss rate and end-to-end delay are satisfied and maintains relatively high resource utilization in a dynamic traffic load environment.