Search

In concurrent spectrum sharing scenarios between radars and wireless communication systems, one strict approach to protect the radar from undesired interference is locating the base stations outside a guard (or exclusion) zone of the radar. As a result, users inside that zone experience bad communication coverage. This paper uses Reconfigurable Intelligent Surfaces (RISs) to improve the base station coverage of users in the radar exclusion zone. The paper shows, through analysis and simulation, that joint optimization of base station and RIS locations improves the probability of coverage in the exclusion zone over the shared spectrum without disturbing the radar operation. [ABSTRACT FROM AUTHOR]

In this paper, an antenna synthesis process is investigated for Intelligent Transportation System (ITS) application. The wireless communication between Road Side Units (RSUs) and On Board Units (OBUs) located in the vehicles enables smart mobility. However, to support high speed vehicles and high data rates, a wider coverage area by the RSU antennas projected on the highway is required. This is defined by the radiation patterns of the RSU antennas. On a multi-lane highway, interference from the adjacent lanes is a critical issue which determines the communication reliability in terms of Single-to-Interference plus Noise Ratio (SINR). Hence, in this paper, an interference-aware antenna synthesis process is proposed and a planar array is optimized based on the objective function of obtaining a wide coverage area in terms of SINR distribution for a given modulation scheme. The proposed antenna array enhances the reliable communication area and provides improved SINR distribution across the lane for misaligned vehicles from the center of the lane. The results indicate that the proposed antenna array performs better than the existing designs in terms of communication reliability. [ABSTRACT FROM AUTHOR]

In this paper, we propose a cost-efficient beamforming optimization algorithm for multi-user wireless communication systems associated with the intelligent reflecting surface (IRS). From the baseline successive refinement algorithm, which gives a sub-optimal solution for the power minimization problem under the signal-to-interference-plus-noise-ratio (SINR) constraint at each user, several optimization techniques are proposed to reduce the computation complexity while maintaining the algorithm-level performance. To reduce the number of required multiply-accumulate (MAC) operations, we first simplify the complicated matrix inversion by utilizing the channel hardening effect. We also present the two-phase refinement process for the group-level optimization of phase-shift elements, further relaxing the computation complexity as well as the processing latency. Applying the proposed optimization techniques, as a result, numerical results show that the fully-optimized algorithm can reduce the computational costs by up to 89.4% while showing less than 1 dB power loss, leading to the practical solution for the next-generation IRS-aided communication. [ABSTRACT FROM AUTHOR]

The large spectral bandwidth at millimeter-wave (mmWave) frequencies provides a mean to achieve very high data rates in wireless communication systems. A unique characteristic of mmWave is that mmWave links are very sensitive to blockage and have large propagation path loss, which exhibits low line-of-sight (LoS) probability, unstable connectivity and unreliable communication. This paper studies the influence of the blockage in pedestrian scenario, explains in detail how blockage affects the mmWave propagation characteristics. In particular, we study the behavior of the blockage due to human mobility and how it affects the timescale for outage due to blockage using knife-edge diffraction model (KED). One of the existing solutions to overcome the influence of blockage, is to associate the user equipment (UE) with other available base stations (BSs) by handover (HO) if the serving BS is blocked. In this paper, for a pedestrian scenario, we propose two reinforcement learning (RL) based user association algorithms, which accounts for the past experience of the blockage on the position of the UE. One focuses on the reward to increase the sum LoS probability and is named as blockage-aware user association (BAUA). The other focuses on the reward to balance the trade-off between the throughput and the LoS probability and is named as modified BAUA. We compare the proposed algorithm with the conventional user algorithms such as the maximum throughput based algorithm and the maximum SINR based algorithm. Simulation results show that to increase the sum LoS probability BAUA would be suitable, and to increase the average throughput maximum throughput based method would be suitable. [ABSTRACT FROM AUTHOR]

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]

Due to transmission of train control and dispatch commands, the ultra high reliability is required for railway wireless communication systems (RWCS). However, the quality of service (QoS) of RWCS is affected by external interference and jamming seriously in railway transportation. The external interference and jamming generated from intentional and/or unintentional sources can disturb the transmission of RWCS and be extremely dangerous for the trains’ safety. In this paper, a reconfigurable intelligent surface (RIS) approach is proposed to suppress the interference and jamming in RWCS. By taking the signal-to-interference-plus-noise (SINR) as the QoS metrics, the interference suppression problem with RIS is transformed into a maximizing receiving SINR problem. Two optimum solutions, which one is based on Charnes-Cooper transformation and the other is based on single linear programming, are provided. In order to deploy the RIS in RWCS practically, two low-complexity sub-optimum solutions, which one is to bypass the channel estimation for interference links and the other is to maximize the receiving desired power, are also discussed. The simulations results show that the RIS can be employed in RWCS with considerable anti-interference gain. [ABSTRACT FROM AUTHOR]

Complex building structures constrain indoor wireless communications. The significant dependence between the indoor wireless network performance and the building structures can be considered as an intrinsic property of a building, which means that the building has to be designed to achieve desirable indoor wireless network performance. The power gain (PG) and the interference gain (IG) have been defined as the figures of merit (FoMs) to evaluate the wireless performance of a building. Employing open space as the benchmark, the PG and the IG respectively quantify the effective change of the intended signal power and the undesired power, i.e., the interference and thermal noise power, received in a targeted user equipment (UE) location due to the presence of the building. In this paper, a tractable approach is proposed to obtain the PG and the IG with a partition-based path gain model. It enables the PG and the IG to capture the impact of both building materials and the building layout on indoor wireless network performance. Numerical results show that the analytical models in closed-form expressions facilitate the wireless performance assessment to a given building computational-efficiently. This work is a critical complement to the initial framework of the building wireless performance (BWP) evaluation. The proposed method can be employed in future wireless-friendly building design. [ABSTRACT FROM AUTHOR]

