计算机科学 ›› 2021, Vol. 48 ›› Issue (4): 268-273.doi: 10.11896/jsjkx.200500011
崔建群, 黄东升, 常亚楠, 吴淑庆
CUI Jian-qun, HUANG Dong-sheng, CHANG Ya-nan, WU Shu-qing
摘要: DTN(Delay Tolerant Network)具有间歇性连接、资源有限以及拓扑结构随机动态变化等特点,因此会受到网络资源有限和网络拓扑不确定性的限制,极易产生网络拥塞。针对这一问题,提出了一种基于消息质量度和节点可信度的拥塞控制策略CCMQ(Congestion Control Based on Message Quality and Node Reliability in DTN)。该策略主要根据消息的质量度划分消息的优先级,在转发消息时,将优先级高的消息优先转发;在选择下一跳节点时,选择节点可信度高的节点进行消息的转发,并充分考虑中继节点自身的属性;在发生拥塞时,消息质量度小的消息被率先丢弃,同时增加了S-ACK消息确认删除机制,以释放节点的缓存空间,从而有效缓解节点拥塞。仿真结果表明,相比传统的拥塞控制算法,CCMQ在消息递交率、网络负载率和平均时延性能方面都有较大的提升。
中图分类号:
[1]GNZBOORG P,NIEMI V,JÖRGOT T.Fragmentation algo-rithms for DTN links[J].Computer Communications,2013,36(3):279-290. [2]FALL K,FARRELL S.DTN:an architecttural retrospective[J].IEEE Journal on Selected Areas in Communications,2008,26(5):828-836. [3]FREEMAN L C.Centrality in Social Networks’ ConceptualClarification[J].Social Networks,1979,1(3):215-239. [4]BEAUCHAMP M A.An improved index of centrality[J].System Research and Behavioral Science,1965,10(2):161-163. [5]CLAUSET A.Finding local community structure in networks[J].Physical Review E,2005,72(2):026132. [6]LI F,SI Y L,CHEN Z,et al.Routing decision Method for Opportunistic Network Security based on trust mechanism [J].Journal of Software,2018(9):2829-2843. [7]GANTAYAT P K,DAS S.Award-Reward Protocol Based on Clustering and Trust Level for Routing in Delay Tolerant Network[J].Journal of Applied Security Research,2019,14(3):270-287. [8]WANG R,WU Y H,HUANG H B,et al.Cooperative transmission in delay tolerant network[J].Journal of Systems Enginee-ring & Electronics,2019,30(1):34-40. [9]CHEN Z G,YIN B A,WU J.Energy equalization routing algorithm for Opportunistic Networks based on message importance [J].Journal of Communications,2018,39(12):91-101. [10]ZHAO K,ZHANG Q.Network protocol architectures for fu-ture deep-space internetworking[J].ENCE China Information Ences,2018,61(4):040303. [11]TAO Y,GONG Z H.A node weight adaptive DTN congestion control [J].Computer Engineering and Science,2013,35(1):52-56. [12]ZHONG C C,LI T,WANG R C.Research on DTN Congestion Control based on enhanced PROPHET Routing [J].Journal of Nanjing University of Posts and Telecommunications:Natural Science,2016,36(2):118-123. [13]SOBIN C C.An Efficient Buffer Management Policy for DTN[J].Procedia Computer Science,2016,93(7):309-314. [14]MOETESUM M.An adaptive and efficient buffer management scheme for resource constrained delay tolerant networks[J].Wireless Networks,2016,22(7):1-13. [15]HUA D, DU X, XU G,et al.A DTN congestion mechanism based on Distributed Storage[C]//IEEE International Confe-rence on Information Management & Engineering.IEEE,2010. [16]WU D P,FU X J,ZHANG H P,et al.A delay tolerance network congestion control strategy based on node state awareness [J].Acta Electronica Sinica,2016,395(1):188-194. [17]VAHDAT A,BECKER D.Epidemic Routing for Partially Connected Ad Hoc Networks[R].Technical Report CS2000-06,Duke University,Durham,2000. [18]KERNEN A,OTT J,KRKKINEN T.The ONE simulator for DTN protocol evaluation[C]//Proceedings of the 2nd International Conference on Simulation Tools and Techniques for Communications,Networks and Systems(SimuTools 2009).Rome,Italy,2009. |
[1] | 李智远,李晶,张剑. 基于连通图的天地一体化测控通信网络仿真 Simulation for Integrated Space-Ground TT&C and Communication Network Routing Algorithm 计算机科学, 2018, 45(6A): 295-299. |
[2] | 印新棋,吴军,莫伟伟,白光伟. WMNs中基于节点可信度的机会路由改进算法 Improved Opportunistic Routing Algorithm Based on Node Trustworthiness for WMNs 计算机科学, 2017, 44(8): 151-156. https://doi.org/10.11896/j.issn.1002-137X.2017.08.027 |
[3] | 韩进,石 进,任勇军. 一种基于区域划分的DTN路由算法 DTN Routing Algorithm Based on Region Segmentation 计算机科学, 2015, 42(10): 113-116. |
[4] | 刘振,戚湧,李千目,韩荟,张宏. 基于ASSFR的DTN弹性质量自适应模型 DTN Resilience Quality Adaptive Prototype System Based on ASSFR 计算机科学, 2013, 40(8): 100-108. |
[5] | 张彩霞,程良伦,王向东. 基于矩阵空间的分级密钥管理 Hierarchical Key Management Based on Matrix Space 计算机科学, 2012, 39(9): 81-84. |
[6] | 孙启禄,戴冠中,潘文平. DTN Web服务器基于自适应控制的成比例延迟区分服务 Adaptive Control-based Proportional Delay Differentiated Service on DTN Web Servers 计算机科学, 2010, 37(2): 105-109. |
|