DTN分发网络中基于数据投递概率的拥塞控制机制

doi:10.11959/j.issn.1000-436x.2015278

摘要/Abstract

摘要：

针对 DTN 网络数据编码分概发过程中数据拥塞造成投递性能下降的问题，提出了一种基于主题数据投递率的节点拥塞控制机制(CCM-DP)。综合考虑节点移动模型、主题包投递概率、节点拥塞程度等因素建立数据投递概率模型，从两方面进行拥塞控制，一方面基于数据投递概率动态调节数据分组转发过程，避免节点因过收取多的数据分组造成拥塞，另一方面，通过设计合理的丢弃策略，降低因拥塞造成数据分组丢失产生的影响。最后，将该拥塞控制机制应用在数据分发过程中进行了仿真分析，结果表明，该方法能提升数据拥塞情况下的数据投递性能。

关键词: 延迟容忍网络, 数据投递概率, 拥塞控制, 数据编码分发

Abstract:

A congestion control mechanism based on data delivery probability (CCM-DP) was proposed to work out the decline of data delivery performance on account of data congestion in delay tolerant networks (DTN) network coding-based data dissemination process.Considering the node mobility model,data delivery probability and data congestion degree,the data delivery probability model was constructed,and the congestion control mechanism was designed from two aspects,on the one hand,by the means of adjusting the packet forwarding process,it equilibriums the data packet delivery to avoid node congestion caused by too many packets received; and on the other hand,through the design of efficient discarding strategy,it reduces the impact of packet loss caused by data congestion.Ultimately,it was put into use in data dissemination process and some simulations were taken,the simulation results show that,CCM-DP can improve data delivery performance in data congestion environment.

Key words: delay tolerant networks, data delivery probability, congestion control

夏奕,邓广宏. DTN分发网络中基于数据投递概率的拥塞控制机制[J]. 通信学报, 2015, 36(Z1): 22-39.

Yi XIA,Guang-hong DENG. Congestion control mechanism based on data delivery probability in DTN data dissemination network[J]. Journal on Communications, 2015, 36(Z1): 22-39.

图/表 7

图1

表1

表2

图2

图3

图4

图5

参考文献 13

[1]	DENG G H , CAO W H , ZHANG J , et al. data dissemination mechanism with network coding based on ant colony algorithm in DTN Environment[J]. Acta Electronica Sinica. 2014,42(8): 1636-1641.
[2]	GRUNDY A , RADENKOVIC M . Promoting congestion control in opportunistic networks[A]. Proc of the IEEE WiMob 2010[C]. Niagara Falls, 2010. 324-330.
[3]	ZHAO G S , CHEN M . Congestion control mechanism based on accepting threshold in delay tolerant networks[J]. Journal of Software. 2013,24(1): 153-163.
[4]	COE E C , RAGHAVENDRA . Token based congestion control for DTNs[A]. Aerospace Conference[C]. 2010. 1-7.
[5]	RADENKOVIC M , GRUNDY A . Congestion aware forwarding in delay tolerant and social opportunistic networks[A]. Proc of the WONS 2011[C]. 60-67.
[6]	DENG G H , CAO W H , ZHANG J , et al. Mobility model detection method based on birth and death model in DTN environment[J]. Journal of Software. 2015,36(1): 2015007-1-2015007-11.
[7]	JEMIE L , TIMUR F , VANIA C . DTN routing in a mobility pattern space[A]. SIGCOMM’05[C]. Philadelphia,USA, 2005.
[8]	PENG M . Research on Mobility Mode1 and Routing in Delay Tolerant Network[D]. University of Science and Technology of China, 2010.
[9]	WU L , WANG X M , LIU M , et al. Group mobility adaptive event delivery scheme for delay tolerant mobile sensor networks[J]. Journal of Software, 2012,23(3): 629-647.
[10]	YUAN Y , PENG Y , XING L S , et al. Efficient heuristic algorithm for the mobile sink routing problem[J]. Journal on Communications, 2011,32(10): 107-117.
[11]	CAI Q S , NIU J W , LIU M Z . Method for identifying node dissemination capability in opportunistic social networks[J]. Journal of Software, 2012,23(Suppl(1)): 49-58.
[12]	DENG G H , CAO W H , ZHANG J , et al. Method of dynamic random network coding in DTN environment[J]. Journal on Communications, 2014,35(2): 76-86.
[13]	ARI K,J?RG O , TEEMU K . The ONE simulator for DTN protocol evaluation[A]. SIMUTools 2009[C]. Rome,Italy, 2009.

