Abstract-This work analyzes the gains of cooperative relaying in interference-limited networks, in which outages can be due to interference and fading. A stochastic model based on point process theory is used to capture the spatial randomness present in contemporary wireless networks. Using a modification of the diversity order metric, the reliability gain of selection decodeand-forward is studied for several cases. The main results are as follows: the achievable spatial-contention diversity order (SC-DO) is equal to one irrespective of the type of channel which is due to the ineffectiveness of the relay in the MAC-phase (transmit diversity). In the BC-phase (receive diversity), the SC-DO depends on the amount of fading and spatial interference correlation. In the absence of fading, there is a hard transition between SC-DO of either one or two, depending on the system parameters.

Abstract-We study the interference and outage statistics in a slotted Aloha ad hoc network, where the spatial distribution of nodes is non-stationary and isotropic. In such a network, outage probability and local throughput depend on both the particular location in the network and the shape of the spatial distribution. We derive in closed-form certain distributional properties of the interference that are important for analyzing wireless networks as a function of the location and the spatial shape. Our results focus on path loss exponents 2 and 4, the former case not being analyzable before due to the stationarity assumption of the spatial node distribution. We propose two metrics for measuring local throughput in non-stationary networks and discuss how our findings can be applied to both analysis and optimization.

We present the \epsilon-outage capacity of incremental relaying at low signal-to-noise ratios (SNR) in a wireless cooperative network with slow Rayleigh fading channels. The relay performs decode-and-forward and repetition coding is employed in the network, which is optimal in the low SNR regime. We derive an expression on the optimal relay location that maximizes the \epsilon-outage capacity. It is shown that this location is independent of the outage probability and SNR but only depends on the channel conditions represented by a path-loss factor. We compare our results to the \epsilon-outage capacity of the cut-set bound and demonstrate that the ratio between the \epsilon-outage capacity of incremental relaying and the cut-set bound lies within 1/\sqrt{2} and 1. Furthermore, we derive lower bounds on the \epsilon-outage capacity for the case of K relays

No abstract

No abstract