Grant-free random access (GFRA) is a promising solution for massive machine-type communications (mMTC) in future wireless networks. However, reliable user activity detection and channel estimation are critical challenges, particularly when orthogonal time-frequency space (OTFS) modulation is integrated with GFRA to address doubly selective channels induced by high mobility. In this paper, we propose an OTFS-based GFRA framework that exploits the inherent structured sparsity of delay-Doppler channels. By adopting a basis expansion model (BEM), we formulate joint user activity detection and channel estimation as a structured compressive sensing problem. A bi-level sparsity structure is identified, consisting of common sparsity across multiple receive antennas and activation sparsity across mMTC users. To effectively leverage this structure, we construct a two-layer factor graph and develop a structured sparsity expectation propagation (SS-EP) algorithm for efficient Bayesian inference. Simulation results demonstrate that the proposed scheme significantly outperforms existing benchmarks.
This letter investigates the sensing-centric design of reconfigurable intelligent surface (RIS)-enabled rate-splitting multiple access-integrated sensing and communication (RSMA-ISAC) systems. Specifically, we propose a new beam-gain approximation method to enhance the sensing beam gain while satisfying communication quality-of-service (QoS) constraints. Since the joint optimization of the beamforming vectors and RIS phase shifts is highly coupled and non-convex, existing methods typically rely on generic optimization solvers involving substantial computational complexity. To address this issue, we propose an efficient constraints-separation-based alternating optimization algorithm (CS-AO). Our proposed algorithm effectively decouples the optimization variables and yields closed-form solutions for all subproblems, thereby significantly reducing the computational burden. Simulation results show that the proposed algorithm achieves sensing beam-gain performance comparable to successive convex approximation (SCA) and semidefinite relaxation (SDR) benchmarks, while achieving more than 120-fold and 50-fold runtime reductions. In addition, compared with conventional space-division multiple access (SDMA) schemes, the proposed design exhibits substantial sensing beam gain.
Xue-Jun Cheng, Qian Zhang, Y. Jiao et al.· IEEE Wireless Communications...· 0 citations
: The emergence of Unmanned Aerial Vehicle (UAV)-enabled Wireless Energy Transfer (WET) and Simultaneous Wireless Information and Power Transfer (SWIPT) technology provide a promising solution to overcome the energy sustainability limitations of traditional harvesting-reliant sensor networks. However, in large-scale Battery-free SWIPT-enabled Sensor Networks (BSSN) characterized by sparse node distribution and heterogeneous energy consumption and harvesting rates, employing a single UAV for energy replenishment often suffers from insufficient operation continuity and low charging efficiency. To overcome these challenges, a Multi-UAV Collaborative Energy Charging for BSSN Based on Multi-Agent Deep Deterministic Policy Gradient (MCEC-MADDPG) is proposed in this paper. Specifically, we construct a collaborative one-to-one precision energy supply model where UAVs hover directly above specific nodes to achieve power transmission without complex beamforming requirements. To achieve collaborative scheduling among multiple UAVs in wide-area dynamic environments, the energy replenishment problem is first formulated as a Partially Observable Markov Decision Process (POMDP). Subsequently, the Centralized Training with Decentralized Execution (CTDE) architecture of the MADDPG algorithm is leveraged to solve this POMDP, which effectively tackles the non-stationarity challenge inherent in multi-agent environments. Simulation results demonstrate that MCEC-MADDPG exhibits superior performance in terms of convergence speed and stability. It enables the adaptive emergence of spatial-division collaborative strategies, significantly enhances the average residual energy of the network, and elevates the node survival rate to nearly 90%. Compared with Deep Deterministic Policy Gradient (DDPG), the traditional static Partition-Greedy method, the heuristic K-Means algorithm and the dynamic Two-Layer task allocation strategy, the proposed approach demonstrates substantial advantages.
Xiangyi Le, Deyu Lin, Yufei Zhao et al.· Computers, Materials & C...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