The next generation of mobile communication has progressed toward the deployment of small cells to meet the growing demands of increased capacity and QoS as compared to the conventional method, where all the computations were performed by the base station (BS)'s only. To reduce burden at the BS side, small cells deployment has been stressed upon, thus resulting in the formation of ultradense networks (UDN) having high concentration of small cells (e.g., picocell, femtocell, hotspots) and as a counter effect of which distance between two small cells is reduced to a greater extent. With such a close association of cells in UDN, the probability of frequent handovers also increases abruptly. As a result, the chances for attacker to spoof the bandwidth also increases many folds. In this paper, we have analyzed SNR, signal-to-interference-plus-noise ratio, and channel quality information channel parameters, such that the position of moving users at which handover is initiated in picocell deployment of UDN can be traced out successfully or region where the probability of attackers presence is high. Through this paper, we have tried to introduce the attacking scenario for the high mobility conditions in UDN. [ABSTRACT FROM AUTHOR]

Vector perturbation (VP) is a nonlinear precoding technique that achieves near-capacity performance in multiuser multiple-input multiple-output systems at the expense of large complexity due to the search for the optimum perturbation vector. In this paper, we present the hybrid Tomlinson–Harashima VP (TH-VP) algorithm, a novel zero-forcing precoding scheme, which combines TH precoding to remove interuser interference, and VP precoding to equalize each user's multiple spatial streams. We show that the two nonlinear techniques can be integrated in a single optimization and that the proposed algorithm has lower computational requirements than any other. The performance of TH-VP is analyzed and simulation results show that TH-VP outperforms conventional zero-forcing VP and approaches the performance of dirty paper coding. [ABSTRACT FROM AUTHOR]

The level crossing rate (LCR) is an important second-order statistical quantity that characterizes the rate of occurrence of fading time intervals. In this paper, we investigate the LCR of multiantenna flat-fading channels in the presence of additive white Gaussian noise and cochannel interferers with unequal received powers and Doppler shifts. We first present a unified approach to derive the exact LCR of the signal-to-interference-noise ratio at a receiver, where maximum ratio combining is deployed over spatially correlated or uncorrelated systems. Through the exact LCR derivation, we identify an accurate approach to obtain a simplified approximate LCR expression in the spatially uncorrelated system case. Benefits of the LCR expressions derived in the paper are demonstrated in two important applications: 1) the packet error rate is evaluated through the finite-state Markov channel model; and 2) the optimum packet length to maximize the throughput of the system with the stop-and-wait automatic repeat request protocol is derived. The analytical results are validated by simulations. [ABSTRACT FROM PUBLISHER]

Convergence and density evolution of a low-complexity iterative multiple-input multiple-output detection based on belief propagation over a ring-type pairwise graph are presented for binary data. The detection algorithm to be considered is effectively a forward–backward recursion and was originally proposed by Yoon and Chae in a work published in 2014, in which link-level performance, computational complexity, and convergence for Gaussian input were analyzed in detail. This paper presents the convergence proof and the density evolution framework for binary input to give an asymptotic performance in terms of average signal-to-interference-plus-noise ratio and bit error rate (BER) without channel coding. The BER curve obtained via density evolution shows a good match with the simulation results for uncoded BER in the paper by Yoon and Chae verifying the effectiveness of the analysis provided and the performance of the detection algorithm. [ABSTRACT FROM AUTHOR]

Millimeter wave (mmWave) has been widely considered as a promising technology in the next generation wireless communication systems. Various beam-based directional transmission techniques have been proposed to compensate high pathloss caused by mmWave properties. However, mobility effect of users potentially causes severe inter-beam interferences, which has not been fully-investigated in existing studies. In this paper, we have analyzed different types of mobility-aware beam interference models. Additionally, the theoretical SINR is derived based on channel statistics and the trajectories of users. We propose a mobility-aware subband and beam resource allocation (MSBA) scheme for the mmWave subband-beam massive multi-input multi-output (SB-MMIMO) systems. The proposed MSBA benefits from reduced computation complexity for maximizing system throughput constrained by quality-of-service (QoS) demands of users. The first phase of MSBA scheme is responsible for resource block assignment; while the second phase allocates beamwidth and beam directions according to the analytical derivations. Numerical results show that the proposed MSBA scheme can effectively achieve the highest system throughput and the lowest complexity compared to existing schemes in open literatures. [ABSTRACT FROM AUTHOR]

This paper considers the downlink of a cognitive radio (CR) network formed by multiple primary and secondary transmitters, where each multiantenna transmitter serves a preknown set of single-antenna users. This paper assumes that the secondary and primary transmitters can simultaneously transmit their data over the same frequency bands to achieve high system spectrum efficiency. This paper considers the downlink balancing problem of maximizing the minimum signal-to-interference-plus-noise ratio (SINR) of the secondary transmitters subject to both the total power constraint of the secondary transmitters and the maximum interference constraint at each primary user due to secondary transmissions. This paper proposes solving the problem using the alternating direction method of multipliers, which leads to a distributed implementation through limited information exchange across the coupled secondary transmitters. This paper additionally proposes a solution that guarantees feasibility at each iteration. Simulation results demonstrate that the proposed solution converges to the centralized solution in a reasonable number of iterations. [ABSTRACT FROM AUTHOR]

