Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/155226
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, Zhenwei | en_US |
dc.contributor.author | Zhang, Wenjie | en_US |
dc.contributor.author | Zheng, Yifeng | en_US |
dc.contributor.author | Yang, Liwen | en_US |
dc.contributor.author | Yeo, Chai Kiat | en_US |
dc.date.accessioned | 2022-02-28T02:51:19Z | - |
dc.date.available | 2022-02-28T02:51:19Z | - |
dc.date.issued | 2020 | - |
dc.identifier.citation | Chen, Z., Zhang, W., Zheng, Y., Yang, L. & Yeo, C. K. (2020). Distributed algorithm for AP association with random arrivals and departures of users. IET Communications, 14(5), 846-856. https://dx.doi.org/10.1049/iet-com.2019.0817 | en_US |
dc.identifier.issn | 1751-8628 | en_US |
dc.identifier.uri | https://hdl.handle.net/10356/155226 | - |
dc.description.abstract | 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 algorithm. They first approximate their optimal objective via Log-Sum-Exp function. Thereafter, they construct a special class of Markov Chain with steady-state distribution specify to their problem to yield a distributed solution. Furthermore, they extend the static problem setting to a dynamic environment where the users can randomly leave or join the system. Their proposed algorithm has provable performance, achieving an approximation gap of (1/η)log ℱ. It is simple and can be implemented in a distributed manner. Their extensive simulation results show that the proposed algorithm can converge very fast, and achieve a close-to-optimal performance with a guaranteed loss bound. | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartof | IET Communications | en_US |
dc.rights | © 2020 The Institution of Engineering and Technology. All rights reserved. | en_US |
dc.subject | Engineering::Computer science and engineering | en_US |
dc.title | Distributed algorithm for AP association with random arrivals and departures of users | en_US |
dc.type | Journal Article | en |
dc.contributor.school | School of Computer Science and Engineering | en_US |
dc.identifier.doi | 10.1049/iet-com.2019.0817 | - |
dc.identifier.scopus | 2-s2.0-85082077780 | - |
dc.identifier.issue | 5 | en_US |
dc.identifier.volume | 14 | en_US |
dc.identifier.spage | 846 | en_US |
dc.identifier.epage | 856 | en_US |
dc.subject.keywords | Combinational Optimisation | en_US |
dc.subject.keywords | Distributed Algorithm | en_US |
dc.description.acknowledgement | This work was supported by the Natural Science Funds of China(Nos. 61701213, 61705260), Natural Science Funds of Fujian (No.2018J01546). | en_US |
item.fulltext | No Fulltext | - |
item.grantfulltext | none | - |
Appears in Collections: | SCSE Journal Articles |
SCOPUSTM
Citations
50
1
Updated on Mar 13, 2024
Web of ScienceTM
Citations
50
1
Updated on Oct 31, 2023
Page view(s)
123
Updated on Mar 19, 2024
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.