Cooperative Strategies for Interference-Limited Wireless Networks

TL;DR

This paper analyzes the outage probability in interference-limited wireless networks with relay-assisted communication, comparing decode-and-forward and compress-and-forward schemes, and explores the trade-offs between network density and cooperation benefits.

Contribution

It provides tight bounds on outage probability for cooperative schemes in large Poisson networks, highlighting the density-cooperation trade-off.

Findings

Tight bounds on outage probability for DF and CF schemes.

Existence of a trade-off between network density and cooperation benefits.

Results aid in optimizing relaying schemes in large wireless networks.

Abstract

Consider the communication of a single-user aided by a nearby relay involved in a large wireless network where the nodes form an homogeneous Poisson point process. Since this network is interference-limited the asymptotic error probability is bounded from above by the outage probability experienced by the user. We investigate the outage behavior for the well-known cooperative schemes, namely, decode-and-forward (DF) and compress-and-forward (CF). In this setting, the outage events are induced by both fading and the spatial proximity of neighbor nodes who generate the strongest interference and hence the worst communication case. Upper and lower bounds on the asymptotic error probability which are tight in some cases are derived. It is shown that there exists a clear trade off between the network density and the benefits of user cooperation. These results are useful to evaluate performances and to optimize relaying schemes in the context of large wireless networks.