{'fraction_non_alphanumeric': 0.019888129272840272, 'fraction_numerical': 0.0, 'mean_word_length': 5.652892561983471, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A low-complexity probabilistic routing algorithm for polar orbits satellite constellation networks

Satellite communication networks have advantages of global coverage and inherent broadcast capability, and offer a solution for providing broadband access to end-users. The regular mesh topologies, typical for satellite networks, comprise of Inter-Satellite Links(ISLs). But due to dynamic changing of traffic load and inter-plane ISL distance variation, adaptive routing is an absolute requirement for optimizing the network utilization. In this paper, we present a low-complexity probabilistic routing(LCPR) algorithm for polar orbits satellite constellation networks. The traditional algorithms choose the path with minimum hops according to the routing tables stored in the on-board equipment. Different from them, we make all the satellite to choose the next hop with minimum propagation delay according to the longitude and latitude of the current node and destination. Without routing table stored in the satellites, the algorithm reduces the space complexity effectively. The whole algorithm has no iteration process, thus decreasing the time complexity to some degree. Additionally, in the proposed algorithm, each satellite can inform the neighbouring satellites of the queue utilization condition periodically so that packet may be sent to a respectively free node adaptively according to the probability. Results from simulations show that LCPR has better performance than other routing algorithms in term of throughput and packet loss rate, which is especially suited large-scale users condition.