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

摘要

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