Routing Heterogeneous Traffic in Delay-Tolerant Satellite Networks
Delay-tolerant networking (DTN) offers a novel architecture that can be used to enhance store-carry-forward routing in satellite networks. Since these networks can take advantage of scheduled contact plans, distributed algorithms like the Contact Graph Routing (CGR) can be utilized to optimize data...
Main Authors: | , , , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers Inc.
2023
|
Subjects: | |
Online Access: | View Fulltext in Publisher View in Scopus |
LEADER | 02677nam a2200529Ia 4500 | ||
---|---|---|---|
001 | 10.1109-JRFID.2023.3269887 | ||
008 | 230529s2023 CNT 000 0 und d | ||
020 | |a 24697281 (ISSN) | ||
245 | 1 | 0 | |a Routing Heterogeneous Traffic in Delay-Tolerant Satellite Networks |
260 | 0 | |b Institute of Electrical and Electronics Engineers Inc. |c 2023 | |
300 | |a 1 | ||
856 | |z View Fulltext in Publisher |u https://doi.org/10.1109/JRFID.2023.3269887 | ||
856 | |z View in Scopus |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-85159689836&doi=10.1109%2fJRFID.2023.3269887&partnerID=40&md5=4ff40665236b6ff0726b338588fc4354 | ||
520 | 3 | |a Delay-tolerant networking (DTN) offers a novel architecture that can be used to enhance store-carry-forward routing in satellite networks. Since these networks can take advantage of scheduled contact plans, distributed algorithms like the Contact Graph Routing (CGR) can be utilized to optimize data delivery performance. However, despite the numerous improvements made to CGR, there is a lack of proposals to prioritize traffic with distinct quality of service (QoS) requirements. This study presents adaptations to CGR to improve QoS-compliant delivery ratio when transmitting traffic with different latency constraints, along with an integer linear programming optimization model that serves as a performance upper bound. The extensive results obtained by simulating different scenarios show that the proposed algorithms can effectively improve the delivery ratio and energy efficiency while meeting latency constraints. IEEE | |
650 | 0 | 4 | |a congestion avoidance |
650 | 0 | 4 | |a Congestion avoidance |
650 | 0 | 4 | |a contact graph routing |
650 | 0 | 4 | |a Contact graph routing |
650 | 0 | 4 | |a Contact graphs |
650 | 0 | 4 | |a Delay |
650 | 0 | 4 | |a Delay tolerant networks |
650 | 0 | 4 | |a Delays |
650 | 0 | 4 | |a Delay-Tolerant Network |
650 | 0 | 4 | |a delay-tolerant networks |
650 | 0 | 4 | |a Energy efficiency |
650 | 0 | 4 | |a Integer programming |
650 | 0 | 4 | |a Measurement |
650 | 0 | 4 | |a Network routing |
650 | 0 | 4 | |a QoS |
650 | 0 | 4 | |a Quality of service |
650 | 0 | 4 | |a Quality-of-service |
650 | 0 | 4 | |a Routing |
650 | 0 | 4 | |a Routings |
650 | 0 | 4 | |a Satellite broadcasting |
650 | 0 | 4 | |a satellite constellations |
650 | 0 | 4 | |a Satellite constellations |
650 | 0 | 4 | |a Satellites |
650 | 0 | 4 | |a Topology |
650 | 0 | 4 | |a Wireless networks |
700 | 1 | 0 | |a Ahmed, K. |e author |
700 | 1 | 0 | |a Hu, P. |e author |
700 | 1 | 0 | |a Kurt, G.K. |e author |
700 | 1 | 0 | |a Lamontagne, G. |e author |
700 | 1 | 0 | |a Madoery, P.G. |e author |
700 | 1 | 0 | |a Martel, S. |e author |
700 | 1 | 0 | |a Yanikomeroglu, H. |e author |
773 | |t IEEE Journal of Radio Frequency Identification |