Local information-based congestion control scheme for space delay/disruption tolerant networks

被引:4
作者
Yan, Hongcheng [1 ]
Zhang, Qingjun [1 ]
Sun, Yong [1 ]
机构
[1] China Acad Space Technol, Inst Spacecraft Syst Engn, Beijing 100094, Peoples R China
基金
中国国家自然科学基金;
关键词
Space delay/disruption tolerant network; Congestion control; Local information; Alternative path; Utility function; DTN; DELAY; PROTOCOL; DYNAMICS; LTP;
D O I
10.1007/s11276-015-0911-6
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The storage resources and communication opportunities in space delay/disruption tolerant networks (DTN) are usually very limited. Moreover, as the links in space DTN are often subject to long delay, intermittent connectivity and asymmetric bandwidth, end-to-end continuous path may not be guaranteed and messages may stay at intermediate nodes for a long time. Thus, congestion in space DTN, which takes the form of persistent storage exhaustion, is inevitable. Due to the intrinsic features of space DTN, congestion control should be performed with local information before congestion occurs and limited storage and communication resources should be allocated to messages that have the highest probability to be delivered to destination. Based on these principles, a local information-based congestion control (LCC) scheme for space DTN is proposed in this paper. Firstly, LCC attempts to relieve the storage pressure by using alternative paths i.e. non-best paths when the network is about to congest. Secondly, LCC adopts a utility function based on the reciprocal of hop counts to destination to assist forwarding decision and queue management. Simulation results show that with the combination of LCC typical space DTN routing algorithm can achieve higher message delivery ratio and more uniform traffic distribution.
引用
收藏
页码:2087 / 2099
页数:13
相关论文
共 43 条
[1]   On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks [J].
Andres Fraire, Juan ;
Madoery, Pablo G. ;
Finochietto, Jorge M. .
IEEE SENSORS JOURNAL, 2014, 14 (11) :3874-3882
[2]  
[Anonymous], 2009, PROC IEEE GLOB TELEC
[3]  
[Anonymous], 12 INT C WIR WIR INT
[4]  
[Anonymous], AD HOC NETWORKS
[5]  
[Anonymous], SPACEOPS 2006 C
[6]  
Apollonio P, 2013, L N INST COMP SCI SO, V123, P1
[7]  
Bezirgiannidis N, 2014, ADV SAT MULTMED SYS, P17, DOI 10.1109/ASMS-SPSC.2014.6934518
[8]  
Bezirgiannidis N., 2013, Proceedings of the 8th ACM MobiCom workshop on Challenged networks, P43
[9]   Delivery Time Estimation for Space Bundles [J].
Bezirgiannidis, Nikolaos ;
Burleigh, Scott ;
Tsaoussidis, Vassilis .
IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 2013, 49 (03) :1897-1910
[10]   Analysis of the contact graph routing algorithm: Bounding interplanetary paths [J].
Birrane, Edward ;
Burleigh, Scott ;
Kasch, Niels .
ACTA ASTRONAUTICA, 2012, 75 :108-119