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

Abstract

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.