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

• المؤلفون الرئيسيون: Chen, Zhenwei, Zhang, Wenjie, Zheng, Yifeng, Yang, Liwen, Yeo, Chai Kiat
• مؤلفون آخرون: School of Computer Science and Engineering
• التنسيق: مقال
• اللغة: English
• منشور في: 2022
• الموضوعات: Engineering::Computer science and engineering; Combinational Optimisation; Distributed Algorithm
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/155226
• المؤسسة: Nanyang Technological University

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