Dynamic Distributed Algorithm for AP Association under User Random Arrivals and Departures

In this paper, we study the novel problem of optimizing AP association by maximizing the network throughput, subject to the degree bound of AP. The formulated problem is a combinatorial optimization. We resort to the Markov Chain approximation technique to design a distributed algorithm. We first ap...

Celý popis

Podrobná bibliografia

Vydané v:	IOP conference series. Earth and environmental science Ročník 428; číslo 1; s. 12066 - 12073
Hlavní autori:	Chen, Zhenwei, Zhang, Wenjie, Yang, Jingmin, Chen, Shengyu, Yang, Liwei, Chai Kiat, Yeo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IOP Publishing 01.01.2020
ISSN:	1755-1307, 1755-1315
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!