The Dijkstra algorithm has been widely used in the routing protocol design. However, the shortest path tree calculation method based on the Dijkstra algorithm fails to take advantage of the characteristics of the grap...
详细信息
ISBN:
(纸本)9798350381993;9798350382006
The Dijkstra algorithm has been widely used in the routing protocol design. However, the shortest path tree calculation method based on the Dijkstra algorithm fails to take advantage of the characteristics of the graph structure in topologies of satellite networks and incurs a heavy computational burden. In this paper, we propose a low -complexity and efficient algorithm for satellite routing according to the special topology and link latency distribution of LEO satellite constellations. The simulation results show that the proposed scheme achieves the same optimal performance as the Dijkstra algorithm but with much-reduced complexity. In particular, under the network scale of 60 x 30, the average calculation time of our algorithm is less than 1/10 of that of the Dijkstra algorithm.
In a massive Low Earth Orbit(LEO) satellite network without inter-satellite links(ISLs), connection between source node and destination node can be established through satellite-ground links. Utilizing satellite netwo...
详细信息
ISBN:
(纸本)9781538637784
In a massive Low Earth Orbit(LEO) satellite network without inter-satellite links(ISLs), connection between source node and destination node can be established through satellite-ground links. Utilizing satellite network topology in time virtualization algorithm and assuming that the current traffic of satellite-ground links which is used as the value of the topology correlation matrix can be perceived, the network uses the Dijkstra algorithm to obtain the shortest path of the current total network traffic and thus implements load balancing of the constellation system. Due to the large number of satellites, the network topology is complex and time varying, it is difficult to find the optimal path in a short time, so a suboptimal routingalgorithm based on network topology is proposed in this paper. The local network topology is obtained by using the positions of the source and destination gateway, and the number of satellites and gateways used to establish the correlation matrix of the Dijkstra algorithm is reduced. Through the simulation analysis, the average computational complexity of this algorithm is much lower than that of the global optimal routingalgorithm, and the average propagation delay of routing is almost the same. When the network load is normal, the system performance is almost the same with the global optimal routingalgorithm.
暂无评论