Distributed optimization for massive connectivity

Authors

Y. Jiang, J. Su, Y. Shi, B. Houska

Reference

IEEE Wireless Communication Letters,
Volume 9(9), pages 1412 - 1416, 2020.

Abstract

Massive device connectivity in Internet of Thing (IoT) networks with sporadic traffic poses significant communication challenges. To overcome this challenge, the serving base station is required to detect the active devices and estimate the corresponding channel state information during each coherence block. The corresponding joint activity detection and channel estimation problem can be formulated as a group sparse estimation problem, also known under the name “Group Lasso”. This letter presents a fast and efficient distributed algorithm to solve such Group Lasso problems, which alternates between solving smallscaled problems in parallel and dealing with a linear equation for consensus. Numerical results demonstrate the speedup of this algorithm compared with the state-of-the-art methods in terms of convergence speed and computation time.

Download

Paper

Bibtex

@ARTICLE{Jiang2020,
author = {Jiang, Y. and Su., J. and Shi, Y. and Houska, B.},
title = {Distributed optimization for massive connectivity},
journal = {IEEE Wireless Communciation Letters},
year = {2020},
volume = {9},
number = {9},
pages = {1412–1416}
}