[Paper Review] Covariance-Based Cooperative Activity Detection for Massive Grant-Free Random Access

Xiaodan Shao, Xiaoming Chen+3 more|arXiv (Cornell University)|Aug 24, 2020

Indoor and Outdoor Localization Technologies17 references4 citations

TL;DR

This paper proposes a covariance-based cooperative activity detection (CMD) algorithm for massive grant-free random access in 6G cell-free wireless networks, leveraging sparsity and similarity across device state vectors among neighboring access points (APs) via a proximal gradient-based approximate splitting method. The method achieves near-optimal activity detection performance with shorter pilot sequences and reduced signaling overhead compared to state-of-the-art approaches.

ABSTRACT

This paper designs a cooperative activity detection framework for massive grant-free random access in the sixth-generation (6G) cell-free wireless networks based on the covariance of the received signals at the access points (APs). In particular, multiple APs cooperatively detect the device activity by only exchanging the low-dimensional intermediate local information with their neighbors. The cooperative activity detection problem is non-smooth and the unknown variables are coupled with each other for which conventional approaches are inapplicable. Therefore, this paper proposes a covariance-based algorithm by exploiting the sparsity-promoting and similarity-promoting terms of the device state vectors among neighboring APs. An approximate splitting approach is proposed based on the proximal gradient method for solving the formulated problem. Simulation results show that the proposed algorithm is efficient for large-scale activity detection problems while requires shorter pilot sequences compared with the state-of-art algorithms in achieving the same system performance.

Motivation & Objective

• To address the challenge of high-latency and high-signaling overhead in conventional grant-based random access for massive machine-type communications (mMTC) in 6G networks.
• To enable efficient and scalable active device detection in large-scale, cell-free wireless networks with distributed APs.
• To reduce pilot sequence length and signaling overhead while maintaining high detection accuracy through cooperative detection across APs.
• To exploit joint sparsity and similarity in device state vectors across neighboring APs to improve detection performance.
• To design a low-complexity, robust algorithm resilient to AP or backhaul link failures and channel statistic variations.

Proposed method

• The CMD algorithm is formulated as a non-smooth, coupled optimization problem based on the covariance of received signals at multiple APs.
• It introduces sparsity-promoting and similarity-promoting terms to model the joint structure of device state vectors across neighboring APs.
• An approximate splitting approach based on the proximal gradient method is developed to solve the non-smooth, coupled optimization problem efficiently.
• Each AP exchanges only low-dimensional intermediate estimates with its one-hop neighbors, minimizing backhaul signaling overhead.
• Closed-form expressions for proximal operators are derived to enhance computational efficiency and scalability.
• The algorithm operates without requiring knowledge of channel state information, relying only on covariance statistics and local signal processing.

Experimental results

Research questions

• RQ1 Can cooperative activity detection across multiple APs improve detection accuracy in massive grant-free random access with reduced pilot overhead?
• RQ2 How can sparsity and similarity in device state vectors across neighboring APs be jointly exploited to enhance detection performance?
• RQ3 What is the trade-off between detection performance and communication cost in cooperative detection with increasing numbers of cooperating APs?
• RQ4 How does the proposed CMD algorithm compare to conventional multi-cell detection schemes in terms of accuracy and robustness under limited pilot resources?
• RQ5 To what extent does the algorithm maintain performance under AP or backhaul link failures and varying channel statistics?

Key findings

• The proposed CMD algorithm achieves near-optimal activity detection performance with significantly shorter pilot sequences compared to state-of-the-art methods.
• Performance saturation occurs when the number of cooperating APs exceeds a threshold, indicating diminishing returns beyond a small number of neighbors.
• The AER decreases sharply with increasing numbers of cooperating APs initially, but the improvement plateaus due to weak channel gains from distant APs.
• With 32 antennas per AP, the CMD algorithm achieves substantially lower AER than both ML-based and AMP-based multi-cell schemes, especially as the number of antennas increases.
• The performance gap between the CMD algorithm and baseline methods is most pronounced with short pilot sequences, demonstrating its efficiency in low-resource scenarios.
• The algorithm maintains robustness and scalability, requiring only low-dimensional intermediate information exchange between APs, reducing backhaul signaling overhead.