基于兴趣社区的高效路由与缓存管理算法  

An efficient routing and cache management algorithm based on interest-community for opportunity networks

作　　者：任智[1] 王坤龙 李秀峰[1] REN Zhi;WANG Kunlong;LI Xiufeng(Chongqing Key Lab of Mobile Communication Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, Chin)

机构地区：[1]重庆邮电大学移动通信技术重庆市重点实验室,重庆400065

出　　处：《电信科学》2018年第6期43-52,共10页Telecommunications Science

基　　金：国家自然科学基金资助项目(No.61379159);长江学者和创新团队发展计划基金资助项目(No.IRT1299)~~

摘　　要：针对现有BEEINFO算法中存在控制消息冗余、未考虑节点多邻居消息转发和对缓存中消息管理不合理的问题,提出了一种基于兴趣社区的高效路由与缓存管理算法——ERCMAON。该算法通过精简控制消息,增加对节点多邻居情形的路由设计,降低了系统开销和消息转发时延;同时,通过优化节点缓存管理机制,降低了有用信息被删除的概率,从而可以提高消息的投递成功率。通过与现有的BEEINFO、Epidemic和Pro PHET算法进行仿真验证,结果表明,与BEEINFO算法相比,ERCMAON投递成功率至少提高2.0%,数据投递开销和归一化控制开销分别降低至少9.7%和1.7%,同时消息传输时延至少降低2.4%。Aiming at the problem of control message redundancy existing in BEEINFO algorithm, unconsidered node multi-neighbor message forwarding problem and unreasonable management of message in cache, an efficient routing and cache management algorithm named ERCMAON which based on community of interest was proposed. The message forwarding delay was reduced by streamlining control messages, increasing the route design for multiple-neighbor nodes. At the same time, by optimizing the node cache management mechanism, the probability of de- leting useful information was reduced, which could improve the success rate of message delivery. Simulation results show thatcompared with the BEEINFO algorithm, the delivery success rate of ERCMAON algorithm increases by at least 2.0%, the data delivery overhead and the normalized control overhead reduces by at least 9.7% and 1.7% respectively. At the same time, the message transmission delay reduces at least 2.4%.

关 键 词：机会网络 社区 高效 缓存管理 路由算法 

分 类 号：TP393.4[自动化与计算机技术—计算机应用技术]