源节点	信宿
源节点	节点u	节点v
节点4	p_4u	P_4v
节点3	p₃₄p_4u	p₃₄p_4v
节点2	p₂₃p₃₄p_4u	P_2v+p₂₃p₃₄p_4v
节点1	P_1u+p₁₃p₃₄p_4u	p₁₃p₃₄p_4v
节点S	p_s1(p_1u+p₁₃p₃₄p_4u)+p_s2p₂₃p₃₄p_4u	p_s1p₁₃p₃₄p_4v+p_s2(p2v+p₂₃p₃₄p_4v)

配置项	说明	数值
Scenario.nrofHostGroups	节点分组个数	4
Scenario.transType	数据传输方式	DRNC
Events.size	消息数据分组大小	500 KB,1 MB
Group1.movementModel	组1节点移动模型	MapRouteMovement
Group1.bufferSize	组1节点缓存大小	5 MB
Group2.movementModel	组1节点移动模型	MapRouteMovement
Group2.bufferSize	组2节点缓存大小	20 MB
Group3.movementModel	组2节点移动模型	MapRouteMovement
Group3.bufferSize	组2节点缓存大小	10 MB
Group4.movementModel	组3节点移动模型	RandomWaypoint
Group4.bufferSize	组3节点缓存大小	100 MB

[1]	王竹,袁青云,郝凡凡,房梁,李凤华. 基于链路容量的多路径拥塞控制算法[J]. 通信学报, 2020, 41(5): 59-71.
[2]	谭国真,韩国栋,张福新,丁男,刘明剑. 基于网络效用最大化理论的分布式车联网拥塞控制策略[J]. 通信学报, 2019, 40(2): 82-91.
[3]	丁男,林滔,宋彩霞,谭国真. 面向车联网按需驱动的多宿主多链路TCP拥塞控制算法[J]. 通信学报, 2016, 37(7): 96-106.
[4]	刘明剑,谭国真,李帅兵,丁男,宋彩霞. 基于信道拥塞代价计算的车联网自适应消息发送速率控制方法[J]. 通信学报, 2016, 37(10): 108-116.
[5]	燕洪成,张庆君,孙勇. 空间延迟/中断容忍网络拥塞控制策略研究[J]. 通信学报, 2016, 37(1): 142-150.
[6]	朱更明,王志强,李哲涛,李仁发. 信道公平分配的局部拥塞控制算法[J]. 通信学报, 2015, 36(4): 9-18.
[7]	邓广宏,曹万华,张剑,程雄,冯力. DTN网络中基于生灭模型的节点运动模式检测[J]. 通信学报, 2015, 36(1): 57-67.
[8]	田波,杨宜民,蔡述庭. 基于半马尔科夫决策过程的视频传输拥塞控制算法[J]. 通信学报, 2014, 35(8): 154-161.
[9]	田波，杨宜民，蔡述庭. 基于半马尔科夫决策过程的视频传输拥塞控制算法[J]. 通信学报, 2014, 35(8): 19-161.
[10]	孙健,李宏智,郭灵波,陈升来. VANET中一种安全消息拥塞控制机制[J]. 通信学报, 2014, 35(5): 134-140.
[11]	孙健，李宏智，郭灵波，陈升来. VANET中一种安全消息拥塞控制机制[J]. 通信学报, 2014, 35(5): 18-140.
[12]	王国栋,任勇毛,李俊. TCP改进协议在高速长距离网络中的性能研究[J]. 通信学报, 2014, 35(4): 81-90.
[13]	王国栋1,2，任勇毛1，李俊1. TCP改进协议在高速长距离网络中的性能研究[J]. 通信学报, 2014, 35(4): 10-90.
[14]	邓罡，龚正虎，王宏，陈琳，刘志宏. 现代数据中心网络资源管理技术分析与综述[J]. 通信学报, 2014, 35(2): 21-181.
[15]	邓罡,龚正虎,王宏,陈琳,刘志宏. 现代数据中心网络资源管理技术分析与综述[J]. 通信学报, 2014, 35(2): 166-181.