Connectivity in selfish, cooperative networks

Authors:
Erwu Liu;Qinqing Zhang;Kin K. Leung
Affiliations:
Department of Electrical and Electronic Engineering, Imperial College, London, UK;Department of Computer Science, Johns Hopkins University;Department of Electrical and Electronic Engineering, Imperial College, London, UK
Venue:
IEEE Communications Letters
Year:
2010

Citing 4
Cited 1

Connectivity in cooperative wireless ad hoc networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Stochastic geometry and random graphs for the analysis and design of wireless networks

IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Asymptotic connectivity properties of cooperative wireless ad hoc networks

IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
An analytical approach to the study of cooperation in wireless ad hoc networks

IEEE Transactions on Wireless Communications

Towards Energy-Efficiency in Selfish, Cooperative Networks

Mobile Networks and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.