You can view the full text of this article for free using the link below.

Title: A holding access-point assignment algorithm for IEEE802.11 wireless local-area networks

Authors: Shigeto Tajima; Nobuo Funabiki; Teruo Higashino

Addresses: Graduate School of Engineering Science, Osaka University, Osaka, Japan ' Graduate School of Natural Science and Technology, Okayama University, Okayama, Japan ' Graduate School of Information Science and Technology, Osaka University, Osaka, Japan

Abstract: Nowadays, various types of access-points (APs) and hosts such as dedicated APs, laptop personal computers (PCs), and mobile terminals have been used in IEEE802.11 wireless local-area networks (WLANs). As a result, the optimal assignment of holding APs with different types into the network field, depending on the host type distribution, has become another important task to design high-performance WLANs. In this paper, we first define this holding access-point assignment problem as a combinatorial optimisation problem and propose its two-phase heuristic algorithm. Then, since plural partially overlapping channels are available in IEEE802.11 WLANs, we present the channel assignment extension to the APs such that the communication time of the APs is minimised, and the model to estimate the communication time increase by interferences. The effectiveness of our proposal is verified through simulations in six instances using the WIMNET simulator.

Keywords: wireless local-area network; WLAN; holding access-point; partially overlapping channel; assignment algorithm; combinatorial optimisation problem.

DOI: 10.1504/IJSSC.2018.091196

International Journal of Space-Based and Situated Computing, 2018 Vol.8 No.1, pp.50 - 58

Available online: 10 Apr 2018 *

Full-text access for editors Access for subscribers Free access Comment on this article