基于消息重要性的机会网络能量均衡路由算法

陈志刚; 殷滨安; 吴嘉

doi:10.11959/j.issn.1000−436x.2018276

您当前的位置：

首页 >

文章列表页 >

基于消息重要性的机会网络能量均衡路由算法

学术论文 | 更新时间：2024-06-05

- 基于消息重要性的机会网络能量均衡路由算法
- Energy balanced routing algorithm for opportunistic network based on message importance
- 通信学报 2018年39卷第12期页码：91-101
- 作者机构：
  
  1. 中南大学软件学院，湖南长沙 410075
  2. “移动医疗”教育部－中国移动联合实验室，湖南长沙 410083
- 作者简介：
  
  [ "陈志刚（1964−），男，湖南益阳人，博士，中南大学教授、博士生导师，主要研究方向为计算机网络及分布式计算。" ]
  [ "殷滨安（1988−），男，湖南长沙人，中南大学硕士生，主要研究方向为机会网络及网络安全。" ]
  [ "吴嘉（1983−），男，贵州贵阳人，博士，中南大学讲师，主要研究方向为机会网络、软件工程及大数据分析。" ]
- 基金信息：
  
  国家自然科学基金资助项目(No.71633006);国家自然科学基金资助项目(No.61672540);国家自然科学基金资助项目(No.61379057);中国博士后科学基金资助项目(No.2017M612586);中南大学博士后科学基金资助项目(No.185684)
- DOI：10.11959/j.issn.1000−436x.2018276
  中图分类号： TP393.4
- 网络出版日期：2018-12，
  
  纸质出版日期：2018-12-25
- 稿件说明：
移动端阅览
陈志刚, 殷滨安, 吴嘉. 基于消息重要性的机会网络能量均衡路由算法[J]. 通信学报, 2018,39(12):91-101.

Zhigang CHEN, NBin'an YI, Jia WU. Energy balanced routing algorithm for opportunistic network based on message importance[J]. Journal on communications, 2018, 39(12): 91-101.
陈志刚, 殷滨安, 吴嘉. 基于消息重要性的机会网络能量均衡路由算法[J]. 通信学报, 2018,39(12):91-101. DOI： 10.11959/j.issn.1000−436x.2018276.

Zhigang CHEN, NBin'an YI, Jia WU. Energy balanced routing algorithm for opportunistic network based on message importance[J]. Journal on communications, 2018, 39(12): 91-101. DOI： 10.11959/j.issn.1000−436x.2018276.

摘要

提出了基于消息重要性的能量均衡路由算法——MIEBR(message importance based energy balanced routing algorithm)。MIEBR 对消息重要性进行度量，并根据消息转发收益确定消息的转发顺序和路由。在节点缓存空间不足时，MIEBR依据消息缓存价值进行缓存替换。实验结果表明，在缓存空间和能量受限的机会网络中，MIEBR均衡节点的能量消耗，降低了重要消息的传输延时，在投递成功率和延时等方面优于其他算法。

Abstract

A new routing algorithm MIEBR(message importance based energy balanced routing algorithm) was proposed. MIEBR measures the importance of messages. It determines message forwarding order and routing by message forwarding profit. When cache space is insufficient

MIEBR performs cache replacement based on message cache value. Simulation results show that

in cache space and energy constrained networks

MIEBR balances energy consumption of nodes

and reduces the latency of important messages. It outperforms other algorithms in delivery rate and latency.

关键词

Keywords

references

SOELISTIJANTO B , HOWARTH M P . Transfer reliability and congestion control strategies in opportunistic networks: a survey [J ] . IEEE Communications Surveys & Tutorials , 2014 , 16 ( 1 ): 538 - 555 .

WU D , ZHANG H , WANG H , et al . Quality-of-protection-driven data forwarding for intermittently connected wireless networks [J ] . Wireless Communications IEEE , 2015 , 22 ( 4 ): 66 - 73 .

NAVAZ A S S . An efficient intrusion detection scheme for mitigating nodes using data aggregation in delay tolerant network [J ] . International Journal of Scientific & Engineering Research , 2015 , 6 ( 9 ): 421 - 428 .

姚建盛，马春光，袁琪 . 基于效用的机会网络“物—物交换”激励机制 [J ] . 通信学报， 2016 , 37 ( 09 ): 102 - 110 .

YAO J S , MA C G , YUAN Q . Utility-based barter trade incentive scheme in opportunistic network [J ] . Journal on Communications , 2016 , 37 ( 09 ): 102 - 110 .

PAN D R , ZHANG H , CHEN W J , et al . Transmission of multimedia contents in opportunistic networks with social selfish nodes [J ] . Multimedia Systems , 2015 , 21 ( 3 ): 277 - 288 .

WU J , CHEN Z G . Reducing energy consumption priority selection of node transmission routing algorithm in opportunistic network [J ] . Advances in Information Sciences & Service Sciences , 2014 , 6 ( 1 ): 111 - 119 .

YIN B A , CHEN Z G , WU J . Transmission failure tolerance and node punishment mechanism in opportunistic network based on repeated-game [C ] // Communications in Computer and Information Science . 2017 , 101 - 115 .

