DocumentCode
2133527
Title
An Improved Resistant to Destruction Routing Algorithm Based on LEO Satellite Network
Author
Yun-tao, Zhao ; Yong-xin, Feng ; Fang, Liu
Author_Institution
Shenyang Ligong Univ., Shenyang, China
Volume
1
fYear
2008
fDate
13-15 Dec. 2008
Firstpage
230
Lastpage
233
Abstract
Low Earth orbit (LEO) satellite networks differ from other types of networks in that movements of satellite network participants possess characteristic of periodicity, forecast, fixity. In this paper, based on Markus¿ theory of DT-DVTR, an improved resistant to destruction routing algorithm, which has tree-structure and utilizes thought of reversing link, was proposed. The new algorithm overcame deficiency of traditional problems of no-optimization reversing and infinite routing computing in the inter-satellite-link (ISL) of acyclic direct graph (ADG) structure. The simulation result shows that the algorithm bears high performance of destruction resistance and low signaling overhead.
Keywords
satellite links; telecommunication computing; telecommunication network routing; trees (mathematics); Markus theory; acyclic direct graph structure; destruction resistance; destruction routing algorithm; infinite routing computing; inter-satellite-link; low Earth orbit satellite network; no-optimization reversing; tree-structure; Ad hoc networks; Artificial satellites; Automation; Bandwidth; Computational modeling; Low earth orbit satellites; Network topology; Routing; Satellite broadcasting; Tree graphs; ADG; DT-DVTR; ISL; LEO;
fLanguage
English
Publisher
ieee
Conference_Titel
Future Generation Communication and Networking, 2008. FGCN '08. Second International Conference on
Conference_Location
Hainan Island
Print_ISBN
978-0-7695-3431-2
Type
conf
DOI
10.1109/FGCN.2008.44
Filename
4734093
Link To Document