Analysis of Multi-Cell Downlink Cooperation with a Constrained Spatial Model

Multi-cell cooperation (MCC) mitigates intercell interference and improves throughput at the cell edge. This paper considers a cooperative downlink, whereby cell-edge mobiles are served by multiple cooperative base stations. The cooperating base stations transmit identical signals over paths with non-identical path losses, and the receiving mobile performs diversity combining. The analysis in this paper is driven by a new expression for the conditional outage probability when signals arriving over different paths are combined in the presence of noise and interference, where the conditioning is with respect to the network topology and shadowing. The channel model accounts for path loss, shadowing, and Nakagami fading, and the Nakagami fading parameters do not need to be identical for all paths. To study performance over a wide class of network topologies, a random spatial model is adopted, and performance is found by statistically characterizing the rates provided on the downlinks. To model realistic networks, the model requires a minimum separation among base stations. Having adopted a realistic model and an accurate analysis, the paper proceeds to determine performance under several resource-allocation policies and provides insight regarding how the cell edge should be defined.Comment: 6 pages, 3 figures, IEEE Global Telecommun. Conf. (GLOBECOM), 2013, to appear. arXiv admin note: text overlap with arXiv:1210.366

A New Analysis of the DS-CDMA Cellular Uplink Under Spatial Constraints

A new analysis is presented for the direct-sequence code-division multiple access (DS-CDMA) cellular uplink. For a given network topology, closed-form expressions are found for the outage probability and rate of each uplink in the presence of path-dependent Nakagami fading and log-normal shadowing. The topology may be arbitrary or modeled by a random spatial distribution for a fixed number of base stations and mobiles placed over a finite area with the separations among them constrained to exceed a minimum distance. The analysis is more detailed and accurate than existing ones and facilitates the resolution of network design issues, including the influence of the minimum base-station separation, the role of the spreading factor, and the impact of various power-control and rate-control policies. It is shown that once power control is established, the rate can be allocated according to a fixed-rate or variable-rate policy with the objective of either meeting an outage constraint or maximizing throughput. An advantage of the variable-rate policy is that it allows an outage constraint to be enforced on every uplink, whereas the fixed-rate policy can only meet an average outage constraint.Comment: 6 pages, 6 figures, to appear at International Conference on Communications (ICC) 201

Role of Interference and Computational Complexity in Modern Wireless Networks: Analysis, Optimization, and Design

Owing to the popularity of smartphones, the recent widespread adoption of wireless broadband has resulted in a tremendous growth in the volume of mobile data traffic, and this growth is projected to continue unabated. In order to meet the needs of future systems, several novel technologies have been proposed, including cooperative communications, cloud radio access networks (RANs) and very densely deployed small-cell networks. For these novel networks, both interference and the limited availability of computational resources play a very important role. Therefore, the accurate modeling and analysis of interference and computation is essential to the understanding of these networks, and an enabler for more efficient design.;This dissertation focuses on four aspects of modern wireless networks: (1) Modeling and analysis of interference in single-hop wireless networks, (2) Characterizing the tradeoffs between the communication performance of wireless transmission and the computational load on the systems used to process such transmissions, (3) The optimization of wireless multiple-access networks when using cost functions that are based on the analytical findings in this dissertation, and (4) The analysis and optimization of multi-hop networks, which may optionally employ forms of cooperative communication.;The study of interference in single-hop wireless networks proceeds by assuming that the random locations of the interferers are drawn from a point process and possibly constrained to a finite area. Both the information-bearing and interfering signals propagate over channels that are subject to path loss, shadowing, and fading. A flexible model for fading, based on the Nakagami distribution, is used, though specific examples are provided for Rayleigh fading. The analysis is broken down into multiple steps, involving subsequent averaging of the performance metrics over the fading, the shadowing, and the location of the interferers with the aim to distinguish the effect of these mechanisms that operate over different time scales. The analysis is extended to accommodate diversity reception, which is important for the understanding of cooperative systems that combine transmissions that originate from different locations. Furthermore, the role of spatial correlation is considered, which provides insight into how the performance in one location is related to the performance in another location.;While it is now generally understood how to communicate close to the fundamental limits implied by information theory, operating close to the fundamental performance bounds is costly in terms of the computational complexity required to receive the signal. This dissertation provides a framework for understanding the tradeoffs between communication performance and the imposed complexity based on how close a system operates to the performance bounds, and it allows to accurately estimate the required data processing resources of a network under a given performance constraint. The framework is applied to Cloud-RAN, which is a new cellular architecture that moves the bulk of the signal processing away from the base stations (BSs) and towards a centralized computing cloud. The analysis developed in this part of the dissertation helps to illuminate the benefits of pooling computing assets when decoding multiple uplink signals in the cloud. Building upon these results, new approaches for wireless resource allocation are proposed, which unlike previous approaches, are aware of the computing limitations of the network.;By leveraging the accurate expressions that characterize performance in the presence of interference and fading, a methodology is described for optimizing wireless multiple-access networks. The focus is on frequency hopping (FH) systems, which are already widely used in military systems, and are becoming more common in commercial systems. The optimization determines the best combination of modulation parameters (such as the modulation index for continuous-phase frequency-shift keying), number of hopping channels, and code rate. In addition, it accounts for the adjacent-channel interference (ACI) and determines how much of the signal spectrum should lie within the operating band of each channel, and how much can be allowed to splatter into adjacent channels.;The last part of this dissertation contemplates networks that involve multi-hop communications. Building on the analytical framework developed in early parts of this dissertation, the performance of such networks is analyzed in the presence of interference and fading, and it is introduced a novel paradigm for a rapid performance assessment of routing protocols. Such networks may involve cooperative communications, and the particular cooperative protocol studied here allows the same packet to be transmitted simultaneously by multiple transmitters and diversity combined at the receiver. The dynamics of how the cooperative protocol evolves over time is described through an absorbing Markov chain, and the analysis is able to efficiently capture the interference that arises as packets are periodically injected into the network by a common source, the temporal correlation among these packets and their interdependence