Search

This paper studies the integration of the newly-emerged intelligent reflecting surface (IRS) technology into non-orthogonal multiple access (NOMA)-based wireless powered communication networks (WPCNs). We consider two WPCNs which communicate with a common hybrid access point (HAP), where there exists two types of devices in each WPCN, namely information receiving device (IRD) and harvest-then-transmit device (HTTD). Downlink communication from the HAP to IRDs, downlink energy transfer (ET) from the HAP to HTTDs, and uplink information transmission (IT) from the HTTDs to the HAP are assisted by two IRSs, one in each WPCN. Under this setup, we propose efficient algorithms to optimize reflection coefficients, beamforming vectors, and resource allocation for the sake of uplink sum-rate maximization, taking into account the minimum rate requirement at the IRDs. Numerical results show the considerable performance gain of the proposed NOMA-based scheme as compared to the conventional orthogonal multiple access (OMA)-based counterpart. [ABSTRACT FROM AUTHOR]

Security and privacy have become increasingly critical demands in wireless networks, which, however, are particularly susceptible to eavesdropping attacks due to the broadcast nature of radio signals. This paper considers the problem of secure communication in the multiuser downlink with a passive eavesdropper (Eve), whose channel state information (CSI) is unavailable. The transmitter simultaneously transmits concurrent information signals to the users and artificial noise (AN) to Eve. We first assume that all users' CSI is perfectly known by the transmitter and derive a closed-form expression for the ergodic secrecy sum rate (SSR) in the large-system limit. We then use it as an objective function to optimize the power allocation between information signals and the AN. It shows that more power needs to be used for AN when Eve has more antennas and when the system serves fewer users. We also extend the analysis to the imperfect-CSI scenario, where the SSR saturates at high transmit power, and it is better to create more AN than to increase the signal strength when the channel estimation error is large. We derive a scale law of feedback bits (for frequency-division duplexing (FDD) systems) to maintain a constant rate offset compared with the perfect-CSI case and the optimal length of training sequence (for time-division duplexing (TDD) systems) to maximize the effective SSR. It shows that more feedback bits and longer training sequences are required to deal with the eavesdropping problem. Closed-form expressions derived in this paper can reduce the complexity of system analysis and design. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate the symbol-level precoding (SLP) design problem in the downlink of a multiuser multiple-input single-output channel. We consider generic two-dimensional constellations with any shape and size, and confine ourselves to one of the main categories of constructive interference regions (CIR), namely distance preserving CIR (DPCIR). We provide a comprehensive study of DPCIRs and derive several properties for these regions. Using these properties, we first show that any signal in a given DPCIR has a norm greater than or equal to the norm of the corresponding constellation point if and only if the convex hull of the constellation contains the origin. It is followed by proving that the power of the noise-free received signal in a DPCIR is a monotonic strictly increasing function of two parameters relating to the infinite Voronoi edges. Using the convex description of DPCIRs and their characteristics, we formulate two design problems, namely the SLP power minimization with signal-to-interference-plus-noise ratio (SINR) constraints, and the SLP SINR balancing problem under max–min fairness criterion. The SLP power minimization based on DPCIRs can straightforwardly be written as a quadratic programming. We derive a simplified reformulation of this problem, which is less computationally complex. The SLP max–min SINR, however, is non-convex in its original form, and hence difficult to tackle. We propose alternative optimization approaches, including semidefinite programming formulation and block coordinate descent optimization. We discuss and evaluate the loss due to the proposed alternative methods through extensive simulation results. [ABSTRACT FROM AUTHOR]

Physical layer security has drawn significant attention in recent years because of its advancement in preventing confidential information leakage to eavesdroppers. In this paper, we focus on secure beamformer designs in multiuser multi-input multi-output (MU-MIMO) systems with a multi-antenna eavesdropper attempting to overhear the confidential information of a particular user. Unlike the existing work, we aim to exploit the inherent multi-user interference to disrupt the reception of the eavesdropper and enhance the security of wireless communications. Particularly, utilizing practical signal-to-interference-noise metrics, the objective of the secure beamformer design is to minimize the eavesdropper's SINR, while providing legitimate users with required prespecified SINRs to guarantee the qualify of service. We propose secure beamformer designs for both downlink and uplink transmissions, under the conditions of known and unknown eavesdropper's channels, respectively. With the proposed secure beamformers, the multiuser signal behaves like the artificial noise or distributed friendly jamming, which can further degrade the reception of the eavesdropper. Extensive simulation studies confirm our analytical performance predictions and illustrate the advantages of proposed beamformer designs for secure MU-MIMO transmissions. [ABSTRACT FROM AUTHOR]

