Connectivity in Selfish, Cooperative Networks
Connectivity in Selfish, Cooperative Networks
复制标题
DOI：
10.1109/lcomm.2010.091010.101173
复制
发表时间：
2010-10
期刊：
影响因子：
--
通讯作者：
Erwu Liu;Qinqing Zhang;K. Leung
中科院分区：
文献类型：
--
作者：
Erwu Liu;Qinqing Zhang;K. Leung
研究了大型协作自组网的连通性问题。与现有工作中假设所有节点都协作传输不同，我们考虑的协作网络是现实的，因为我们假设在转发其他节点的流量时并不是所有节点都愿意协作。对于这种自私的协作网络，我们利用随机几何和渗流理论对网络的连通性进行了分析，给出了网络渗流时临界节点密度的上界。
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.