• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks
【24h】

Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks

机译：利用友谊关系在移动社交网络中进行高效路由

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Routing in delay tolerant networks is a challenging problem due to the intermittent connectivity between nodes resulting in the frequent absence of end-to-end path for any source-destination pair at any given time. Recently, this problem has attracted a great deal of interest and several approaches have been proposed. Since Mobile Social Networks (MSNs) are increasingly popular type of Delay Tolerant Networks (DTNs), making accurate analysis of social network properties of these networks is essential for designing efficient routing protocols. In this paper, we introduce a new metric that detects the quality of friendships between nodes accurately. Utilizing this metric, we define the community of each node as the set of nodes having close friendship relations with this node either directly or indirectly. We also present Friendship-Based Routing in which periodically differentiated friendship relations are used in forwarding of messages. Extensive simulations on both real and synthetic traces show that the introduced algorithm is more efficient than the existing algorithms.
机译：由于节点之间的间歇性连接导致在任何给定时间频繁缺少任何源－目标对的端到端路径，因此在延迟容忍网络中进行路由是一个具有挑战性的问题。最近，这个问题引起了人们的极大兴趣，并且已经提出了几种方法。由于移动社交网络（MSN）是延迟容忍网络（DTN）越来越流行的一种类型，因此对这些网络的社交网络属性进行准确分析对于设计有效的路由协议至关重要。在本文中，我们引入了一种新的度量标准，可以准确地检测节点之间的友谊质量。利用该度量，我们将每个节点的社区定义为直接或间接与该节点具有紧密友谊关系的节点集。我们还介绍了基于友谊的路由，其中​​定期区分的友谊关系用于消息的转发。在真实和合成轨迹上的大量仿真表明，引入的算法比现有算法更有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号