Densely deployed cellular wireless networks, which employ small cell technology, are being widely implemented. Mitigating the impact of inter- and intracell signal interferences induced by the operations of these networks is a challenging yet essential task. In this paper, we consider adaptive rate scheduling for a transmitting node, regardless of whether it is a base station (BS) or a mobile user. We aim to maximize the system's throughput through the employment of fractional frequency reuse (FFR) schemes. Each BS employs either an omnidirectional or a directional antenna system. We derive the optimal configuration of the FFR scheme and evaluate the ensuing system's performance behavior under absolute and proportional fairness requirements. To maximize the attained throughput by mobiles, we determine the best method to use to classify cell users into interior and edge mobiles. The bandwidth levels allocated for serving interior and edge mobiles are optimized. We derive approximate closed-form mathematical expressions for calculating the probability distributions of the interference signal levels measured at the destined receivers. We account for the impact of the classification process on intercell interference power levels. Under an absolute fairness requirement, we show that optimally configured FFR schemes lead to much enhanced performance. We show that the optimally configured directional-FFR schemes increase the throughput capacity by a factor of about 60% relative to that obtained by using optimal omnidirectional-FFR schemes. The analyses and simulation results presented in this paper serve to characterize the performance behavior attainable by using such small cell deployed cellular wireless network systems when employing the underlying configurations. [ABSTRACT FROM AUTHOR]

In this paper, we consider a multi-cell MISO downlink, where a multi-antenna base station (BS) sends messages to its intended user, while a passive eavesdropper tries to intercept the information in each cell. Physical layer security is employed in order to guarantee information security. Due to incomplete channel state information (CSI) at BSs, residue inter-cell interference exists even with coordinated beamforming, which exerts a great impact on the secrecy performance. In this paper, we conduct a unified performance analysis for physical layer security with incomplete CSI, and derives closed-form expressions of ergodic secrecy rate, secrecy outage probability, and interception probability, considering CSI estimation accuracy, transmit signal to noise ratio (SNR), and channel condition. We reveal some insights on the secrecy performance through asymptotic analysis. Furthermore, based on the derived theoretical results, we propose a CSI exchange amount allocation scheme. Finally, the simulations validate our theoretical claims. [ABSTRACT FROM AUTHOR]

This paper studies the problem of downlink pre-equalization in a multicarrier wireless network under utility and sum-rate maximization. The network utility depends on two main factors: 1) an efficiency mapping which is a function of the signal-to-interference-noise ratio (SINR), and 2) the power of the pre-equalization variables. Meanwhile, the sum-rate index is constructed by the summation of a logarithmic function of the SINRs of the active users. The network utility and sum-rate maximization problems are formulated here by assuming that the data estimation at the mobile units (MUs) is carried out by a simple matched filter. The optimal solutions are derived in this work for the pre-equalization factors by following a strategy that is distributed with respect to the channel state information (CSI) and data rates, but centralized with respect to the spreading sequences of all active users. The construction of these optimal solutions requires in each case a two step procedure. First, the optimal SINR is computed for the maximum utility and sum-rate solutions based on the efficiency mapping and on the bound of the transmission power, respectively. Then, exploiting the induced diversity by the multiple subcarriers, the pre-equalization algorithms cancel the multiple-access interference (MAI) and channel distortions, minimize the transmission power and achieve the optimal SINR after signal detection. A comprehensive numerical evaluation is presented at the end of the paper to validate the analytical derivations. Applications of the proposed pre-equalization schemes could be associated among others to cellular communication systems, and wireless networks of actuators. [ABSTRACT FROM AUTHOR]

We present in this paper a novel proactive interference avoidance scheme for mobile-to-mobile (M2M) communication as an underlay in Long-Term Evolution (LTE) downlink networks. The proposed scheme introduces an intelligent user-selective resource allocation algorithm that aims to proactively avoid interference between M2M pairs and LTE regular users while achieving a satisfactory link budget for both M2M and LTE regular links. The proposed resource allocation algorithm is based on a novel low-complexity interference estimation approach that requires only channel quality indicator (CQI) information (CSI). Since the CQI reporting mechanism has been already implemented in current LTE systems, the proposed algorithm is indeed practical and standard compatible, compared with the existing works that require perfect knowledge of the channel state information (CSI). In this research, achievable data throughput with LTE-compliant adaptive modulation and coding has been adopted as the optimization measurement, rather than the information-theoretic capacity. Therefore, the performance of the proposed scheme is practically realizable in LTE communication systems. Since the performance of the proposed scheme highly relies on the accuracy of CQI feedback, we also carry out performance analysis to evaluate the impact of CQI estimation error and delay. The simulation results show that the total achievable data throughput for LTE networks is dramatically enhanced by M2M communication with this proposed interference avoidance resource allocation scheme. [ABSTRACT FROM PUBLISHER]