This paper studies the cooperative device-to-device (D2D) transmissions in cellular networks, where two D2D users communicate bidirectionally with each other and simultaneously serve as relays to assist the two-way transmissions between two cellular users. For this scenario, both cellular and D2D links share the same spectrum, thus creating mutual interference. In addition to that, a security problem also exists since the cellular users want to keep their messages secret from the D2D users and vice versa. To address these two issues, a security-embedded interference avoidance scheme is proposed in this paper. By exploiting the constellation rotation technique, the proposed scheme can create interference-free links for both D2D and cellular communications, thereby significantly improving the system error performance. Moreover, our scheme also provides an inherent secrecy protection at the physical layer, which makes the information exchange between cellular users and that between D2D users confidential from each other. [ABSTRACT FROM PUBLISHER]

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]

Carrier sense multiple access with collision notification (CSMA/CN) is a typical representation of physical-layer (PHY)/medium access control (MAC) co-designs, where the MAC control frames are implemented or detected using PHY techniques. With CSMA/CN, the sender detects an unsuccessful transmission, with the aid of a collision notification (CN) from the receiver. In this paper, we first theoretically study the crucial impact of the CN attributes (namely, the detection threshold and the length) on system throughput in a wireless local area network (WLAN). We identify that the false-alarm probability of CN (more generally, the control frames in PHY/MAC co-designs) is a dominating metric that influences system performance. This paper will help developers select optimal CN attributes to balance various factors influencing CN detection performance. Extensive simulation results verify that our performance model is very accurate. [ABSTRACT FROM PUBLISHER]

In this paper, a general two-way relay (TWR) transmission method is proposed under per-antenna power constraints by combining space-time line codes (STLCs) with transmit power allocation for two source nodes. We introduce a general STLC-based encoding scheme for a decode-and-forward TWR and derive the detection signal-to-interference-plus-noise ratio (SINR) values at two source nodes. An optimal encoder structure with power allocation is proposed in terms of maximizing the minimum SINRs, and it is verified that the optimal encoder is identical to the superposition of two conventional STLCs. An iterative method is proposed to find the optimal power allocation for detection at two source nodes. Moreover, a low-complexity suboptimal encoder is proposed for practical implementation. Numerical simulations present that the proposed STLC-based transmission method outperforms a conventional eigen-beamforming scheme with nulling and an STLC-based scheme with equal power allocation, in terms of the average bit error rate of source nodes, regardless of the distribution of source nodes, the number of TWR antennas, and the transmit power. [ABSTRACT FROM AUTHOR]

In this paper, the advantages of joint detection (JD) in a hybrid-duplex unmanned aerial vehicle (UAV) communication system (HBD-UCS) are investigated as a step toward addressing spectrum scarcity in UAV communications. Through extensive outage probability and finite signal-to-noise-ratio diversity gain analysis, we showed that the performance of JD is independent of the strength and the data rate of the inter-UAV interference signal. On the contrary, the successive interference cancellation (SIC) detector requires the data rate of the interfering UAV to be less than the ground station before meaningful performance can be seen. At the system level, it is observed that the half-duplex UAV communication system outperforms the HBD-UCS with JD at moderate and high SNR regimes, as the latter is constrained by self-interference at the full-duplex ground station. Finally, we investigated the multiplexing gain region and showed that the joint detector offers higher diversity gain over a wide range of multiplexing gains over the interference ignorant and the SIC detector. [ABSTRACT FROM AUTHOR]

In this paper, we present a new technique of the symbol error-rate evaluation for quadrature amplitude modulation in communication systems equipped with conventional detectors designed for additive white Gaussian noise (AWGN) model of interference, but operating over a fading environment with arbitrary interference and AWGN. In contrast to many reported methods, the given technique is applicable to arbitrary interference and fading models, and it can efficiently be implemented numerically. These facts make the derived result especially convenient for practical purposes. [ABSTRACT FROM AUTHOR]

The shared resource access wireless communication system is regarded as an efficient paradigm that allows the mobile network operators to have extended coverage and satisfy their subscribers’ high capacity demands while keeping the capital and operational expenditure in check. On the other hand, dual connectivity (DC), a small cell enhancement feature, allows the subscribers to have two simultaneous connections increasing throughput and enhancing mobility robustness. The coordinated multipoint (CoMP) transmission/reception and user-centric virtual cell (VC) improve the signal quality and performance. For all of these mechanisms, the user needs to be under the coverage of multiple base stations (BSs) concurrently. Because of the random nature of the wireless links and distribution of BSs in a network, the practicability/operability of DC and CoMP/VC for a typical user under such random operating conditions (both topological and wireless link randomness) needs to be adequately evaluated. In this paper, we take an extensive look at this problem exploiting tools from Poisson point process theory and stochastic geometry and derive easy-to-evaluate tractable integral expressions for essential performance metrics such as DC and CoMP/VC coverage probability of a typical user in downlink cellular. Unlike most of the existing works, we consider a signal propagation loss model, where the selection of the strongest (not necessarily the closest) BS that serves the typical user is perturbed by arbitrary shadowing, not by fading, i.e., we consider a fading-averaged signal propagation loss process. We derive the coverage probability as a function of various system parameters such as BS density, fading parameters, the cardinality of the coordination set for CoMP/VC, etc. We verify the analytical analysis with simulation results [ABSTRACT FROM AUTHOR]

This paper analyzes statistical properties of the Poisson line Cox point process useful in the modeling of vehicular networks. The point process is created by a two-stage construction: a Poisson line process to model road infrastructure and independent Poisson point processes, conditionally on the Poisson lines, to model vehicles on the roads. We derive basic properties of the point process, including the general quadratic position of the points, the nearest distance distribution, the Laplace functional, the densities of facets of the Cox–Voronoi tessellation, and the asymptotic behavior of the typical Voronoi cell under vehicular densification. These properties are closely linked to features that are important in vehicular networks. [ABSTRACT FROM AUTHOR]

