Connectivity in Selfish, Cooperative Networks

摘要

This paper studies the connectivity of large cooperative ad hoc networks. Unlike existing work where all nodes are assumed to transmit cooperatively, the cooperative network we consider is realistic as we assume that not all nodes are willing to collaborate when relaying other nodes' traffic. For such selfish, cooperative network, we use stochastic geometry and percolation theory to analyze the connectivity and provide an upper bound of critical node density when the network percolates.