DTN网络环境下动态随机网络编码方法

doi:10.3969/j.issn.1000-436x.2014.02.011

Abstract

Abstract:

With the dynamical features of mobility, intermittent connectivity and dynamic topology in delay tolerant net-work (DTN), the static random network coding methods become difficult to adapt to the applications in DTN environ-ment. For working out this problem, a dynamic random network coding transfer method (DRNC) was proposed. Based on the Markov channel model, it first computed the transmit speeds of every network channel according to the receive data states of nodes, and then constructed the network flow graphic with channel capacities at the source node, calculated and forecasted the current network multicast capacity, after that, the random network coding scenario was extended and tailored according to the multicast capacity to transmit data packages under DTN environment. The simulation results show that, compared with the traditional random network coding method with fixed multicast rate, the dynamic random network coding method has reduced the average latency of data packages and increased the delivery probability.

Key words: delay tolerant network, random network coding, multicast rate; multicast capacity

Guang-hong DENG,Wan-hua CAO,Jian ZHANG,Li FENG,Xiong CHENG. Method of dynamic random network coding in DTN environment[J]. Journal on Communications, 2014, 35(2): 76-86.

Figures/Tables 9

References 17

[1]	AHLSWEDE R , NING C LI S et al. Network information flow[J]. Network information flow, 2000,46(4): 1204-1216.
[2]	LI S Y R , YEUNG R W CAI N . Linear network coding[J]. IEEE Transactions on Information Theory, 2003,49(2): 371-381.
[3]	TRACEY H O , M′EDARD M KOETTER R et al. A random linear network coding approach to multicast[J]. IEEE Transactions on In-formation Theory, 2006,52(10): 4413-4430.
[4]	LI B C , NIU D KOETTER R et al. Random network coding in Peer-to-Peer networks:from theory to practice[J]. roceedings of the IEEE, 2011,99(3 ): 513-523.
[5]	HAEUPLER B , KARGER D R . Faster information dissemination in dynamic networks via network coding[A]. PODC'11[C]. California, USA, 2011, 381-390.
[6]	FONG S L , YEUNG R W . ariable-rate linear network coding[J]. IEEE Trans on Information Theory, 2010,56(6): 2618-2625.
[7]	卢冀，吴成柯，肖嵩等. 基于机会式网络编码的高效广播传输算法[J]. 通信学报， 2012,33(1): 64-70. LU J , WU C K , XIAO S et al. Efficient broadcast transmission algorithms based on opportunistic network coding[J]. Journal on Communications, 2012,33(1): 64-70.
[8]	ROUAYHEB A E L , SPRINTSON A , GEORGHIADES C . Robust network codes for unicast connections: a case study[J]. IEEE/ACM Transactions on Networking, 2011,19(3): 644-656.
[9]	DEB S , MEDARD M , CHOUTE C . Algebraic gossip: a network coding approach to optimal multiple rumor mongering[J]. IEEE Transactions on Information Theory, 2006,52(6): 2486-2507.
[10]	蒲保兴，杨路明，王伟平 . 网络拓扑未知环境下确定性网络编码数据传输[J]. 电子学报， 2009,37(10): 2119-2124. PU B X , YANG L M , WANG W P . A deterministic data transmission approach with network coding under unknown network topology[J]. Acta Electronica Sinica, 2009,37(10): 2119-2124.
[11]	汪玉，卢汉成，洪佩琳 et al. 基于随机线性网络编码的双源交替调度算法[J]. 电子与信息学报， 2011,32(12): 3008-3014. WANG Y , LU H C , HONG P L et al. Random linear network coding based alternative scheduling algorithms with two sources[J]. Journal of Electronics＆;Information Technology, 2011,33(12): 3008-3014.
[12]	GOPINATHAN A , PENG Z . Optimal layered multicast[J]. ACM Transactions on Multimedia Computing, Communications and Applications, 2011,7(2): 1-20.
[13]	ZHANG Q , KASSAM S . A finite-state markov model for rayleigh fading channels[J]. IEEE Transactions on Communications, 1999,47(11): 1688-1692.
[14]	RAZAVILAR J , LIU K J R , MARCUS S I . Jointly optimized bit-rate/delay control policy for wireless packet networks with fading channels[J]. IEEE Transactions on Communications, 2002,50(3): 484-494.
[15]	张宪超，江贺，陈国良 . 节点和边都有容量的有向平面网络中的最小截和最大流[J]. 计算机学报， 2006,29(4): 544-551. ZHANG X C , JIANG H , CHEN G L . Minimum cuts and maximum flows in directed planar networks with both node and edge capacities[J]. Chinese Journal of Computers, 2006,29(4): 544-551.
[16]	蒲保兴，杨路明，王伟平 . 线性网络编码的导出与扩展[J]. 软件学报， 2011,22(3): 558-571. PU B X , YANG L M , WANG W P . Generation and extension of linear network coding[J]. Journal of Software, 2011,22(3): 558-571.
[17]	KER?NEN A , OTT J , K?RKK?INEN T . The ONE simulator for DTN protocol evaluation[J]. Proc of the 2nd International Conference on Simulation Tools and Techniques[C]. Rome, Italy, 2009.