Ultradense heterogeneous networks (HetNets) are emerging as an inevitable approach to tackle the capacity crunch in cellular networks. However, imbalanced load among small and macrocells and poor resource utilization as a consequence in HetNets remains a long-standing problem. This paper addresses this problem by presenting a solution for maximization of coverage and capacity while minimizing load imbalance among macro and small cells. Most recent studies on the topic focus on either optimization of coverage, capacity or load, or a combination of two of these three intertwined objectives. We formulate the optimization problem as a function of two hard parameters namely antenna tilt and transmit power, and a soft parameter, cell individual offset, that affect the coverage, capacity, and load directly. The resulting solution is a combination of the otherwise conflicting coverage and capacity optimization (CCO) and load balancing (LB) self-organizing network (SON) functions. In the presented joint CCO-LB solution, a conflict free operation of CCO and LB is ensured by designing a novel load aware user association methodology and resolving the effects of shadowing on coverage probability using stochastic approximation. The problem is proven to be nonconvex and is solved using genetic algorithm, sequential quadratic programming, and pattern search algorithms. The proposed CCO-LB solution is compared against two recently proposed CCO and CCO-LB solutions in the literature. Results show that the proposed solution can yield significant gain in terms of throughput, spectral efficiency, and load distribution. [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]

Contention resolution diversity slotted ALOHA (CRDSA) is a promising solution to meet the challenge of designing efficient random access in future wireless networks. In this paper, we consider CRDSA with transmit power diversity where each packet copy from a device is transmitted at a randomly selected power level. This results in interslot received power diversity, which is exploited by employing a signal-to-interference-plus-noise ratio based successive interference cancellation (SIC) receiver. Leveraging edge-weighted bipartite graph representation, we propose a novel graph-based message passing algorithm to model the SIC decoding. We derive an expression to characterize the recovery-error probability of the scheme. We also formulate and solve an optimization problem to determine the optimal transmit power distribution. The results show that by enhancing the capture effect, the optimal transmit power distribution leads to considerable performance improvement. [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]

Channel state information (CSI) is critical for the performance of cooperative multicell transmission. In this paper, the performances of cooperative multicell precoding under global CSI and local individual CSI are analyzed and compared in the large dimensional regime. Using theoretical results from large random matrix theory, we derive large dimensional approximations of signal-to-interference-plus-noise ratio for both precoding cases. Such approximations depend only on the slow fading channel statistics instead of the fast fading channel realizations. It is easy to quantify the performance loss caused by local individual CSI in the large dimensional regime. Two different massive MIMO scenarios are considered. When the number of antennas and that of users go large at the same rate, there is a constant gap between the two CSI cases. When the number of antennas goes large, while the number of users is fixed, the performances of both CSI cases are the same. This means that the impact of limited local individual CSI vanishes. Numerical results validate the theoretical analysis and show that there is constant performance loss due to the price of limited CSI. Also, the performance of precoding with local individual CSI almost decreases linearly with the increased number of BSs for the first scenario. [ABSTRACT FROM PUBLISHER]

The evaluation of the coverage probability of multistream multiple-input multiple-output (MIMO) communications in HetNets subject to noise, fading, and intercell interference is undoubtedly intricate. Unfortunately, the current literature misses its comprehensive evaluation, as the effects of noise and cross-stream correlation are often overlooked. Furthermore, computationally friendly expressions of the coverage probability allowing engineering insights and adaptive system design are lacking. For multistream MIMO zero-forcing beamforming, in this paper we tackle these issues by considering scenarios where a receiver is in the coverage if all of its data-streams are successfully decoded. Assuming the max signal-to-interference-plus-noise ratio (SINR) cell association (CA), we adopt the stochastic geometry tools to provide an upper bound and an easy-to-compute closed-form lower bound on the coverage probability, while their accuracies are confirmed against extensive simulations. Our contributions are as follows. We prove that full correlation of data streams of a given link slightly reduces the coverage performance. We show that from a coverage probability perspective, the single stream communication is preferable. We exploit our analysis to explore several pertinent design issues, which have not fully discussed in the literature. Our results demonstrate tradeoffs between densification and multiplexing gains. We, further, see that by appropriately designating feedback channel with modest capacity 8 bits per frame per user, the spatial throughput grows by nearly 180 $\%$ over the conventional 1-bit feedback scenario. Finally, We present important extensions of our analysis to underlay spectrum sharing, practical aspects of the max-SINR CA, and a nonhomogeneous path loss environment. [ABSTRACT FROM PUBLISHER]

Interference alignment (IA) is a promising technique for interference management in wireless networks. However, most of the existing IA works are based on symmetric multiuser networks. To meet the requirements of practical applications, we consider asymmetric networks where the location of each user is randomly distributed. When the path loss is large, interference may become sufficiently weak, and aligning the interference via IA becomes unnecessary. In this paper, a spectrum-efficient topology management (TM) scheme is proposed for asymmetric interference networks. In this scheme, for a user far away from others, solely adopting spatial multiplexing (SM) as a point-to-point multiple-input and multiple-output subnetwork is more spectrum efficient. On the other hand, for the users close to each other, jointly comprising an IA subnetwork can be the better choice. Thus, we first present the decision criterion, which is used for reinterpreting the network as a graph. Then, the TM scheme is elaborated with the graph theory. In addition, we present the designs of the precoding and decoding matrices for the IA and SM subnetworks. Simulation results show that the proposed TM scheme is much more spectrum efficient than the conventional IA scheme in asymmetric interference networks. [ABSTRACT FROM AUTHOR]

