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

Liu, Xinmeng; Yan, Xuemei; Jiang, Zhuqing; Li, Chao; Yang, Yuying

doi:10.1109/vtcfall.2015.7390795

Cited by 33 publications

(17 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Routing overhead is zero in DRA due to the absence of signalling for collecting topology information. In Reference [39,40], the Low-Complexity Routing Algorithm (LCRA) and Low-Complexity Probabilistic Routing (LCPR) were both proposed for polar orbit constellations that were based on the concept of logical locations introduced by the DRA. LCRA considers both propagation delay and queuing delay as well as balancing the traffic load to avoid congestion.…”

Section: Single-layer Routing For Satellite Networkmentioning

confidence: 99%

DTN and Non-DTN Routing Protocols for Inter-CubeSat Communications: A comprehensive survey

2020

View full text Add to dashboard Cite

CubeSats, which are limited by size and mass, have limited functionality. These miniaturised satellites suffer from a low power budget, short radio range, low transmission speeds, and limited data storage capacity. Regardless of these limitations, CubeSats have been deployed to carry out many research missions, such as gravity mapping and the tracking of forest fires. One method of increasing their functionality and reducing their limitations is to form CubeSat networks, or swarms, where many CubeSats work together to carry out a mission. Nevertheless, the network might have intermittent connectivity and, accordingly, data communication becomes challenging in such a disjointed network where there is no contemporaneous path between source and destination due to satellites’ mobility pattern and given the limitations of range. In this survey, various inter-satellite routing protocols that are Delay Tolerant (DTN) and Non Delay Tolerant (Non-DTN) are considered. DTN routing protocols are considered for the scenarios where the network is disjointed with no contemporaneous path between a source and a destination. We qualitatively compare all of the above routing protocols to highlight the positive and negative points under different network constraints. We conclude that the performance of routing protocols used in aerospace communications is highly dependent on the evolving topology of the network over time. Additionally, the Non-DTN routing protocols will work efficiently if the network is dense enough to establish reliable links between CubeSats. Emphasis is also given to network capacity in terms of how buffer, energy, bandwidth, and contact duration influence the performance of DTN routing protocols, where, for example, flooding-based DTN protocols can provide superior performance in terms of maximizing delivery ratio and minimizing a delivery delay. However, such protocols are not suitable for CubeSat networks, as they harvest the limited resources of these tiny satellites and they are contrasted with forwarding-based DTN routing protocols, which are resource-friendly and produce minimum overheads on the cost of degraded delivery probability. From the literature, we found that quota-based DTN routing protocols can provide the necessary balance between delivery delay and overhead costs in many CubeSat missions.

show abstract

Section: Single-layer Routing For Satellite Networkmentioning

confidence: 99%

DTN and Non-DTN Routing Protocols for Inter-CubeSat Communications: A comprehensive survey

2020

View full text Add to dashboard Cite

show abstract

“…The algorithm has a large computation and poor adaptability of the algorithm when the satellite node fails. In the routing algorithm based on the virtual node topology strategy, the distributed routing algorithm (DRA) is a connectionless routing algorithm, which optimizes the transmission delay of the packet to forward the request, but the algorithm ignores the reverse seams of the constellation . The probabilistic routing protocol (PRP) algorithm also aims to reduce the probability of the rerouting caused by the chain path switching .…”

Section: Related Researchmentioning

confidence: 99%

“…but the algorithm ignores the reverse seams of the constellation. 20,21 The probabilistic routing protocol (PRP) algorithm also aims to reduce the probability of the rerouting caused by the chain path switching. 22 The QRA algorithm reduces the end-to-end delay jitter by improving the RPR algorithm.…”

mentioning

confidence: 99%

Routing algorithm design of satellite network architecture based on SDN and ICN

Liu

Zhu

Zhang

et al. 2019

Satell Commun Network

View full text Add to dashboard Cite

Summary In view of the problems of low routing efficiency, complex control process, and difficult network management in big data environment in the traditional integrated space‐terrestrial network, in the paper, we propose a satellite network architecture called software‐defined information centric satellite networking (SDICSN) based on software‐defined networking (SDN) and information‐centric networking (ICN), and we design a virtual node matrix routing algorithm (VNMR) under the SDICSN architecture. The SDICSN architecture realizes the flexibility of network management and business deployment through the features of the separation of forwarding and controlling by the SDN architecture and improves the response speed of requests in the network by the centric of “content” as the ICN idea. According to the periodicity and predictability of the satellite network, the VNMR algorithm obtains the routing matrix through the relative orientation of the source and destination nodes, thus reducing the spatial complexity of the input matrix of the Dijkstra algorithm and then reducing the time complexity of the routing algorithm. For forwarding information base (FIB), the mechanism of combination of event driven and polling can be quickly updated in real time. Finally, the advantages of the SDICSN architecture in routing efficiency, request delay, and request aggregation are verified by simulation.

show abstract

“…The LCPR (Low-complexity Probabilistic Routing Algorithm) is an improvement of the DRA routing algorithm, and is used to solve the problem of next hop selection when a satellite receives a packet [10,11] . By using the position information of the source node and destination node, the distributed computing method is XVHG WR REWDLQ WKH RSWLPDO SDWK 7KH VSHFL¿F URXWLQJ algorithm is given in Ref.…”

Section: Lcra Algorithmmentioning

confidence: 99%

“…By using the position information of the source node and destination node, the distributed computing method is XVHG WR REWDLQ WKH RSWLPDO SDWK 7KH VSHFL¿F URXWLQJ algorithm is given in Ref. [10] and the queue delay is considered in Ref. [11].…”

Section: Lcra Algorithmmentioning

confidence: 99%

A survey of routing techniques for satellite networks

Liu

et al. 2016

J. Commun. Inf. Netw.

View full text Add to dashboard Cite

6DWHOOLWH QHWZRUNV KDYH PDQ\ DGYDQWDJHV RYHU WUDGLWLRQDO WHUUHVWULDO QHWZRUNV +RZHYHU LW LV YHU\ GLI¿FXOW WR GHVLJQ D VDWHOOLWH QHWZRUN ZLWK H[FHOOHQW SHUIRUPDQFH 7KH SDSHU EULHÀ\ VXPPDUL]HV VRPH H[LVWLQJ VDWHOOLWH QHWZRUN URXWLQJ WHFKQRORJLHVfrom the perspective of both single-layer and multilayer satellite constellations, and focuses on the main ideas, characteristics, and existing problems of these routing technologies. For single-layer satellite networks, two routing strategies are discussed, YLUWXDO QRGH VWUDWHJ\ DQG YLUWXDO WRSRORJ\ VWUDWHJ\ 0RUHRYHU FRQVLGHULQJ WKH GH¿FLHQF\ RI H[LVWLQJ PXOWLOD\HU VDWHOOLWH QHWZRUN URXWLQJ ZH GLVFXVV WKH WRSLF LQYXOQHUDELOLW\ )LQDOO\ WKH FKDOOHQJHV DQG SUREOHPV IDFHG E\ WKH VDWHOOLWH QHWZRUN DUH DQDO\]HGand the trend of future development is predicted.Key words: satellite network, routing technology, virtual node, virtual topology, invulnerability

show abstract

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

Cited by 33 publications

References 6 publications

DTN and Non-DTN Routing Protocols for Inter-CubeSat Communications: A comprehensive survey

DTN and Non-DTN Routing Protocols for Inter-CubeSat Communications: A comprehensive survey

Routing algorithm design of satellite network architecture based on SDN and ICN

A survey of routing techniques for satellite networks

Contact Info

Product

Resources

About