BARUA R , SHADMAN S , CHAKRABARTY A . PNGP: a social relationship based routing algorithm for pocket switched network [C ] // IEEE 19th International Conference on Computer and Information Technology . 2017 , 25 - 30 .

HULL B W . Opportunistic sensing and mobile data delivery in the cartel system [M ] . Massachusetts Institute of Technology . 2010 .

王丹，陈志刚，吴嘉 . 基于机会网络中社交关系的转发机制 [J ] . 计算机应用研究， 2015 , 32 ( 5 ): 1461 - 1463 .

WANG D , CHEN Z G , WU J . Forwarding mechanism in opportunistic networks based on social relations [J ] . Application Research of Computers , 2015 , 32 ( 5 ): 1461 - 1463 .

李豪，陈志刚，吴嘉 . 基于社区与社会性的机会网络路由算法 [J ] . 计算机工程， 2015 , 41 ( 12 ): 64 - 68 + 74 .

LI H , CHEN Z G , WU J . Opportunistic network routing algorithm based on community and sociality [J ] . Computer Engineering , 2015 , 41 ( 12 ): 64 - 68 , 74 .

CHEN Z G , WU J . Applying a sensor energy supply communication scheme to big data opportunistic networks [J ] . KSII Transactions on Internet and Information Systems , 2016 , 10 ( 5 ): 2029 - 2046 .

叶晖，陈志刚，赵明 . ON-CRP：机会网络缓存替换策略研究 [J ] . 通信学报， 2010 , 31 ( 5 ): 98 - 107 .

YE H , CHEN Z G , ZHAO M . ON-CRP: cache replacement policy for opportunistic networks [J ] . Journal on Communications , 2010 , 31 ( 5 ): 98 - 107 .

马华东，袁培燕，赵东 . 移动机会网络路由问题研究进展 [J ] . 软件学报， 2015 , 26 ( 3 ): 600 - 616 .

MA H D , YUAN P Y , ZHAO D . Research progress on routing problem in mobile opportunistic networks [J ] . Journal of Software , 2015 , 26 ( 3 ): 600 - 616 .

孙践知，刘乃瑞，张迎新，等 . 机会网络典型路由算法性能分析 [J ] . 计算机工程， 2011 , 37 ( 16 ): 86 - 89 .

SUN J Z , LIU N R , ZHANG Y X , et al . Performance analysis of typical routing algorithm in opportunistic network [J ] . Computer Engineering , 2011 , 37 ( 16 ): 86 - 89 .

REN Z , PENG S , CHEN H , et al . Epidemic routing based on adaptive compression of vectors: efficient low-delay routing for opportunistic networks based on adaptive compression of vectors [J ] . International Journal of Communication Systems , 2015 , 28 ( 3 ): 560 - 573 .

JAIN S , CHAWLA M , SOARES V N G J , et al . Enhanced fuzzy logic-based spray and wait routing protocol for delay tolerant networks [J ] . International Journal of Communication Systems , 2016 , 29 ( 12 ): 1820 - 1843 .

SOK P , KIM K . Distance-based PRoPHET routing protocol in disruption tolerant network [C ] // International Conference on ICT Convergence . 2013 : 159 - 164 .

NGUYEN H A , GIORDANO S , PUIATTI A . Probabilistic routing protocol for intermittently connected mobile ad hoc network (PROPICMAN) [C ] // IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks . 2007 : 1 - 6 .

HUI P , CROWCROFT J , YONEKI E . Bubble rap: social-based forwarding in delay tolerant networks [J ] . IEEE Transactions on Mobile Computing , 2011 , 10 ( 11 ): 1576 - 1589 .

PRODHAN A T , DAS R , KABIR H , et al . TTL based routing in opportunistic networks [J ] . Journal of Network & Computer Applications , 2011 , 34 ( 5 ): 1660 - 1670 .

王熙照，贺毅朝 . 求解背包问题的演化算法 [J ] . 软件学报， 2017 , 28 ( 1 ): 1 - 16 .

WANG X Z , HE Y C . Evolutionary algorithms for knapsack problems [J ] . Journal of Software , 2017 , 28 ( 1 ): 1 - 16 .

王朕，王新华，隋敬麒 . 机会网络模拟器 ONE 及其扩展研究 [J ] . 计算机应用研究， 2012 , 29 ( 1 ): 272 - 277 .

WANG Z , WANG X H , SUI J Q . Extending research for ONE simulator of opportunistic network [J ] . Application Research of Computers , 2012 , 29 ( 1 ): 272 - 277 .

EKMAN F , KARVO J . Working day movement model [C ] // Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing . 2008 : 33 - 40 .

浏览量

下载量

CSCD

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

提交

工具集

关联资源

基于相遇节点跨层感知的机会网络高效低时延路由算法

基于网络编码的机会网络高效路由算法

基于时空卷积的机会网络拓扑预测

基于多时间段优化贝叶斯网络的车载容迟网络路由算法

基于多目标优化的固定中继节点唤醒策略