Structural properties of a low Earth orbit satellite constellation - the Walker delta network

Wang, C.-J.

doi:10.1109/milcom.1993.408677

Cited by 33 publications

(9 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Indeed, as shown in Figure 6, contacts among satellites are only feasible when orbital planes cross. This setup is known to provide efficient communication opportunities [69] and can also be used for DTN studies.…”

Section: Simulation Resultsmentioning

confidence: 99%

Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations

Fraire

Madoery

Burleigh

et al. 2017

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

Existing Internet protocols assume persistent end-to-end connectivity, which cannot be guaranteed in disruptive and high-latency space environments. To operate over these challenging networks, a store-carry-and-forward communication architecture called Delay/Disruption Tolerant Networking (DTN) has been proposed. This work provides the first examination of the performance and robustness of Contact Graph Routing (CGR) algorithm, the state-of-the-art routing scheme for space-based DTNs. To this end, after a thorough description of CGR, two appealing satellite constellations are proposed and evaluated by means of simulations. Indeed, the DtnSim simulator is introduced as another relevant contribution of this work. Results enabled the authors to identify existing CGR weaknesses and enhancement opportunities.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations

Fraire

Madoery

Burleigh

et al. 2017

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

show abstract

“…A complete network comprises multiple shells in which satellites are evenly spaced on an orbital plane, and multiple such orbital planes are spaced evenly along the equator [14,15]. All satellites within a shell share orbital parameters such as their altitude and their inclination, which describes the orbital plane's angle to the equator.…”

Section: Large Leo Satellite Networkmentioning

confidence: 99%

QoS-Aware Resource Placement for LEO Satellite Edge Computing

Pfandzelter¹,

Bermbach²

2022

Preprint

View full text Add to dashboard Cite

With the advent of large LEO satellite communication networks to provide global broadband Internet access, interest in providing edge computing resources within LEO networks has emerged. The LEO Edge promises low-latency, high-bandwidth access to compute and storage resources for a global base of clients and IoT devices regardless of their geographical location.Current proposals assume compute resources or service replicas at every LEO satellite, which requires high upfront investments and can lead to over-provisioning. To implement and use the LEO Edge efficiently, methods for server and service placement are required that help select an optimal subset of satellites as server or service replica locations. In this paper, we show how the existing research on resource placement on a 2D torus can be applied to this problem by leveraging the unique topology of LEO satellite networks. Further, we extend the existing discrete resource placement methods to allow placement with QoS constraints. In simulation of proposed LEO satellite communication networks, we show how QoS depends on orbital parameters and that our proposed method can take these effects into account where the existing approach cannot.

show abstract

“…These two paths have the same hop count. In a bidirectional MSN network, the minimum hop count X-Y path(s) can be obtained by comparing the orbit numbers and satellite numbers of the two satellites [20]. However, as pointed out in section III, an inclined constellation features the offset of satellite number.…”

Section: A Basic X-y Routingmentioning

confidence: 99%

A Distributed Survivable Routing Algorithm for Mega-Constellations With Inclined Orbits

Zhang

Qiu

2020

IEEE Access

View full text Add to dashboard Cite

Mega-constellations consisting of hundreds to thousands of low-earth-orbit (LEO) satellites are an attractive solution for providing global ubiquitous network access. Due to good coverage properties for populated areas, inclined orbits are gaining popularity among commercial constellations. A scalable routing algorithm with survivability plays a key role in such systems. In this paper, we propose a distributed survivable routing algorithm for mega-constellations with inclined orbits. First, the special topology characteristic of inclined constellations is identified and formalized. Based on the topology characterization, a basic X-Y routing algorithm is presented to determine multiple primary and secondary paths towards each destination utilizing the regularity of the network topology with minimal computation overhead. Then, a failure recovery mechanism which consists of a restricted flooding mechanism and a pre-detour mechanism is proposed to reduce end-to-end delay and signaling overhead in case of link failures. Besides, a partialrecord loop avoidance mechanism is proposed to deal with routing loops with minimal overhead. Finally, a vector-based next hop selection mechanism is proposed to facilitate the selection of next hop while incorporating various criteria. The performance of the proposed routing algorithm is evaluated through simulation on the Starlink constellation. Simulation results show that our proposal achieves scalability by reducing signaling overhead and provides better quality of service in terms of end-to-end delay under link failures.

show abstract

Structural properties of a low Earth orbit satellite constellation - the Walker delta network

Cited by 33 publications

References 5 publications

Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations

Assessing Contact Graph Routing Performance and Reliability in Distributed Satellite Constellations

QoS-Aware Resource Placement for LEO Satellite Edge Computing

A Distributed Survivable Routing Algorithm for Mega-Constellations With Inclined Orbits

Contact Info

Product

Resources

About