Title
Distributed Optimization for Massive Connectivity
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 small-scaled 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.
Year
DOI
Venue
2020
10.1109/LWC.2020.2992189
IEEE Wireless Communications Letters
Keywords
DocType
Volume
Distributed optimization,IoT,group sparsity
Journal
9
Issue
ISSN
Citations 
9
2162-2337
0
PageRank 
References 
Authors
0.34
0
4
Name
Order
Citations
PageRank
Yuning Jiang141121.30
Su Junyan200.34
Yuanming Shi365953.58
Boris Houska421426.14