计算机工程2017，Vol.43Issue(12)：98-102,5.DOI:10.3969/j.issn.1000-3428.2017.12.019
基于社交关系的移动机会网络路由算法
Routing Algorithm Based on Social Relationship in Mobile Opportunistic Network
摘要
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分类
信息技术与安全科学引用本文复制引用
余翔,刘志红,闫冰冰..基于社交关系的移动机会网络路由算法[J].计算机工程,2017,43(12):98-102,5.基金项目
国家科技重大专项“新一代宽带无线移动通信网”(2015ZX03004004). （2015ZX03004004）
