Search

We consider performance enhancement of asymmetrically-clipped optical orthogonal frequency division multiplexing (ACO-OFDM) and related optical OFDM schemes, which are variations of OFDM in intensity-modulated optical wireless communications. Unlike most existing studies on specific designs of improved receivers, this paper investigates information theoretic limits of all possible receivers. For independent and identically distributed (IID) complex Gaussian inputs, we obtain an exact characterization of information rate of ACO-OFDM with improved receivers for all SNRs. It is proved that the high-SNR gain of improved receivers asymptotically achieve 1/4 bits per channel use, which is equivalent to 3 dB in electrical SNR or 1.5 dB in optical SNR; as the SNR decreases, the maximum achievable SNR gain of improved receivers decreases monotonically to a non-zero low-SNR limit, corresponding to an information rate gain of 36.3%. For practically used constellations, we derive an upper bound on the gain of improved receivers. Numerical results demonstrate that the upper bound can be approached to within 1 dB in optical SNR by combining existing improved receivers and coded modulation. We also show that our information theoretic analyses can be extended to Flip-OFDM and PAM-DMT. Our results imply that, for the considered schemes, improved receivers may reduce the gap to channel capacity significantly at low-to-moderate SNR. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the performance of an RIS-aided wireless communication system subject to outdated channel state information that may operate in both the near- and far-field regions. In particular, we take two RIS deployment strategies into consideration: (i) the centralized deployment, where all the reflecting elements are installed on a single RIS and (ii) the distributed deployment, where the same number of reflecting elements are placed on multiple RISs. For both deployment strategies, we derive accurate closed-form approximations for the ergodic capacity, and we introduce tight upper and lower bounds for the ergodic capacity to obtain useful design insights. From this analysis, we unveil that an increase of the transmit power, the Rician- $K$ factor, the accuracy of the channel state information and the number of reflecting elements help improve the system performance. Moreover, we prove that the centralized RIS-aided deployment may achieve a higher ergodic capacity as compared with the distributed RIS-aided deployment when the RIS is located near the base station or near the user. In different setups, on the other hand, we prove that the distributed deployment outperforms the centralized deployment. Finally, the analytical results are verified by using Monte Carlo simulations. [ABSTRACT FROM AUTHOR]

Ultra-Reliable and Low-Latency Communications (URLLC) has attracted considerable attention because of its potential applications in factory automation, automated driving, and telesurgery anticipated for the era of the sixth-Generation (6G) networks. In URLLC with random channel gains and a hard delay constraint, the scheduling of backlogged queues and finite blocklength coding in the physical layer will make it very challenging to specify its performance limits. In this paper, we focus our attention on the asymptotic cross-layer analysis of URLLC when the Signal-to-Noise Ratio (SNR) is sufficiently high. More specifically, we find that a fundamental tradeoff exists among the service capability, latency, and error probability in the high SNR regime, which is characterized by a gain conservation equation. The main result of this work reveals that the sum of our defined service rate gain, real-time gain, and reliability gain is equal to one under the optimal policy. Numerical simulations are also exploited to validate that the derived gain conservation equation holds even with bounded random arrival. [ABSTRACT FROM AUTHOR]

Channel estimation is challenging for the reconfigurable intelligent surface (RIS)-aided wireless communications. Since the number of coefficients of the cascaded channel among the base station (BS), the RIS, and the user equipment (UE), is the product of the number of BS antennas, the number of RIS elements, and the number of UEs, the pilot overhead can be prohibitively high. In this paper, we propose a two-timescale channel estimation framework to exploit the property that the BS-RIS channel is high-dimensional but quasi-static, while the RIS-UE channel is mobile but low-dimensional. Specifically, to estimate the quasi-static BS-RIS channel, we propose a dual-link pilot transmission scheme, where the BS transmits downlink pilots and receives uplink pilots reflected by the RIS. Then, we propose a coordinate descent-based algorithm to recover the BS-RIS channel. Since the quasi-static BS-RIS channel is estimated less frequently than the mobile channel is, the average pilot overhead can be reduced from a long-term perspective. Although the mobile RIS-UE channel has to be frequently estimated in a small timescale, the associated pilot overhead is low thanks to its low dimension. Simulation results show that the proposed two-timescale channel estimation framework can achieve accurate channel estimation with low pilot overhead. [ABSTRACT FROM AUTHOR]

In order to satisfy the requirement of extremely high data rate in traffic hotspot regions, millimeter wave (mmWave) has attracted significant attention in wireless communication networks. While the coverage performance of mmWave networks based on the distribution of signal-to-interference-plus-noise ratio (SINR) has been widely studied, it provides only very limited information on the link reliability. In this paper, we provide a fine-grained performance analysis of the mmWave networks with hotspots. Specifically, we first establish a general and tractable framework to investigate the performance of mmWave networks using the Poisson cluster process integrated with several features of the mmWave band. Both open and closed association strategies are considered. To show what fraction of users in the networks achieves target reliability when the SINR is given, we derive the tier association probability and the moments of the conditional SINR distribution, based on which the exact meta distributions of SINR are given. Interestingly, in clustered mmWave networks, the widely used standard and generalized beta approximations do not work well when the blockage effect is severe. To resolve this issue, we provide a modified approximation by scaling the standard beta distribution, which is shown to be closer to the exact results. We conduct extensive simulations to study the impact of mmWave and deployment features on the performance of clustered mmWave networks. Numerical results reveal that the optimal scattering variance of mmWave base stations scales with the cluster size to maximize the number of concurrent reliable links, and increasing the antenna directivity results in more reliable communications than elevating the transmit power of mmWave base stations. [ABSTRACT FROM AUTHOR]

Intelligent reflecting surface (IRS) is deemed as a promising solution to improve the spectral and energy efficiency of wireless communications cost-effectively. In this paper, we consider a wireless network where multiple base stations (BSs) serve their respective users with the aid of distributed IRSs in the downlink communication. Specifically, each IRS assists in the transmission from its associated BS to user via passive beamforming, while in the meantime, it also randomly scatters the signals from other co-channel BSs, thus resulting in additional signal as well as interference paths in the network. As such, a new IRS-user/BS association problem arises pertaining to optimally balance the passive beamforming gains from all IRSs among different BS-user communication links. To address this new problem, we first derive a tractable lower bound of the average signal-to-interference-plus-noise ratio (SINR) at the receiver of each user, termed average-signal-to-average-interference-plus-noise ratio (ASAINR), based on which two ASAINR balancing problems are formulated to maximize the minimum ASAINR among all users by optimizing the IRS-user associations without and with BS transmit power control, respectively. We also characterize the scaling behavior of user ASAINRs with the increasing number of IRS reflecting elements to investigate the different effects of IRS-reflected signal versus interference power. Moreover, to solve the two ASAINR balancing problems that are both non-convex optimization problems, we propose an optimal solution to the problem without BS power control and low-complexity suboptimal solutions to both problems by applying the branch-and-bound method and exploiting new properties of the IRS-user associations, respectively. Numerical results verify our performance analysis and also demonstrate significant performance gains of the proposed solutions over benchmark schemes. [ABSTRACT FROM AUTHOR]

We consider two users A and B wanting to exchange their messages MA and MB via a relay in a wireless communication network. To this aim, we have two methods: direct forward (DF) and computation and forward (CAF). In the first method, after an orthogonal multiple access (OMA) or non-orthogonal multiple access (NOMA) phase, the receiver decodes the two messages. In the second method, after a NOMA phase, the receiver decodes only the (modulo) sum. In the latter case the capacity region (computation region) is not known. This paper compares the two methods. To such aim, we propose a unified coding framework and identify a lower bound of achievable computation rates. We consider three constellations for the symmetric two-user Gaussian channel with Eisenstein constellation showing highest performance. We also show that a minimum signal-to-noise ratio is required for our CAF method to outperform DF, and we obtain the numerical values of such minimum ratios for the three constellations. Finally, we show achievability of our bounds, which is proved to require affine codes for computation, which has not been proved before. Overall, our results are useful for communication system designers towards practical implementation of multiple access methods in integrated wireless systems. [ABSTRACT FROM AUTHOR]

Multiple-input Multiple-output (MIMO) technologies play an important role in modern and future wireless communication systems as they can improve the capacity without increasing the bandwidth. MIMO detection is one of the key technologies for MIMO system designs. MIMO detection schemes based on Message Passing (MP) algorithms have attracted extensive attention in recent years. The MIMO detection scheme based on Expectation Propagation (EP), which is also a kind of MP algorithms, has been proved to achieve the Bayes-optimal performance under the conditions of large system limit and compression rate threshold. However, there is improvement space for the detection performance of the EP algorithm when the conditions are not satisfied, which are the common cases in the practical applications. In this paper, when the conditions of the large system limit and compression rate threshold are not satisfied, we analyze the influences of two factors, the initial parameters selection and the moment matching strategy, on the performance of EP based detection scheme. As a result, we propose an improved EP detection scheme based on optimizing the two factors. Simulation results show that the proposed scheme outperforms the original EP detection scheme in different MIMO scenarios. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new construction of generalized root protograph (GRP) low-density parity-check (LDPC) codes which has a guaranteed diversity order. New hybrid-automatic request with incremental redundancy (H-ARQ-IR) is also proposed to ensure high diversity and rate-compatibility in wireless communication systems, where the GRP LDPC codes are employed along with a method called feedback encoding. The proposed H-ARQ-IR has advantages of low-complexity and near-optimal performance. In order to show its performance behavior, theoretical analysis for the proposed scheme is conducted for the block fading channel. Furthermore, numerical analysis shows that it achieves near maximum diversity order under the belief propagation (BP) decoding with binary phase shift keying (BPSK) modulation and high-order quadrature amplitude modulations (QAMs). [ABSTRACT FROM AUTHOR]

Intelligent reflecting surface (IRS) that enables the control of wireless propagation environment has recently emerged as a promising cost-effective technology for boosting the spectral and energy efficiency of future wireless communication systems. Prior works on IRS are mainly based on the ideal phase shift model assuming full signal reflection by each of its elements regardless of the phase shift, which, however, is practically difficult to realize. In contrast, we propose in this paper a practical phase shift model that captures the phase-dependent amplitude variation in the element-wise reflection design. Based on the proposed model and considering an IRS-aided multiuser system with one IRS deployed to assist in the downlink communications from a multi-antenna access point (AP) to multiple single-antenna users, we formulate an optimization problem to minimize the total transmit power at the AP by jointly designing the AP transmit beamforming and the IRS reflect beamforming, subject to the users’ individual signal-to-interference-plus-noise ratio (SINR) constraints. Iterative algorithms are proposed to find suboptimal solutions to this problem efficiently by utilizing the alternating optimization (AO) as well as penalty-based optimization techniques. Moreover, to draw essential insight, we analyze the asymptotic performance loss of the IRS-aided system that employs practical phase shifters but assumes the ideal phase shift model for beamforming optimization, as the number of IRS elements goes to infinity. Simulation results unveil substantial performance gains achieved by the proposed beamforming optimization based on the practical phase shift model as compared to the conventional ideal model. [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) and spectrum sharing (SS) are two emerging multiple access technologies for efficient spectrum utilization in future wireless communications standards. In this paper, we present the performance analysis of a NOMA-based cooperative relaying system (CRS) in an underlay spectrum sharing scenario, considering a peak interference constraint (PIC), where the peak interference inflicted by the secondary (unlicensed) network on the primary-user (licensed) receiver (PU-Rx) should be less than a predetermined threshold. In the proposed system the relay and the secondary-user receiver (SU-Rx) are equipped with multiple receive antennas and apply selection combining (SC), where the antenna with highest instantaneous signal-to-noise ratio (SNR) is selected, and maximal-ratio combining (MRC), for signal reception. Closed-form expressions are derived for the average achievable rate and outage probabilities for SS-based CRS-NOMA. These results show that for large values of peak interference power, the SS-based CRS-NOMA outperforms the CRS with conventional orthogonal multiple access (OMA) in terms of spectral efficiency. The effect of the interference channel on the system performance is also discussed, and in particular, it is shown that the interference channel between the secondary-user transmitter (SU-Tx) and the PU-Rx has a more severe effect on the average achievable rate as compared to that between the relay and the PU-Rx. A close agreement between the analytical and numerical results confirm the correctness of our rate and outage analysis. [ABSTRACT FROM AUTHOR]

In this paper, we investigate adaptive power allocation for generalized polar optical wireless communications (OWC), where a general complex bipolar signal is converted into magnitude and phase signals for intensity modulation. Mean square errors (MSE) between the input complex signals and the re-constructed complex signals are derived to characterize signal distortion. Optimal power scaling factors and power allocation are investigated to minimize the distortion. Under a sole average intensity constraint, closed-form optimal power scaling factors are derived and found to be input-dependent. Specifically, they are determined by the first and second moments of the magnitude signals, the first moment of the phase signals as well as the channel state. Under both average and peak intensity constraints, the expression of MSE regarding the power scaling factors is derived but it is too complicated to find the optimal power allocation. Thus, we propose to use a small-scale numerical search for practical power allocation. As an example, we adopt the proposed power allocation to polar optical orthogonal frequency division multiplexing (P-OFDM) systems and analyze its achievable bit error rate (BER). Numerical simulations are presented to validate the analysis. It is shown that the proposed power allocation greatly improves the performance in terms of MSE and BER and the proposed power allocation-enhanced P-OFDM (EP-OFDM) outperforms existing optical OFDM schemes over various channels in the high signal-to-noise ratio (SNR) regime, especially in the systems with a peak intensity constraint. [ABSTRACT FROM AUTHOR]

This paper investigates the secrecy performance of multiple-input multiple-output systems under generalized $\alpha -\mu $ fading conditions. To this end, we focus on two distinct scenarios: 1) the transmitter has knowledge of the channel state information (CSI) of the eavesdropper channel and 2) the transmitter is not aware of the CSI of the wiretap link. By considering transmit antenna selection in the underlying system, we develop closed-form analytical expressions for the lower bound of the secrecy outage probability (SOP) and the probability of the strictly positive secrecy capacity. Furthermore, two novel approaches are proposed to derive an analytical expression of the average secrecy capacity (ASC). First, the ASC is expressed as a function of the average capacity of the desired link and an interaction term regarded as the ASC loss. Second, the ASC is expressed in terms of the average capacities of the desired and eavesdropper links, plus an interaction term that can be regarded as some sort of ASC gain due to the statistical independence between the desired and eavesdropper links. In addition, asymptotic studies of the SOP and the ASC at high signal-to-noise ratio are carried out, which precisely reveal the secrecy diversity and array gains. [ABSTRACT FROM AUTHOR]

Full-duplex (FD) jamming transceivers recently have been shown to enhance the information security of wireless communication systems by simultaneously transmitting artificial noise (AN) while receiving information. In this paper, we investigate whether FD jamming can also improve the system’s secrecy energy efficiency (SEE) in terms of securely communicated bits per Joule when considering the additional power used for jamming and self-interference (SI) cancellation. Moreover, the degrading effect of the residual SI is also taken into account. In this regard, we formulate a set of SEE maximization problems for a FD multiple-input-multiple-output multiple-antenna eavesdropper (MIMOME) wiretap channel, considering both cases where exact or statistical channel state information (CSI) is available. Due to the intractable problem structure, we propose iterative solutions in each case with a proven convergence to a stationary point. Numerical simulations indicate only a marginal SEE gain, through the utilization of FD jamming, for a wide range of system conditions. However, when SI can efficiently be mitigated, the observed gain is considerable for scenarios with a small distance between the FD node and the eavesdropper, a high signal-to-noise ratio (SNR), or for a bidirectional FD communication setup. [ABSTRACT FROM AUTHOR]

This paper investigates and optimizes the performance of simultaneous wireless information and power transfer (SWIPT) in wireless sensor networks over Nakagami- $m$ fading channels. In the considered system, there is one mobile reader ( $R$ ), which is equipped with one transmit antenna and one receive antenna, and a group of passive sensors. The information delivery includes two stages: 1) $R$ broadcasts a command with radio-frequency energy to the sensors, which adopt time splitting (TS)/power splitting (PS) schemes to harvest energy and 2) sensors deliver their information to $R$ over orthogonal channels by using the harvested energy. In this paper, we propose a unified framework to study and optimize the impact of SWIPT on the system performance with both TS and PS schemes. First, we characterize the probability density function and cumulative distribution function of the signal-to-interference-plus-noise-ratio in high signal-to-noise ratio region, then we study the outage and ergodic capacity performance of the backward links. The approximated closed-form expressions for the outage probability and ergodic capacity are derived and validated through Monte Carlo simulations. Finally, we also evaluate the energy efficiency of the target system, and propose an optimal splitting scheme for TS and PS to maximize the throughput of the target system. [ABSTRACT FROM PUBLISHER]

Multi-channel (MC) optical wireless communication (OWC) systems employing wave-division multiplexing for outdoors free-space optical communications, or multi-user time-division multiple access for indoors visible-light communications, e.g., can be modeled as parallel channels. Multi-input multi-output OWC systems can also be transformed, possibly with some performance loss, to parallel channels using pre-/post-coding. Studying the performance of such MC-OWC systems requires characterizing the capacity of the underlying parallel channels. In this paper, upper and lower bounds on the capacity of constant parallel OWC channels with a total average intensity constraint are derived. Then, this paper focuses on finding intensity allocations that maximize the lower bounds given channel-state information at the transmitter (CSIT). Due to its nonconvexity, the Karush–Kuhn–Tucker conditions are used to describe a list of candidate allocations. Instead searching exhaustively for the best solution, low-complexity near-optimal algorithms are proposed. The resulting optimized lower bound nearly coincides with capacity at high signal-to-noise ratio (SNR). Under a quasi-static channel model and in the absence of CSIT, outage probability upper and lower bounds are derived. Those bounds also meet at high SNR, thus characterizing the outage capacity in this regime. Finally, the results are extended to a system with both average and peak intensity constraints. [ABSTRACT FROM PUBLISHER]

Integrating the unmanned aerial vehicles (UAVs) into the cellular network is envisioned to be a promising technology to significantly enhance the communication performance of both UAVs and existing terrestrial users. In this paper, we first provide an overview on the two main research paradigms in cellular UAV communications, namely, cellular-enabled UAV communication with UAVs as new aerial users served by the ground base stations (GBSs), and UAV-assisted cellular communication with UAVs as new aerial communication platforms serving the terrestrial users. Then, we focus on the former paradigm and study a new UAV trajectory design problem subject to practical communication connectivity constraints with the GBSs. Specifically, we consider a cellular-connected UAV in the mission of flying from an initial location to a final location that are given, during which it needs to maintain reliable communication with the cellular network by associating with one of the available GBSs at each time instant that has the best line-of-sight channel (or shortest distance) with it. We aim to minimize the UAV’s mission completion time by optimizing its trajectory, subject to a quality-of-connectivity constraint of the GBS-UAV link specified by a minimum receive signal-to-noise ratio target, which needs to be satisfied throughout its mission. To tackle this challenging non-convex optimization problem, we first propose an efficient method to verify its feasibility via checking the connectivity between two given vertices on an equivalent graph. Next, by examining the GBS-UAV association sequence over time, we obtain useful structural results on the optimal UAV trajectory, based on which two efficient methods are proposed to find high-quality approximate trajectory solutions by leveraging the techniques from graph theory and convex optimization. The proposed methods are analytically shown to be capable of achieving a flexible tradeoff between complexity and performance, and yielding a solution in polynomial time with the performance arbitrarily close to that of the optimal solution. Numerical results further validate the effectiveness of our proposed designs against benchmark schemes. Finally, we make concluding remarks and point out promising directions for future work. [ABSTRACT FROM AUTHOR]

The position and time of mobile agents are essential information for many wireless network applications. In this paper, we propose a single-anchor localization and synchronization scheme of full-duplex (FD) agents in the line-of-sight scenario, where the anchor is equipped with an antenna array. The agents perform inter-node ranging using the FD radios, while the anchor only receives signals transmitted from the agents. We derive the Cramér-Rao lower bounds for the agent positions and clock offsets based on the frames received by the agents and anchor. In particular, the Fisher information matrix for the positions and clock offsets can be decomposed into the information from the measurements of the arrival angles and arrival times. Then, we design the channel estimation algorithm to obtain the arrival angles, arrival times, and signal-to-noise ratios, based on which we further develop the network localization and synchronization algorithms to obtain the agent positions and clock offsets. The simulation results illustrate the performance of our proposed scheme and algorithms. [ABSTRACT FROM AUTHOR]

This paper studies interference exploitation techniques for secure beamforming design in simultaneous wireless information and power transfer in multiple-input single-output systems. In particular, multiuser interference (MUI) and artificially generated noise (AN) signals are designed as constructive to the information receivers (IRs) yet kept disruptive to potential eavesdropping by the energy receivers. The objective is to improve the received signal-to-interference and noise ratio (SINR) at the IRs by exploiting the MUI and AN power in an attempt to minimize the total transmit power. We first propose second-order cone programming-based solutions for the perfect channel state information (CSI) case by defining strong upper and lower bounds on the energy harvesting (EH) constraints. We then provide semidefinite programming-based solutions for the problems. In addition, we also solve the worst case harvested energy maximization problem under the proposed bounds. Finally, robust beamforming approaches based on the above are derived for the case of imperfect CSI. Our results demonstrate that the proposed constructive interference precoding schemes yield huge saving in transmit power over conventional interference management schemes. Most importantly, they show that, while the statistical constraints of conventional approaches may lead to instantaneous SINR as well as EH outages, the instantaneous constraints of our approaches guarantee both constraints at every symbol period. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the performance of a spectrum sharing decode-and-forward multiple-relay network (SSDMN) with direct link under the joint impact of two practical and detrimental imperfections, called transceiver hardware impairments (HIs) and channel estimation errors (CEEs). Here, we consider the hardware distortions induced by all the non-ideal secondary nodes and residual interferences originating from imperfect channel estimations. By taking these imperfections into account, we derive an exact closed-form expression for the outage probability of the considered SSDMN employing selection cooperation over independent and non-identical Rayleigh fading channels. We identify three important ceiling effects invoked by HIs, namely relay cooperation ceiling (RCC), direct link ceiling (DLC), and overall system ceiling. Specifically, we highlight the impact of these prevailing effects on the system’s performance and provide some useful insights about the tolerable level of HIs while designing the practical systems for a given rate requirement. We also illustrate that a potential direct link and a relaying link can, respectively, partially compensate for the incurred performance losses due to RCC and DLC effects. Moreover, we investigate the asymptotic behavior of outage probability to highlight the impact of HIs and CEEs on the achievable diversity and coding gains. [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]

Caching and multicasting are two promising methods to support massive content delivery in multi-tier wireless networks. In this paper, we consider a random caching and multicasting scheme with caching distributions in the two tiers as design parameters, to achieve efficient content dissemination in a two-tier large-scale cache-enabled wireless multicasting network. First, we derive tractable expressions for the successful transmission probabilities in the general region as well as the high signal-to-noise ratio (SNR) and high user density region, respectively, utilizing tools from stochastic geometry. Then, for the case of a single operator for the two tiers, we formulate the optimal joint caching design problem to maximize the successful transmission probability in the asymptotic region, which is nonconvex in general. By using the block successive approximate optimization technique, we develop an iterative algorithm, which is shown to converge to a stationary point. Next, for the case of two different operators, one for each tier, we formulate the competitive caching design game where each tier maximizes its successful transmission probability in the asymptotic region. We show that the game has a unique Nash equilibrium (NE) and adopt an iterative algorithm, which is shown to converge to the NE under a mild condition. Finally, by numerical simulations, we show that the proposed designs achieve significant gains over existing schemes. [ABSTRACT FROM AUTHOR]

Incremental relaying is a spectral-efficient relaying approach which introduces itself as one of the possible solutions to the spectrum scarcity problem for future generations of cellular communications systems. In this paper, we study threshold amplify-and-forward incremental relaying for correlated fading channels, i.e., fading channels for which the channel gain amplitude varies during the time interval of a block transmission; however, the variation occurs in a correlating fashion. From this aspect, these channels are different from both block-fading and fast-fading channels. Due to the correlating nature of the channels, it is possible to compress channel state information (CSI) sequences and employ the compressed CSI sequences as side information to carefully select the bits transmitted by the relay. This idea is already employed in previous works to increase the spectral efficiency; however, those works consider block-fading channels and also assume maximal ratio combining (MRC) at receiver. In case of MRC, explicit expressions for the end-to-end signal-to-noise ratio (SNR) exist, which enable packet error rate analysis by aid of Moment Generating Functions of the SNR. However, to apply MRC, the receiver requires all channel gains (including source-relay channel gain). In case of correlated channels, communicating all real-valued channel gains, requires a large overhead. This fact renders applicability of MRC for correlated channels. We apply the more practical Equal-Gain Combining method. We derive series approximations for symbol error rate, given M-QAM and MPSK modulations, and assuming Nakagami- $m$ fading channels. We also analyze the spectral efficiency by assuming Markov models for the channels. We compare the spectral efficiency in case of correlated and fast-fading channels and show that, unlike fast-fading channels, correlated fading channels allow for a spectrally efficient scheme. [ABSTRACT FROM PUBLISHER]

To improve the spectral efficiency in long-term evolution systems, the resource blocks (RBs) are shared among different cells/base stations (BSs) resulting in interference among the cells/BSs on each RB, although all the sub-carriers (SCs) in an RB may not be used in a cell. Defining the load of a given BS per RB as the fraction of the active SCs in that RB, in this paper, we present a generalized signal-to-interference-and-noise-ratio (SINR) model for downlink users on a given RB. This model considers both the transmit powers of the BSs and the loads of the cells over that RB. Under this load-coupled SINR model, to study the feasibility of a given rate demand vector for users, we formulate an optimization problem of minimizing the total load of the BSs on the RBs. Then, for two different scenarios of feasible and infeasible demand vectors, respectively, we study the load management problem (i.e., minimizing the total load of the BSs on the RBs) and admission control problem (i.e., finding the sub-set of users with maximum cardinality whose demands can be concurrently satisfied), respectively. Our theoretical investigations, which provide guidelines for designing radio resource management methods for load-coupled OFDMA networks, are complemented through Monte Carlo simulations. [ABSTRACT FROM PUBLISHER]

The medium access probability (MAP) of a random access protocol can severely impact network throughput especially for delay-sensitive applications, since it determines whether a node should transmit packets in a given slot or not. This paper focuses on network throughput maximization through optimizing the MAPs of all users under delay quality-of-service constraints in wireless interference-limited networks. Specifically, first, the total delay for transmitting one packet for a user is analyzed and derived based on an M/G/1 model. Then, the stochastic property of the aggregated interference is analyzed and its distribution is modeled as a log-normal distribution. Based on the delay and interference models, an optimization problem is formulated to derive the optimal MAPs so that the network throughput is maximized under the delay constraints. Two network traffic scenarios, homogeneous and heterogeneous user traffic, are discussed, respectively. For the case of homogeneous traffic, a closed-form expression of the optimal MAP is derived; for the case of heterogeneous traffic, a global $\epsilon $ -optimal algorithm based on the branch-and-bound framework and convex relaxation technology is proposed with relatively low complexity. Simulations results show that the proposed algorithms can achieve superior network throughput performance over existing schemes. [ABSTRACT FROM PUBLISHER]

In this paper, a novel cooperative non-orthogonal multiple access (NOMA) system is proposed, where one near user is employed as decode-and-forward relaying switching between full-duplex (FD) and half-duplex (HD) mode to help a far user. Two representative cooperative relaying scenarios are investigated insightfully. The first scenario is that no direct link exists between the base station (BS) and far user. The second scenario is that the direct link exists between the BS and far user. To characterize the performance of potential gains brought by the FD NOMA in two considered scenarios, three performance metrics outage probability, ergodic rate, and energy efficiency are discussed. More particularly, we derive new closed-form expressions for both exact and asymptotic outage probabilities as well as delay-limited throughput for two NOMA users. Based on the derived results, the diversity orders achieved by users are obtained. We confirm that the use of direct link overcomes zero diversity order of far NOMA user inherent to FD relaying. In addition, we derive new closed-form expressions for asymptotic ergodic rates. Based on these, the high signal-to-noise ratio (SNR) slopes of two users for FD NOMA are obtained. Simulation results demonstrate that: 1) the FD NOMA is superior to the HD NOMA in terms of outage probability and ergodic sum rate in the low SNR region; and 2) in delay-limited transmission mode, the FD NOMA has higher energy efficiency than the HD NOMA in the low SNR region; However, in delay-tolerant transmission mode, the system energy efficiency of the HD NOMA exceeds the FD NOMA in the high SNR region. [ABSTRACT FROM PUBLISHER]

In this paper, we propose an imperfect quantized feedback-based diagonal precoding scheme for generalized orthogonal space-time block codes in an $N \times 1$ multiple-input single-output (MISO) wireless communication system employing $M$ -QAM constellation. It is well known that a feedback-based precoding scheme aids channel adaptive signaling in wireless communication system and capitulates large improvements in almost all performance metrics. However, a practical feedback link is susceptible to error due to wireless channel fading and leads to wrong precoder selection. Therefore, a signal-to-noise ratio (SNR) adaptive error-tolerant weighting scheme is introduced which provides significant gain in comparison with another proposed arbitrarily fixed SNR error-tolerant weighting scheme. At first, a tight approximate closed-form expression of average symbol-error-rate (SER) and an exact analytical expression of outage probability are derived under imperfect feedback information with the help of order statistics. By minimizing the derived average SER, optimized transmit weights for the diagonal precoding matrix (based on feedback bits) are obtained. Later, a closed-form expression of the ergodic capacity with erroneous feedback bits for arbitrary MISO system is also provided by using the moment generating function approach. Further, numerical results show that the considered error-tolerant schemes outperform the uniform power allocation scheme in term of all the investigated performance metrics. [ABSTRACT FROM AUTHOR]

Signal to interference plus noise ratio (SINR) is an important index for wireless communications. This paper shows a method to derive spreading sequences utilized in code division multiple access systems as the solutions of the non-linear programming: maximize SINR. To this end, we consider a frequency-selective wide-sense-stationary uncorrelated-scattering channel and obtain the worst case of SINR. In the course of the evaluation, we derive an expression of SINR, whose main terms consist of periodic correlation terms and odd periodic correlation terms. Also, we show a relation between SINR and mean square correlations. With our expression, we obtain the problem: maximize SINR. Since this problem is not convex, we obtain the relaxed problem with a semidefinite relaxation technique. From this relaxed problem, we obtain the approximated solutions and evaluate the bit error rate for the solutions. [ABSTRACT FROM AUTHOR]

In this paper, we develop an optimal precoder and a suboptimal precoder for uplink distributed antenna systems with transmit correlation over Rician channels. The objective is to minimize a pairwise error probability (PEP) with constrained transmit power. The optimal scheme uses an efficient projection-based steepest descent algorithm to obtain the Gram matrix of the precoder, while the suboptimal scheme exploits the eigen-structure of the Gram matrix to obtain its unitary matrix (beamforming) and eigenvalues (power control). For a given beamforming (BF), an efficient power adaptation based on a fuzzy signal-to-noise ratio (SNR) is developed. The PEP analysis at low SNR is used to obtain a suboptimal BF. The derived BF and the fuzzy power adaptation have closed-form expressions that make the suboptimal scheme computationally efficient in comparison with existing methods. The BF can be re-optimized via the Riemannian steepest descent method to further reduce the PEP. Simulation results show that the proposed optimal scheme not only gives the performance the same as the existing optimal scheme when the latter can converge, but it also has lower computational complexity and faster convergence. Moreover, the suboptimal scheme can give a nearly optimal error rate. [ABSTRACT FROM AUTHOR]

To enable massive machine type communication (mMTC), data aggregation is a promising approach to reduce the congestion caused by a massive number of machine type devices (MTDs). In this paper, we consider a two-phase cellular-based mMTC network, where MTDs transmit to aggregators (i.e., aggregation phase) and the aggregated data is then relayed to base stations (i.e., relaying phase). Due to the limited resources, the aggregators not only aggregate data, but also schedule resources among MTDs. We consider two scheduling schemes: random resource scheduling (RRS) and channel-aware resource scheduling (CRS). By leveraging the stochastic geometry, we present a tractable analytical framework to investigate the signal-to-interference ratio (SIR) for each phase, thereby computing the MTD success probability, the average number of successful MTDs and probability of successful channel utilization, which are the key metrics characterizing the overall mMTC performance. Our numerical results show that, although the CRS outperforms the RRS in terms of SIR at the aggregation phase, the simpler RRS has almost the same performance as the CRS for most of the cases with regards to the overall mMTC performance. Furthermore, the provision of more resources at the aggregation phase is not always beneficial to the mMTC performance. [ABSTRACT FROM AUTHOR]

The Beckmann distribution is a general multipath fading model for the received radio signal in the presence of a large number of scatterers, which can thence be modeled as a complex Gaussian random variable where both the in-phase and quadrature components have arbitrary mean and variance. However, the complicated nature of this distribution has prevented its widespread use and relatively few analytical results have been reported for this otherwise useful fading model. In this paper, we derive a closed-form expression for the generalized moment-generating function (MGF) of the signal-to-noise ratio (SNR) of Beckmann fading, which permits to circumvent the inherent analytical complexity of this model. This is a new and useful result, as it is a key for evaluating several important performance metrics of different wireless communication systems and also permits to readily compute the moments of the output SNR. Thus, we obtain simple exact expressions for the energy detection performance in Beckmann fading channels, both in terms of the receiver operating characteristic (ROC) curve and of the area under ROC curve. We also analyze the outage probability in interference limited systems affected by Beckmann fading, as well as the outage probability of secrecy capacity in wiretap Beckmann fading channels. Monte Carlo simulations have been performed to validate the derived expressions. [ABSTRACT FROM AUTHOR]

The capacity of multiple-input multiple-output (MIMO) Rayleigh fading channels with full knowledge of channel state information (CSI) at both the transmitter and the receiver (CSI-TR) has been shown recently to scale at low signal-to-noise ratio (SNR) essentially as SNR log(1/SNR), independently of the number of transmit and receive antennas. In this paper, we investigate the ergodic capacity of MIMO Rayleigh fading channel with estimated channel state information at the transmitter (CSI-T) and possibly imperfect channel state information at the receiver (CSI-R). Our framework can be seen as a generalization of previous works as it can capture the perfect CSI-TR as a special case when the estimation error variance goes to zero. In this paper, we mainly focus on the low SNR regime, and we show that the capacity scales as $(1-\alpha)$ SNR log(1/SNR), where $\alpha$ is the estimation error variance. This characterization shows the loss of performance due to error estimation over the perfect channel state information at both the transmitter and the receiver. As a by-product of our new analysis, we show that our framework can be also extended to characterize the capacity of MIMO Rician fading channels at low SNR with possibly imperfect CSI-T and CSI-R. [ABSTRACT FROM AUTHOR]

Physical transceivers have hardware impairments that create distortions which degrade the performance of communication systems. The vast majority of technical contributions in the area of relaying neglect hardware impairments and, thus, assume ideal hardware. Such approximations make sense in low-rate systems, but can lead to very misleading results when analyzing future high-rate systems. This paper quantifies the impact of hardware impairments on dual-hop relaying, for both amplify-and-forward and decode-and-forward protocols. The outage probability (OP) in these practical scenarios is a function of the effective end-to-end signal-to-noise-and-distortion ratio (SNDR). This paper derives new closed-form expressions for the exact and asymptotic OPs, accounting for hardware impairments at the source, relay, and destination. A similar analysis for the ergodic capacity is also pursued, resulting in new upper bounds. We assume that both hops are subject to independent but non-identically distributed Nakagami-m fading. This paper validates that the performance loss is small at low rates, but otherwise can be very substantial. In particular, it is proved that for high signal-to-noise ratio (SNR), the end-to-end SNDR converges to a deterministic constant, coined the SNDR ceiling, which is inversely proportional to the level of impairments. This stands in contrast to the ideal hardware case in which the end-to-end SNDR grows without bound in the high-SNR regime. Finally, we provide fundamental design guidelines for selecting hardware that satisfies the requirements of a practical relaying system. [ABSTRACT FROM AUTHOR]

Considering a dual-hop energy-harvesting (EH) relaying system, this paper advocates novel relaying protocols based on adaptive time-switching (TS) for amplify-and-forward and decode-and-forward modes, respectively. The optimal TS factor is first studied, which is adaptively adjusted based on the dual-hop channel state information (CSI), accumulated energy, and threshold signal-to-noise ratio (SNR), to achieve the maximum throughput efficiency per block. To reduce the CSI overhead at the EH relay, a low-complexity TS factor design is presented, which only needs single-hop CSI to determine the TS factor. Theoretical results show that, in comparison with the conventional solutions, the proposed optimal/low-complexity TS factor can achieve higher limiting throughput efficiency for sufficiently small threshold SNR. As the threshold SNR approaches infinity, the throughput efficiency of the proposed optimal/low-complexity TS factor tends to zero in a much slower pace than that of the conventional solutions. Simulation results are presented to corroborate the proposed methodology. [ABSTRACT FROM PUBLISHER]

Reconfigurable antenna arrays provide a means for efficient use of the spatial domain in wireless communication systems. Despite its potential, the topic is only briefly explored in the literature. In this paper, we present a comprehensive theoretical analysis of the performance of reconfigurable systems. We consider a receiver equipped with multiple reconfigurable antennas that pick the best state based on the channel between the transmitter and the receiver. For such a system, we derive a new expression for the moment generating function (MGF) of the received signal-to-noise ratio by employing maximal ratio combining. Based on the MGF, we analyze three important performance measures, specifically, achievable rate, error probability, and outage probability. Furthermore, we conduct an asymptotic analysis incorporating the correlation between reconfigurable states and show that a reconfigurable system can achieve a diversity order of the number of antennas times the number of reconfigurable states. Finally, we discuss the applicability of reconfigurable antennas in novel wireless networks with large antenna arrays and distributed antenna systems, highlighting the performance gains and requirement for fewer RF chains. [ABSTRACT FROM AUTHOR]

This paper analyzes the impact of statistical delay constraints on the achievable rate of a two-hop wireless communication link in which the communication between a source and a destination is accomplished via a buffer-aided relay node. It is assumed that there is no direct link between the source and the destination, and the buffer-aided relay forwards the information to the destination by employing the decode-and-forward scheme. Given statistical delay constraints specified via maximum delay and delay violation probability, the tradeoff between the statistical delay constraints imposed on any two concatenated queues is identified. With this characterization, the maximum constant arrival rates that can be supported by this two-hop link are obtained by determining the effective capacity of such links as a function of the statistical delay constraints, signal-to-noise ratios at the source and relay, and the fading distributions of the links. It is shown that asymmetric statistical delay constraints at the buffers of the source and relay node can improve the achievable rate. Overall, the impact of the statistical delay tradeoff on the achievable throughput is provided. [ABSTRACT FROM PUBLISHER]

This paper analyzes the performance of energy-constrained dual-hop amplify-and-forward relaying systems with multi-antenna nodes in the presence of multiple co-channel interferers at the destination. To maximize the overall signal-to-interference-plus-noise ratio, as well as the harvested energy so as to mitigate the severe effects of fading and enable long-distance wireless power transfer, hop-by-hop information and energy beamforming is proposed where the transmitted signal is steered along the strongest eigenmode of each hop. The wirelessly powered relay scavenges energy from the source information radio frequency signal through energy beamforming, where both the time-switching receiver and power-splitting receiver are considered, and then uses the harvested energy to forward the source message to the destination. To this end, tight lower and upper bound expressions for the outage probability and ergodic capacity are presented in closed form. These are employed to investigate the throughput of the delay-constrained and delay-tolerant transmission modes. In addition, the asymptotic high signal-to-noise ratio outage probability and ergodic capacity approximations are derived, where the achievable diversity order is also presented. Numerical results sustained by Monte Carlo simulations show the tightness of the proposed analytical expressions. The impact of various parameters, such as energy harvesting time, power-splitting ratio, source transmit power, and the number of antennas on the system throughput, is also considered. [ABSTRACT FROM PUBLISHER]

We study the optimal resource allocation in the wireless powered underground sensor network (WPUSN) for throughput maximization. The WPUSN is a new networking paradigm where underground sensors can be replenished by a radio frequency energy harvesting technique and transmit geological data to the nearby aboveground access point in real time. In this paradigm, the underground portion of the wireless communication link suffers from severe path loss. Moreover, different underground sensors may have diverse data traffic demands. In this paper, we formulate an optimization problem to maximize the throughput in WPUSNs with the quality of service (QoS) consideration in terms of communication reliability and diverse data traffic demands. Specifically, we map the QoS requirements to signal-to-noise ratio thresholds and transform our problem into a convex optimization problem with linear constraints. We then present a closed-form solution for the transformed problem through a problem decomposition of the Karush–Kuhn–Tucker conditions. Our closed-form solution uncovers the insights that how the wireless channel states, reliability requirements, and data traffic demands affect the optimal resource allocation in the WPUSN. Finally, we demonstrate the effectiveness of the proposed scheme by running simulations. [ABSTRACT FROM PUBLISHER]

Ambient backscatter technology that utilizes the ambient radio frequency signals to enable the communications of battery-free devices has attracted much attention recently. In this paper, we study the problem of signal detection for an ambient backscatter communication system that adopts the differential encoding to eliminate the necessity of channel estimation. Specifically, we formulate a new transmission model, design the data detection algorithm, and derive two closed-form detection thresholds. One threshold is used to approximately achieve the minimum sum bit error rate (BER), while the other yields balanced error probabilities for “0” bit and “1” bit. The corresponding BER expressions are derived to fully characterize the detection performance. In addition, the lower and the upper bounds of BER at high signal-to-noise ratio regions are also examined to simplify a performance analysis. Simulation results are then provided to corroborate the theoretical studies. [ABSTRACT FROM PUBLISHER]

In this paper, we investigate secure communications in uplink transmissions, where there are a base station (BS) with $M$ receive antennas, K$ mobile users each with a single antenna, and an eavesdropper with N$ receive antennas. The closed-form expressions of the achievable ergodic secrecy sum rates (ESSRs) for a random k$ users selection scheme in the high and low signal-to-noise ratio regimes are presented. It is shown that the scaling behavior of ESSR with respect to the number of served users k$ can be quite different under different system configurations, determined by the numbers of the BS antennas and that of the eavesdropper antennas. In order to achieve a multiuser gain, two low-complexity user selection schemes are proposed under different assumptions on the eavesdropper’s channel state information. The closed-form expressions of the achievable ESSRs and the multiuser secrecy gains of the two schemes are also presented in both low and high SNR regimes. We observe that, as k$ increases, the multiuser secrecy gain increases, while the ESSR may decrease. Therefore, when N . [ABSTRACT FROM AUTHOR]

In this paper we evaluate outage performances of multirelay amplify and forward (AF) transmission over fading channels. We focus on the uplink of a two-hop based network where N (with N ⩾ 1) single antenna relay stations (RSs) serve as non-regenerative repeaters for the message transmitted by a single antenna source node (or mobile station MS). Performances are derived at high SNR for arbitrary fading distributions over each cooperative link. In Rayleigh fading the high price of cooperation in terms of signalling (e.g. during MS-to-RSs transmissions and control messages broadcasts) causes a significant loss in spectral efficiency. Instead, provided that the RSs can be strategically positioned to benefit from a channel with marginal diffusive fading component compared to Rayleigh, this paper shows that this loss in efficiency can be significantly alleviated depending on the particular propagation environment. Closed form conditions on the fading statistics for the relayed links are derived to guarantee that collaborative transmission performs as if the MS node would benefit from the same diversity and bandwidth efficiency provided by multi-antenna transmission. The proposed conditions are computed for arbitrary distributed fading for the relays-to-BS link and are specialized for Rice faded RSs-to-BS links. [ABSTRACT FROM AUTHOR]

In this paper we derive two iterative joint precoding and power allocation methods for downlink MC-CDMA systems with multiple transmit antennas at the base station. The first method optimally solves the so called assigned target SJNRs problem, i.e. determines the precoding coefficients and the minimum sum-power allocation under a constraint on the SINR of each user. The second method instead solves the maximum sum-rate problem, i.e. maximizes the system throughput under a constraint on the overall transmit power. The main result of this paper is that the proposed joint precoding and power control solutions provide an advantage with respect to suboptimal solutions for a fully loaded system, i.e. when the number of users is equal to the spreading factor times the number of transmit antennas. For lower loads, performance of the various schemes becomes closer. [ABSTRACT FROM AUTHOR]

Although there has been a growing interest on the study of diversity-multiplexing tradeoff (DMT), the existing works are mostly restricted to the outcomes reported for Rayleigh, Rician, and Nakagami fading channels. In this paper, we investigate the optimal tradeoff in the presence of log-normal fading, which provides an accurate model for indoor wireless, optical wireless, and ultra-wideband channels. We consider a multiple-input multiple-output (MIMO) log-normal channel, derive the outage probability expression, and then present the asymptotical DMT expression. It is shown that the asymptotical maximum diversity gain tends to infinity with logarithm of signal-to-noise ratio (SNR). To have further insight, we normalize the DMT with that of single-input single-output case and express the relative asymptotical DMT of the MIMO log-normal channel as a function of the number of transmit and receive antennas. We further study DMT for finite SNRs and demonstrate convergence to the asymptotical case. Extensive numerical results are provided to corroborate the analytical derivation. [ABSTRACT FROM AUTHOR]

Compute-and-forward (C&F) is a promising new approach to interference management, enjoying several advantages over other information-theoretic schemes. C&F usually requires channel state information (CSI) at the receivers so that an “optimal” scaling factor can be computed for the purposes of decoding. In this paper, a blind C&F scheme—i.e., one not requiring CSI—is developed. Rather than attempting to compute the optimal scaling factor, this new scheme seeks one or more “good” scalars, i.e., scalars that allow correct decoding despite possibly being suboptimal. The region of all such good scalars is characterized. To find a good scalar, a computationally efficient scheme is proposed which involves error-detection, a hierarchically organized list, as well as a use of the smoothing lemma from lattice theory. Simulation results show that our blind C&F scheme achieves—for a class of nested lattice codes—the same throughput as its CSI-enabled counterpart at the expense of, approximately, a two-fold increase in computational complexity in the high-throughput region. Moreover, our blind C&F scheme can be applied to multisource multirelay networks with a good performance/complexity tradeoff. [ABSTRACT FROM AUTHOR]

