arXiv · 2006.05637
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.
Explore related subjects
Keep this discovery
Yuning Jiang, Junyan Su, Yuanming Shi, Boris Houska. 2020-06-10. Distributed Optimization for Massive Connectivity. https://arxiv.org/abs/2006.05637
Cite the original work for its findings. Save a collection to share your selection of sources.