Please use this identifier to cite or link to this item:
Title: Distributed algorithm for AP association with random arrivals and departures of users
Authors: Chen, Zhenwei
Zhang, Wenjie
Zheng, Yifeng
Yang, Liwen
Yeo, Chai Kiat
Keywords: Engineering::Computer science and engineering
Issue Date: 2020
Source: Chen, Z., Zhang, W., Zheng, Y., Yang, L. & Yeo, C. K. (2020). Distributed algorithm for AP association with random arrivals and departures of users. IET Communications, 14(5), 846-856.
Journal: IET Communications
Abstract: Here, the authors study the novel problem of optimising access point (AP) association by maximising the network throughput, subject to the degree bound of AP. The formulated problem is a combinatorial optimisation. They resort to the Markov Chain approximation technique to design a distributed algorithm. They first approximate their optimal objective via Log-Sum-Exp function. Thereafter, they construct a special class of Markov Chain with steady-state distribution specify to their problem to yield a distributed solution. Furthermore, they extend the static problem setting to a dynamic environment where the users can randomly leave or join the system. Their proposed algorithm has provable performance, achieving an approximation gap of (1/η)log ℱ. It is simple and can be implemented in a distributed manner. Their extensive simulation results show that the proposed algorithm can converge very fast, and achieve a close-to-optimal performance with a guaranteed loss bound.
ISSN: 1751-8628
DOI: 10.1049/iet-com.2019.0817
Rights: © 2020 The Institution of Engineering and Technology. All rights reserved.
Fulltext Permission: none
Fulltext Availability: No Fulltext
Appears in Collections:SCSE Journal Articles

Page view(s)

Updated on Jul 1, 2022

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.