Friendship Based Routing in Delay Tolerant Mobile Social Networks
Friendship Based Routing in Delay Tolerant Mobile Social Networks
复制标题
DOI：
10.1109/glocom.2010.5683082
复制
发表时间：
2010-12
期刊：
影响因子：
--
通讯作者：
E. Bulut;B. Szymański
中科院分区：
文献类型：
--
作者：
E. Bulut;B. Szymański
延迟容忍网络（DTN）中的路由最近引起了人们的极大兴趣。越来越流行的 DTN 类型是移动社交网络 (MSN)，也称为袖珍交换网络。因此，准确分析社交网络属性已成为设计高效MSN路由协议的重要问题。在本文中，我们首先引入了一种新的指标来准确检测友谊的质量。使用引入的度量，每个节点将其友谊社区定义为直接或间接与其自身具有密切友谊的节点的集合。然后，我们提出基于友谊的路由，其中使用时间差异的友谊来做出消息的转发决策。真实的跟踪驱动仿真结果表明，与现有算法相比，所引入的算法在转发更少的消息的同时实现了更好的投递率。
Routing in delay tolerant networks (DTN) have attracted a great interest recently. Increasingly popular type of DTNs are mobile social networks (MSN) also called pocket switched networks. Hence, analyzing accurately social network properties has become an important issue in designing efficient routing protocols for MSNs. In this paper, we first introduce a new metric for detecting the quality of friendships accurately. Using the introduced metric, each node defines its friendship community as the set of nodes having close friendship with itself either directly or indirectly. Then, we present Friendship Based Routing in which temporally differentiated friendships are used to make the forwarding decisions of messages. Real trace-driven simulation results show that the introduced algorithm achieves better delivery rate while forwarding fewer messages than the existing algorithms.