A multi-constraint optimal routing algorithm in LEO satellite networks

Zhao, Na; Long, Xiaoyi; Wang, Jian

doi:10.1007/s11276-021-02674-3

Cited by 10 publications

(3 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, graph theorybased models require pre-set starting and ending positions [13], [15]. In addition to the graph theory model, there are also studies on routing reliability estimation based on random algorithms, such as the ant colony algorithm [17] and particle swarm optimization algorithm [18]. Although the proposed methods can be applied to routing in a dynamic system, these studies can only provide numerical simulation results and are difficult to be supported by theoretical analysis.…”

Section: A Related Workmentioning

confidence: 99%

Reliability Analysis of Multi-hop Routing in Multi-tier LEO Satellite Networks

Wang¹,

Kishk²,

Alouini³

2023

Preprint

View full text Add to dashboard Cite

This article studies the reliability of multi-hop routing in a multi-tier hybrid satellite-terrestrial relay network (HSTRN). We evaluate the reliability of multi-hop routing by introducing interruption probability, which is the probability that no relay device (ground gateway or satellite) is available during a hop. The single-hop interruption probability is derived and extended to the multi-hop interruption probability using a stochastic geometry-based approach. Since the interruption probability in HSTRN highly depends on the priority of selecting communication devices at different tiers, we propose three priority strategies: (i) stationary optimal priority strategy, (ii) single-hop interruption probability inspired strategy, and (iii) density inspired strategy. Among them, the interruption probability under the stationary optimal priority strategy can approach the ideal lower bound. However, when analyzing an HSTRN with a large number of tiers, the stationary optimal priority strategy is computationally expensive. The single-hop interruption probability inspired strategy is expected to be a low-complexity but less reliable alternative to the stationary optimal priority strategy. In numerical results, we study the complementarity between terrestrial devices and satellites. Furthermore, analytical results for reliability are also applicable to the analysis of satellite availability, coverage probability, and ultra-reliable and low latency communications (URLLC) rate. Finally, we extend our original routing strategy into a multi-flow one with dynamic priority strategy.

show abstract

Section: A Related Workmentioning

confidence: 99%

Reliability Analysis of Multi-hop Routing in Multi-tier LEO Satellite Networks

Wang¹,

Kishk²,

Alouini³

2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Due to the high-speed movement of LEO satellites, a transmitting satellite that is communicating with the receiver may experience communication interruptions within a few minutes as it moves out of the receiver's line-of-sight (LoS) range [12]. Some studies consider the dynamic topology of LEO satellites and provide routing algorithms specifically designed for dynamic topologies, such as ant colony algorithm [13] and particle swarm optimization algorithm [14]. However, due to the heuristic nature of the algorithms, their stochastic performances, or even bounds of performances, are challenging to be expressed by analytical results [15], [16].…”

Section: A Related Workmentioning

confidence: 99%

Stochastic Geometry-Based Low Latency Routing in Massive LEO Satellite Networks

Wang

Kishk

Alouini

2022

IEEE Trans. Aerosp. Electron. Syst.

View full text Add to dashboard Cite

In this paper, the routing in massive low earth orbit (LEO) satellite networks is studied. When the satellite-tosatellite communication distance is limited, we choose different relay satellites to minimize the latency in a constellation at a constant altitude. Firstly, the global optimum solution is obtained in the ideal scenario when there are available satellites at all the ideal locations. Next, we propose a nearest neighbor search algorithm for realistic (non-ideal) scenarios with a limited number of satellites. The proposed algorithm can approach the global optimum solution under an ideal scenario through a finite number of iterations and a tiny range of searches. Compared with other routing strategies, the proposed algorithm shows significant advantages in terms of latency. Furthermore, we provide two approximation techniques that can give tight lower and upper bounds for the latency of the proposed algorithm, respectively. Finally, the relationships between latency and constellation height, satellites' number, and communication distance are investigated.

show abstract

“…A large number of constraints must be considered to ensure that every constraint is accounted. An expeditious choice based on the route's effectiveness should be used [29][30][31][32][33]. Given the advances in recent genetic routing, pathfinding algorithms are currently most often used to identify a feasible path.…”

Section: Introductionmentioning

confidence: 99%

Improving Waste Management System Efficiency and Mobility with Efficient Path MANET

et al. 2021

View full text Add to dashboard Cite

Waste Management System (WMS) is applied in smart cities and is supported by the Internet of Things (IoT). WMS involves several responsibilities, such as collection, disposal, and utilization of waste in relevant facilities. Efficient waste management has a considerable impact on the quality of life of citizens in smart cities. The interaction between wireless sensor networks and mobile ad-hoc networks (MANETs) with IoT provides excellent mobility for users, and reduces the deployment costs of networks. Data transfer via the intermediate connected devices must be maintained to shorten the distance between the devices. Intelligent routing algorithm is proposed to find efficient paths that comply with the WMS requirement constraints and avoid invalid paths that cause increased computation time. Chromosome intersection operation on genetic-based routing algorithm, intersection activation function, and intersection node table are proposed to avoid the similarity and redundancy of generated paths and keep the validity of the paths. This study improves the path finding, obtains good results, and increases the rate of efficient paths. Results show that the selected path is efficient in terms of distance, number of hops and number of iterations by using the proposed method. In addition, this proposed method outperforms DSR, which offers alternative paths with more efficiency.

show abstract

A multi-constraint optimal routing algorithm in LEO satellite networks

Cited by 10 publications

References 40 publications

Reliability Analysis of Multi-hop Routing in Multi-tier LEO Satellite Networks

Reliability Analysis of Multi-hop Routing in Multi-tier LEO Satellite Networks

Stochastic Geometry-Based Low Latency Routing in Massive LEO Satellite Networks

Improving Waste Management System Efficiency and Mobility with Efficient Path MANET

Contact Info

Product

Resources

About