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: | , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/155226 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |