arXiv subjects

Jeffrey G. Andrews

Publications and source records attributed to Jeffrey G. Andrews.

At least 163 records · Page 9Linked to original sources

arXiv2011

Spatial Intercell Interference Cancellation with CSI Training and Feedback

We investigate intercell interference cancellation (ICIC) with a practical downlink training and uplink channel state information (CSI) feedback model. The average downlink throughput for such a 2-cell network is derived. The user location has a strong effect on the signal-to-interference ratio (SIR) and the channel estimation error. This motivates adaptively switching between traditional (single-cell) beamforming and ICIC at low signal-to-noise ratio (SNR) where ICIC is preferred only with low SIR and accurate channel estimation, and the use of ICIC with optimized training and feedback at high SNR. For a given channel coherence time and fixed training and feedback overheads, we develop optimal data vs. pilot power allocation for CSI training as well as optimal feedback resource allocation to feed back CSI of different channels. Both analog and finite-rate digital feedback are considered. With analog feedback, the training power optimization provides a more significant performance gain than feedback optimization; while conversely for digital feedback, performance is more sensitive to the feedback bit allocation than the training power optimization. We show that even with low-rate feedback and standard training, ICIC can transform an interference-limited cellular network into a noise-limited one.

cs.IT↗

arXiv2011

Broadcast Channels with Delayed Finite-Rate Feedback: Predict or Observe?

Most multiuser precoding techniques require accurate transmitter channel state information (CSIT) to maintain orthogonality between the users. Such techniques have proven quite fragile in time-varying channels because the CSIT is inherently imperfect due to estimation and feedback delay, as well quantization noise. An alternative approach recently proposed by Maddah-Ali and Tse (MAT) allows for significant multiplexing gain in the multi-input single-output (MISO) broadcast channel (BC) even with transmit CSIT that is completely stale, i.e. uncorrelated with the current channel state. With $K$ users, their scheme claims to lose only a $\log(K)$ factor relative to the full $K$ degrees of freedom (DoF) attainable in the MISO BC with perfect CSIT for large $K$. However, their result does not consider the cost of the feedback, which is potentially very large in high mobility (short channel coherence time). In this paper, we more closely examine the MAT scheme and compare its DoF gain to single user transmission (which always achieves 1 DoF) and partial CSIT linear precoding (which achieves up to $K$). In particular, assuming the channel coherence time is $N$ symbol periods and the feedback delay is $N_{\rm fd}$ we show that when $N < (1+o(1)) K \log K$ (short coherence time), single user transmission performs best, whereas for $N> (1+o(1)) (N_{\rm fd}+ K / \log K)(1-\log^{-1}K)^{-1}$ (long coherence time), zero-forcing precoding outperforms the other two. The MAT scheme is optimal for intermediate coherence times, which for practical parameter choices is indeed quite a large and significant range, even accounting for the feedback cost.

cs.IT↗

arXiv2011

Ergodic Transmission Capacity of Wireless Ad Hoc Networks with Interference Management

Most work on wireless network throughput ignores the temporal correlation inherent to wireless channels because it degrades tractability. To better model and quantify the temporal variations of wireless network throughput, this paper introduces a metric termed ergodic transmission capacity (ETC), which includes spatial and temporal ergodicity. All transmitters in the network form a homogeneous Poisson point process and all channels are modeled by a finite state Markov chain. The bounds on outage probability and ETC are characterized, and their scaling behaviors for a sparse and dense network are discussed. From these results, we show that the ETC can be characterized by the inner product of the channel-state related vector and the invariant probability vector of the Markov chain. This indicates that channel-aware opportunistic transmission does not always increase ETC. Finally, we look at outage probability with interference management from a stochastic geometry point of view. The improved bounds on outage probability and ETC due to interference management are characterized and they provide some useful insights on how to effectively manage interference in sparse and dense networks.

cs.IT↗

arXiv2011

A Stochastic-Geometry Approach to Coverage in Cellular Networks with Multi-Cell Cooperation

Multi-cell cooperation is a promising approach for mitigating inter-cell interference in dense cellular networks. Quantifying the performance of multi-cell cooperation is challenging as it integrates physical-layer techniques and network topologies. For tractability, existing work typically relies on the over-simplified Wyner-type models. In this paper, we propose a new stochastic-geometry model for a cellular network with multi-cell cooperation, which accounts for practical factors including the irregular locations of base stations (BSs) and the resultant path-losses. In particular, the proposed network-topology model has three key features: i) the cells are modeled using a Poisson random tessellation generated by Poisson distributed BSs, ii) multi-antenna BSs are clustered using a hexagonal lattice and BSs in the same cluster mitigate mutual interference by spatial interference avoidance, iii) BSs near cluster edges access a different sub-channel from that by other BSs, shielding cluster-edge mobiles from strong interference. Using this model and assuming sparse scattering, we analyze the shapes of the outage probabilities of mobiles served by cluster-interior BSs as the average number $K$ of BSs per cluster increases. The outage probability of a mobile near a cluster center is shown to be proportional to $e^{-c(2-\sqrtν)^2K}$ where $ν$ is the fraction of BSs lying in the interior of clusters and $c$ is a constant. Moreover, the outage probability of a typical mobile is proved to scale proportionally with $e^{-c' (1-\sqrtν)^2K}$ where $c'$ is a constant.

cs.IT↗

arXiv2011

Downlink SDMA with Limited Feedback in Interference-Limited Wireless Networks

The tremendous capacity gains promised by space division multiple access (SDMA) depend critically on the accuracy of the transmit channel state information. In the broadcast channel, even without any network interference, it is known that such gains collapse due to interstream interference if the feedback is delayed or low rate. In this paper, we investigate SDMA in the presence of interference from many other simultaneously active transmitters distributed randomly over the network. In particular we consider zero-forcing beamforming in a decentralized (ad hoc) network where each receiver provides feedback to its respective transmitter. We derive closed-form expressions for the outage probability, network throughput, transmission capacity, and average achievable rate and go on to quantify the degradation in network performance due to residual self-interference as a function of key system parameters. One particular finding is that as in the classical broadcast channel, the per-user feedback rate must increase linearly with the number of transmit antennas and SINR (in dB) for the full multiplexing gains to be preserved with limited feedback. We derive the throughput-maximizing number of streams, establishing that single-stream transmission is optimal in most practically relevant settings. In short, SDMA does not appear to be a prudent design choice for interference-limited wireless networks.

cs.IT↗

arXiv2011

A Tractable Approach to Coverage and Rate in Cellular Networks

Cellular networks are usually modeled by placing the base stations on a grid, with mobile users either randomly scattered or placed deterministically. These models have been used extensively but suffer from being both highly idealized and not very tractable, so complex system-level simulations are used to evaluate coverage/outage probability and rate. More tractable models have long been desirable. We develop new general models for the multi-cell signal-to-interference-plus-noise ratio (SINR) using stochastic geometry. Under very general assumptions, the resulting expressions for the downlink SINR CCDF (equivalent to the coverage probability) involve quickly computable integrals, and in some practical special cases can be simplified to common integrals (e.g., the Q-function) or even to simple closed-form expressions. We also derive the mean rate, and then the coverage gain (and mean rate loss) from static frequency reuse. We compare our coverage predictions to the grid model and an actual base station deployment, and observe that the proposed model is pessimistic (a lower bound on coverage) whereas the grid model is optimistic, and that both are about equally accurate. In addition to being more tractable, the proposed model may better capture the increasingly opportunistic and dense placement of base stations in future networks.

cs.IT↗

arXiv2011

Analytical Evaluation of Fractional Frequency Reuse for OFDMA Cellular Networks

Fractional frequency reuse (FFR) is an interference management technique well-suited to OFDMA-based cellular networks wherein the cells are partitioned into spatial regions with different frequency reuse factors. To date, FFR techniques have been typically been evaluated through system-level simulations using a hexagonal grid for the base station locations. This paper instead focuses on analytically evaluating the two main types of FFR deployments - Strict FFR and Soft Frequency Reuse (SFR) - using a Poisson point process to model the base station locations. The results are compared with the standard grid model and an actual urban deployment. Under reasonable special cases for modern cellular networks, our results reduce to simple closed-form expressions, which provide insight into system design guidelines and the relative merits of Strict FFR, SFR, universal reuse, and fixed frequency reuse. We observe that FFR provides an increase in the sum-rate as well as the well-known benefit of improved coverage for cell-edge users. Finally, a SINR-proportional resource allocation strategy is proposed based on the analytical expressions, showing that Strict FFR provides greater overall network throughput at low traffic loads, while SFR better balances the requirements of interference reduction and resource efficiency when the traffic load is high.

cs.IT↗

arXiv2011

Series Expansion for Interference in Wireless Networks

The spatial correlations in transmitter node locations introduced by common multiple access protocols makes the analysis of interference, outage, and other related metrics in a wireless network extremely difficult. Most works therefore assume that nodes are distributed either as a Poisson point process (PPP) or a grid, and utilize the independence properties of the PPP (or the regular structure of the grid) to analyze interference, outage and other metrics. But,the independence of node locations makes the PPP a dubious model for nontrivial MACs which intentionally introduce correlations, e.g. spatial separation, while the grid is too idealized to model real networks. In this paper, we introduce a new technique based on the factorial moment expansion of functionals of point processes to analyze functions of interference, in particular outage probability. We provide a Taylor-series type expansion of functions of interference, wherein increasing the number of terms in the series provides a better approximation at the cost of increased complexity of computation. Various examples illustrate how this new approach can be used to find outage probability in both Poisson and non-Poisson wireless networks.

cs.IT↗

arXiv2010

Multicast Outage Probability and Transmission Capacity of Multihop Wireless Networks

Multicast transmission, wherein the same packet must be delivered to multiple receivers, is an important aspect of sensor and tactical networks and has several distinctive traits as opposed to more commonly studied unicast networks. Specially, these include (i) identical packets must be delivered successfully to several nodes, (ii) outage at any receiver requires the packet to be retransmitted at least to that receiver, and (iii) the multicast rate is dominated by the receiver with the weakest link in order to minimize outage and retransmission. A first contribution of this paper is the development of a tractable multicast model and throughput metric that captures each of these key traits in a multicast wireless network. We utilize a Poisson cluster process (PCP) consisting of a distinct Poisson point process (PPP) for the transmitters and receivers, and then define the multicast transmission capacity (MTC) as the maximum achievable multicast rate per transmission attempt times the maximum intensity of multicast clusters under decoding delay and multicast outage constraints. A multicast cluster is a contiguous area over which a packet is multicasted, and to reduce outage it can be tessellated into $v$ smaller regions of multicast. The second contribution of the paper is the analysis of several key aspects of this model, for which we develop the following main result. Assuming $τ/v$ transmission attempts are allowed for each tessellated region in a multicast cluster, we show that the MTC is $Θ(ρk^{x}\log(k)v^{y})$ where $ρ$, $x$ and $y$ are functions of $τ$ and $v$ depending on the network size and intensity, and $k$ is the average number of the intended receivers in a cluster. We derive $\{ρ, x, y\}$ for a number of regimes of interest, and also show that an appropriate number of retransmissions can significantly enhance the MTC.

cs.IT↗

arXiv2010

MIMO Interference Alignment Over Correlated Channels with Imperfect CSI

Interference alignment (IA), given uncorrelated channel components and perfect channel state information, obtains the maximum degrees of freedom in an interference channel. Little is known, however, about how the sum rate of IA behaves at finite transmit power, with imperfect channel state information, or antenna correlation. This paper provides an approximate closed-form signal-to-interference-plus-noise-ratio (SINR) expression for IA over multiple-input-multiple-output (MIMO) channels with imperfect channel state information and transmit antenna correlation. Assuming linear processing at the transmitters and zero-forcing receivers, random matrix theory tools are utilized to derive an approximation for the post-processing SINR distribution of each stream for each user. Perfect channel knowledge and i.i.d. channel coefficients constitute special cases. This SINR distribution not only allows easy calculation of useful performance metrics like sum rate and symbol error rate, but also permits a realistic comparison of IA with other transmission techniques. More specifically, IA is compared with spatial multiplexing and beamforming and it is shown that IA may not be optimal for some performance criteria.

cs.IT↗

arXiv2010

High-SIR Transmission Capacity of Wireless Networks with General Fading and Node Distribution

In many wireless systems, interference is the main performance-limiting factor, and is primarily dictated by the locations of concurrent transmitters. In many earlier works, the locations of the transmitters is often modeled as a Poisson point process for analytical tractability. While analytically convenient, the PPP only accurately models networks whose nodes are placed independently and use ALOHA as the channel access protocol, which preserves the independence. Correlations between transmitter locations in non-Poisson networks, which model intelligent access protocols, makes the outage analysis extremely difficult. In this paper, we take an alternative approach and focus on an asymptotic regime where the density of interferers $η$ goes to 0. We prove for general node distributions and fading statistics that the success probability $\p \sim 1-γη^κ$ for $η\rightarrow 0$, and provide values of $γ$ and $κ$ for a number of important special cases. We show that $κ$ is lower bounded by 1 and upper bounded by a value that depends on the path loss exponent and the fading. This new analytical framework is then used to characterize the transmission capacity of a very general class of networks, defined as the maximum spatial density of active links given an outage constraint.

cs.IT↗

arXiv2010

Spatial Interference Cancellation for Multi-Antenna Mobile Ad Hoc Networks

Interference between nodes is a critical impairment in mobile ad hoc networks (MANETs). This paper studies the role of multiple antennas in mitigating such interference. Specifically, a network is studied in which receivers apply zero-forcing beamforming to cancel the strongest interferers. Assuming a network with Poisson distributed transmitters and independent Rayleigh fading channels, the transmission capacity is derived, which gives the maximum number of successful transmissions per unit area. Mathematical tools from stochastic geometry are applied to obtain the asymptotic transmission capacity scaling and characterize the impact of inaccurate channel state information (CSI). It is shown that, if each node cancels L interferers, the transmission capacity decreases as the outage probability to the power of 1/(L+1) as the outage probability vanishes. For fixed outage probability, as L grows, the transmission capacity increases as L to the power of (1-2/alpha) where alpha is the path-loss exponent. Moreover, CSI inaccuracy is shown to have no effect on the transmission capacity scaling as the outage probability vanishes, provided that the CSI training sequence has an appropriate length, which we derived. Numerical results suggest that canceling merely one interferer by each node increases the transmission capacity by an order of magnitude or more, even when the CSI is imperfect.

cs.IT↗

arXiv2010

Open, Closed, and Shared Access Femtocells in the Downlink

A fundamental choice in femtocell deployments is the set of users which are allowed to access each femtocell. Closed access restricts the set to specifically registered users, while open access allows any mobile subscriber to use any femtocell. Which one is preferable depends strongly on the distance between the macrocell base station (MBS) and femtocell. The main results of the paper are lemmas which provide expressions for the SINR distribution for various zones within a cell as a function of this MBS-femto distance. The average sum throughput (or any other SINR-based metric) of home users and cellular users under open and closed access can be readily determined from these expressions. We show that unlike in the uplink, the interests of home and cellular users are in conflict, with home users preferring closed access and cellular users preferring open access. The conflict is most pronounced for femtocells near the cell edge, when there are many cellular users and fewer femtocells. To mitigate this conflict, we propose a middle way which we term shared access in which femtocells allocate an adjustable number of time-slots between home and cellular users such that a specified minimum rate for each can be achieved. The optimal such sharing fraction is derived. Analysis shows that shared access achieves at least the overall throughput of open access while also satisfying rate requirements, while closed access fails for cellular users and open access fails for the home user.

cs.NI↗

arXiv2010

Multicast Capacity Scaling of Wireless Networks with Multicast Outage

Multicast transmission has several distinctive traits as opposed to more commonly studied unicast networks. Specially, these include (i) identical packets must be delivered successfully to several nodes, (ii) outage could simultaneously happen at different receivers, and (iii) the multicast rate is dominated by the receiver with the weakest link in order to minimize outage and retransmission. To capture these key traits, we utilize a Poisson cluster process consisting of a distinct Poisson point process (PPP) for the transmitters and receivers, and then define the multicast transmission capacity (MTC) as the maximum achievable multicast rate times the number of multicast clusters per unit volume, accounting for outages and retransmissions. Our main result shows that if $τ$ transmission attempts are allowed in a multicast cluster, the MTC is $Θ\left(ρk^{x}\log(k)\right)$ where $ρ$ and $x$ are functions of $τ$ depending on the network size and density, and $k$ is the average number of the intended receivers in a cluster. We also show that an appropriate number of retransmissions can significantly enhance the MTC.

cs.IT↗

arXiv2010

Sensitive White Space Detection with Spectral Covariance Sensing

This paper proposes a novel, highly effective spectrum sensing algorithm for cognitive radio and whitespace applications. The proposed spectral covariance sensing (SCS) algorithm exploits the different statistical correlations of the received signal and noise in the frequency domain. Test statistics are computed from the covariance matrix of a partial spectrogram and compared with a decision threshold to determine whether a primary signal or arbitrary type is present or not. This detector is analyzed theoretically and verified through realistic open-source simulations using actual digital television signals captured in the US. Compared to the state of the art in the literature, SCS improves sensitivity by 3 dB for the same dwell time, which is a very significant improvement for this application. Further, it is shown that SCS is highly robust to noise uncertainty, whereas many other spectrum sensors are not.

cs.NI↗

arXiv2010

An overview of the transmission capacity of wireless networks

This paper surveys and unifies a number of recent contributions that have collectively developed a metric for decentralized wireless network analysis known as transmission capacity. Although it is notoriously difficult to derive general end-to-end capacity results for multi-terminal or \adhoc networks, the transmission capacity (TC) framework allows for quantification of achievable single-hop rates by focusing on a simplified physical/MAC-layer model. By using stochastic geometry to quantify the multi-user interference in the network, the relationship between the optimal spatial density and success probability of transmissions in the network can be determined, and expressed -- often fairly simply -- in terms of the key network parameters. The basic model and analytical tools are first discussed and applied to a simple network with path loss only and we present tight upper and lower bounds on transmission capacity (via lower and upper bounds on outage probability). We then introduce random channels (fading/shadowing) and give TC and outage approximations for an arbitrary channel distribution, as well as exact results for the special cases of Rayleigh and Nakagami fading. We then apply these results to show how TC can be used to better understand scheduling, power control, and the deployment of multiple antennas in a decentralized network. The paper closes by discussing shortcomings in the model as well as future research directions.

cs.IT↗

arXiv2010

Multi-mode Transmission for the MIMO Broadcast Channel with Imperfect Channel State Information

This paper proposes an adaptive multi-mode transmission strategy to improve the spectral efficiency achieved in the multiple-input multiple-output (MIMO) broadcast channel with delayed and quantized channel state information. The adaptive strategy adjusts the number of active users, denoted as the transmission mode, to balance transmit array gain, spatial division multiplexing gain, and residual inter-user interference. Accurate closed-form approximations are derived for the achievable rates for different modes, which help identify the active mode that maximizes the average sum throughput for given feedback delay and channel quantization error. The proposed transmission strategy is combined with round-robin scheduling, and is shown to provide throughput gain over single-user MIMO at moderate signal-to-noise ratio. It only requires feedback of instantaneous channel state information from a small number of users. With a feedback load constraint, the proposed algorithm provides performance close to that achieved by opportunistic scheduling with instantaneous feedback from a large number of users.

cs.IT↗

arXiv2010

Open vs Closed Access Femtocells in the Uplink

Femtocells are assuming an increasingly important role in the coverage and capacity of cellular networks. In contrast to existing cellular systems, femtocells are end-user deployed and controlled, randomly located, and rely on third party backhaul (e.g. DSL or cable modem). Femtocells can be configured to be either open access or closed access. Open access allows an arbitrary nearby cellular user to use the femtocell, whereas closed access restricts the use of the femtocell to users explicitly approved by the owner. Seemingly, the network operator would prefer an open access deployment since this provides an inexpensive way to expand their network capabilities, whereas the femtocell owner would prefer closed access, in order to keep the femtocell's capacity and backhaul to himself. We show mathematically and through simulations that the reality is more complicated for both parties, and that the best approach depends heavily on whether the multiple access scheme is orthogonal (TDMA or OFDMA, per subband) or non-orthogonal (CDMA). In a TDMA/OFDMA network, closed-access is typically preferable at high user densities, whereas in CDMA, open access can provide gains of more than 200% for the home user by reducing the near-far problem experienced by the femtocell. The results of this paper suggest that the interests of the femtocell owner and the network operator are more compatible than typically believed, and that CDMA femtocells should be configured for open access whereas OFDMA or TDMA femtocells should adapt to the cellular user density.

cs.IT↗