作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2017, Vol. 43 ›› Issue (12): 98-102. doi: 10.3969/j.issn.1000-3428.2017.12.019

• 移动互联与通信技术 • 上一篇    下一篇

基于社交关系的移动机会网络路由算法

余翔,刘志红,闫冰冰   

  1. (重庆邮电大学 宽带移动通信动员中心,重庆 400065)
  • 收稿日期:2016-11-14 出版日期:2017-12-15 发布日期:2017-12-15
  • 作者简介:余翔(1969—),男,副教授、硕士,主研方向为网络及信息安全、下一代网络协议;刘志红(通信作者)、闫冰冰,硕士研究生。
  • 基金资助:
    国家科技重大专项“新一代宽带无线移动通信网”(2015ZX03004004)。

Routing Algorithm Based on Social Relationship in Mobile Opportunistic Network

YU Xiang,LIU Zhihong,YAN Bingbing   

  1. (Broadband Mobile Communication Mobilization Center,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)
  • Received:2016-11-14 Online:2017-12-15 Published:2017-12-15

摘要: 在基于节点社交信息移动机会网络路由算法的设计中,存在不能有效平衡数据的传输成功率与平均传输时延的问题。为此,提出一种基于社交关系的路由算法。利用改进的桥接中心度重新评价节点的异质中心性,通过引入社区内的转发判别因子加快社区内消息的转发,结合带有老化机制的Simple社区识别算法选择转发节点。仿真结果表明,与经典算法Bubble Rap及其改进算法BiBubble、BridgingCom相比,该算法能够有效提高消息投递成功率并减小消息平均传输时延。

关键词: 移动机会网络, 社交信息, 中心度, 社区, 路由算法

Abstract: In the design of routing algorithms in mobile opportunistic networks based on node social information,there is a problem that it is hard to balance transmission success ratio with average transmission delay effectively.In order to solve this problem,the routing algorithm based on social relationships is proposed,which makes use of center of the improved bridging centrality degree to evaluate the node heterogenicity and speeds up the messages forwarding through the introduction of forwarding discrimination factor in the community,and chooses forwarding nodes according to simple community identification algorithm with aging mechanism.Simulation results show that the proposed algorithm can effectively improve the message delivery success rate and reduce the average transmission delay compared with the classic algorithm Bubble Rap and its improved algorithms BiBubble and BridgingCom.

Key words: mobile opportunistic network, social information, centrality, community, routing algorithm

中图分类号: