DocumentCode :
1330392
Title :
Connectivity in Selfish, Cooperative Networks
Author :
Liu, Erwu ; Zhang, Qinqing ; Leung, Kin K.
Author_Institution :
Dept. of Electr. & Electron. Eng., Imperial Coll., London, UK
Volume :
14
Issue :
10
fYear :
2010
fDate :
10/1/2010 12:00:00 AM
Firstpage :
936
Lastpage :
938
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.
Keywords :
ad hoc networks; geometry; stochastic processes; telecommunication traffic; cooperative ad hoc networks; node density; node traffic; percolation theory; stochastic geometry; Frequency shift keying; Geometry; Mobile ad hoc networks; Topology; Upper bound; Wireless networks; Selfish node; connectivity; cooperative network;
fLanguage :
English
Journal_Title :
Communications Letters, IEEE
Publisher :
ieee
ISSN :
1089-7798
Type :
jour
DOI :
10.1109/LCOMM.2010.091010.101173
Filename :
5581191
Link To Document :
بازگشت