全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

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

DOI: 10.1155/2014/502158

Full-Text   Cite this paper   Add to My Lib

Abstract:

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. Introduction With the rapid progress in GNSS technology, it is now feasible and necessary to build ISL network to increase system functions as communications and range measurements. One of the most important aspects in satellite constellation ISL analysis is the topological design. In previous researches, Werner [1–3] provided geometry of Virtual Path Connection (VPC) topological representation method for the analysis of the ISL between the satellites. In a series of literatures of Werner, “LEONET,” a Medium Earth Orbit (MEO) satellite constellation has been taken as an example, which is on the basis of proposed topology method. Moreover, the actual needs for global data relay and transmission are considered. By using the idea of Asynchronous Transfer Mode (ATM), Werner also provided a Modified Dijkstra Shortest Path Algorithm (M-DSPA) to achieve the global transmission of data with end-to-end performance. Donner et al. [4] carried out in-depth study of routing algorithm according to the Werner’s topology method, and Lee and Kang [5] also provided an application case of global Search and Rescue (SAR) using Werner’s results. Chang et al. [6] proposed a graphical method for ISL topology design for a Low Earth Orbit (LEO) communication satellite constellation, and a two-step optimized search routing algorithm was given for global data relay and

References

[1]  M. Werner, C. Delucchi, H. J. V?gel, G. Maral, and J. J. de Ridder, “ATM-based routing in LEO/MEO satellite networks with intersatellite links,” IEEE Journal on Selected Areas in Communications, vol. 15, no. 1, pp. 69–82, 1997.
[2]  M. Werner and C. Delucchi, “ATM virtual path routing for LEO/MEO satellite networks with intersatellite links,” in Proceedings of the 5th International Conference on Satellite Systems for Mobile Communications and Navigation, pp. 143–146, London, UK, May 1996.
[3]  M. Werner, G. Berndl, and B. Edmaier, “Performance of optimized routing in LEO intersatellite link networks,” in Proceedings of the 47th IEEE Vehicular Technology Conference, pp. 246–250, May 1997.
[4]  A. Donner, R. Zamorano, and M. Costache, “Maximum persistence routing in satellite constellation networks,” in Proceedings of the 22nd AIAA International Communications Satellite Systems Conference & Exhibit (ICSSC '04), pp. 505–515, American Institute of Aeronautics and Astronautics, May 2004.
[5]  J. Lee and S. Kang, “Satellite over satellite (SOS) network: a novel architecture for satellite network,” in Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '00), vol. 1, pp. 315–321, March 2000.
[6]  H. S. Chang, B. W. Kim, C. G. Lee et al., “Topological design and routing for low-earth orbit satellite networks,” in Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM '95), vol. 1, pp. 529–535, November 1995.
[7]  R. Suzuki, S. Motoyoshi, and Y. Yasuda, “A study of constellation for LEO satellite network,” in Proceedings of the 22nd AIAA International Communications Satellite Systems Conference & Exhibit (ICSSC '04), pp. 1093–1102, American Institute of Aeronautics and Astronautics, May 2004.
[8]  R. Kucukates and C. Ersoy, “High performance routing in a LEO satellite network,” in Proceedings of the 8th IEEE International Symposium on Computers and Communication (ISCC '03), vol. 2, pp. 1403–1408, 2003.
[9]  G. H. Golub and C. F. V. Loan, Matrix Computations, The Johns Hopkins University Press, Baltimore, Md, USA, 3rd edition, 1996.
[10]  E. del Re and L. Pierucci, “Next-generation mobile satellite networks,” IEEE Communications Magazine, vol. 40, no. 9, pp. 150–159, 2002.
[11]  J. Farserotu and R. Prasad, “Survey of future broadband multimedia satellite systems, issues and trends,” IEEE Communications Magazine, vol. 38, no. 6, pp. 128–133, 2000.
[12]  P. Chitre and F. Yegenoglu, “Next-generation satellite networks: architectures and implementations,” IEEE Communications Magazine, vol. 37, no. 3, pp. 30–36, 1999.
[13]  A. Jamalipour, “Broad-band satellite networks-the global IT bridge,” Proceedings of the IEEE, vol. 89, no. 1, pp. 88–104, 2001.
[14]  K. Harathi, P. Krishna, R. E. Newman-Wolfe, and R. Y. C. Chow, “A fast link assignment algorithm for satellite communication networks,” in Proceedings of the 12th Annual International Phoenix Conference on Computers and Communications, pp. 401–408, 1993.
[15]  J. B. Cain, S. L. Adams, M. D. Noakes, P. J. Knoke, and E. L. Althouse, “A distributed link assignment (reconstitution) algorithm for space-based SDI networks,” in Proceedings of the IEEE Military Communications Conference—Crisis Communications: The Promise and Reality (MILCOM '87), pp. 0571–0577, Washington, DC, USA, 1987.
[16]  M. D. Noakes, J. B. Cain, J. W. Nieto, and E. L. Althouse, “An Adaptive link assignment algorithm for dynamically changing topologies,” IEEE Transactions on Communications, vol. 41, no. 5, pp. 694–704, 1993.
[17]  H. S. Chang, B. W. Kim, C. G. Lee et al., “FSA-based link assignment and routing in low-earth orbit satellite networks,” IEEE Transactions on Vehicular Technology, vol. 47, no. 3, pp. 1037–1048, 1998.

Full-Text

comments powered by Disqus

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133

WeChat 1538708413