In this paper, we study the uplink in a single-cell massive multiple-input–multiple-output system. The base station (BS) is equipped with three antenna arrays, each covering one third of the cell area. Each antenna array comprises a large yet finite number of antennas. The single-antenna users are randomly and uniformly distributed in the cell, transmitting to the BS utilizing full channel inversion power control. All users experience Rician fading. Receiver maximum-ratio-combining is performed at the BS. Under such a setting, we focus on one cell sector and analyze the intrasector interference in a realistic situation where the number of BS antennas is not extremely large compared with the user number. In particular, we show that, due to the line-of-sight (LoS) component of the channel, the interference is partially determined by the angles of arrival of the signals. We approximate the LoS component interference by a Beta mixture. The interference in Rician fading is then modeled as a noncentral chi-square distribution with a random noncentrality parameter, corresponding to the LoS component. The approximate interference distribution can be used to compute signal-to-interference-ratio-dependent metrics such as outage probability and average throughput. [ABSTRACT FROM AUTHOR]

Cognitive radio (CR) in conjunction with multiple-input multiple-output (MIMO) orthogonal frequency-division multiple access is a candidate technology for future mobile radio networks. The short communication range of underlay CR systems is commonly a major limiting factor. In this paper, we propose a computationally and spectrally efficient resource allocation scheme for multiuser MIMO orthogonal-frequency-division-multiplexing-based underlay CR networks to provide good spectral efficiency gain and, therefore, increased communication range. Since the formulated optimization problem defines a mixed-integer programming (combinatorial task) that is hard to solve, we propose a two-phase scheme to produce efficient solutions for both the downlink and the uplink. Particularly, the first procedure elaborates on an adaptive precoding that is characterized by spectral efficiency due to the degrees of freedom it can provide. The second procedure develops a fast subcarrier mapping algorithm, which can be worked out through optimal power distribution among the CR users. The proposed scheme is optimal for the downlink but, however, near-optimal for the uplink. Simulation results demonstrate the bandwidth and computational efficiencies of the proposed scheme compared with the state of the art. [ABSTRACT FROM AUTHOR]

Cooperative communication assisted by relays is regarded as an effective means of achieving spatial diversity. The achievable diversity gain relies on the channel-state information (CSI) that can be acquired at the destination because spatial diversity combining unavoidably requires the disintegrated channel information. To reduce signaling overhead, quantization and compression are applied prior to the delivery of the source-to-relay (SR) CSI to the destination. This paper studies an amplify-and-forward relay network while considering the impact of the quantization of the SR CSI. Several quantization methods relying on the statistics of the SR CSI are investigated. The probability density functions of upper and lower bounds on the signal-to-noise ratio (SNR) and the corresponding symbol-error rate (SER) achieved at the destination are derived analytically. Monte Carlo simulations are performed to compare the simulation results with the analytical results of the SER bounds and to verify the effectiveness of the proposed channel quantizer. A combined method of determining the quantization interval based on equal-probability partitioning and determining the representative quanta based on the minimum-mean-square-error criterion is proposed and is verified to have the lowest quantization error among the noniterative quantization methods compared here. It is shown via the simulations that when using an iterative procedure based on the Lloyd–Max procedure, three bits per dimension are sufficient to achieve negligible SNR degradation. [ABSTRACT FROM AUTHOR]

In uplink device-to-device (D2D) underlay cellular systems, massive multiple-input multiple-output (MIMO) seems promising as the large antenna array at the base station (BS) can nearly null the D2D-to-cellular interference. However, the channel-state information (CSI) from all users is required to obtain this advantage. For the orthogonal training scheme, the pilot overhead increases with the number of D2D users, leading to a loss of the achievable spectral efficiency. In this paper, we propose a pilot scheduling scheme for D2D underlay massive MIMO systems, which allows D2D users to reuse the pilots of cellular users so that the pilot overhead can be reduced. Moreover, a novel interference-aided minimum mean square error (MMSE) detector is proposed to suppress the D2D-to-cellular interference, utilizing the estimated CSI from not only cellular users but D2D users as well. Furthermore, we derive the large-scale approximations of the signal-to-interference-plus-noise ratios (SINRs), which are asymptotically tight and accurate, even for a small number of BS antennas. Based on these SINR approximations, performance analyses are given to provide more insights. Simulation results show that the proposed pilot reuse scheme and detector significantly increase the achievable sum spectral efficiency, as compared with the conventional massive MIMO and other baseline schemes. [ABSTRACT FROM PUBLISHER]

