Routing Heterogeneous Traffic in Delay-Tolerant Satellite Networks

被引：6

作者：

Madoery, Pablo G. ^{[1
]}

Kurt, Gunes Karabulut ^{[1
,2
]}

Yanikomeroglu, Halim ^{[1
]}

Hu, Peng ^{[3
]}

Ahmed, Khaled ^{[4
]}

Martel, Stephane ^{[4
]}

Lamontagne, Guillaume ^{[4
]}

机构：

[1] Carleton Univ, Dept Syst & Comp Engn, Nonterr Networks Lab, Ottawa, ON K1V 6L6, Canada

[2] Polytech Montreal, Polygrames Res Ctr, Dept Elect Engn, Montreal, PQ H3C 3A7, Canada

[3] Natl Res Council Canada, Digital Technol Res Ctr, Ottawa, ON K1A 0R6, Canada

[4] MDA, Satell Syst, Brampton, ON L6S 4J3, Canada

来源：

IEEE JOURNAL OF RADIO FREQUENCY IDENTIFICATION | 2023年 / 7卷

关键词：

Routing; delay-tolerant networks; satellite constellations; QoS; contact graph routing; congestion avoidance; DESIGN;

D O I：

10.1109/JRFID.2023.3269887

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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.

引用

页码：390 / 401

页数：12

共 33 条

[1] Future Space Networks: Toward the Next Giant Leap for Humankind
Abdelsadek, Mohammed Y.
Chaudhry, Aizaz U.
Darwish, Tasneem
Erdogan, Eylem
Karabulut-Kurt, Gunes
Madoery, Pablo G.
Ben Yahia, Olfa
Yanikomeroglu, Halim
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2023, 71 (02) : 949 - 1007
[2] Alonso J., 2003, Rep. IRB-TR-03-007
[3] [Anonymous], 2018, P IEEE INT C COMM IC
[4] Analysis of contact graph routing enhancements for DTN space communications
Bezirgiannidis, N.
Caini, C.
Tsaoussidis, V.
[J]. INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND NETWORKING, 2016, 34 (05) : 695 - 709
[5] Bezirgiannidis N, 2014, ADV SAT MULTMED SYS, P17, DOI 10.1109/ASMS-SPSC.2014.6934518
[6] Analysis of the contact graph routing algorithm: Bounding interplanetary paths
Birrane, Edward
Burleigh, Scott
Kasch, Niels
[J]. ACTA ASTRONAUTICA, 2012, 75 : 108 - 119
[7] Birrane EJ, 2011, IFIP WIREL DAY
[8] Burleigh S, 2016, INT CONF WIREL SPAC, P82, DOI 10.1109/WiSEE.2016.7877309
[9] Schedule-Aware Bundle Routing: Analysis and enhancements
Caini, Carlo
De Cola, Gian Marco
Persampieri, Lorenzo
[J]. INTERNATIONAL JOURNAL OF SATELLITE COMMUNICATIONS AND NETWORKING, 2021, 39 (03) : 237 - 249
[10] Efficient Contact Graph Routing Algorithms for Unicast and Multicast Bundles
De Jonckere, Olivier
[J]. 2019 IEEE INTERNATIONAL CONFERENCE ON SPACE MISSION CHALLENGES FOR INFORMATION TECHNOLOGY (SMC-IT 2019), 2019, : 87 - 94

← 1 2 3 4 →