Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userIntelligent Reflecting Surface Aided Multi-Cell NOMA Networks
179
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
This paper proposes a novel framework of resource allocation in intelligent reflecting surface (IRS) aided multi-cell non-orthogonal multiple access (NOMA) networks, where a sum-rate maximization problem is formulated. To address this challenging mixed-integer non-linear problem, we decompose it into an optimization problem (P1) with continuous variables and a matching problem (P2) with integer variables. For the non-convex optimization problem (P1), iterative algorithms are proposed for allocating transmit power, designing reflection matrix, and determining decoding order by invoking relaxation methods such as convex upper bound substitution, successive convex approximation and semidefinite relaxation. For the combinational problem (P2), swap matching-based algorithms are proposed to achieve a two-sided exchange-stable state among users, BSs and subchannels. Numerical results are provided for demonstrating that the sum-rate of the NOMA networks is capable of being enhanced with the aid of the IRS.
rate research
Read More
Intelligent reflecting surface (IRS) enhanced multi-unmanned aerial vehicle (UAV) non-orthogonal multiple access (NOMA) networks are investigated. A new transmission framework is proposed, where multiple UAV-mounted base stations employ NOMA to serve multiple groups of ground users with the aid of an IRS. The three-dimensional (3D) placement and transmit power of UAVs, the reflection matrix of the IRS, and the NOMA decoding orders among users are jointly optimized for maximization of the sum rate of considered networks. To tackle the formulated mixed-integer non-convex optimization problem with coupled variables, a block coordinate descent (BCD)-based iterative algorithm is developed. Specifically, the original problem is decomposed into three subproblems, which are alternatingly solved by exploiting the penalty method and the successive convex approximation technique. The proposed BCD-based algorithm is demonstrated to be able to obtain a stationary point of the original problem with polynomial time complexity. Numerical results show that: 1) the proposed NOMA-IRS scheme for multi-UAV networks achieves a higher sum rate compared to the benchmark schemes, i.e., orthogonal multiple access (OMA)-IRS and NOMA without IRS; 2) the use of IRS is capable of providing performance gain for multi-UAV networks by both enhancing channel qualities of UAVs to their served users and mitigating the inter-UAV interference; and 3) optimizing the UAV placement can make the sum rate gain brought by NOMA more distinct due to the flexible decoding order design.
Intelligent reflecting surface (IRS) is deemed as a promising and revolutionizing technology for future wireless communication systems owing to its capability to intelligently change the propagation environment and introduce a new dimension into wireless communication optimization. Most existing studies on IRS are based on an ideal reflection model. However, it is difficult to implement an IRS which can simultaneously realize any adjustable phase shift for the signals with different frequencies. Therefore, the practical phase shift model, which can describe the difference of IRS phase shift responses for the signals with different frequencies, should be utilized in the IRS optimization for wideband and multi-band systems. In this paper, we consider an IRS-assisted multi-cell multi-band system, in which different base stations (BSs) operate at different frequency bands. We aim to jointly design the transmit beamforming of BSs and the reflection beamforming of the IRS to minimize the total transmit power subject to signal to interference-plus-noise ratio (SINR) constraints of individual user and the practical IRS reflection model. With the aid of the practical phase shift model, the influence between the signals with different frequencies is taken into account during the design of IRS. Simulation results illustrate the importance of considering the practical communication scenario on the IRS designs and validate the effectiveness of our proposed algorithm.
Channel estimation is the main hurdle to reaping the benefits promised by the intelligent reflecting surface (IRS), due to its absence of ability to transmit/receive pilot signals as well as the huge number of channel coefficients associated with its reflecting elements. Recently, a breakthrough was made in reducing the channel estimation overhead by revealing that the IRS-BS (base station) channels are common in the cascaded user-IRS-BS channels of all the users, and if the cascaded channel of one typical user is estimated, the other users cascaded channels can be estimated very quickly based on their correlation with the typical users channel cite{b5}. One limitation of this strategy, however, is the waste of user energy, because many users need to keep silent when the typical users channel is estimated. In this paper, we reveal another correlation hidden in the cascaded user-IRS-BS channels by observing that the user-IRS channel is common in all the cascaded channels from users to each BS antenna as well. Building upon this finding, we propose a novel two-phase channel estimation protocol in the uplink communication. Specifically, in Phase I, the correlation coefficients between the channels of a typical BS antenna and those of the other antennas are estimated; while in Phase II, the cascaded channel of the typical antenna is estimated. In particular, all the users can transmit throughput Phase I and Phase II. Under this strategy, it is theoretically shown that the minimum number of time instants required for perfect channel estimation is the same as that of the aforementioned strategy in the ideal case without BS noise. Then, in the case with BS noise, we show by simulation that the channel estimation error of our proposed scheme is significantly reduced thanks to the full exploitation of the user energy.
In this paper, we investigate the design of robust and secure transmission in intelligent reflecting surface (IRS) aided wireless communication systems. In particular, a multi-antenna access point (AP) communicates with a single-antenna legitimate receiver in the presence of multiple single-antenna eavesdroppers, where the artificial noise (AN) is transmitted to enhance the security performance. Besides, we assume that the cascaded AP-IRS-user channels are imperfect due to the channel estimation error. To minimize the transmit power, the beamforming vector at the transmitter, the AN covariance matrix, and the IRS phase shifts are jointly optimized subject to the outage rate probability constraints under the statistical cascaded channel state information (CSI) error model that usually models the channel estimation error. To handle the resulting non-convex optimization problem, we first approximate the outage rate probability constraints by using the Bernstein-type inequality. Then, we develop a suboptimal algorithm based on alternating optimization, the penalty-based and semidefinite relaxation methods. Simulation results reveal that the proposed scheme significantly reduces the transmit power compared to other benchmark schemes.
The fundamental intelligent reflecting surface (IRS) deployment problem is investigated for IRS-assisted networks, where one IRS is arranged to be deployed in a specific region for assisting the communication between an access point (AP) and multiple users. Specifically, three multiple access schemes are considered, namely non-orthogonal multiple access (NOMA), frequency division multiple access (FDMA), and time division multiple access (TDMA). The weighted sum rate maximization problem for joint optimization of the deployment location and the reflection coefficients of the IRS as well as the power allocation at the AP is formulated. The non-convex optimization problems obtained for NOMA and FDMA are solved by employing monotonic optimization and semidefinite relaxation to find a performance upper bound. The problem obtained for TDMA is optimally solved by leveraging the time-selective nature of the IRS. Furthermore, for all three multiple access schemes, low-complexity suboptimal algorithms are developed by exploiting alternating optimization and successive convex approximation techniques, where a local region optimization method is applied for optimizing the IRS deployment location. Numerical results are provided to show that: 1) near-optimal performance can be achieved by the proposed suboptimal algorithms; 2) asymmetric and symmetric IRS deployment strategies are preferable for NOMA and FDMA/TDMA, respectively; 3) the performance gain achieved with IRS can be significantly improved by optimizing the deployment location.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
