Abstract
Broadband satellite networks are capable of providing global coverage and support various services. The networks constructed by Low Earth Orbit (LEO) satellite constellations have attracted great interests because of their short round-trip delays and wide bandwidths. A challenging problem is to develop a simple and efficient packet routing algorithm for the LEO satellite constellation network. This paper presents a SpiderWeb Topological Network (SWTN) and a distributed packet routing algorithm for the LEO satel-lite constellation network based on the SWTN. The algorithm gives the minimum propa-gation delay paths with low computational complexity and requires no routing tables, which is practical for on-board processing. The performance of the algorithm is demon-strated through simulations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
