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

全面介紹

Saved in:
書目詳細資料
Main Authors: Chen, Zhenwei, Zhang, Wenjie, Zheng, Yifeng, Yang, Liwen, Yeo, Chai Kiat
其他作者: School of Computer Science and Engineering
格式: Article
語言:English
出版: 2022
主題:
在線閱讀:https://hdl.handle.net/10356/155226
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!