Complexity of Routing in Store-and-Forward LEO Satellite Networks

Complexity of Routing in Store-and-Forward LEO Satellite Networks

In this letter, we analyze the effect of the mobility of satellites on routing in store-and-forward low earth orbit (LEO) satellite networks, and the NP-hard proofs are given for the minimum path stretch schedule (MIN-PSS), maximum path contraction schedule (MAX-PCS), and maximum constant path sched...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE communications letters 2016-01, Vol.20 (1), p.89-92
Hauptverfasser: Lu, Yong, Zhao, Youjian, Sun, Fuchun, Qin, Donghong
Format: Artikel
Sprache:eng
Schlagworte:
Communication satellites
complexity
Complexity theory
Computer networks
Constants
Handover
LEO Satellite Network (LSN)
Low earth orbits
Orbits
Routing
Routing (telecommunications)
Satellite networks
Satellites
Schedules
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this letter, we analyze the effect of the mobility of satellites on routing in store-and-forward low earth orbit (LEO) satellite networks, and the NP-hard proofs are given for the minimum path stretch schedule (MIN-PSS), maximum path contraction schedule (MAX-PCS), and maximum constant path schedule (MAX-CPS) problems. These conclusions theoretically prove the routing intractability in store-and-forward LEO satellite networks.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2015.2501399