Opportunistic Routing in Intermittently Connected Mobile P2P Networks
Opportunistic Routing in Intermittently Connected Mobile P2P Networks
复制标题
间歇性连接的移动 P2P 网络中的机会路由
DOI：
10.1109/jsac.2013.sup.0513033
复制
发表时间：
2013-08
影响因子：
16.4
通讯作者：
Biao Chen
中科院分区：
文献类型：
--
作者：
Xiuzhen Cheng;Zhongcheng Li;Jianhui Huang;Biao Chen
移动的P2P网络是一种使移动的设备能够以非结构化方式自组织并以对等方式通信的技术。由于用户移动性和/或移动的设备的不受限制的开/关，链路被间歇地连接并且端到端路径可能不存在，从而导致路由非常具有挑战性的问题。此外，有限的无线频谱和设备资源以及快速增长的便携式设备数量和传输的数据量使得路由更加困难。为了应对这些挑战，路由算法必须是可扩展的，分布式的，轻量级的。然而，现有的方法通常不能同时满足所有这三个要求。在本文中，我们提出了两个机会路由算法间歇连接的移动的P2P网络，利用空间的局部性，空间规律性和活动的异质性，人类的流动性选择中继。第一种算法采用深度搜索方法将数据扩散到目的地。第二种方法采用深度-宽度-搜索方法，在某种意义上，它不仅将数据扩散到目的地，而且还扩散到由活跃移动节点（活动家）确定的其他方向，以找到更好的中继。我们进行理论分析，以及基于比较的模拟研究。我们的结果从合成数据和真实的世界的痕迹表明，所提出的算法优于国家的最先进的交付延迟和交付率。
Mobile P2P networking is an enabling technology for mobile devices to self-organize in an unstructured style and communicate in a peer-to-peer fashion. Due to user mobility and/or the unrestricted switching on/off of the mobile devices, links are intermittently connected and end-to-end paths may not exist, causing routing a very challenging problem. Moreover, the limited wireless spectrum and device resources together with the rapidly growing number of portable devices and amount of transmitted data make routing even harder. To tackle these challenges, the routing algorithms must be scalable, distributed, and light-weighted. Nevertheless, existing approaches usually cannot simultaneously satisfy all these three requirements. In this paper, we propose two opportunistic routing algorithms for intermittently connected mobile P2P networks, which exploit the spatial locality, spatial regularity, and activity heterogeneity of human mobility to select relays. The first algorithm employs a depth-search approach to diffuse the data towards the destination. The second one adopts a depth-width-search approach in a sense that it diffuses the data not only towards the destination but also to other directions determined by the actively moving nodes (activists) to find better relays. We perform both theoretical analysis as well as a comparison based simulation study. Our results obtained from both the synthetic data and the real world traces reveal that the proposed algorithms outperform the state-of-the-art in terms of delivery latency and delivery ratio.
登录
查看更多内容
DOI：
10.1145/1015467.1015484
发表时间：
2004-08
期刊：
--
影响因子：
--
作者：
S. Jain;K. Fall;Rabin K. Patra
通讯作者：
S. Jain;K. Fall;Rabin K. Patra
影响因子：
10.4
作者：
Dang, Ha;Wu, Hongyi
通讯作者：
Wu, Hongyi
影响因子：
7.9
作者：
Evan P. C. Jones;Li Li-Li;Jakub K. Schmidtke;Paul A. S. Ward
通讯作者：
Evan P. C. Jones;Li Li-Li;Jakub K. Schmidtke;Paul A. S. Ward
影响因子：
1
作者：
Zhipeng Cai;Y. Duan;A. Bourgeois
通讯作者：
Zhipeng Cai;Y. Duan;A. Bourgeois
DOI：
10.1109/infcom.2011.5935157
发表时间：
2011-04
期刊：
2011 Proceedings IEEE INFOCOM
影响因子：
--
作者：
Wei Gao;G. Cao
通讯作者：
Wei Gao;G. Cao