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

发布时间：2018-04-03 06:46

本文选题：机会网络　切入点：马尔可夫链　出处：《通信学报》2017年05期

【摘要】：提出了一种基于马尔可夫链的轻量级机会路由转发策略(MOR),该方法将网络运行划分为多个等距的时间周期,利用活跃度描述节点每个周期的随机相遇状态,多个连续周期的状态序列构成一个离散的马尔可夫链,将节点活跃度评估转换为状态预测问题,利用马尔可夫模型预测相遇节点后续周期的状态,有效地提高了节点活跃度评估的准确性。构建了基于节点活跃度和平均相遇间隔的综合效用评估方法,作为消息转发决策的依据,节点只需维护前一周期的状态和状态转移概率矩阵,以及记录与其他节点平均相遇间隔的向量表,算法简单高效,时空复杂度低。建立了多指标的最优消息副本设置方法,有效地均衡了网络资源的使用率。实验结果表明,与已有算法相比,MOR算法能够有效地提高消息传递的成功率,降低平均转发时延,且具有较低的网络交付代价。
[Abstract]:In this paper, a lightweight opportunistic forwarding strategy based on Markov chain is proposed. The network is divided into multiple equidistant time periods, and the random encounter state of each cycle is described by using the activity degree.Multiple continuous periodic state sequences form a discrete Markov chain. The evaluation of node activity is transformed into a state prediction problem. The Markov model is used to predict the state of the subsequent period of the encounter node.The accuracy of node activity evaluation is improved effectively.A comprehensive utility evaluation method based on node activity and average encounter interval is constructed. As the basis of message forwarding decision, the node only needs to maintain the state and state transition probability matrix of the previous period.The algorithm is simple and efficient, and the space-time complexity is low.A multi-index optimal message copy setting method is established, which effectively balances the utilization rate of network resources.Experimental results show that the Mor algorithm can effectively improve the success rate of message delivery, reduce the average forwarding delay, and have a lower network delivery cost than the existing algorithms.
【作者单位】：东北大学秦皇岛分校计算机与通信工程学院;燕山大学信息科学与工程学院;燕山大学里仁学院;
【基金】：国家自然科学基金资助项目(No.61300193,No.61272125,No.61602100,No.61601107) 河北省自然科学基金资助项目(No.F2015501105,No.F2017203307,No.F2015501122) 中央高校基本科研业务费专项资金资助项目(No.N120323012)~~
【分类号】：TN929.5

【相似文献】