Contact Plan Design for Navigation Satellite Network Based on Maximum Matching

It is the most important development trends for Global Navigation Satellite System (GNSS) to take advantage of intersatellite links (ISLs) to enhance the performance. ISL is established in GNSS not only for inter-satellite communication but also for inter-satellite pseudo-range measurement. However, only one link can be established in the every moment for a satellite. Therefore, contact plan, which comprises all forthcoming network communication opportunities among satellites, needs to be carefully designed to accommodate the constraints of both inter-satellite pseudo-range measurement and communication. In this paper, we focus on the contact plan design problems considering the data transmission between satellites and ground stations. We present a method of contact plan based on maximum matching to improve the performance of inter-satellite ranging and communication. Through the trade-off between two specific solutions, different performance is achieved. The simulations evaluate the performance of the solutions in the final.

[1]  Juan A. Fraire,et al.  Routing-aware fair contact plan design for predictable delay tolerant networks , 2015, Ad Hoc Networks.

[2]  Yong Sun,et al.  Contact plan design for navigation satellite network based on simulated annealing , 2015, 2015 IEEE International Conference on Communication Software and Networks (ICCSN).

[3]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

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

[5]  Wei Xiang,et al.  A link assignment algorithm for GNSS with crosslink ranging , 2011, 2011 International Conference on Localization and GNSS (ICL-GNSS).

[6]  Juan A. Fraire,et al.  Traffic-aware contact plan design for disruption-tolerant space sensor networks , 2016, Ad Hoc Networks.

[7]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[8]  Pablo G. Madoery,et al.  On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks , 2014, IEEE Sensors Journal.

[9]  Siyuan Chen,et al.  Topology Control for Time-Evolving and Predictable Delay-Tolerant Networks , 2011, 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems.

[10]  Jun Yang,et al.  Timeslot scheduling of inter-satellite links based on a system of a narrow beam with time division , 2017, GPS Solutions.

[11]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[12]  Juan A. Fraire,et al.  On the design of fair contact plans in predictable Delay-Tolerant Networks , 2013, IEEE International Conference on Wireless for Space and Extreme Environments.