TY - GEN
T1 - An Improved Earliest-Delivery Routing Algorithm in Double-layered Satellite Delay Tolerant Networks
AU - Zhao, Guokui
AU - Yang, Mingchuan
AU - Guo, Qing
AU - Wang, Gang
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/11/9
Y1 - 2018/11/9
N2 - Since presented by K. Fall, the new-type network Delay and Disruption Tolerant Network (DTN) came to become a hot area of research. In recent years, many kinds of DTN routing algorithms have been proposed. With the characteristics of long time delay, high packet loss rate and intermittent connectivity. Satellite networks also belong to a kind of DTN. But meanwhile, they have their unique characteristics of satellite nodes regular running in orbits and predictable inter-satellite links on and off, for which deterministic routing algorithm is more suited in Satellite DTN networks. This paper focuses on studying the theoretical knowledge of a kind of deterministic DTN routing algorithm, Earliest-Delivery(ED) algorithm. And combining with the characteristics of the satellite network above, we propose an improved ED algorithm from three aspects of distributed routing, routing update strategy and tag - based dynamic storage scheme. Ultimately, we simulate the LEO/MEO two-layer satellite delay tolerant network in OPNET, and analyze the performance of two algorithms upon packet delivery ratio, average end-to-end delay and the number of packets destroyed in the storage queue. The result shows the improved algorithm performs better in satellite DTN network.
AB - Since presented by K. Fall, the new-type network Delay and Disruption Tolerant Network (DTN) came to become a hot area of research. In recent years, many kinds of DTN routing algorithms have been proposed. With the characteristics of long time delay, high packet loss rate and intermittent connectivity. Satellite networks also belong to a kind of DTN. But meanwhile, they have their unique characteristics of satellite nodes regular running in orbits and predictable inter-satellite links on and off, for which deterministic routing algorithm is more suited in Satellite DTN networks. This paper focuses on studying the theoretical knowledge of a kind of deterministic DTN routing algorithm, Earliest-Delivery(ED) algorithm. And combining with the characteristics of the satellite network above, we propose an improved ED algorithm from three aspects of distributed routing, routing update strategy and tag - based dynamic storage scheme. Ultimately, we simulate the LEO/MEO two-layer satellite delay tolerant network in OPNET, and analyze the performance of two algorithms upon packet delivery ratio, average end-to-end delay and the number of packets destroyed in the storage queue. The result shows the improved algorithm performs better in satellite DTN network.
KW - Distributed algorithm
KW - Earliest-Delivery algorithm
KW - optimized routing updates time slots
KW - satellite Delay and Disruption Tolerant Network
UR - https://www.scopus.com/pages/publications/85058465757
U2 - 10.1109/ISNCC.2018.8530902
DO - 10.1109/ISNCC.2018.8530902
M3 - 会议稿件
AN - SCOPUS:85058465757
T3 - 2018 International Symposium on Networks, Computers and Communications, ISNCC 2018
BT - 2018 International Symposium on Networks, Computers and Communications, ISNCC 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 International Symposium on Networks, Computers and Communications, ISNCC 2018
Y2 - 19 June 2018 through 21 June 2018
ER -