关键词: 深空通信网络, 路由算法, 存储转发, 时延容忍网络, 最大吞吐量

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