arXiv subjects

Radha Krishna Ganti

Publications and source records attributed to Radha Krishna Ganti.

47 records · Page 3Linked to original sources

arXiv2011

Analytical Evaluation of Fractional Frequency Reuse for Heterogeneous Cellular Networks

Interference management techniques are critical to the performance of heterogeneous cellular networks, which will have dense and overlapping coverage areas, and experience high levels of interference. Fractional frequency reuse (FFR) is an attractive interference management technique due to its low complexity and overhead, and significant coverage improvement for low-percentile (cell-edge) users. Instead of relying on system simulations based on deterministic access point locations, this paper instead proposes an analytical model for evaluating Strict FFR and Soft Frequency Reuse (SFR) deployments based on the spatial Poisson point process. Our results both capture the non-uniformity of heterogeneous deployments and produce tractable expressions which can be used for system design with Strict FFR and SFR. We observe that the use of Strict FFR bands reserved for the users of each tier with the lowest average SINR provides the highest gains in terms of coverage and rate, while the use of SFR allows for more efficient use of shared spectrum between the tiers, while still mitigating much of the interference. Additionally, in the context of multi-tier networks with closed access in some tiers, the proposed framework shows the impact of cross-tier interference on closed access FFR, and informs the selection of key FFR parameters in open access.

cs.IT↗

arXiv2011

On the Throughput Cost of Physical Layer Security in Decentralized Wireless Networks

This paper studies the throughput of large-scale decentralized wireless networks with physical layer security constraints. In particular, we are interested in the question of how much throughput needs to be sacrificed for achieving a certain level of security. We consider random networks where the legitimate nodes and the eavesdroppers are distributed according to independent two-dimensional Poisson point processes. The transmission capacity framework is used to characterize the area spectral efficiency of secure transmissions with constraints on both the quality of service (QoS) and the level of security. This framework illustrates the dependence of the network throughput on key system parameters, such as the densities of legitimate nodes and eavesdroppers, as well as the QoS and security constraints. One important finding is that the throughput cost of achieving a moderate level of security is quite low, while throughput must be significantly sacrificed to realize a highly secure network. We also study the use of a secrecy guard zone, which is shown to give a significant improvement on the throughput of networks with high security requirements.

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

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

Outage Probability of General Ad Hoc Networks in the High-Reliability Regime

Outage probabilities in wireless networks depend on various factors: the node distribution, the MAC scheme, and the models for path loss, fading and transmission success. In prior work on outage characterization for networks with randomly placed nodes, most of the emphasis was put on networks whose nodes are Poisson distributed and where ALOHA is used as the MAC protocol. In this paper we provide a general framework for the analysis of outage probabilities in the high-reliability regime. The outage probability characterization is based on two parameters: the intrinsic spatial contention $γ$ of the network, introduced in [1], and the coordination level achieved by the MAC as measured by the interference scaling exponent $κ$ introduced in this paper. We study outage probabilities under the signal-to-interference ratio (SIR) model, Rayleigh fading, and power-law path loss, and explain how the two parameters depend on the network model. The main result is that the outage probability approaches $γη^κ$ as the density of interferers $η$ goes to zero, and that $κ$ assumes values in the range $1\leq κ\leq α/2$ for all practical MAC protocols, where $α$ is the path loss exponent. This asymptotic expression is valid for all motion-invariant point processes. We suggest a novel and complete taxonomy of MAC protocols based mainly on the value of $κ$. Finally, our findings suggest a conjecture that tightly bounds the outage probability for all interferer densities.

cs.IT↗

arXiv2009

Spatial Analysis of Opportunistic Downlink Relaying in a Two-Hop Cellular System

We consider a two-hop cellular system in which the mobile nodes help the base station by relaying information to the dead spots. While two-hop cellular schemes have been analyzed previously, the distribution of the node locations has not been explicitly taken into account. In this paper, we model the node locations of the base stations and the mobile stations as a point process on the plane and then analyze the performance of two different two-hop schemes in the downlink. In one scheme the node nearest to the destination that has decoded information from the base station in the first hop is used as the relay. In the second scheme the node with the best channel to the relay that received information in the first hop acts as a relay. In both these schemes we obtain the success probability of the two hop scheme, accounting for the interference from all other cells. We use tools from stochastic geometry and point process theory to analyze the two hop schemes. Besides the results obtained a main contribution of the paper is to introduce a mathematical framework that can be used to analyze arbitrary relaying schemes. Some of the main contributions of this paper are the analytical techniques introduced for the inclusion of the spatial locations of the nodes into the mathematical analysis.

cs.IT↗

arXiv2009

Spatial and Temporal Correlation of the Interference in ALOHA Ad Hoc Networks

Interference is a main limiting factor of the performance of a wireless ad hoc network. The temporal and the spatial correlation of the interference makes the outages correlated temporally (important for retransmissions) and spatially correlated (important for routing). In this letter we quantify the temporal and spatial correlation of the interference in a wireless ad hoc network whose nodes are distributed as a Poisson point process on the plane when ALOHA is used as the multiple-access scheme.

cs.IT↗

arXiv2009

Analysis of Uncoordinated Opportunistic Two-Hop Wireless Ad Hoc Systems

We consider a time-slotted two-hop wireless system in which the sources transmit to the relays in the even time slots (first hop) and the relays forward the packets to the destinations in the odd time slots (second hop). Each source may connect to multiple relays in the first hop. In the presence of interference and without tight coordination of the relays, it is not clear which relays should transmit the packet. We propose four decentralized methods of relay selection, some based on location information and others based on the received signal strength (RSS). We provide a complete analytical characterization of these methods using tools from stochastic geometry. We use simulation results to compare these methods in terms of end-to-end success probability.

cs.IT↗

arXiv2008

The Transport Capacity of a Wireless Network is a Subadditive Euclidean Functional

The transport capacity of a dense ad hoc network with n nodes scales like \sqrt(n). We show that the transport capacity divided by \sqrt(n) approaches a non-random limit with probability one when the nodes are i.i.d. distributed on the unit square. We prove that the transport capacity under the protocol model is a subadditive Euclidean functional and use the machinery of subadditive functions in the spirit of Steele to show the existence of the limit.

cs.IT↗