On Social Delay-Tolerant Networking: Aggregation, Tie Detection, and Routing
On Social Delay-Tolerant Networking: Aggregation, Tie Detection, and Routing
复制标题
DOI：
10.1109/tpds.2013.264
复制
发表时间：
2014-06
影响因子：
5.3
通讯作者：
Kaimin Wei;Deze Zeng;Song Guo;Ke Xu
中科院分区：
文献类型：
--
作者：
Kaimin Wei;Deze Zeng;Song Guo;Ke Xu
基于社交的路由协议在延迟容忍网络（DTNs）中显示出了其提高消息传递效率的潜力。效率很大程度上依赖于聚合社会图谱的质量，而聚合社会图谱的质量是由用来衡量社会联系强度的指标决定的。在本文中，我们提出了一种改进的指标，通过考虑接触的频率和持续时间来获得高质量的社交图谱。此外，为了提高基于社交的信息传播的性能，我们系统地研究了文献中很少研究的社区进化问题。基于获得的社交图，开发了分布式算法，使重叠的社区和桥梁节点（即社区之间的连接节点）可以在进化的社交网络中动态检测。最后，我们将上述所有结果纳入基于社交的路由设计中。大量的跟踪驱动仿真结果表明，我们的路由算法明显优于现有的基于社交的转发策略。
Social-based routing protocols have shown their promising capability to improve the message delivery efficiency in Delay Tolerant Networks (DTNs). The efficiency greatly relies on the quality of the aggregated social graph that is determined by the metrics used to measure the strength of social connections. In this paper, we propose an improved metrics that leads to high-quality social graph by taking both frequency and duration of contacts into consideration. Furthermore, to improve the performance of social-based message transmission, we systematically study the community evolution problem that has been little investigated in the literation. Distributed algorithms based on the obtained social graph are developed such that the overlapping communities and bridge nodes (i.e., connecting nodes between communities) can be dynamically detected in an evolutionary social network. Finally, we take all the results above into our social-based routing design. Extensive trace-driven simulation results show that our routing algorithm outperforms existing social-based forwarding strategies significantly.