• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>2014 IEEE Computing, Communications and IT Applications Conference >An overlapping community detection algorithm for opportunistic networks
【24h】

An overlapping community detection algorithm for opportunistic networks

机译：机会网络的重叠社区检测算法

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

摘要

A more detailed community structure can contribute to a better understanding of the network, which can also benefit efficient routing protocols and QoS schemes designing. For an Opportunistic Network which consists of different kinds of mobile nodes, its topology changes over time. Therefore the community detection becomes more difficult than static situations. Moreover the overlapping community detection is a more complex problem. This paper analyzes the time varying topology of Opportunistic Networks and the overlapping community structures of human. Then, we propose a new detection algorithm to solve the overlapping community detection problems in Opportunistic Networks. Only with the local network topology information and a short period, nodes can get their overlapping community structures by our detection algorithm. Numerical simulations with both scenarios of movement models and real trace data are presented to illustrate the accuracy and efficiency of our algorithm.
机译：更详细的社区结构可以有助于更好地了解网络，也可以使高效的路由协议和QoS方案设计受益。对于由不同类型的移动节点组成的机会网络，其拓扑会随时间而变化。因此，社区检测比静态情况变得更加困难。此外，重叠的社区检测是一个更复杂的问题。本文分析了机会网络的时变拓扑和人类重叠的社区结构。然后，我们提出了一种新的检测算法来解决机会网络中重叠的社区检测问题。只有使用本地网络拓扑信息并在很短的时间内，节点才能通过我们的检测算法获得其重叠的社区结构。结合运动模型和真实轨迹数据进行了数值仿真，以说明我们算法的准确性和效率。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号