一种最大吞吐量的深空通信网络路由算法

doi:10.3969/j.issn.1001-2400.2012.01.017

Abstract

Abstract:

The deep space network has several characteristics not commonly seen in terrestrial wireless networks. Important among them are the long delays and seldom continuous end-to-end paths which make conventional table-driven routing algorithms work inefficiently. To overcome these problems, a routing algorithm focusing on a maximum throughput is proposed. The algorithm constructs multiple end-to-end paths for non-real-time data delivery by utilizing the store-and-forward mechanism. According to intermittent connectivity phases and throughput of links, the available time intervals for data transmission of each link in a path are obtained which aims at maximizing the usage of link connectivity phases. The throughput of each path is calculated based on link available time intervals. The path with a maximum throughput is selected as the end-to-end route. Theoretical analysis and simulation results show that the routing algorithm is capable of supporting end-to-end communication with intermittent links and constructs the route with a maximum throughput.

Key words: deep space network, routing algorithm, store-and-forward, delay tolerant network, throughput

LI Hongyan;YANG Guangxiang;WANG Wenlong. Routing algorithm for deep space networks with a maximum throughput[J].J4, 2012, 39(1): 92-97.

References

［1］ Marchese M. Interplanetary and Pervasive Communications ［J］. Aerospace and Electronic Systems Magazine, 2011, 26(2): 12-18.
［2］ Ali S, Qadir J, Baig A. Routing Protocols in Delay Tolerant Networks—a Survey［C/OL］. ［2011-6-23］. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=＆arnumber=5638377.
［3］ Fall K, Farrell S. DTN: an Architectural Retrospective［J］. Journal of Selected Areas in Communications, 2008, 26(5): 828-836.
［4］ Ott J, Kutscher D, Dwertmann C. Integrating DTN and MANET Routing［C］//Proceedings of the 2006 SIGCOMM workshop on Challenged networks. Pisa: SIGCOMM Workshop, 2006: 221-228.
［5］ Koutsogiannis E, Tsapeli F, Tsaoussidis V. Bundle Layer End-to-end Retransmission Mechanism［C/OL］. ［2011-6-13］. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=＆arnumber=5733233.
［6］ Komnios I, Diamantopoulos S, Tsaoussidis V. Evaluation of Dynamic DTN Routing Protocols in Space Environment［C/OL］.［2011-6-18］. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=＆arnumber=5286392.
［7］ Burleigh S. Contact Graph Routing［S/OL］. ［2011-5-20］. http://tools.ietf.org/html/draft-burleigh-dtnrg-cgr-01.
［8］ Jones E P C, Li L, Schmidtke J, et al. Practical Routing in Delay-Tolerant Networks［J］. IEEE Trans on Mobile Computing, 2007, 6(8): 943-959.
［9］ Luglio M, Roseti C, de Cola T. A DTN-oriented Protocol Design for Satellite Based Architectures［C/OL］. ［2011-6-20］. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=＆arnumber=5586881.
［10］ Yu X Y, Yu F, Hou W B, et al. State-of-the-Art of Transmission Protocols for Deep Space Communication Networks［C/OL］.［2011-4-28］. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=＆arnumber=5645412.
［11］ Patrick R, Peter S, Otto K, et al. Developments Towards an Interplanetary Internet［C/OL］. ［2011-6-15］. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=＆arnumber=5286360.
［12］ Archana S, Manoj B S, Siva R M. MARVIN: Movement-Aware Routing over Interplanetary Networks［C/OL］.［2011-6-3］. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=＆arnumber=1381923.
［13］ Li X Y, Li G S, Zhang S T. Routing Space Internet Based on Dijkstra's Algorithm［C/OL］. ［2011-5-28］. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=＆arnumber=5340354.

[1]	ZHANG Yinghao,LIU Xiaofan. Preliminary research on the blockchain protocol in satellite broadcasting network environment [J]. Journal of Xidian University, 2020, 47(5): 11-18.
[2]	QI Xiaogang, MA Jiulong, LIU Lifang. Topology control with a high reliability and low transmission overhead in DTN [J]. Journal of Xidian University, 2018, 45(5): 7-12.
[3]	SUN Yanjing;QU Qianqian;WANG Bowen;ZUO Haiwei;WANG Xiaolin. Medium access control mechanism and performance analysis for in band full duplex wireless networks [J]. Journal of Xidian University, 2018, 45(3): 123-129.
[4]	WANG Ruyan;MIAO Yi;YAN Junjie. Relay selection algorithm incorporated with prestige for D2D communication [J]. Journal of Xidian University, 2018, 45(1): 76-82.
[5]	KUO Yonghong;HE Bingtao;CHEN Jian. Stable-throughput analysis and optimization of cooperative cognitive radio networks based on information and energy cooperation [J]. Journal of Xidian University, 2016, 43(6): 1-7.
[6]	YANG Fan;XU Zhanqi;LI Danwu;ZHU Jianfeng;MA Tao;DING Zhe. Multicast scheduling algorithm with a dynamic weight for the input buffered Crossbar [J]. Journal of Xidian University, 2016, 43(6): 80-85.
[7]	PAN Zhipeng;WU Bin;YE Tianchun. Airtime fairness scheduling algorithm for multi-rate WLANs [J]. Journal of Xidian University, 2016, 43(4): 128-134.
[8]	WANG Yequn;YE Xiangyang;QI Yunjun;HUANG Guoce;ZHANG Hengyang. Adaptive mechanism for the frequency hopping MAC [J]. J4, 2013, 40(5): 78-85.
[9]	NIU Yufeng;ZHUANG Yiqi;LI Zhenrong;XU Fei. Enhancing Bluetooth 2.1's anti-interference ability based on interleaving coding [J]. J4, 2013, 40(3): 109-114+211.
[10]	BAO Minquan;QIU Zhiliang;YAO Mingwu;LU Weina. Chipped packet forwarding scheme suitable for the length variable packet switch [J]. J4, 2013, 40(1): 1-5.
[11]	ZHENG Yanwei;NI Hong;LIU Lei. Modeling of the throughput of CMT in heterogeneous networks [J]. J4, 2012, 39(3): 166-171+184.
[12]	SU Jingfang;WU Muqing;ZHANG Qinjuan. Quantized optimal throughput analysis model of wireless multi-hop Ad hoc networks [J]. J4, 2012, 39(1): 128-134.
[13]	ZHU Bin;ZENG Xiaoping;CHEN Li;LIAO Hongyun;YAN Fang. Research on the adaptive load balancing routing algorithm [J]. J4, 2011, 38(5): 101-107.
[14]	ZHANG Chao;ZHUANG Yiqi;LI Zhenrong;JIN Zhao;LIU Weifeng. Study and improvement of bluetooth-based WPAN throughput [J]. J4, 2011, 38(2): 54-60.
[15]	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.

Routing algorithm for deep space networks with a maximum throughput

PDF (PC)

Like

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Metrics

Comments

Recommended 0