Blind Asynchronous Goal-Oriented Detection for Massive Connectivity
Resource allocation and multiple access schemes are instrumental for the success of communication networks, which facilitate seamless wireless connectivity among a growing population of uncoordinated and non-synchronized users. In this paper, we present a novel random access scheme that addresses one of the most severe barriers of current strategies to achieve massive connectivity and ultra-reliable and low latency communications for 6G. The proposed scheme utilizes wireless channels' angular continuous group-sparsity feature to provide low latency, high reliability, and massive access features in the face of limited time-bandwidth resources, asynchronous transmissions, and preamble errors. Specifically, a reconstruction-free goal-oriented optimization problem is proposed, which preserves the angular information of active devices and is then complemented by a clustering algorithm to assign active users to specific groups. This allows us to identify active stationary devices according to their line of sight angles. Additionally, for mobile devices, an alternating minimization algorithm is proposed to recover their preamble, data, and channel gains simultaneously, enabling the identification of active mobile users. Simulation results show that the proposed algorithm provides excellent performance and supports a massive number of devices. Moreover, the performance of the proposed scheme is independent of the total number of devices, distinguishing it from other random access schemes. The proposed method provides a unified solution to meet the requirements of machine-type communications and ultra-reliable and low-latency communications, making it an important contribution to the emerging 6G networks.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Joint Activity-Delay Detection and Channel Estimation for Asynchronous Massive Random Access
Most existing studies on joint activity detection and channel estimation for grant-free massive random access (RA) systems assume perfect synchronization among all active users, which is hard to achieve in practice. Ther…
Action DetectionActivity DetectionUser Activity Detection with Delay-Calibration for Asynchronous Massive Random Access
This work considers an uplink asynchronous massive random access scenario in which a large number of users asynchronously access a base station equipped with multiple receive antennas. The objective is to alleviate the p…
Action DetectionActivity DetectionCompressive SensingSketchtopia: A Dataset and Foundational Agents for Benchmarking Asynchronous Multimodal Communication with Iconic Feedback
We introduce Sketchtopia, a large-scale dataset and AI framework designed to explore goal-driven, multimodal communication through asynchronous interactions in a Pictionary-inspired setup. Sketchtopia captures natura…
BenchmarkingLamarckian Platform: Pushing the Boundaries of Evolutionary Reinforcement Learning towards Asynchronous Commercial Games
Despite the emerging progress of integrating evolutionary computation into reinforcement learning, the absence of a high-performance platform endowing composability and massive parallelism causes non-trivial difficulties…
CPUDistributed Computingreinforcement-learningReinforcement Learning+2Asynchronous Random Access in Massive MIMO Systems Facilitated by the Delay-Angle Domain
The problem of uplink transmissions in massive connectivity is commonly dealt with using schemes for grant-free random access. When a large number of devices transmit almost synchronously, the receiver may not be able to…
Action DetectionActivity Detection