Link Assignment Algorithm Research on Earth-Moon Spatial Information Network

Abstract

When we design the topology,how to assign the numerable communication terminals on each satellite to build communication links,and then construct a well performing network topology,becomes a significant research problem. With the object of minimizing the average distance between lunar relay satellites to ground station, and subject to the communication terminal quantity on satellites as well as the connectivity between lunar relay satellites and ground station,we proposed the link assignment algorithm based on competitive decision(LAA-CD)and the link assignment algorithm based on simulated annealing (LAA-SA),and then compared the performances of those two algorithms with the greedy algorithm. The simulation result shows that both resulted topologies of LAA-CD and LAA-SA have shorter average distance than the greedy algorithm,and LAA-SA can greatly reduce the time complexity. This paper further compares two different constellations and finds out the network topology based on the lunar polar orbit satellite constellation always has a shorter average distance than the Earth-Moon Lagrange satellite constellation. It will provide technology support for the future satellite networks assignments.

Keywords

Earth-Moon spatial information network / relay satellite / ground station / communication terminal / topology design

References

[1] 欧阳自远.月球探测进展与我国的探月行动(下)[J].自然杂志, 2005(5):253-257,246. OUYANG Z Y. Review of lunar exploration and introduction of Chinese lunar exploration project[J]. Chinese Journal of Nature,2005,27(5):253-257,246.
[2] 孙晨华,何辞,张亚生,等.地月空间信息网络体系架构对比研究[J].载人航天,2018,24(5):624-629. SUN C H,HE C,ZHANG Y S,et al. Comparison study on architectures of Earth-Moon space information network[J]. Manned Spaceflight,2018,24(5):624-629.
[3] WU X B,ZHOU X W,LIN F H. Dynamic connectivity in cislunar communication networking based on geosynchronous orbit relay satellites[J]. China Communications,2012,9(11):41-53.
[4] 易先清,赵阳,冯明月,等.满足用户与任务应用需求的卫星网络服务质量QoS需求分析[J].计算机科学,2007,34(9):27-34. YI X Q,ZHAO Y,FENG M Y,et al. Analysis of QoS requirement of satellite network satisfying applications demands of users and tasks[J]. Computer Science,2007,34(9):27-34.
[5] BENOTHMAN J,BESSAOUD K,BUI A,et al. Self-stabilizing algorithm for energy saving in Wireless Sensor Networks[C]//IEEE Symposium on Computers&Communications. Kerkyra,Greece:IEEE Computer Society,2011.
[6] BESSAOUD K,BUI A,PILARD L. Self-stabilizing algorithm for low weight connected dominating set[C]//IEEE/ACM International Symposium on Distributed Simulationℜal Time Applications. Delft,Netherlands:IEEE,2013.
[7] BHATT R,DATTA R. Utilizing graph sampling and connected dominating set for backbone construction in wireless multimedia sensor networks[C]//2014 Twentieth National Conference on Communications (NCC). Kanpur,India:IEEE,2014.
[8] ZHANG T,KE L,LI J,et al. Fireworks Algorithm for the Satellite Link Scheduling Problem in the Navigation Constellation[C]//2016 IEEE Congress on Evolutionary Computation. Vancouver,Canada:IEEE,2016
[9] LANSARD E,FRAYSSINHES E,PALMADE J L. Global design of satellite constellations:a multi-criteria performance comparison of classical walker patterns and new design patterns 1[J]. Acta Astronautica,1998,42(9):555-564.
[10] LIU Z,GUO W,DENG C L,et al. Perfect match model-based link assignment to design topology for satellite constellation system[J]. International Journal of Satellite Communications and Networking, 2016,34(2):263-276.
[11] TAN L Y,YANG Q L,MA J,et al. Wavelength dimensioning of optical transport networks over nongeosychronous satellite constellations[J]. IEEE/OSA Journal of Optical Communications&Networking,2010,2(4):166-174.
[12] NOAKES M D,CAIN J B,ADAMS S L,et al. An adaptive link assignment algorithm for dynamically changing topologies[J]. Communications IEEE Transactions on,1993,41(5):694-706.
[13] HARATHI K,KRISHNA P,RICHARD E,et al. A fast link assignment algorithm for satellite communication networks[C]//Twelfth International Phoenix Conference on Computers&Communications. Tempe,USA:IEEE,1993
[14] WATTS D J,STROGATZ S H. Collective dynamics of ‘small-world’ networks[J]. Nature,1998,393(6684):440.
[15] HUANG J,SU Y,LIU W,et al. Optimization design of inter-satellite link (ISL) assignment parameters in GNSS based on genetic algorithm[J]. Advances in Space Research,2017,60(12):2574-2580.
[16] SHI L Y,XIANG W,TANG X M. A link assignment algorithm for GNSS with crosslink ranging[C]//International Conference on Localization&GNSS. Tampere,Finland:2011
[17] FRAIRE J A,MADOERY P G,FINOCHIETTO J M. On the design and analysis of fair contact plans in predictable delay-tolerant networks[J]. IEEE Sensors Journal,2014,14(11):3874-3882.
[18] HUANG M,CHEN S,ZHU Y,et al. Topology control for timeevolving and predictable delay-tolerant networks[C]//2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems. Valencia:IEEE,2011
[19] 宁爱兵,王波,熊小华,等.竞争决策算法原理及其应用[J].上海理工大学学报,2008,30(4):369-373. NING A B,WANG B,XIONG X H,et al. Principles and applications of competitive decision algorithm[J]. Journal of University of Shanghai for Science and Technology,2008,30(4):369-373.
[20] HONG S C,KIM B W,CHANG G L,et al. Topological design and routing for low-earth orbit satellite networks[C]//Proceedings of GLOBECOM'95. Singapore:IEEE,1995.
[21] HONG S C,KIM B W,CHANG G L,et al. FSA-based link assignment and routing in low-earth orbit satellite networks[J]. IEEE Transactions on Vehicular Technology,1998,47(3):1037-1048.
[22] ZHANG L,XU B. A universe light house-candidate architectures of the libration point satellite navigation system[J]. Journal of Navigation,2014,67(5):737-752.