This paper considers the shortest link scheduling problem in wireless networks under the signal-to-interference-plus-noise ratio (SINR) model. We propose an $O({}\log({}l_{\max}/l_{\min}{}){})-approximation algorithm called shortest link scheduling with power control (SLSPC) with oblivious power assignment and an O(\log1+\varphi(l\max/l\min)-approximation algorithm called shortest link scheduling with uniform or mean power assignment (SLSUM) with uniform or mean power control, where \varphi > 0 is a constant serving as a regulatory factor for slight transmit power adjustment, and where l\max and l\min denote the lengths of the longest and shortest links, respectively. We conduct a rigorous theoretical performance analysis to analyze the feasibility and approximation factors of the proposed algorithms. We also carry out an extensive comparison-based simulation study, whose results indicate that the performances of SLSPC and SLSUM are superior over the state of the art as the set of the so-called “black and gray” links, which are difficult to schedule and should be sequentially scheduled, is completely removed by adjusting the transmit power appropriately via $\varphi$. Our numerical analysis demonstrates that the approximation ratios of our algorithms are tighter than the best known ratios. [ABSTRACT FROM PUBLISHER]

Interference alignment (IA) is a promising technique for interference management in wireless networks. On the other hand, jamming is a potential threat to wireless communications, which can degrade the performance of IA-based networks severely. Although some excellent work has been done on IA and antijamming, these two important aspects have traditionally been addressed separately in most previous work. In this paper, we study the antijamming issues and propose two antijamming schemes for IA-based networks. In the first scheme, the jamming signal and interferences are aligned into the same subspace at each receiver, and thus, can be perfectly eliminated together. When the requirement of perfect alignment can be relaxed, the second scheme is proposed to further improve the antijamming performance by maximizing the received signal-to-interference-plus-noise ratio (SINR). We derive the proper and feasibility conditions of the proposed two schemes. Simulation results are presented to show the effectiveness of the proposed schemes in mitigating jamming signals in IA-based wireless networks. [ABSTRACT FROM PUBLISHER]

In this paper, we introduce advancements of the conventional blanking nonlinearity (BN) for orthogonal frequency-division multiplexing (OFDM)-based systems, which is referred to in the following as advanced BN. Blanking is a common measure for mitigating impulsive interference that often occurs in wireless communication systems. Although the BN removes impulsive interference reliably, it possesses various drawbacks for OFDM-based systems. In particular, the choice of the blanking threshold (BT), to decide whether a received sample is blanked, is a critical issue. We present an algorithm for determining the optimal BT to maximize the signal-to-noise-and-interference ratio (SINR) after blanking. Another drawback is that the entire received signal is discarded during a blanking interval, despite the fact that only a fraction of the spectrum of the OFDM signal might be affected by interference. We show how blanking can be limited to subcarriers that are actually affected by interference. Further, we show how these measures can be combined and how a priori information obtained in an iterative loop can be incorporated into the proposed scheme. Simulation results incorporating realistic channel and interference models demonstrate the effectiveness of the proposed scheme. [ABSTRACT FROM PUBLISHER]

This paper proposes feasible and satisfactory system design parameters to mitigate the impact of interference on real-time high-definition video streaming in infrastructure-to-vehicle (I2V) telematic platforms utilizing 60-GHz radiation and the corresponding IEEE 802.11ad baseband. The analysis captures the impact of interference on the 60-GHz I2V vehicle (IV), which is caused by multiple interference sources through the 60-GHz wireless transmissions from nearby I2V base stations (IBSs) to their associated IVs. The impact of the interference on the quality of main 1080p at 30-frame/s (30 1080p frames/s) and 1080p at 60-frame/s (60 1080p frames/s) streaming is analyzed and estimated for various simulation settings. [ABSTRACT FROM PUBLISHER]

This paper investigates the impact of practical operation conditions such as channel information imperfection (CII), independent nonidentical (i.n.i) fading distributions, strict power constraints (i.e., peak transmit power constraint and primary outage constraint), and primary interference on outage performance of opportunistic relay selection (ORS) in underlay cooperative cognitive networks (UCCNs). Toward this end, the power of secondary transmitters is first established to meet strict power constraints and account for primary interference and CII. Then, exact closed-form outage probability expressions for the secondary destination employing the maximum ratio combining (MRC) and the selection combining (SC) are proposed to promptly evaluate the effect of these conditions and provide useful insights into performance limits. Numerous results illustrate significant system performance deterioration due to primary interference and CII, performance saturation phenomenon in the secondary network, performance compromise between the secondary network and the primary network, significant performance improvement with respect to the increase in the number of involved relays, a large gap between the lower outage bound (MRC's outage performance) and the upper outage bound (SC's outage performance), and the advantage of utilizing direct channel between the source and the destination. [ABSTRACT FROM PUBLISHER]

In this paper, we propose trellis-coded quantization (TCQ)-based limited-feedback techniques for massive multiple-input single-output (MISO) frequency-division duplexing systems in temporally and spatially correlated channels. We exploit the correlation present in the channel to effectively quantize channel direction information (CDI). For multiuser systems with matched-filter precoding, we show that the number of feedback bits required by the random vector quantization codebook to match even a small fraction of the perfect-CDI signal-to-interference-plus-noise ratio performance is large. With such large numbers of bits, the exhaustive search required by conventional codebook approaches makes them infeasible for massive MISO systems. Motivated by this, we propose a differential TCQ scheme for temporally correlated channels that transforms the source constellation at each stage in a trellis using 2-D translation and scaling techniques. We derive a scaling parameter for the source constellation as a function of the temporal correlation and the number of base station antennas. We also propose a TCQ-based limited-feedback scheme for spatially correlated channels, where the channel is directly quantized without performing decorrelation at the receiver. Simulation results show that the proposed TCQ schemes outperform the existing noncoherent TCQ (NTCQ) schemes, by improving the spectral efficiency and beamforming gain of the system. The proposed differential TCQ also reduces the feedback overhead of the system compared with the differential NTCQ method. [ABSTRACT FROM PUBLISHER]

Current and future mobile network access technologies increasingly rely on multiantenna transmission techniques and on cell miniaturization to achieve orders-of-magnitude gains in capacity. In this paper, we propose and evaluate the idea of multiuser multiple-input–multiple-input-based (MU-MIMO) cell reassignments. Dense small-cell deployments make it possible to pair user equipment units (UEs), which were originally assigned to different cells, enabling multiuser MIMO (MU-MIMO) and resulting in performance improvements to both UEs. We discuss how such pairings can be accomplished, and we assess the potential gains in the resulting spectral efficiency and MU-MIMO usage. These are assessed through both discussion of performance bounds and detailed system-level simulation in a realistic outdoor small-cell scenario. [ABSTRACT FROM PUBLISHER]

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]

