Facial reconstruction

Search LJMU Research Online

Browse Repository | Browse E-Theses

A Dynamic Access Point Allocation Algorithm for Dense Wireless LANs Using Potential Game

Raschella, A, Bouhafs, F, MacKay, M, Shi, Q, Ortín, J, Gállego, JR and Canales, M (2019) A Dynamic Access Point Allocation Algorithm for Dense Wireless LANs Using Potential Game. Computer Networks. ISSN 1389-1286

[img] Text
Elsevier-COMNET_2019.pdf - Accepted Version
Restricted to Repository staff only until 18 November 2020.
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (1MB)

Abstract

This work introduces an innovative Access Point (AP) allocation algorithm for dense Wi-Fi networks, which relies on a centralised potential game developed in a Software-Defined Wireless Networking (SDWN)-based framework. The proposed strategy optimises the allocation of the Wi-Fi stations (STAs) to APs and allows their dynamic reallocation according to possible changes in the capacity of the Wi-Fi network. This paper illustrates the design of the proposed framework based on SDWN and the implementation of the potential game-based algorithm, which includes two possible strategies. The main novel contribution of this work is that the algorithm allows us to efficiently reallocate the STAs by considering external interference, which can negatively affect the capacities of the APs handled by the SDWN controller. Moreover, the paper provides a detailed performance analysis of the algorithm, which describes the significant improvements achieved with respect to the state of the art. Specifically, the results have been compared against the AP selection considered by the IEEE 802.11 standards and another centralised algorithm dealing with the same problem, in terms of the data bit rate provided to the STAs, their dissatisfaction and Quality of Experience (QoE). Finally, the paper analyses the trade-off between efficient performance and the computational complexity achieved by the strategies implemented in the proposed algorithm.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
Divisions: Computer Science
Publisher: Elsevier
Date Deposited: 12 Nov 2019 12:06
Last Modified: 19 Nov 2019 10:45
URI: http://researchonline.ljmu.ac.uk/id/eprint/11759

Actions (login required)

View Item View Item