A Low-Complexity Routing Algorithm Based on Load Balancing for LEO Satellite Networks

Citations Over TimeTop 1% of 2015 papers

Abstract

The mesh topology structure constituted by inter- satellite links(ISLs) along with longitude and latitude, as a feature of most LEO satellite constellations, has not been fully used. Additionally, most LEO networks design its routing protocol depending on path distance, which is only proportional to the propagation delay without consideration of the queue delay. In this paper, a low-complexity routing algorithm (LCRA) based on load balancing is proposed, which can obtain the best path by distributed computation with the location information of the current node and destination. There is no iteration process in the computation, thus saving the computational cost. Additionally, each node informs its neighbouring nodes of its congestion information so that packets can choose the next hop dynamically according to the status of links, so as to shorten the mean queue delay and reduce the packet loss rate. Results assessed by NS2 presents the superiority of LCRA in terms of end-to-end delay, throughput and packet loss rate in comparison with other routing algorithms.

Related Papers

• → ITGR: Intermediate Target Based Geographic Routing(2010)16 cited
• → Distributed and compact routing using spatial distributions in wireless sensor networks(2013)4 cited
• → Comparison of the beacon-less geographic routing protocols in wireless sensor networks(2011)3 cited
• → Landmark Based Circle Routing in Wireless Sensor Networks(2020)3 cited
• → Bypassing Routing Holes in WSNs with a Predictive Geographic Greedy Forwarding(2009)2 cited