A Simple Three-Dimensional Matrix Method for Global Constellation Intrasatellite Link Topological Design

A three-dimensional matrix method is proposed in this paper for Global Navigation Satellite System (GNSS) constellation Intrasatellite Link (ISL) topological design. The rows and columns of proposed matrix contain the information of both constellation orbit planes and satellites in each orbit plane. The third dimension of proposed matrix represents the time sequences during constellation movement. The proposed method has virtues of better advantage of conceptual clarity and computational efficiency, meanwhile, some properties of ISLs in the constellation can be proved easily. At the second part of this paper, a link assignment and optimal routing problem is proposed using three-dimensional topology matrixes, which aimed to minimize the relay hops during the process of data uploading to whole constellation network. Moreover, some practical constrains as antenna beam coverage and relative velocity are considered and analyzed in detail. Finally, some numerical simulations are provided, and the results demonstrated the promising performance of proposed topological method in reduction of computation burden, clear ISL conception, and so forth; the efficiency of provided optimal ISL routing problem is also proved.

[1]  Yasuhiko Yasuda,et al.  A Study of Constellation for LEO Satellite Network , 2004 .

[2]  Anton Donner,et al.  Maximum Persistence Routing in Satellite Constellation Networks , 2004 .

[3]  Cem Ersoy,et al.  High performance routing in a LEO satellite network , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[4]  E. Del Re,et al.  Next-generation mobile satellite networks , 2002 .

[5]  A. Jamalipour.  Broadband satellite networks-the global IT bridge , 2001 .

[6]  Ramjee Prasad,et al.  A survey of future broadband multimedia satellite systems, issues and trends , 2000, IEEE Commun. Mag..

[7]  Sun Kang,et al.  Satellite over satellite (SOS) network: a novel architecture for satellite network , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Ferit Yegenoglu,et al.  Next-generation satellite networks: architectures and implementations , 1999, IEEE Commun. Mag..

[9]  Yanghee Choi,et al.  FSA-based link assignment and routing in low-earth orbit satellite networks , 1998 .

[10]  M. Werner,et al.  Performance of optimized routing in LEO intersatellite link networks , 1997, 1997 IEEE 47th Vehicular Technology Conference. Technology in Motion.

[11]  Markus Werner,et al.  ATM-Based Routing in LEO/MEO Satellite Networks with Intersatellite Links , 1997, IEEE J. Sel. Areas Commun..

[12]  M. Werner,et al.  ATM virtual path routing for LEO/MEO satellite networks with intersatellite links , 1996 .

[13]  Yanghee Choi,et al.  Topological design and routing for low-Earth orbit satellite networks , 1995, Proceedings of GLOBECOM '95.

[14]  K. Harathi,et al.  A fast link assignment algorithm for satellite communication networks , 1993, Proceedings of Phoenix Conference on Computers and Communications.

[15]  Michael D. Noakes,et al.  An adaptive link assignment algorithm for dynamically changing topologies , 1988, MILCOM 88, 21st Century Military Communications - What's Possible?'. Conference record. Military Communications Conference.

[16]  Michael D. Noakes,et al.  A Distributed Link Assignment (Reconstitution) Algorithm for Space-Based SDI Networks , 1987, MILCOM 1987 - IEEE Military Communications Conference - Crisis Communications: The Promise and Reality.

[17]  G. Golub.  Matrix computations , 1983 .