A low-complexity probabilistic routing algorithm for polar orbits satellite constellation networks

Liu, Xinmeng; Jiang, Zhuqing; Liu, Chonghua; He, Shoujie; Li, Chao; Yang, Yuying; Men, Aidong

doi:10.1109/iccchina.2015.7448759

Cited by 20 publications

(12 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The intrinsic reason for such inefficiency is that the routing needs to be computed on global topology so as to be optimal. However, as shown by many existing studies [21]- [24], certain topology changes do not affect or have little effect on the routing of a large part of satellites. This implies that global topology awareness may not be necessary.…”

Section: Introductionmentioning

confidence: 91%

See 1 more Smart Citation

ASER: Scalable Distributed Routing Protocol for LEO Satellite Networks

Zhang

Yang

et al. 2021

2021 IEEE 46th Conference on Local Computer Networks (LCN)

View full text Add to dashboard Cite

Low earth orbit (LEO) satellite networks are promising at constructing the satellite Internet. Dynamics of a large-scale LEO network topology induces critical problems on routing efficiency and scalability. Existing approaches either suffer from such routing problems, or have limited resilience against unpredictable link/node failures. We propose Area-based SatellitE Routing (ASER), a fully distributed routing protocol for LEO networks with high efficiency and scalability. ASER uses a hierarchical routing mechanism, which groups satellites into areas, in such a way that the inter-area routing never changes due to handovers of inter-satellite links. Routing can be quickly reconstructed with little overhead when either regular or unpredictable topology changes occur. We develop ASER based on OSPF, and propose an efficient algorithm to construct the forwarding table, enabling standard packet forwarding. Simulations validate that ASER can reduce the convergence time by more than 50%, and reduce computation and control overhead by orders of magnitude.3 Parameter θ in Fig. 1 and Fig. 2 means the half apex angle of the cone which is the reachable range of a satellite antenna.

show abstract

Section: Introductionmentioning

confidence: 91%

“…LEO network dynamics: A number of studies on routing in satellite networks analyze the properties of topology dynamics [16], [17], [20]- [24], [27]. Most studies find that inter-orbit links (IOLs) are turned off in a polar region.…”

Section: Introductionmentioning

confidence: 99%

ASER: Scalable Distributed Routing Protocol for LEO Satellite Networks

Zhang

Yang

et al. 2021

2021 IEEE 46th Conference on Local Computer Networks (LCN)

View full text Add to dashboard Cite

show abstract

“…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

“…Em [7] propõe-se método de roteamento em redes de satélites LEO, onde cada satélite escolhe o próximo salto com atraso mínimo de propagação de acordo com sua localização geográfica, sem necessidade de armazenar uma tabela de roteamento. Os resultados das simulações mostraram que a proposta possui melhor desempenho, em termos de taxa de transferência de dados e taxa de perda de pacotes, quando comparada a outros algoritmos que utilizam tabelas de roteamento.…”

Section: Trabalhos Relacionadosunclassified

Roteamento ciente da capacidade e consumo energético em redes de satélites LEO

Maceno¹,

Carvalho²,

Mota³

2019

Anais De XXXVII Simpósio Brasileiro De Telecomunicações E Processamento De Sinais

View full text Add to dashboard Cite

Resumo-Este artigo apresenta uma métrica de roteamento para redes de satélites de órbita baixa (Low Earth Orbit-LEO), de forma que permita aumentar a demanda de tráfego atendida, observando o consumo energético das baterias dos satélites que estão na área de eclipse. Nossa proposta aproveita o movimento dos satélites em suas órbitas para favorecer o tráfego de dados entre satélites que estão expostos à luz solar, em oposição aos satélites que estão na área de eclipse, a fim de reduzir a profundidade de descarga das baterias. Além disso, também são observadas as capacidades dos enlaces entre os satélites adjacentes, com o objetivo de evitar congestionamentos na rede, aumentando o escoamento de tráfego de dados. Os resultados das simulações demonstraram aumento de demanda em 14%, na situação com 100 fontes com taxa de 1,5Mbps, quando comparado a métrica LASER [1], sem aumentar o consumo energético das baterias dos satélites em área de eclipse.

show abstract

A low-complexity probabilistic routing algorithm for polar orbits satellite constellation networks

Cited by 20 publications

References 5 publications

ASER: Scalable Distributed Routing Protocol for LEO Satellite Networks

ASER: Scalable Distributed Routing Protocol for LEO Satellite Networks

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

Roteamento ciente da capacidade e consumo energético em redes de satélites LEO

Contact Info

Product

Resources

About