Distributed algorithm for AP association with random arrivals and departures of users

Distributed algorithm for AP association with random arrivals and departures of users

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 algor...

Full description

Bibliographic Details
Main Authors: Chen, Zhenwei, Zhang, Wenjie, Zheng, Yifeng, Yang, Liwen, Yeo, Chai Kiat
Other Authors: School of Computer Science and Engineering
Format: Journal Article
Language:English
Published: 2022
Subjects:
Engineering::Computer science and engineering
Combinational Optimisation
Distributed Algorithm
Online Access:https://hdl.handle.net/10356/155226

Internet

https://hdl.handle.net/10356/155226

Similar Items