Proposal for access point backhaul resource aggregation and its modeling using one-to-one matching game

Hassine, Kawther; Frikha, Mounir; Chahed, Tijani

doi:10.1145/2837126.2837134

Cited by 3 publications

(4 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the aforementioned limitations, we proposed in [8] an alternate solution for backhaul capacity aggregation. Our approach defines a symmetric AP-exclusive protocol (no wireless clients involved) for available backhaul resource (ABR) allocation.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Hassine¹,

Frikha²,

Chahed

2017

Wireless Communications and Mobile Computing

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%

“…We, however, restricted ourselves in [8] to one-to-one matching wherein each player could be matched with one player at most. In this case, even though B-APs improve their transmission rates, access to backhaul resources was limited in a way that holds back most of them from fulfilling their needs in terms of required backhaul capacity.…”

Section: Introductionmentioning

confidence: 99%

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

Hassine¹,

Frikha²,

Chahed

2017

Wireless Communications and Mobile Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…In a previous work [9], we proposed a new backhaul resource management scheme which consists of an AP-exclusive protocol which discards entirely wireless clients from the aggregation process. The management of the spare backhaul resources is entirely controlled by access points.…”

Section: Introductionmentioning

confidence: 99%

“…As in [9], we adopt a one-to-one matching game theory approach which consists, first, in dividing the ensemble of APs into two separate sets: 1) providers: with spare backhaul resources and 2) beneficiaries: in need of more backhaul bandwidth (see Fig. 3).…”

Section: Introductionmentioning

confidence: 99%

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

Hassine¹,

Frikha²,

Chahed

2016

2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Access point backhaul capacity aggregation as a matching game in the context of Wireless Local Area Networks

Hassine¹,

Frikha²,

Chahed

2018

Computer Networks

View full text Add to dashboard Cite

Proposal for access point backhaul resource aggregation and its modeling using one-to-one matching game

Cited by 3 publications

References 8 publications

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

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

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

Access point backhaul capacity aggregation as a matching game in the context of Wireless Local Area Networks

Contact Info

Product

Resources

About