This paper studies the performance of two traditional schedulers, namely, proportional fair (PF) and round robin (RR), in the context of relay-enhanced Long-Term Evolution Advanced (LTE-A) networks. These two schedulers are natural candidates for implementation in relay nodes (RNs), and following the results obtained in single-hop networks, mobile operators could be tempted to adopt PF because of the good tradeoff it offers between cell capacity and fairness. Based on a statistical throughput evaluation model, we show that this is not necessarily the right option. The number of RNs, their locations in the cell, and backhaul link quality have a decisive influence on scheduler choice. In some scenarios, it is even not desirable to deploy relays as they degrade the network performance compared with the no-relay case. For the purpose of performance evaluation, we develop a realistic and computationally tractable statistical network model that takes into account fast fading, multiple interferers, cell range expansion bias, backhaul link quality, and traffic load. We also propose optimization of the radio frame structure and a suboptimal RN placement scheme to fairly compare RR and PF. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of coordinated beamforming across a group of base stations (BSs) and frequency slots in the downlink of a multiple-input multiple-output (MIMO) orthogonal frequency-division multiple-access (OFDMA) cellular network. Three figures of merit are considered for system design under a per-BS power constraint: 1) the weighted sum of the rates (WSR) on the frequency slots of the coordinated BSs; 2) the global energy efficiency (GEE), defined as the ratio between the network sum rate and the corresponding consumed power; and 3) the weighted sum of the energy efficiencies (WSEE) on the frequency slots of the coordinated BSs. The Karush–Kuhn–Tucker (KKT) conditions of the considered optimization problems are first derived to gain insight into the structure of the optimal beamformers. Then, we propose a suboptimal design method that can be applied to all considered figures of merit. Numerical results are provided to assess the performance of the proposed beamforming strategies. [ABSTRACT FROM PUBLISHER]

In this paper, we present a quality-of-service (QoS)-aware cooperative downlink scheduling approach for cell-edge and handoff users that offers more reliability and higher effective capacity. The cooperation (handoff) region is defined for active handoff users between two adjacent base stations (BSs) as a function of the user QoS requirements and network load. In addition, the proposed technique inherently acquires intercell interference (ICI) coordination by adjusting the position and size of the cooperation window suitably. Numerical results are presented showing reliability, user QoS and capacity gain performance, and the region for cooperative scheduling in a coded communication scenario. Our analysis indicates that cooperation provides relatively less gain in effective capacity, i.e., up to about 40% with respect to noncooperative handoff, when the QoS requirement is loose. On the other hand, when the QoS requirement is more stringent, the effective capacity gain can increase up to nearly 100%. Additionally, we show that, while for applications with a loose QoS requirement the cooperation window size is small, i.e., nearly 1% of the total area of the BSs participating in cooperation, it increases quite significantly, i.e., up to nearly 25%, for the applications with stringent QoS. Although the outage performance of the proposed approach is poorer than the joint transmission mode of a cooperative multipoint scheme in lightly loaded networks, its effective capacity is significantly higher under varying network traffic load and QoS constraints. [ABSTRACT FROM PUBLISHER]

We consider the uplink transmission in multiuser wireless systems with multiple single-antenna transmitting users and a multiantenna receiver. We address two problems in this paper. The first problem is user admission, i.e., given a large number of users, how to admit the maximum number of users that can simultaneously satisfy quality of service (QoS) and power constraints. The second problem is how to distribute the data among the users when they are allowed to share data before transmission. The aim is to minimize the total data exchange cost. Such a problem is called user clustering. We formulate those problems into sparsity-maximization problems, which are NP-hard. Inspired by compressive sensing techniques, we propose a common framework to tackle those problems by first applying the \ell1 -norm relaxation and then solving them with convex optimization methods. Simulations show that the proposed algorithms achieve excellent performance. For user admission, the numbers of admitted users by the proposed algorithms are close to the optimum numbers of admitted users obtained by exhaustive search (ES) . For user clustering, the total data exchange cost is reduced by more than 10% after only a few iterations. When the QoS requirement is low, the user data exchange can be avoided using the proposed method, which achieves the optimum result obtained by ES. [ABSTRACT FROM PUBLISHER]

It has been shown that the knowledge of both channel and data information at the base station prior to downlink transmission can help increase the received signal-to-noise ratio (SNR) of each user without the need to increase the transmitted power. Achievability is based on the idea of phase alignment (PA) precoding, where instead of nulling out the destructive interference, it judiciously rotates the phases of the transmitted symbols. In this way, they add up coherently at the intended user and yield higher received SNRs. In addition, it is well known that regularized channel inversion (RCI) precoding improves the performance of channel inversion (CI) in multiantenna downlink communications. In line with this and similar to the RCI precoding, in this paper, we propose the idea of regularized PA (RPA), which is shown to improve the performance of original PA precoding. To do this, we first rectify the original PA precoding, deriving a closed-form expression to evaluate the amount of transmit-power reduction achieved for the same average output SNR compared with CI precoding. We then use this new analysis to select the appropriate regularization factor for our proposed RPA scheme. It is shown by means of theoretical analysis and simulations that the proposed RPA precoding outperforms CI, RCI, and PA precoders from both symbol error rate (SER) and throughput perspectives and provides a more power-efficient alternative. This is particularly pronounced as the number of transmit antennas becomes larger, where up to a 50-times reduction in the transmit power is achieved by RPA (PA) compared with RCI (CI) precoding for a given performance. [ABSTRACT FROM AUTHOR]