In heterogeneous networks (HetNets), the load between macrocell base stations (MBSs) and small-cell base stations (SBSs) is imbalanced due to their different transmission powers and locations. This load imbalance significantly impacts system performance and affects the experience of mobile users (MUs) with different priorities. In this paper, we aim to distributively optimize the user association in HetNets with various user priorities to solve the load balancing problem. Since the user association is a binary matching problem, which is NP-hard, we propose a distributed belief propagation (BP) algorithm to approach the optimal solution. We first develop a factor graph model, using the network topology, to represent this user association problem. With this factor graph, we propose a novel distributed BP algorithm by adopting the proportional fairness as the objective. Next, we theoretically prove the existence of the fixed point in our BP algorithm. To be more practical, we develop an approximation method to significantly reduce the computational and communication complexity of the BP algorithm. Furthermore, we analyze some properties of the factor graph relevant to the performance of the BP algorithm using the stochastic geometry. Simulation results show that 1) the proposed BP algorithm well approaches the optimal system performance and achieves a much better performance compared with other association schemes and that 2) the analytical results on the average degree distribution and sparsity of the factor graph match with those obtained from the Monte Carlo simulations. [ABSTRACT FROM PUBLISHER]

In emerging heterogeneous networks (HetNets), a wide range of the underlying performance evaluation problems is related to wireless interference characterization and can be reduced to investigating the distribution of a side length in a random triangle. In this paper, we address the task of calculating the side-length distribution in such a triangle determined by the known distributions of its two other sides and the distribution of the angle between them. No restrictions on the distributions of input random variables (RVs) are imposed except for their statistical independence. Our solution delivers a crucial building block for interference analysis in multitier and multiradio HetNets, including mobile device-to-device communication as one of the most extreme interference-limited cases. [ABSTRACT FROM AUTHOR]

We study multiuser detection for uplink transmissions using only analog beamformers in a millimeter-wave (mm-wave) communication system under a limited scattering environment in this paper. In particular, the successive interference cancelation (SIC)-based detection at a base station (BS) that is equipped with an antenna array is considered with the outputs of analog beamformers. We employ beam selection from a codebook of analog beams for low-complexity analog beamforming in the SIC-based detection and compressive sensing (CS)-based channel estimation that is suitable for the BS that only has analog beamformers. Through simulation results, we can see that the performance of the joint analog beam selection and SIC-based detection is comparable with the performance of the SIC-based detection (with ideal digital beamforming) at the cost of more antenna elements with lower complexity. [ABSTRACT FROM AUTHOR]

The cross-layer utility maximization problem, which is subject to stability constraints for a multicommodity wireless network where all links share the same number of orthogonal channels, is considered in this paper. We assume a time-slotted network, where the channel gains randomly change from one slot to another. The optimal cross-layer network control policy can be decomposed into the folloing three subproblems: 1) flow control; 2) next-hop routing and in -node scheduling; and 3) power and rate control, which is also known as resource allocation (RA). These subproblems span the layers from the physical layer to the transport layer. In every time slot, a network controller decides the amount of each commodity data admitted to the network layer, schedules different commodities over the network's links, and controls the power and rate allocated to every link in every channel. To fully exploit the available multichannel diversity, we consider the general case, where multiple links can be activated in the same channel during the same time slot, and the interference is controlled solely through power and rate control. Unfortunately, the RA subproblem is not yet amendable to a convex formulation, and in fact, it is NP-hard. The main contribution of this paper is to develop efficient RA algorithms for multicommodity multichannel wireless networks by applying complementary geometric programming and homotopy methods to analyze the quantitative impact of gains that can be achieved at the network layer in terms of end-to-end rates and network congestion by incorporating different RA algorithms. Although the global optimality of the solution cannot be guaranteed, the numerical results show that the proposed algorithms perform close to the (exponentially complex) optimal solution methods. Moreover, they efficiently exploit the available multichannel diversity, which provides significant gains at the network layer in terms of end-to-end rates and network congestion. In addition, the assessment of the improvement in performance due to the use of multiuser detectors at the receivers is provided. [ABSTRACT FROM PUBLISHER]

In this paper, we tackle the problem of semidistributed user selection with distributed linear precoding for sum-rate maximization in multiuser multicell systems. A set of adjacent base stations (BSs) forms a cluster to perform coordinated transmission to cell-edge users, and coordination is carried out through a central processing unit (CU). However, the message exchange between BSs and the CU is limited to scheduling control signaling, and no user data or channel state information (CSI) exchange is allowed. In the considered multicell coordinated approach, each BS has its own set of cell-edge users and transmits only to one intended user while interference to nonintended users at other BSs is suppressed by signal steering (precoding). We use two distributed linear precoding schemes, namely, distributed zero forcing and distributed virtual signal-to-interference-plus-noise ratio (DVSINR). Considering multiple users per cell and the backhaul limitations, the BSs rely on local CSI to solve the user selection problem. First, we investigate how the signal-to-noise ratio regime and the number of antennas at the BSs impact the effective channel gain (the magnitude of the channels after precoding) and its relationship with multiuser diversity. Considering that user selection must be based on the type of implemented precoding, we develop metrics of compatibility (estimations of the effective channel gains) that can be computed from local CSI at each BS and reported to the CU for scheduling decisions. Based on such metrics, we design user selection algorithms that can find a set of users that potentially maximizes the sum rate. Numerical results show the effectiveness of the proposed metrics and algorithms for different configurations of users and antennas at the BSs. [ABSTRACT FROM AUTHOR]