Metrics

Recommended 0

No Suggested Reading articles found!

配置项	说明	数值
Scenario.nrofHostGroups	场景中节点分组个数	3
Scenario.disturbrate	环境干扰产生的概率	0.2
Scenario.transType	数据传输方式	DRNC
btInterface.transmitSpeed	链路最高传输速率	250 kbit/s
btInterface.transmitRange	链路有效通信距离	1, 5 m
Group1.bufferSize	组1节点缓存大小	5 MB
Group1.interface1	组1节点传输设置	btInterface
Group1.speed	组1节点移动速度	0.5,1.5 m/s
Group1.msgTtl	消息可存活时间	300 s
Group1.nrofHosts	组1节点数	80
Group1.movementModel	组1节点移动模型	RandomWaypoint
Group1.sleep	组1节点休眠时间	2, 30 s
Events.size	消息数据分组大小	500 KB, 1 MB
Group2.movementModel	组2节点移动模型	MapRouteMove-ment
Group2.bufferSize	组2节点缓存大小	20 MB
Group2.speed	组2节点移动速度	5,6.5 m/s
Group3.movementModel	组3节点移动模型	StationaryMove-ment
Group3.bufferSize	组3节点缓存大小	100 MB

Method of dynamic random network coding in DTN environment

RichHTML

PDF

Knowledge

Cited

Abstract

Cite this article

share this article

Figures/Tables 9

References 17

Related Articles 12

Metrics

Recommended 0

[1]	Jiagao WU, Yahang GUO, Shenlei CAI, Linfeng LIU. Vehicular delay tolerant network routing algorithm based on optimized multi-period Bayesian network [J]. Journal on Communications, 2021, 42(12): 109-120.
[2]	Lingling ZI,Xin CONG. Blockchain trading mechanism based on attached chain for the delay tolerant network [J]. Journal on Communications, 2020, 41(11): 151-159.
[3]	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.
[4]	ENGGuang-hong D,AOWan-hua C,HANGJian Z,HENGXiong C,ENGLi F. Mobility model detection method based on birth and death model in DTN environment [J]. Journal on Communications, 2015, 36(1): 57-67.
[5]	. Method of dynamic random network coding in DTN environment [J]. Journal on Communications, 2014, 35(2): 11-86.
[6]	. IEDR: an infrastructure enhanced DTN routing protocol [J]. Journal on Communications, 2013, 34(8): 6-52.
[7]	Zhen YU,Jing-dong XU,Jian-zhong ZHANG,Yu ZHANG. IEDR:an infrastructure enhanced DTN routing protocol [J]. Journal on Communications, 2013, 34(8): 44-52.
[8]	Jian-wei NIU,Jin-kai GUO,Yan LIU,Chao TONG. PreS:an efficient routing algorithm for opportunistic networks based on mobility prediction [J]. Journal on Communications, 2010, 31(9A): 73-80.
[9]	Hai-zheng YU,Jian-feng MA,Hong BIAN. Social network-based trustworthy routing in delay tolerant networks [J]. Journal on Communications, 2010, 31(12): 20-26.
[10]	Min PENG,Pei-lin HONG,Han-cheng LU,Kai-ping XUE. Framework for mobility model detection based on local information [J]. Journal on Communications, 2010, 31(11): 73-79.
[11]	Bo WANG,Chuan-he HUANG,Wen-zhong YANG. Adaptive opportunistic routing protocol based on forwarding-utility for delay tolerant networks [J]. Journal on Communications, 2010, 31(10): 36-47.
[12]	Yun LI,Xiao-ying WANG,Zhan-jun LIU,Ya-hui ZHOU. Analysis of link interruption characteristics in the DTN [J]. Journal on Communications, 2008, 29(11): 232-236.