Table of Contents Author Guidelines Submit a Manuscript
Wireless Communications and Mobile Computing
Volume 2017, Article ID 3523868, 11 pages
Research Article

Access Point Backhaul Resource Aggregation as a Many-to-One Matching Game in Wireless Local Area Networks

1Higher School of Communications of Tunis (Sup’Com), Tunis, Tunisia
2Institut Mines-Telecom, Telecom SudParis, Paris, France

Correspondence should be addressed to Kawther Hassine; nt.mocpus@enissah.rehtuoak

Received 22 September 2016; Revised 9 March 2017; Accepted 10 April 2017; Published 15 May 2017

Academic Editor: Michael McGuire

Copyright © 2017 Kawther Hassine et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This paper studies backhaul bandwidth aggregation in the context of a wireless local area network composed of two different types of access points: those with spare backhaul capacity (which we term providers) and those in shortage of it (beneficiaries); the aim is to transfer excess capacity from providers to beneficiaries. We model the system as a matching game with many-to-one setting wherein several providers can be matched to one beneficiary and adopt the so-called deferred acceptance algorithm to reach an optimal and stable solution. We consider two flavors, when the beneficiaries are limited in their resource demands and when they are not, and two scenarios, when resources are abundant and when they are scarce. Our results show that the many-to-one setting outperforms the one-to-one case in terms of overall throughput gain, resource usage, and individual beneficiaries satisfaction by up to 50%, whether resources are scarce or abundant. As of the limited versus nonlimited case, the former ensures more fair sharing of spectral resources and higher satisfaction percentage between beneficiaries.