Success probabilities in Gauss-Poisson networks with and without cooperation

Gauss-Poisson processes (GPPs) are a class of clustered point processes, which include the Poisson point process as a special case and have a simpler structure than general Poisson cluster point processes. In this paper, we propose the GPP as a model for wireless networks that exhibit clustering behavior. We calculate the success probabilities and provide bounds for three kinds of GPP networks: (1) the basic model where the desired transmitter is independent of the GPP and all nodes in the GPP are interferers; (2) the non-cooperative model where the desired transmitter is one of the nodes in the GPP; (3) the cooperative model where both nodes in a two-node cluster of the GPP serve a receiver cooperatively using non-coherent joint transmission. Our results show that the bounds, especially the upper bounds, provide good approximations for different operating regimes.