基于马尔科夫决策的容迟网络路由算法

doi:10.3969/j.issn.1001-2400.2011.02.004

J4 ›› 2011, Vol. 38 ›› Issue (2): 18-22+81.doi: 10.3969/j.issn.1001-2400.2011.02.004

基于马尔科夫决策的容迟网络路由算法

张文柱¹;孙发勇¹;王炫²

(1. 西安电子科技大学综合业务网理论及关键技术国家重点实验室，陕西西安 710071;
2. 西北电网有限公司，陕西西安 710048)

收稿日期:2010-09-13 出版日期:2011-04-20 发布日期:2011-05-26
作者简介:张文柱(1970-)，男，博士，副教授，E-mail: wzzhang1@mail.xidian.edu.cn．
基金资助:
国家杰出青年科学基金资助项目(60725105);国家重点基础研究发展计划(973计划)资助项目(2009CB320404);长江学者和创新团队发展计划资助项目(IRT0852);国家自然科学基金资助项目(61072068，60872045);中央高校基本科研业务费专项资助项目(JY10000901031);综合业务网理论及关键技术国家重点实验室资助项目(ISN102005)

Study of the DTN routing algorithm based on the Markov decision

ZHANG Wenzhu¹;SUN Fayong¹;WANG Xuan²

(1. State Key Lab. of Integrated Service Networks, Xidian Univ., Xi'an 710071， China;
2. Northwest China Grid Company Limited, Xi'an 710048， China)

Received:2010-09-13 Online:2011-04-20 Published:2011-05-26

摘要/Abstract

摘要：

由于容迟容断网络面临的应用环境极为特殊，传统网络的路由协议无法适用于容迟容断网络．为了提高容迟容断网络的传输效率，同时减小网络延迟和网络开销，提出了基于马尔科夫决策的容迟容断网络路由算法．该算法具有学习功能，能够解决复杂的容迟容断网络环境中的高延迟和频繁割裂问题．仿真结果表明，基于马尔科夫决策的容迟容断网络在同等网络条件下，性能优于Epidemic、PROPHET等同类路由算法．

关键词: 容迟网络, 路由算法, 马尔科夫决策

Abstract:

Since the major application scenarios of the DTN (delay/disruption tolerant network) are extremely particular, routing protocols designed for the traditional networks are not suitable for it. In order to raise the transfer efficiency while reducing the network delay and network cost in the DTN, a routing algorithm based on the Markov Decision, named MRDDTN (Markov Route Decision in the DTN), is proposed. The MRDDTN is self-learning and can solve problems in the complex network environment characterized by very long delay paths and frequent network partitions. Through simulative analysis, the MRDDTN is found to be able to achieve a better performance than Epidemic and PROPHET routing algorithms under the same network conditions.

Key words: delay/disruption tolerant network, routing algorithm, Markov decision

中图分类号:

TP393

张文柱;孙发勇;王炫. 基于马尔科夫决策的容迟网络路由算法[J]. J4, 2011, 38(2): 18-22+81.

ZHANG Wenzhu;SUN Fayong;WANG Xuan. Study of the DTN routing algorithm based on the Markov decision[J]. J4, 2011, 38(2): 18-22+81.

参考文献

［1］ Cerf V, Burleigh V, Hooke A, et al. Delay-tolerant Networking Architecture［R/OL］. ［2007-04-30］. http://www.rfc-editor.org/rfc/rfc4838.txt.
［2］ Pietilainen A K, Diot C. Social Pocket Switched Networks［C］//INFOCOM Workshops 2009. Rio de Janeirol: IEEE Press, 2009: 1-2.
［3］ Fall K. A Delay-tolerant Network Architecture for Challenged Internets ［C］//Proc of t he ACM SIGCOMM 2003. New York: ACM Press, 2003:27-34.
［4］ Citerin J, Kheddar A. Patterning IPN-CP Actuators and Applications［C］//IEEE/ASME International Conference on Advanced Intelligent Mechatronics 2009. Singapore: IEEE Press, 2009: 1016-1021.
［5］ Chea S, Luo M M, Bui T X. If You Build It, They Will Use: Usage Motivations and Unintended Effects of the Internet Village Motoman Project in Rural Cambodia［C］//42nd Hawaii International Conference on System Sciences. Hawaii: IEEE Press, 2009:1-8.
［6］ Zhang Z, Tang D. Performance of Seamless Soft Handoff Protocol for Tactic Mobile Ad Hoc Networks［C］//IEEE Military Communications Conference. San Diego: IEEE Press, 2008:1-7.
［7］ Yu C, Lu C, Kuo S. Habitual Behavior-based Opportunistic Data Forwarding in Wildlife Tracking［C］//ISWCS 2007. Trondheim: IEEE Press, 2007:807-808.
［8］ Yuan J, Yu W. Joint Source Coding, Routing and Power Allocation in Wireless Sensor Networks［J］. IEEE Trans on Communications, 2008, 56(6):886-896.
［9］ Abdulla M, Simon R. The Impact of the Mobility Model on Delay Tolerant Networking Performance Analysis ［C］//Proc of the 40th Annual Simulation Symp (ANSS07). Piscataway: IEEE Press, 2007: 177-184.
［10］ Spyropoulos T, Psounis K, Raghavendra C. Spray and Focus: Efficient Mobility-assisted Routing for Heterogeneous and Correlated Mobility ［C］//Proc of the IEEE PerCom. Piscataway: IEEE Press, 2007: 79-85.
［11］ Yoo J, Choi S, Kim C. The Capacity of Epidemic Routing in Vehicular Networks［J］. IEEE Communications Letters, 2009, 13(6): 459-461.
［12］ James A D, Andrew H F, Brian N L. Wearable Computers as Packet Transport Mechanisms in Highly-Partitioned Ad-Hoc Networks［C］//Proc of the Inter-national Symposium on Wearable Computing. Zurich: IEEE Press, 2001:11-18.
［13］ Lin T, Shin J, Cosman P. Packet Dropping for Widely Varying Bit Reduction Rates Using a Network-Based Packet Loss Visibility Model［C］//Data Compression Conference. Snowbird: IEEE Press, 2010:445-454.
［14］ Xue J, Li J. Advanced PROPHET Routing in Delay Tolerant Network［C］//International Conference on Communication Software and Networks. Macau: IEEE Press, 2009: 411-413.
［15］樊秀梅,王明媚. 基于能量约束和历史信息的容迟网络路由算法［J］. 北京理工大学学报, 2009, 29(4): 332-335.
Fan Xiumei, Wang Mingmei. Delay-Tolerant Network Routing Algorithm Based on Energy Restriction and History Information［J］. Beijing Laboratory of Intelligent Information Technology, 2009, 29(4): 332-335.
［16］刘克. 实用马尔科夫决策过程［M］. 北京:清华大学出版社,2004: 121-142.

[1]	刘道华, 魏丁二, 宣贺君, 余长鸣, 寇丽博. 一种改进的双深度Q网络服务功能链部署算法[J]. 西安电子科技大学学报, 2024, 51(1): 52-59.
[2]	李红艳;杨光祥;王文龙. 一种最大吞吐量的深空通信网络路由算法[J]. J4, 2012, 39(1): 92-97.
[3]	朱斌;曾孝平;陈礼;廖红云;颜芳. 自适应负载均衡路由算法研究[J]. J4, 2011, 38(5): 101-107.
[4]	李云;覃凤谢;李嫄源;曹傧. 认知无线电最短传输时延路由算法[J]. J4, 2010, 37(6): 1143-1147.
[5]	妥艳君;刘云;刘永健. LEO卫星星座系统组播报文扩散算法[J]. J4, 2010, 37(2): 380-384.
[6]	刘有耀;韩俊刚. 一种星簇双环片上网络拓扑结构[J]. J4, 2009, 36(6): 1063-1069.
[7]	王静1;刘景美1;王新梅1;袁荣亮2;刘向阳3. 一种网络编码的多播路由算法 [J]. J4, 2008, 35(1): 71-75.
[8]	杨帆;邱智亮;刘增基;严敬. 高速交换网络中基于综合优先级计算的调度及路由算法 [J]. J4, 2007, 34(5): 702-707.
[9]	王长山1;牛继云1;顾华玺2;柯楚3. 一种直连网络智能路由算法 [J]. J4, 2007, 34(4): 532-537.
[10]	秦浩;张SHI;刘增基. 一种非对称OBS网络中的路由算法[J]. J4, 2006, 33(4): 568-571.
[11]	米志超;鲍民权;郑少仁. 一种基于多跳Ad Hoc网络的路由协议的设计与实现[J]. J4, 2001, 28(6): 707-711.
[12]	暂时无作者信息. 基于遗传策略的实时多点传送路由算法[J]. J4, 2000, 27(2): 215-219.

基于马尔科夫决策的容迟网络路由算法

Study of the DTN routing algorithm based on the Markov decision

PDF (PC)

赞

可视化

被引次数

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 12

Metrics

本文评价

推荐阅读 0