Outage probabilities and single-hop throughput are two important performance metrics that have been evaluated for certain specific types of wireless networks. However, there is a lack of comprehensive results for larger classes of networks, and there is no systematic approach that permits the convenient comparison of the performance of networks with different geometries and levels of randomness. The uncertainty cube is introduced to categorize the uncertainty present in a network. The three axes of the cube represent the three main potential sources of uncertainty in interference-limited networks: the node distribution, the channel gains (fading), and the channel access scheme (set of transmitting nodes). For the performance analysis, a new parameter, the so- called spatial contention, is defined. It measures the slope of the outage probability in an ALOHA network as a function of the transmit probability p at p = 0. Outage is defined as the event that the signal-to-interference ratio (SIR) is below a certain threshold in a given time slot. It is shown that the spatial contention is sufficient to characterize outage and throughput in large classes of wireless networks, corresponding to different positions on the uncertainty cube. Existing results are placed in this framework, and new ones are derived. Further, interpreting the outage probability as the SIR distribution, the ergodic capacity of unit-distance links is determined and compared to the throughput achievable for fixed (yet optimized) transmission rates.
In early work, it is said that the convolution of exponential RVs of different means can be approximated by a Gamma distribution. This needs to be verified! @cite_6 determines the interference in Poisson random networks for @math . Since their interference is averaged over many network realizations, it turns out to be Gaussian. For a given network and a certain MAC scheme, the distribution obtained from a temporal trace will most likely look different (see @cite_0 @cite_8 ), since there will be a few dominant interferers, in particular for high @math . Hence, such Gaussian models have to be used with care for analysis and protocol design. We will characterize the distribution of the cumulated interference for single network realizations and different MAC schemes.
@cite_0 @cite_6 @cite_8
2121714289 2952966314 2022637917 2032712938
In Costa's dirty-paper channel, Gaussian random binning is able to eliminate the effect of interference which is known at the transmitter, and thus achieve capacity. We examine a generalization of the dirty-paper problem to a multiple access channel (MAC) setup, where structured (lattice-based) binning seems to be necessary to achieve capacity. In the dirty-MAC, two additive interference signals are present, one known to each transmitter but none to the receiver. The achievable rates using Costa's Gaussian binning vanish if both interference signals are strong. In contrast, it is shown that lattice-strategies (“lattice precoding”) can achieve positive rates, independent of the interference power. Furthermore, in some cases-which depend on the noise variance and power constraints-high-dimensional lattice strategies are in fact optimal. In particular, they are optimal in the limit of high SNR-where the capacity region of the dirty MAC with strong interference approaches that of a clean MAC whose power is governed by the minimum of the users' powers rather than their sum. The rate gap at high SNR between lattice-strategies and optimum (rather than Gaussian) random binning is conjectured to be 1 2 log2(πe 6) ≈ 0.254 bit. Thus, the doubly dirty MAC is another instance of a network setting, like the Korner-Marton problem, where (linear) structured coding is potentially better than random binning. A generalization of the Gaussian dirty-paper problem to a multiple access setup is considered. There are two additive interference signals, one known to each transmitter but none to the receiver. The rates achievable using Costa's strategies (i.e. by a random binning scheme induced by Costa's auxiliary random variables) vanish in the limit when the interference signals are strong. In contrast, it is shown that lattice strategies ("lattice precoding") can achieve positive rates independent of the interferences, and in fact in some cases - which depend on the noise variance and power constraints - they are optimal. In particular, lattice strategies are optimal in the limit of high SNR. It is also shown that the gap between the achievable rate region and the capacity region is at most 0.167 bit. Thus, the dirty MAC is another instance of a network setup, like the Korner-Marton modulo-two sum problem, where linear coding is potentially better than random binning. Lattice transmission schemes and conditions for optimality for the asymmetric case, where there is only one interference which is known to one of the users (who serves as a "helper" to the other user), and for the "common interference" case are also derived. In the former case the gap between the helper achievable rate and its capacity is at most 0.085 bit. In mobile networks, distance variations caused by node mobility generate fluctuations in the channel gains. Such fluctuations can be treated as another type of fading besides multipath effects. In this paper, the interference statistics in mobile random networks are characterized by incorporating the distance variations of mobile nodes to the channel gain fluctuations. The mean interference is calculated at the origin and at the border of a finite mobile network. The network performance is evaluated in terms of the outage probability. Compared to a static network, the interference in a single snapshot does not change under uniform mobility models. However, random waypoint mobility increases (decreases) the interference at the origin (at the border). Furthermore, due to the correlation of the node locations, the interference and outage are temporally and spatially correlated. We quantify the temporal correlation of the interference and outage in mobile Poisson networks in terms of the correlation coefficient and conditional outage probability, respectively. The results show that it is essential that routing, MAC, and retransmission schemes need to be smart (i.e., correlation-aware) to avoid bursts of transmission failures. The equivalent-in-distribution (EiD)-based approach to the analysis of single-input-single-output (SISO) cellular networks for transmission over Rayleigh fading channels has recently been introduced [1]. Its rationale relies upon formulating the aggregate other-cell interference in terms of an infinite summation of independent and conditionally distributed Gaussian random variables (RVs). This approach leads to exact integral expressions of the error probability for arbitrary bi-dimensional modulations. In this paper, the EiD-based approach is generalized to the performance analysis of multiple-input-multiple-output (MIMO) cellular networks for transmission over Rayleigh fading channels. The proposed mathematical formulation allows us to study a large number of MIMO arrangements, including receive-diversity, spatial-multiplexing, orthogonal space-time block coding, zero-forcing reception and zero-forcing precoding. Depending on the MIMO setup, either exact or approximate integral expressions of the error probability are provided. In the presence of other-cell interference and noise, the error probability is formulated in terms of a two-fold integral. In interference-limited cellular networks, the mathematical framework simplifies to a single integral expression. As a byproduct, the proposed approach enables us to study SISO cellular networks for transmission over Nakagami- @math fading channels. The mathematical analysis is substantiated with the aid of extensive Monte Carlo simulations.