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

Full description

Bibliographic Details

Published in:	IOP conference series. Earth and environmental science Vol. 428; no. 1; pp. 12066 - 12073
Main Authors:	Chen, Zhenwei, Zhang, Wenjie, Yang, Jingmin, Chen, Shengyu, Yang, Liwei, Chai Kiat, Yeo
Format:	Journal Article
Language:	English
Published:	IOP Publishing 01.01.2020
ISSN:	1755-1307, 1755-1315
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!