Optimal data detection of data transmitted over a linear channel can always be implemented through the Viterbi algorithm (VA). However, in many cases of interest the memory of the channel prohibits direct application of the VA. A popular and conceptually simple method in this case, studied since the early 1970s, is to first filter the received signal in order to shorten the memory of the channel, and then to apply a VA that operates with the shorter memory. We shall refer to this general concept as a channel shortening (CS) receiver. Although studied for almost four decades, an information theoretic understanding of what such a simple receiver solution is actually doing is not available. In this paper, we show that an optimized CS receiver has a direct correspondance to the chain rule of mutual information. Furthermore, we show that the tools for analyzing the ensuing achievable rates from an optimized CS receiver are precisely the same as those used for analyzing the achievable rates of a minimum mean-square-error (MMSE) receiver. [ABSTRACT FROM AUTHOR]

This paper tackles the problem of minimum-energy cooperative transmission in wireless networks under the assumption of limited channel state information at the transmitters. It is assumed that only the average statistics of the fading channels are known to the transmitters. The objective here is to jointly optimize the set of relays and the transmission powers for both the broadcasting and cooperative transmission phases while satisfying probabilistic signal-to-noise ratio (SNR) constraints at the relays and at the destination node. Increasing the broadcasting power expands the set of potential relays and decreases the required power for cooperative transmission. Hence, there is a compromise in the selection of the power values, which is addressed in this work using a chance-constrained optimization framework. A closed-form approximate solution is also presented, which provides a low-complexity transmission scheme for energy-harvesting wireless networks. Simulations are presented to demonstrate the efficacy of the proposed approach and the approximate solution. [ABSTRACT FROM AUTHOR]

Wireless-powered cellular networks (WPCNs) are currently being investigated to ensure the reliability as well as improved battery lifetime of wireless devices. A WPCN leverages on a centralized base station (BS) that takes care of both wireless information and energy transfer. However, the harvested energy and, in turn, the spectral efficiency of uplink transmission of the users may significantly vary depending on the locations of the users and the channels used for energy and information transfer purposes. To this end, this paper theoretically characterizes the signal-to-noise ratio (SNR) outage zones in a WPCN and comparatively analyzes the performance of three useful configurations of dedicated energy sources that can potentially minimize the SNR outage zones. These configurations are: (i) harvesting energy from and information transfer to a full-duplex BS. This is considered as a baseline configuration; (ii) harvesting energy from symmetrically deployed power beacons (PBs) and information transfer to a conventional half-duplex BS; and (iii) harvesting energy from symmetrically deployed PBs that are colocated with the distributed antenna elements (DAEs) of a conventional half-duplex BS. For all the listed cases, we characterize the SNR outage probability and spectral efficiency of an arbitrarily located user within the cellular region. Based on the derived expressions, we also optimize the distance of the PBs from the BS to minimize the SNR outage probability and provide closed-form solutions for special cases. The optimum distance of the PBs is shown to be a function of the number of PBs and the coverage area of the BS. Numerical results validate the accuracy of the derived expressions, provide design insights related to WPCNs, and reveal the significance of the limited number of optimally placed PBs over a large number of randomly deployed PBs. [ABSTRACT FROM AUTHOR]

In multiple antenna systems, phase noise due to instabilities of the radio-frequency (RF) oscillators, acts differently depending on whether the RF circuitries connected to each antenna are driven by separate (independent) local oscillators (SLO) or by a common local oscillator (CLO). In this paper, we investigate the high-SNR capacity of single-input multiple-output (SIMO) and multiple-output single-input (MISO) phase-noise channels for both the CLO and the SLO configurations. Our results show that the first-order term in the high-SNR capacity expansion is the same for all scenarios (SIMO/MISO and SLO/CLO), and equal to $0.5\ln(\rho)$, where $\rho$ stands for the SNR. On the contrary, the second-order term, which we refer to as phase-noise number, turns out to be scenario-dependent. For the SIMO case, the SLO configuration provides a diversity gain, resulting in a larger phase-noise number than for the CLO configuration. For the case of Wiener phase noise, a diversity gain of at least $0.5\ln(M)$ can be achieved, where $M$ is the number of receive antennas. For the MISO, the CLO configuration yields a higher phase-noise number than the SLO configuration. This is because with the CLO configuration one can obtain a coherent-combining gain through maximum ratio transmission (a.k.a. conjugate beamforming). This gain is unattainable with the SLO configuration. [ABSTRACT FROM AUTHOR]

Small cell networks are regarded as a promising candidate to meet the exponential growth of mobile data traffic in cellular networks. With a dense deployment of access points, spatial reuse will be improved, and uniform coverage can be provided. However, such performance gains cannot be achieved without effective intercell interference management. In this paper, a novel interference coordination strategy, called user-centric intercell interference nulling , is proposed for small cell networks. A main merit of the proposed strategy is its ability to effectively identify and mitigate the dominant interference for each user. Different from existing works, each user selects the coordinating base stations (BSs) based on the relative distance between the home BS and the interfering BSs, called the interference nulling (IN) range, and thus interference nulling adapts to each user's own interference situation. By adopting a random spatial network model, we derive an approximate expression of the successful transmission probability to the typical user, which is then used to determine the optimal IN range. Simulation results shall confirm the tightness of the approximation, and demonstrate significant performance gains (about 35–40 $\%$) of the proposed coordination strategy, compared with the non-coordination case. Moreover, it is shown that the proposed strategy outperforms other interference nulling methods. Finally, the effect of imperfect channel state information (CSI) is investigated, where CSI is assumed to be obtained via limited feedback. It is shown that the proposed coordination strategy still provides significant performance gains even with a moderate number of feedback bits. [ABSTRACT FROM PUBLISHER]

In this paper, an energy harvesting dual-hop relaying system without/with the presence of co-channel interference (CCI) is investigated. Specifically, the energy constrained multi-antenna relay node is powered by either the information signal of the source or via the signal receiving from both the source and interferer. In particular, we first study the outage probability and ergodic capacity of an interference free system, and then extend the analysis to an interfering environment. To exploit the benefit of multiple antennas, three different linear processing schemes are investigated, namely, 1) Maximum ratio combining/maximum ratio transmission (MRC/MRT), 2) Zero-forcing/MRT (ZF/MRT) and 3) Minimum mean-square error/MRT (MMSE/MRT). For all schemes, both the systems outage probability and ergodic capacity are studied, and the achievable diversity order is also presented. In addition, the optimal power splitting ratio minimizing the outage probability is characterized. Our results show that the implementation of multiple antennas increases the energy harvesting capability, hence, significantly improves the systems performance. Moreover, it is demonstrated that the CCI could be potentially exploited to substantially boost the performance, while the choice of a linear processing scheme plays a critical role in determining how much gain could be extracted from the CCI. [ABSTRACT FROM PUBLISHER]