Geometric node routing algorithms for low-Earth orbit global satellite communications systems

Author

Thurston, Paul

Author_Institution

Arizona State Univ., Tempe, AZ, USA

fYear

1999

fDate

1999

Firstpage

179

Abstract

Novel algorithms for determining optimal routes through a packet-switched, LEO satellite communications system having inter-linked satellites are presented. These algorithms have their foundations in the field of differential geometry and a version of these algorithms has been implemented in the Iridium system. The implementation resulted in a multiple of an order of magnitude performance enhancement as well as a bound on the computational complexity (thus facilitating scalability)

Keywords

cellular radio; computational complexity; differential geometry; mobile satellite communication; packet radio networks; telecommunication network routing; Iridium system; LEO global satellite communications systems; algorithms; cellular radio; computational complexity bound; differential geometry; geometric node routing algorithms; inter-linked satellites; low-Earth orbit; optimal routes; packet-switched communications system; performance; single orbit route propagation; Base stations; Geometry; Land mobile radio cellular systems; Low earth orbit satellites; Network topology; Packet switching; Routing; Satellite broadcasting; Satellite communication; Scalability;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications and Networking Conference, 1999. WCNC. 1999 IEEE

Conference_Location

New Orleans, LA

ISSN

1525-3511

Print_ISBN

0-7803-5668-3

Type

conf

DOI

10.1109/WCNC.1999.797810

Filename

797810