The spectrum efficiency (SE) and security of the secondary users (SUs) in the cognitive radio networks (CRNs) have become two main issues due to the limitation interference to the primary users (PUs) and the shared spectrum with the PUs. Intelligent reflecting surface (IRS) has been recently proposed as a revolutionary technique which can help to enhance the SE and physical layer security of wireless communications. This paper investigates the application of IRS in an underlay CRN, where a multi-antenna cognitive base station (CBS) utilizes spectrum assigned to the PU to communicate with a SU via IRS in the presence of multiple coordinated eavesdroppers (Eves). To achieve the trade-off between the secrecy rate (SR) and energy consumption, we investigate the secrecy energy efficiency (SEE) maximization problem by jointly designing the transmit beamforming at the CBS and the reflect beamforming at the IRS. To solve the non-convex problem with coupled variables, we propose an iterative alternating optimization algorithm to solve the sub-problems alternately, by utilizing an iterative penalty function based algorithm for sub-problem 1 and the difference of two-convex functions method for sub-problem 2. Furthermore, we provide a second-order-cone-programming (SOCP) approximation approach to reduce the computational complexity. Finally, the simulation results demonstrate that IRS can help significantly improve the SE and enhance the physical layer security in the CRNs. Moreover, the effectiveness and superiority of our proposed algorithm in achieving the trade-off between the SR and energy consumption are verified.
Deploying federated learning (FL) over wireless networks with resource-constrained devices requires balancing between accuracy, energy efficiency, and precision. Prior art on FL often requires devices to train deep neural networks (DNNs) using a 32-bit precision level for data representation to improve accuracy. However, such algorithms are impractical for resource-constrained devices since DNNs could require execution of millions of operations. Thus, training DNNs with a high precision level incurs a high energy cost for FL. In this paper, a quantized FL framework, that represents data with a finite level of precision in both local training and uplink transmission, is proposed. Here, the finite level of precision is captured through the use of quantized neural networks (QNNs) that quantize weights and activations in fixed-precision format. In the considered FL model, each device trains its QNN and transmits a quantized training result to the base station. Energy models for the local training and the transmission with the quantization are rigorously derived. An energy minimization problem is formulated with respect to the level of precision while ensuring convergence. To solve the problem, we first analytically derive the FL convergence rate and use a line search method. Simulation results show that our FL framework can reduce energy consumption by up to 53% compared to a standard FL model. The results also shed light on the tradeoff between precision, energy, and accuracy in FL over wireless networks.
We propose a data-driven approach for power allocation in the context of federated learning (FL) over interference-limited wireless networks. The power policy is designed to maximize the transmitted information during the FL process under communication constraints, with the ultimate objective of improving the accuracy and efficiency of the global FL model being trained. The proposed power allocation policy is parameterized using a graph convolutional network and the associated constrained optimization problem is solved through a primal-dual algorithm. Numerical experiments show that the proposed method outperforms three baseline methods in both transmission success rate and FL global performance.
Cell-Free Massive Multiple-input Multiple-output (mMIMO) consists of many access points (APs) in a coverage area that jointly serve the users. These systems can significantly reduce the interference among the users compared to conventional MIMO networks and so enable higher data rates and a larger coverage area. However, Cell-Free mMIMO systems face multiple practical challenges such as the high complexity and power consumption of the APs' analog front-ends. Motivated by prior works, we address these issues by considering a low complexity hybrid beamforming framework at the APs in which each AP has a limited number of RF-chains to reduce power consumption, and the analog combiner is designed only using the large-scale statistics of the channel to reduce the system's complexity. We provide closed-form expressions for the signal to interference and noise ratio (SINR) of both uplink and downlink data transmission with accurate random matrix approximations. Also, based on the existing literature, we provide a power optimization algorithm that maximizes the minimum SINR of the users for uplink scenario. Through several simulations, we investigate the accuracy of the derived random matrix approximations, trade-off between the 95% outage data rate and the number of RF-chains, and the impact of power optimization. We observe that the derived approximations accurately follow the exact simulations and that in uplink scenario while using MMSE combiner, power optimization does not improve the performance much.
We introduce a framework for linear precoder design over a massive multiple-input multiple-output downlink system in the presence of nonlinear power amplifiers (PAs). By studying the spatial characteristics of the distortion, we demonstrate that conventional linear precoding techniques steer nonlinear distortions towards the users. We show that, by taking into account PA nonlinearity, one can design linear precoders that reduce, and in single-user scenarios, even completely remove the distortion transmitted in the direction of the users. This, however, is achieved at the price of a reduced array gain. To address this issue, we present precoder optimization algorithms that simultaneously take into account the effects of array gain, distortion, multiuser interference, and receiver noise. Specifically, we derive an expression for the achievable sum rate and propose an iterative algorithm that attempts to find the precoding matrix which maximizes this expression. Moreover, using a model for PA power consumption, we propose an algorithm that attempts to find the precoding matrix that minimizes the consumed power for a given minimum achievable sum rate. Our numerical results demonstrate that the proposed distortion-aware precoding techniques provide significant improvements in spectral and energy efficiency compared to conventional linear precoders.
The effective integration of unmanned aerial vehicles (UAVs) in future wireless communication systems depends on the conscious use of their limited energy, which constrains their flight time. Reconfigurable intelligent surfaces (RISs) can be used in combination with UAVs with the aim to improve the communication performance without increasing complexity at the UAV side. In this paper, we propose a synergetic UAV RIS communication system, utilizing a UAV with a highly directional antenna aiming to the RIS. The proposed scenario can be applied in all air-to-ground RIS-assisted networks and numerical results illustrate that it is superior from the cases where the UAV utilizes either an omnidirectional antenna or a highly directional antenna aiming towards the ground node.
The kinetic theory provides a good basis for developing numerical methods for multiscale gas flows covering a wide range of flow regimes. A particular challenge for kinetic schemes is whether they can capture the correct hydrodynamic behaviors of the system in the continuum regime (i.e., as the Knudsen number $\epsilon\ll 1$ ) without enforcing kinetic scale resolution. At the current stage, the main approach to analyze such property is the asymptotic preserving (AP) concept, which aims to show whether the kinetic scheme reduces to a solver for the hydrodynamic equations as $\epsilon \to 0$. However, the detailed asymptotic properties of the kinetic scheme are indistinguishable as $\epsilon$ is small but finite under the AP framework. In order to distinguish different characteristics of kinetic schemes, in this paper we introduce the concept of unified preserving (UP) aiming at assessing asmyptotic orders (in terms of $\epsilon$) of a kinetic scheme by employing the modified equation approach and Chapman-Enskon analysis. It is shown that the UP properties of a kinetic scheme generally depend on the spatial/temporal accuracy and closely on the inter-connections among the three scales (kinetic scale, numerical scale, and hydrodynamic scale). Specifically, the numerical resolution and specific discretization determine the numerical flow behaviors of the scheme in different regimes, especially in the near continuum limit. As two examples, the UP analysis is applied to the discrete unified gas-kinetic scheme (DUGKS) and a second-order implicit-explicit Runge-Kutta (IMEX-RK) scheme to evaluate their asymptotic behaviors in the continuum limit.
We propose a variant of alternating direction method of multiplier (ADMM) to solve constrained trajectory optimization problems. Our ADMM framework breaks a joint optimization into small sub-problems, leading to a low iteration cost and decentralized parameter updates. Our method inherits the theoretical properties of primal interior point method (P-IPM), i.e., guaranteed collision avoidance and homotopy preservation, while being orders of magnitude faster. We have analyzed the convergence and evaluated our method for time-optimal multi-UAV trajectory optimizations and simultaneous goal-reaching of multiple robot arms, where we take into consider kinematics-, dynamics-limits, and homotopy-preserving collision constraints. Our method highlights 10-100 times speedup, while generating trajectories of comparable qualities as state-of-the-art P-IPM solver.
Self-energy recycling (sER), which allows transmit energy re-utilization, has emerged as a viable option for improving the energy efficiency (EE) in low-power Internet of Things networks. In this work, we investigate its benefits also in terms of reliability improvements and compare the performance of full-duplex (FD) and half-duplex (HD) schemes when using multi-antenna techniques in a communication system. We analyze the trade-offs when considering not only the energy spent on transmission but also the circuitry power consumption, thus making the analysis of much more practical interest. In addition to the well known spectral efficiency improvements, results show that FD also outperforms HD in terms of reliability. We show that sER introduces not only benefits in EE matters but also some modifications on how to achieve maximum reliability fairness between uplink and downlink transmissions, which is the main goal in this work. In order to achieve this objective, we propose the use of a dynamic FD scheme where the small base station (SBS) determines the optimal allocation of antennas for transmission and reception. We show the significant improvement gains of this strategy for the system outage probability when compared to the simple HD and FD schemes.
The underlay cognitive radio-based hybrid radio frequency / free-space optical (RF / FSO) systems have been emerged as a promising technology due to its ability to eliminate spectrum scarcity and spectrum under-utilization problems. Consequently, this work analyzes the physical layer security aspects of a cognitive RF / FSO hybrid network that includes a primary user, a secondary source, a secondary receiver, and an eavesdropper where the secret communication takes place between two legitimate secondary peers over the RF and FSO links simultaneously, and the eavesdropper can overhear the RF link only. In particular, the maximum transmit power limitation at the secondary user as well as the permissible interference power restriction at the primary user are also taken into consideration. All the RF links are modeled with $\alpha$-$\mu$ fading whereas the FSO link undergoes M\'alaga (M) turbulence with link blockage and pointing error impairments. At the receiver, the selection combining diversity technique is utilized to select the signal with the best electrical signal-to-ratio (SNR). Moreover, the closed-form expressions for the secrecy outage probability, probability of strictly positive secrecy capacity, and effective secrecy throughput are derived to analyze the secrecy performance. Besides, the impacts of fading, primary-secondary interference, detection techniques, link blockage probability, atmospheric turbulence, and pointing error are examined. Finally, Monte-Carlo simulations are performed to corroborate the derived expressions.
Reconfigurable intelligent surface (RIS) has become a promising technology to improve wireless communication in recent years. It steers the incident signals to create a favorable propagation environment by controlling the reconfigurable passive elements with less hardware cost and lower power consumption. In this paper, we consider a RIS-aided multiuser multiple-input single-output downlink communication system. We aim to maximize the weighted sum-rate of all users by joint optimizing the active beamforming at the access point and the passive beamforming vector of the RIS elements. Unlike most existing works, we consider the more practical situation with the discrete phase shifts and imperfect channel state information (CSI). Specifically, for the situation that the discrete phase shifts and perfect CSI are considered, we first develop a deep quantization neural network (DQNN) to simultaneously design the active and passive beamforming while most reported works design them alternatively. Then, we propose an improved structure (I-DQNN) based on DQNN to simplify the parameters decision process when the control bits of each RIS element are greater than 1 bit. Finally, we extend the two proposed DQNN-based algorithms to the case that the discrete phase shifts and imperfect CSI are considered simultaneously. Our simulation results show that the two DQNN-based algorithms have better performance than traditional algorithms in the perfect CSI case, and are also more robust in the imperfect CSI case.