This paper investigates reconfigurable intelligent surface (RIS)-assisted simultaneous wireless information and power transfer (SWIPT) networks with rate splitting multiple access (RSMA). An energy ...efficiency (EE) maximization problem is formulated subject to the power budget at the transmitter and the quality of service (QoS) requirements of both information communication and energy harvesting, where the beamforming vectors, the power splitting (PS) ratios, the common message rates, and the discrete phase shifts are jointly optimized. To tackle the non-convex problem with both discrete and continuous variables, a deep reinforcement learning-based approach is proposed with the proximal policy optimization (PPO) framework. Different from traditional optimization approaches which optimizes the beamforming vectors and phase shifts separately and alternatively, our proposed PPO-based approach optimizes all the variables in unison. Besides, to perform beamforming design in action space, the beamforming vectors for the common stream and the private stream are respectively designed based on the maximum-ratio transmission and the zero forcing to enhance both energy and information transmission. To evaluate the performance of the PPO-based approach, a successive convex approximation (SCA) and Dinkelbach's method based solution scheme (named SCA-D scheme) is also presented. Simulation results show that the system EE obtained by the proposed PPO-based approach is close to that obtained by the SCA-D scheme while outperforming various benchmarks. The RSMA contributes to the EE of the system greatly compared with traditional scheme. As for the case of time-varying channels, the proposed PPO-based approach is with much smaller running time by only sacrificing a slight EE performance compared with the SCA-D scheme.
The cloud radio access network (Cloud-RAN) has recently been proposed as one of the cost-effective and energy-efficient techniques for 5G wireless networks. By moving the signal processing ...functionality to a single baseband unit (BBU) pool, centralized signal processing and resource allocation are enabled in cloud-RAN, thereby providing the promise of improving the energy efficiency via effective network adaptation and interference management. In this paper, we propose a holistic sparse optimization framework to design green cloud-RAN by taking into consideration the power consumption of the fronthaul links, multicast services, as well as user admission control. Specifically, we first identify the sparsity structures in the solutions of both the network power minimization and user admission control problems, which call for adaptive remote radio head (RRH) selection and user admission. However, finding the optimal sparsity structures turns out to be NP-hard, with the coupled challenges of the $\ell_0$-norm-based objective functions and the nonconvex quadratic QoS constraints due to multicast beamforming. In contrast to the previous works on convex but nonsmooth sparsity inducing approaches, e.g., the group sparse beamforming algorithm based on the mixed $\ell_1/\ell_2$-norm relaxation, we adopt the nonconvex but smoothed $\ell_p$-minimization ($0 <p\leq 1$) approach to promote sparsity in the multicast setting, thereby enabling efficient algorithm design based on the principle of the majorization-minimization (MM) algorithm and the semidefinite relaxation (SDR) technique. In particular, an iterative reweighted-$\ell_2$ algorithm is developed, which will converge to a Karush-Kuhn-Tucker (KKT) point of the relaxed smoothed $\ell_p$-minimization problem from the SDR technique. We illustrate the effectiveness of the proposed algorithms with extensive simulations for network power minimization and user admission control in multicast cloud-RAN.
In this paper, we present a flexible low-rank matrix completion (LRMC) approach for topological interference management (TIM) in the partially connected K-user interference channel. No channel state ...information (CSI) is required at the transmitters except the network topology information. The previous attempt on the TIM problem is mainly based on its equivalence to the index coding problem, but so far only a few index coding problems have been solved. In contrast, in this paper, we present an algorithmic approach to investigate the achievable degrees-of-freedom (DoFs) by recasting the TIM problem as an LRMC problem. Unfortunately, the resulting LRMC problem is known to be NP-hard, and the main contribution of this paper is to propose a Riemannian pursuit (RP) framework to detect the rank of the matrix to be recovered by iteratively increasing the rank. This algorithm solves a sequence of fixed-rank matrix completion problems. To address the convergence issues in the existing fixed-rank optimization methods, the quotient manifold geometry of the search space of fixed-rank matrices is exploited via Riemannian optimization. By further exploiting the structure of the low-rank matrix varieties, i.e., the closure of the set of fixed-rank matrices, we develop an efficient rank increasing strategy to find good initial points in the procedure of rank pursuit. Simulation results demonstrate that the proposed RP algorithm achieves a faster convergence rate and higher achievable DoFs for the TIM problem compared with the state-of-the-art methods.
Radio frequency (RF) fingerprinting is a promising device authentication technique for securing the Internet of Things. It exploits the intrinsic and unique hardware impairments of the transmitters ...for device identification. Recently, due to the superior performance of deep learning (DL)-based classification models on real-world datasets, DL networks have been explored for RF fingerprinting. Most existing DL-based RF fingerprinting models use a single representation of radio signals as the input, while the multi-channel input model can leverage information from different representations of radio signals and improve the identification accuracy of RF fingerprints. In this work, we propose a multi-channel attentive feature fusion (McAFF) method for RF fingerprinting. It utilizes multi-channel neural features extracted from multiple representations of radio signals, including in-phase and quadrature samples, carrier frequency offsets, fast Fourier transform coefficients and short-time Fourier transform coefficients. The features extracted from different channels are fused adaptively using a shared attention module, where the weights of neural features are learned during the model training. In addition, we design a signal identification module using a convolution-based ResNeXt block to map the fused features to device identities. To evaluate the identification performance of the proposed method, we construct a Wi-Fi dataset using commercial Wi-Fi end-devices as the transmitters and a Universal Software Radio Peripheral platform as the receiver. Experimental results show that the proposed McAFF method significantly outperforms the single-channel-based as well as the existing DL-based RF fingerprinting methods in terms of identification accuracy and robustness.
This paper investigates the user clustering and power control in the uplink multiple-input single-output non-orthogonal multiple access (MISO-NOMA) networks. A joint optimization problem is ...formulated to minimize the system transmit power. The formulated optimization problem is prohibitively complicated, especially when the number of users is large. Alternatively, a two-step user clustering and power control algorithm is proposed. First, a K-means-based algorithm is proposed for user clustering, where both channel gain and channel correlation among users are taken into account for the distance measurement to reduce the intra- and inter-cluster interference. Then, a semi-orthogonal user selection (SUS) algorithm is designed, with which the optimal cluster number and cluster centers can be dynamically obtained. Further, the closed-form expression of the optimal intra-cluster power control is derived, and the resulting inter-cluster power control problem is solved by designing an efficient iterative algorithm. Simulation results show that the proposed K-means-based iterative power control scheme outperforms other reference methods, and can approach the optimal performance in terms of power consumption and energy efficiency at a much lower computational complexity.
In recent years, semantic communication has received significant attention from both academia and industry, driven by the growing demands for ultra-low latency and high-throughput capabilities in ...emerging intelligent services. Nonetheless, a comprehensive and effective theoretical framework for semantic communication has yet to be established. In particular, finding the fundamental limits of semantic communication, exploring the capabilities of semantic-aware networks, or utilizing theoretical guidance for deep learning in semantic communication are very important yet still unresolved issues. In general, the mathematical theory of semantic communication and the mathematical representation of semantics are referred to as semantic information theory. In this paper, we introduce the pertinent advancements in semantic information theory. Grounded in the foundational work of Claude Shannon, we present the latest developments in semantic entropy, semantic rate-distortion, and semantic channel capacity. Additionally, we analyze some open problems in semantic information measurement and semantic coding, providing a theoretical basis for the design of a semantic communication system. Furthermore, we carefully review several mathematical theories and tools and evaluate their applicability in the context of semantic communication. Finally, we shed light on the challenges encountered in both semantic communication and semantic information theory.
Densifying networks and deploying more antennas at each access point are two principal ways to boost the capacity of wireless networks. However, the complicated distributions of the signal power and ...the accumulated interference power, largely induced by various space-time processing techniques, make it highly challenging to quantitatively characterize the performance of multi-antenna networks. In this paper, using tools from stochastic geometry, a unified framework is developed for the analysis of such networks. The major results are two innovative representations of the coverage probability, which make the analysis of multi-antenna networks almost as tractable as the single-antenna case. One is expressed as an <inline-formula> <tex-math notation="LaTeX">\ell _{1} </tex-math></inline-formula>-induced norm of a Toeplitz matrix, and the other is given in a finite sum form. With a compact representation, the former incorporates many existing analytical results on single- and multi-antenna networks as special cases and leads to tractable expressions for evaluating the coverage probability in both ad hoc and cellular networks. While the latter is more complicated for numerical evaluation, it helps analytically gain key design insights. In particular, it helps prove that the coverage probability of ad hoc networks is a monotonically decreasing convex function of the transmitter density and that there exists a peak value of the coverage improvement when increasing the number of transmit antennas. On the other hand, in multi-antenna cellular networks, it is shown that the coverage probability is independent of the transmitter density and that the outage probability decreases exponentially as the number of transmit antennas increases.
Cell-free (CF) massive multiple-input multiple-output (MIMO) systems, which exploit many geographically distributed access points to coherently serve user equipment via spatial multiplexing on the ...same time-frequency resource, has become a vital component of the next-generation mobile communication networks. Theoretically, CF massive MIMO systems have many advantages, such as large capacity, great coverage, and high reliability, but several practical obstacles must be overcome. In this article, we study the paradigm of CF massive MIMO-aided mobile communications, including the main deployment architectures and associated application scenarios. Furthermore, we thoroughly investigate the challenges of mobile CF massive MIMO communications. We then exploit a novel predictor antenna, hierarchical cancellation, rate-splitting and dynamic clustering system for mobile CF massive MIMO. Finally, several important research directions regarding mobile CF massive MIMO communications are presented to facilitate further investigation.
The conventional design of wireless communication systems typically relies on established mathematical models that capture the characteristics of different communication modules. Unfortunately, such ...design cannot be easily and directly applied to future wireless networks, which will be characterized by large-scale ultra-dense networks whose design complexity scales exponentially with the network size. Furthermore, such networks will vary dynamically in a significant way, which makes it intractable to develop comprehensive analytical models. Recently, deep learning-based approaches have emerged as potential alternatives for designing complex and dynamic wireless systems. However, existing learning-based methods have limited capabilities to scale with the problem size and to generalize with varying network settings. In this paper, we propose a scalable and generalizable neural calibration framework for future wireless system design, where a neural network is adopted to calibrate the input of conventional model-based algorithms. Specifically, the backbone of a traditional time-efficient algorithm is integrated with deep neural networks to achieve a high computational efficiency, while enjoying enhanced performance. The permutation equivariance property, carried out by the topological structure of wireless systems, is furthermore utilized to develop a generalizable neural network architecture. The proposed neural calibration framework is applied to solve challenging resource management problems in massive multiple-input multiple-output (MIMO) systems. Simulation results will show that the proposed neural calibration approach enjoys significantly improved scalability and generalization compared with the existing learning-based methods.
Pilot contamination has been regarded as a main limiting factor of time division duplexing (TDD) massive multiple-input-multiple-output (Massive MIMO) systems, as it will make the ...signal-to-interference-plus-noise ratio (SINR) saturated. However, how pilot contamination will limit the user capacity of downlink Massive MIMO, i.e., the maximum number of users whose SINR targets can be achieved, has not been addressed. This paper provides an explicit expression of the Massive MIMO user capacity in the pilot-contaminated regime where the number of users is larger than the pilot sequence length. This capacity expression characterizes a region within which a set of SINR requirements can be jointly satisfied. The size of this region is fundamentally limited by the pilot sequence length. Furthermore, the scheme for achieving the user capacity, i.e., the uplink pilot training sequences and downlink power allocation, has been identified. Specifically, the generalized Welch bound equality sequences are exploited and it is shown that the power allocated to each user should be proportional to its SINR target. With this capacity-achieving scheme, the SINR requirement of each user can be satisfied and energy-efficient transmission is achieved in the large-antenna-size (LAS) regime. The comparison with two non-capacity-achieving schemes highlights the superiority of our proposed scheme in terms of achieving higher user capacity. Furthermore, for the practical scenario with a finite number of antennas, the actual antenna size required to achieve a significant percentage of the asymptotic performance has been analytically quantified.
PDF
