西安电子科技大学学报（自然科学版）2012，Vol.39Issue(1)：92-97,6.DOI:10.3969/j.issn.1001-2400.2012.01.017
一种最大吞吐量的深空通信网络路由算法
Routing algorithm for deep space networks with a maximum throughput
摘要
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分类
信息技术与安全科学引用本文复制引用
李红艳,杨光祥,王文龙..一种最大吞吐量的深空通信网络路由算法[J].西安电子科技大学学报（自然科学版）,2012,39(1):92-97,6.基金项目
国家自然科学基金资助项目(60972047) （60972047）
国家科技重大专项课题资助项目(2010ZX03005-003,2011ZX03004-003,2011ZX03005-004,2011ZX03005-003) （2010ZX03005-003,2011ZX03004-003,2011ZX03005-004,2011ZX03005-003）
国家杰出青年科学基金资助项目(60725105) （60725105）
国家重点基础研究发展计划资助项目(973计划)(2009CB320404) （973计划）
长江学者和创新团队发展计划资助项目(IRT0852) （IRT0852）
高等学校引智计划资助项目(B08038) （B08038）
综合业务网理论及关键技术国家重点实验室自主课题资助项目(ISN1002005) （ISN1002005）
