Greedy Versus Limited Access Point Backhaul Resource Aggregation in Wireless Local Area Networks

Abstract

We conduct in this work a comparative study between a greedy versus limited proposals for resource aggregation in the backhaul of wireless local area networks. We consider a setting with several access points, some with excess backhaul capacity (providers), and others in shortage of it (beneficiaries) and investigate two approaches for the distribution of resources between them: a greedy one wherein each beneficiary seeks to maximize the resource it could obtain from the provider and a limited one in which the operator limits the amount of acquired resources to some limit, so as to ensure fairness between beneficiaries. We model the system using a one-toone matching game, and compare the two approaches in three scenarios: a symmetric one with equal number of providers and beneficiaries, and asymmetric ones with higher number of either providers or beneficiaries. Our results show that the greedy scheme outperforms the limited one when the number of providers is larger than that of beneficiaries; the limited one performs best in the opposite case and ensures fairness between beneficiary access points. In all cases, both approaches outperform the random allocation scheme.

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

“…We simulate network response of the many-to-one matching game in comparison with previously addressed one-to-one matching game [18]. To do so, we consider several " × " configurations where and denote, respectively, the number of B-APs and P-APs in each matching set.…”