In this paper, an overhearing protocol is proposed for two-way cooperative multiantenna relaying systems, where the relays equipped with multiple antennas collaborate to relay signals between the base station (BS) and two user equipment units (UEs). In the proposed overhearing protocol, the UE in the uplink transmission phase transmits only in the first time slot, i.e., it remains silent in the second time slot, whereas the previous overhearing protocol assumes that the UE transmits also in the second time slot. Therefore, the proposed overhearing protocol is more power efficient. The precoding matrix at each cooperative relay is optimized in the sense of minimizing the weighted mean squared error (WMSE). Simulation results show that the proposed scheme shows not only lower mean squared error but also higher achievable sum rate than existing cooperative relaying schemes. [ABSTRACT FROM AUTHOR]

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]

Fifth-generation (5G) wireless networks are expected to achieve 1000 times higher capacity compared with fourth-generation wireless networks. Thus, improving the spectrum efficiency (SE) is a crucial problem, which must be considered. Cognitive radio (CR) is considered an effective approach to alleviate the spectrum scarcity problem. In this paper, based on the location information of the primary transmitter (PT) and the CR network, we estimate the distance between the PT and the secondary transmitter (ST) and then propose a joint spectrum sensing and power allocation (JSS-PA) scheme to improve the SE of the CR network. In the JSS-PA scheme, we focus on jointly optimizing the sensing parameters and the transmit power of the secondary user (SU) such that the SE is maximized, whereas the primary user (PU) outage constraint is satisfied. When cooperative spectrum sensing is employed to detect the PU's status, we analyze two cooperative strategies, i.e., soft information fusion (SIF) and hard information fusion (HIF). Under the SIF strategy, the optimization of sensing and power (S-OSP) algorithm is proposed to maximize the SE. Under the HIF strategy, the optimization of thresholds (H-OT) algorithm is proposed, and then, the optimization of sensing and power (H-OSP) algorithm is proposed to find the optimal duration of local sensing, the optimal transmit power of the SU, and the optimal final decision threshold. Finally, we present the simulation results to evaluate the performance of the proposed JSS-PA scheme and discuss the effects of the optimal parameters on different schemes under SIF and HIF strategies. [ABSTRACT FROM PUBLISHER]

Massive multiple-input–multiple-output (MIMO) antenna system implies the use of a large number of base station (BS) antennas to serve a relatively small number of user terminals (UTs) for extraordinary spectral efficiency. However, its performance is limited by pilot contamination due to unavoidable reuse of pilot sequences from UTs in different cells. In this paper, we analyze the performance of massive MIMO zero-forcing (ZF) systems using the time-shifted pilot scheme, which was known to combat pilot contamination effectively using conjugate beamforming if there is a very large number of antennas. We derive expressions for achievable sum rates and the signal-to-interference-plus-noise ratios (SINRs) of forward and reverse links if the number of BS antennas is finite. Then, the impact of system parameters, such as cell radius, transmit power, group number (a parameter related to the time-shifted pilot scheme), BS antenna number, etc., on the system performance are revealed. Our model embraces a series of previous works as special cases. Moreover, we compare the performance of conjugate and ZF precoders, from which a simple but effective large-scale fading-based UT scheduling scheme is proposed to enhance the system throughput. [ABSTRACT FROM PUBLISHER]

This paper investigates advanced energy-efficient wireless systems in orthogonal frequency-division multiple access (OFDMA) downlink networks using coordinated multipoint (CoMP) transmissions between the base stations (BSs) in a heterogeneous network (HetNet), which is adopted by Third-Generation Partnership Project (3GPP) Long-Term Evolution (LTE)-Advanced to meet International Mobile Telecommunications-Advanced targets. HetNet CoMP has received significant attention as a way of achieving spectral efficiency (SE) and energy efficiency (EE). Usually, in the literature, the total network power consumption is restricted to the sum of the power consumption of all BSs. The significance of the power consumption of the backhaul links in wireless networks is normally omitted for its trivial effect with respect to that of the radio BSs. For SE and EE analysis of HetNet CoMP, the energy and bandwidth consumption of the backhaul is considered, without which, the investigation remains incomplete. However, SE and EE are design criteria in conflict with each other, and a careful study of their tradeoff is mandatory for designing future wireless communication systems. The EE is measured as “throughput (bits) per joule,” whereas the power consumption model includes RF transmit (radiated), circuit, and backhaul power. Furthermore, a nonideal backhaul model such as a microwave link is also investigated within intra-HetNet-CoMP (inside one cell), where an implementing fiber is not feasible. An intercell interference (ICI) coordination method is also studied to mitigate ICI. At the end, a novel resource allocation algorithm is proposed—modeled as an optimization problem—which takes into account the total power consumption, including radiated, circuit, and backhaul power, and the minimum required data rate to maximize EE. Given an SE requirement, the EE optimization problem is formulated as a constrained optimization problem. The considered optimization problem is transformed into a convex optimization problem by redefining the constraint using cubic inequality, which results in an efficient iterative resource allocation algorithm. In each iteration, the transformed problem is solved by using dual decomposition with a projected gradient method. Simulations results demonstrate how backhaul has a significant impact on total power consumption and the effectiveness of the studied schemes. In addition, the results demonstrate that the proposed iterative resource allocation algorithm converges within a small number of iterations and illustrate the fundamental tradeoffs between SE and EE. Our analytical results shed light on future “green” network planning in advanced OFDMA wireless systems like those envisioned for a fifth-generation (5G) system. [ABSTRACT FROM PUBLISHER]