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

任智; 王坤龙; 李秀峰

doi:10.11959/j.issn.1000-0801.2018160

您当前的位置：

首页 >

文章列表页 >

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

研究与开发 | 更新时间：2024-06-05

- 基于兴趣社区的高效路由与缓存管理算法
- An efficient routing and cache management algorithm based on interest-community for opportunity networks
- 电信科学 2018年34卷第6期页码：43-52
- 作者机构：
- 作者简介：
  
  [ "任智（1971-），男，博士后，重庆邮电大学移动通信技术重庆市重点实验室教授、博士生导师，主要研究方向为宽带自组网与无线通信。" ]
  [ "王坤龙（1993-），男，重庆邮电大学移动通信技术重庆市重点实验室硕士生，主要研究方向为物联网理论技术及无线 MAC协议。" ]
  [ "李秀峰（1991-），男，重庆邮电大学移动通信技术重庆市重点实验室硕士生，主要研究方向为机会网络路由算法。" ]
- 基金信息：
  
  国家自然科学基金资助项目;The National Natural Science Foundation of China(61379159);长江学者和创新团队发展计划基金资助项目;Program for Changjiang Scholars and Innova-tive Research Team in University(IRT1299)
- DOI：10.11959/j.issn.1000-0801.2018160
  中图分类号： TP393.4
- 网络出版日期：2018-06，
  
  纸质出版日期：2018-06-20
- 稿件说明：
移动端阅览
任智, 王坤龙, 李秀峰. 基于兴趣社区的高效路由与缓存管理算法[J]. 电信科学, 2018,34(6):43-52.

Zhi REN, Kunlong WANG, Xiufeng LI. An efficient routing and cache management algorithm based on interest-community for opportunity networks[J]. Telecommunications science, 2018, 34(6): 43-52.
任智, 王坤龙, 李秀峰. 基于兴趣社区的高效路由与缓存管理算法[J]. 电信科学, 2018,34(6):43-52. DOI： 10.11959/j.issn.1000-0801.2018160.

Zhi REN, Kunlong WANG, Xiufeng LI. An efficient routing and cache management algorithm based on interest-community for opportunity networks[J]. Telecommunications science, 2018, 34(6): 43-52. DOI： 10.11959/j.issn.1000-0801.2018160.

摘要

针对现有BEEINFO算法中存在控制消息冗余、未考虑节点多邻居消息转发和对缓存中消息管理不合理的问题，提出了一种基于兴趣社区的高效路由与缓存管理算法——ERCMAON。该算法通过精简控制消息，增加对节点多邻居情形的路由设计，降低了系统开销和消息转发时延；同时，通过优化节点缓存管理机制，降低了有用信息被删除的概率，从而可以提高消息的投递成功率。通过与现有的 BEEINFO、Epidemic 和ProPHET算法进行仿真验证，结果表明，与BEEINFO算法相比，ERCMAON投递成功率至少提高2.0%，数据投递开销和归一化控制开销分别降低至少9.7%和1.7%，同时消息传输时延至少降低2.4%。

Abstract

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 deleting 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%.

关键词

Keywords

references

STAVROULAKI V , TSAGKARIS K , LOGOTHETIS M , et al . Opportunistic networks [J ] . IEEE Vehicular Technology Magazine , 2011 , 6 ( 3 ): 52 - 59 .

HOSSMANN T , NOMIKOS G , SPYROPOULOS T , et al . Collection and analysis of multi-dimensional network data for opportunistic networking research [J ] . Computer Communications , 2012 , 35 ( 13 ): 1613 - 1625 .

VAHDAT A , BECKER D . Epidemic routing for partially-connected Ad Hoc networks [J ] . Master Thesis , 2000

LINDGREN A , DORIA A . Probabilistic routing in intermittently connected networks [J ] . ACM Sigmobile Mobile Computing ＆ Communications Review , 2004 , 7 ( 3 ): 239 - 254 .

MEI A , MORABITO G , SANTI P , et al . Social-aware stateless forwarding in pocket switched networks [C ] // 2011 IEEE INFOCOM,April 10-15,2011,Shanghai,China . Piscataway:IEEE Press , 2011 : 251 - 255 .

PAN H , CROWCROFT J , EIKO Y . BUBBLE rap:social-based forwarding in delay-tolerant networks [J ] . IEEE Transactions on Mobile Computing , 2010 , 10 ( 11 ): 1576 - 1589 .

WANG Y , WU J . Social-tie-based information dissemination in mobile opportunistic social networks [C ] // 2013 IEEE 14th International Symposium and Workshops on aWorld of Wireless,Mobile and Multimedia Networks (WoWMoM),June 4-7,2013,Madrid,Spain . Piscataway:IEEE Press , 2013 : 1 - 6 .

WONG G , JIA X . A novel socially-aware opportunistic routing algorithm in mobile social networks [C ] // International Conference on Computing,Networking and Communications,Jan 28-31,2013,San Diego,USA . Piscataway:IEEE Press , 2013 : 514 - 518 .

BECKER C , SCHLINGA S , FISCHER S . Trustful data forwarding in social opportunistic networks [C ] // Ubiquitous Intelligence and Computing,Dec 18-21,2013,Vietri,Italy . Piscataway:IEEE Press , 2013 : 430 - 437 .

JANG K , LEE J , KIM S K , et al . An adaptive routing algorithm considering position and social similarities in an opportunistic network [J ] . Wireless Networks , 2016 , 22 ( 5 ): 1537 - 1551 .

ZHANG S , WANG X , YAO M , et al . Community-based message transmission with energy efficient in opportunistic networks [C ] // International Conference on Web Information Systems Engineering,November 16-18,Zhangjiajie,China . Berlin:Springer Press , 2016 : 411 - 423 .

LI J , LIU L , XIA F . BEEINFO:data forwarding based on interest and swarm intelligence for socially-aware networking [C ] // International Conference on Mobile Computing ＆Networking,September 30-October 4,2013,Miami,USA . New York:ACM Press , 2013 : 175 - 178 .

ERRAMILLI V , CROVELLA M . Forwarding in opportunistic networks with resource constraints [C ] // The 3rd ACM Workshop on Challenged Networks,September 15-15,2008,San Francisco,USA . New York:ACM Press , 2008 : 41 - 48 .

XIA F , LIU L , LI J , et al . BEEINFO:interest-based forwarding using artificial bee colony for socially aware networking [J ] . IEEE Transactions on Vehicular Technology , 2015 , 64 ( 3 ): 1188 - 1200 .

ZHOU J , LIN Y , ZHOU S , et al . Community-based adaptive buffer management strategy in opportunistic network [C ] // International Conference on Security,Privacy and Anonymity in Computation,Communication and Storage,November 16-18,2016,Zhangjiajie,China . Berlin:Springer Press , 2016 : 16 - 25 .

浏览量

499

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

SDN/NFV引入后的运营支撑系统实施方案和策略

一种基于二次剩余的改进的RFID认证协议

一种有效的稀疏无线传感器网络路由方案

基于SDN架构的数据中心网络路由算法需求分析

NDN中基于蚁群替换算法的邻居协作缓存管理策略