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

Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks

Development of many futuristic technologies, such as MANET, VANET, iThings, nano-devices, depend on efficient distributed communication protocols in multi-hop ad hoc networks. A vast majority of research in this area focus on design heuristic protocols, and analyze their performance by simulations on networks generated randomly or obtained in practical measurements of some (usually small-size) wireless networks. %some library. Moreover, they often assume access to truly random sources, which is often not reasonable in case of wireless devices. In this work we use a formal framework to study the problem of broadcasting and its time complexity in any two dimensional Euclidean wireless network with uniform transmission powers. For the analysis, we consider two popular models of ad hoc networks based on the Signal-to-Interference-and-Noise Ratio (SINR): one with opportunistic links, and the other with randomly disturbed SINR. In the former model, we show that one of our algorithms accomplishes broadcasting in $O(D\log^2 n)$ rounds, where $n$ is the number of nodes and $D$ is the diameter of the network. If nodes know a priori the granularity $g$ of the network, i.e., the inverse of the maximum transmission range over the minimum distance between any two stations, a modification of this algorithm accomplishes broadcasting in $O(D\log g)$ rounds. Finally, we modify both algorithms to make them efficient in the latter model with randomly disturbed SINR, with only logarithmic growth of performance. Ours are the first provably efficient and well-scalable, under the two models, distributed deterministic solutions for the broadcast task.Comment: arXiv admin note: substantial text overlap with arXiv:1207.673