Lightweight opportunistic routing forwarding strategy based on Markov chain

Feng LI; Ya-li SI; Zhen CHEN; Li-min SHEN

doi:10.11959/j.issn.1000-436x.2017105

您当前的位置：

首页 >

文章列表页 >

Lightweight opportunistic routing forwarding strategy based on Markov chain

Papers | 更新时间：2024-06-05

- Lightweight opportunistic routing forwarding strategy based on Markov chain
- Journal on Communications Vol. 38, Issue 5, Pages: 108-120(2017)
- 作者机构：
  
  1. 东北大学秦皇岛分校计算机与通信工程学院，河北秦皇岛 066004
  2. 燕山大学信息科学与工程学院，河北秦皇岛 066004
  3. 燕山大学里仁学院，河北秦皇岛 066004
- 作者简介：
- 基金信息：
  
  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)
- DOI：10.11959/j.issn.1000-436x.2017105
  CLC： TP393
- Online First：2017-05，
  
  Published：25 May 2017
- 稿件说明：
移动端阅览
Feng LI, Ya-li SI, Zhen CHEN, et al. Lightweight opportunistic routing forwarding strategy based on Markov chain[J]. Journal on Communications, 2017, 38(5): 108-120.
DOI：

Feng LI, Ya-li SI, Zhen CHEN, et al. Lightweight opportunistic routing forwarding strategy based on Markov chain[J]. Journal on Communications, 2017, 38(5): 108-120. DOI： 10.11959/j.issn.1000-436x.2017105.

摘要

提出了一种基于马尔可夫链的轻量级机会路由转发策略（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.

关键词

Keywords

references

熊永平 , 孙利民 , 牛建伟 , 等 . 机会网络 [J ] . 软件学报 , 2009 , 20 ( 1 ): 124 - 137 .

XIONG Y P , SUN L M , NIU J W , et al . Opportunistic networks [J ] . Journal of Software , 2009 , 20 ( 1 ): 124 - 137 .

苏金树 , 胡乔林 , 赵宝康 , 等 . 容延容断网络路由技术 [J ] . 软件学报 , 2010 , 21 ( 1 ): 119 - 132 .

SU J S , HU Q L , ZHAO B K , et al . Routing techniques on delay/disruption tolerant networks [J ] . Journal of Software , 2010 , 21 ( 1 ): 119 - 132 .

CHAKCHOUK N . A survey on opportunistic routing in wireless communication networks [J ] . Communications Surveys & Tutorials,IEEE , 2015 , 17 ( 4 ): 2214 - 2241 .

KAIMIN W , XIAO L , KE X . A survey of social-aware routing protocols in delay tolerant networks:applications,taxonomy and design-related issues [J ] . IEEE Communications Surveys & Tutorials , 2014 , 16 ( 1 ): 556 - 578 .

VAHDAT A , BECKER D . Epidemic routing for partially-connected ad hoc networks [R ] . Duke University,Cs-2000-06 , 2000 .

LINDGREN A , DORIA A , SCHELEN O . Probabilistic routing in intermittently connected networks [J ] . ACM Sigmobile Mobile Compute , 2003 , 7 ( 3 ): 19 - 20 .

NELSON S C , BAKHT M , KRAVETS R , et al . Encounter based routing in DTNs [J ] . ACM Sigmobile Mobile Computing and Communications Review , 2009 , 13 ( 1 ): 56 - 59 .

LO S C , TSAI C C , LAI Y H . Quota-control routing in delay-tolerant networks [J ] . Ad Hoc Networks , 2015 , 25 : 393 - 405 .

CAO Y , SUN Z , WANG N , et al . Geographic-based spray-and-relay (GSaR):an efficient routing scheme for DTNs [J ] . IEEE Transactions on Vehicular Technology , 2015 , 64 ( 4 ): 1548 - 1564 .

张振京 , 金志刚 , 舒炎泰 . 基于节点运动预测的社会性DTN高效路由 [J ] . 计算机学报 , 2013 , 36 ( 3 ): 626 - 635 .

ZHANG Z J , JIN Z G , SHU Y T . Efficient routing in social DTN based on nodes' movement prediction [J ] . Chinese Journal of Computers , 2013 , 36 ( 3 ): 626 - 635 .

张三峰 , 黄迪 , 陈州 , 等 . 一种面向机会网络路由的最优停止决策方法 [J ] . 软件学报 , 2014 , 25 ( 6 ): 1291 - 1300 .

ZHANG S F , HUANG D , CHEN Z , et al . Optimal stopping decision method for routing of opportunistic networks [J ] . Journal of Software , 2014 , 25 ( 6 ): 1291 - 1300 .

PICU A , SPYROPOULOS T . DTN-meteo:forecasting the performance of dtn protocols under heterogeneous mobility [J ] . IEEE/ACM Transactions on Networking (TON) , 2015 , 23 ( 2 ): 587 - 602 .

LEE K , JEONG J , YI Y , et al . Max contribution:an online approximation of optimal resource allocation in delay tolerant networks [J ] . IEEE Transactions on Mobile Computing , 2015 , 14 ( 3 ): 592 - 605 .

黄永锋 , 董永强 , 张三峰 . 基于社会特征周期演化的机会移动网络路由转发策略 [J ] . 通信学报 , 2015 , 36 ( 3 ):2015055.

HUANG Y F , DONG Y Q , ZHANG S F . Message forwarding based on periodically evolving social characteristics in opportunistic mobile networks [J ] . Journal on Communications , 2015 , 36 ( 3 ):2015055.

吴大鹏 , 楼芃雯 , 刘乔寿 , 等 . 带有编码冗余控制的机会网络数据转发机制 [J ] . 通信学报 , 2015 , 36 ( 3 ):5-2015059

WU D P , LOU P W , LIU Q S , et al . Coding redundancy controlled data forwarding mechanism in opportunistic networks [J ] . Journal on Communications , 2015 , 36 ( 3 ):5-2015059

CHAINTREAU A , HUI P , CROWCROFT J , et al . Impact of human mobility on opportunistic forwarding algorithms [J ] . IEEE Transactions on Mobile Computing , 2007 , 6 ( 6 ): 606 - 62 .

Views

1309

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Downlink cooperative transmission and MAC layer modeling for multi-access point based on C-WAN architecture

Topology prediction for opportunistic network based on spatiotemporal convolution

Generative blockchain-based covert communication model based on Markov chain

Power consumption modeling and optimization for NB-IoT eDRX

Energy balanced routing algorithm for opportunistic network based on message importance

Related Author

XU Pengju

LIU Yichen

LIU Yingzhuang

ZENG Chen

Jian SHU

Jiawei SHI

Linlan LIU

Al-Kali Manar

Related Institution

School of Electronic Information and Communication, Huazhong University of Science and Technology

School of Information Engineering, Nanchang Hangkong University

School of Software, Nanchang Hangkong University

Henan Key Laboratory of Network Cryptography Technology

School of Cyber Science and Engineering, Zhengzhou University

AI问答

⁰