通信学报 ›› 2017, Vol. 38 ›› Issue (5): 108-120.doi: 10.11959/j.issn.1000-436x.2017105

• 学术论文 • 上一篇    下一篇

基于马尔可夫链的轻量级机会路由转发策略

李峰1,司亚利2,3,陈真2,申利民2   

  1. 1 东北大学秦皇岛分校计算机与通信工程学院，河北 秦皇岛 066004
    2 燕山大学信息科学与工程学院，河北 秦皇岛 066004
    3 燕山大学里仁学院，河北 秦皇岛 066004
  • 修回日期:2017-03-10 出版日期:2017-05-01 发布日期:2017-05-28
  • 作者简介:李峰（1978-），男，山东德州人，博士，东北大学讲师，主要研究方向为机会网络和信任关系建模技术。|司亚利（1981-），女，黑龙江齐齐哈尔人，博士，燕山大学副教授，主要研究方向为移动推荐。|陈真（1987-），男，陕西宝鸡人，燕山大学博士生，主要研究方向为Web服务评估和机会网络。|申利民（1962-），男，黑龙江佳木斯人，博士，燕山大学教授、博士生导师，主要研究方向为软件工程和可信计算。
  • 基金资助:
    国家自然科学基金资助项目(61300193);国家自然科学基金资助项目(61272125);国家自然科学基金资助项目(61602100);国家自然科学基金资助项目(61601107);河北省自然科学基金资助项目(F2015501105);河北省自然科学基金资助项目(F2017203307);河北省自然科学基金资助项目(F2015501122);中央高校基本科研业务费专项资金资助项目(N120323012)

Lightweight opportunistic routing forwarding strategy based on Markov chain

Feng LI1,Ya-li SI2,3,Zhen CHEN2,Li-min SHEN2   

  1. 1 School of Computer and Communication Engineering,Northeastern University at Qinhuangdao,Qinhuangdao 066004,China
    2 School of Information Science and Engineering,Yanshan University,Qinhuangdao 066004,China
    3 LiRen College,Yanshan University,Qinhuangdao 066004,China
  • Revised:2017-03-10 Online:2017-05-01 Published:2017-05-28
  • Supported by:
    The National Natural Science Foundation of China(61300193);The National Natural Science Foundation of China(61272125);The National Natural Science Foundation of China(61602100);The National Natural Science Foundation of China(61601107);The Natural Science Foundation of Hebei Province(F2015501105);The Natural Science Foundation of Hebei Province(F2017203307);The Natural Science Foundation of Hebei Province(F2015501122);The Fundamental Research Funds for the Central Universities(N120323012)

在线阅读

2

PDF下载

995

摘要：

提出了一种基于马尔可夫链的轻量级机会路由转发策略（MOR），该方法将网络运行划分为多个等距的时间周期，利用活跃度描述节点每个周期的随机相遇状态，多个连续周期的状态序列构成一个离散的马尔可夫链，将节点活跃度评估转换为状态预测问题，利用马尔可夫模型预测相遇节点后续周期的状态，有效地提高了节点活跃度评估的准确性。构建了基于节点活跃度和平均相遇间隔的综合效用评估方法，作为消息转发决策的依据，节点只需维护前一周期的状态和状态转移概率矩阵，以及记录与其他节点平均相遇间隔的向量表，算法简单高效，时空复杂度低。建立了多指标的最优消息副本设置方法，有效地均衡了网络资源的使用率。实验结果表明，与已有算法相比，MOR算法能够有效地提高消息传递的成功率，降低平均转发时延，且具有较低的网络交付代价。

关键词: 机会网络, 马尔可夫链, 活跃度, 平均相遇间隔, 消息副本

Abstract:

A lightweight opportunistic routing forwarding strategy (MOR) was proposed based on Markov chain.In the scheme,the execute process of network was divided into a plurality of equal time period,and the random encounter state of node in each time period was represented by activity degree.The state sequence of a plurality of continuous time period constitutes a discrete Markov chain.The activity degree of encounter node was estimated by Markov model to predict its state of future time period,which can enhance the accuracy of activity degree estimation.Then,the method of comprehensive evaluating forwarding utility was designed based on the activity degree of node and the average encounter interval.MOR used the utility of node for making a routing forwarding decision.Each node only maintained a state of last time period and a state transition probability matrix,and a vector recording the average encounter interval of nodes.So,the routing forwarding decision algorithm was simple and efficient,low time and space complexity.Furthermore,the method was proposed to set optimal number of the message copy based on multiple factors,which can effectively balance the utilization of network resources.Results show that compared with existing algorithms,MOR algorithm can effectively increase the delivery ratio and reduce the delivery delay,and lower routing overhead ratio.

Key words: opportunistic network, Markov chain, activity degree, average encounter interval, message copy

中图分类号: 

No Suggested Reading articles found!