延迟容忍网络中新旧信息结合的路由策略研究

doi:1000-436X(2010)9A-0053-06

摘要/Abstract

摘要：

提出了一种新旧信息相结合的路由策略(ONICRM,old-new information combined routing method)，该策略根据节点的当前位置及历史传输成功率估计其当前传输概率，并根据节点局部拓扑结构进行信息复制。根据消息的生存时间、剩余时间及复制次数采用一种混合消息队列管理机制。仿真实验表明，ONICRM以很少的副本数及较低的传输延迟取得了较高的传输成功率。

关键词: 延迟容忍网, 路由策略, 传输概率, 队列管理

Abstract:

A new routing method ONICRM(old-new information combined routing method) was proposed for DTN which used the old and new information of the node to estimate its delivery probability.According to the local topology of the node at some instance,the number of the copies were reduced.At last,a queue management method was adopted according to the message’s age,time of left and the number of copies.Simulation shows that ONICRM achieves a higher message delivery ratio and lower delivery delay with lower transmission overhead.

Key words: DTN, routing method, delivery probability, queue management

吴亚辉,邓苏,黄宏斌. 延迟容忍网络中新旧信息结合的路由策略研究[J]. 通信学报, 2010, 31(9A): 53-58.

Ya-hui WU,Su DENG,Hong-bin HUANG. Research of old-new information combined routing method in delay tolerant network[J]. Journal on Communications, 2010, 31(9A): 53-58.

图/表 4

参考文献 13

[1]	BURLEIGH S , HOOKE A , TORGERSON L ,et al. Delay-tolerant networking:an approach to interplanetary Internet[J]. IEEE Communications Magazine, 2003,41(6): 128-136.
[2]	KRISHNAN R , BASU P , MIKKELSON J M ,et al. The spindle disruption-tolerant networking system[A]. IEEE Military Communications Conference[C]. USA, 2007. 1-7.
[3]	JUANG P , OKI H , WANG Y ,et al. Energy-efficient computing for wildlife tracking:design tradeoffs and early experiences with zebranet[J]. ACM SIGOPS Operating Systems Review, 2002,36(5): 96-107.
[4]	FALL K . A delay-tolerant network architecture for challenged Internets[A]. Proc of the 2003 Conf on Applications,Technologies,Architectures,and Protocols for Computer Communications[C]. Karlsruhe:ACM, 2003. 27-34.
[5]	ZHANG H , SHEN H , TAN Y . Optimal energy balanced data gathering in wireless sensor networks[A]. Proc of 21st Int’l Parallel and Distributed Processing Symp.(IPDPS’07)[C]. 2007. 1-10.
[6]	PHILO J , HIDEKAZU O , YONG W . Energy-efficient computing for wildlife tracking:design tradeoffs and early experiences with zebranet[J]. ACM Operating System Review, 2002,36(5): 96-107.
[7]	WANG Y , WU H . Replication-based efficient data delivery scheme (RED)for delay/fault-tolerant mobile sensor network(DFT-MSN)[A]. Proc of the 4th Annual IEEE Int’l Conf,on Pervasive Computing and Communications Workshops[C]. Washington:IEEE Computer Society, 2006. 485-489.
[8]	朱金奇, 刘明, 龚海刚 ,等. 延迟容忍移动传感器网络中基于选择复制的数据传输[J]. 软件学报, 2009,20(8): 2227-2240. ZHU J Q , LIU M , GONG H G ,et al. Selective replication-based data delivery for delay tolerant mobile sensor networks[J]. Journal of Software, 2009,20(8): 2227-2240.
[9]	许富龙, 刘明, 龚海刚 ,等. 延迟容忍传感器网络基于相对距离的数据传输[J]. 软件学报, 2010,21(3): 490-504. XU F L , LIU M , GONG H G ,et al. Relative distance-aware data delivery scheme for delay tolerant mobile sensor networks[J]. Journal of Software, 2010,21(3): 490-504.
[10]	张可, 曾家智, 刘伟 . 延迟容忍移动传感器网络中基于概率复制的数据传输策略及其性能研究[J]. 电子与信息学报, 2010,32(3): 677-681. ZHANG K , ZENG J Z , LIU W . Data delivery scheme of dtmsn based on probability replication and its performance research[J]. Journal of Electronics ＆ Information Technology, 2010,32(3): 677-681.
[11]	KRIFA A , BARAKAT C , SPYROPOULOS T . Optimal buffer management policies for delay tolerant networks[A]. Proc of IEEE SECON[C]. 2008. 260-268.
[12]	LI Y , QIAN M J , JIN D P ,et al. Adaptive optimal buffer management policies for realistic DTN[A]. Proc of IEEE GLOBECOM[C]. 2009.
[13]	LINDGREN A , PHANSE K S . Evaluation of queuing policies and forwarding strategies for routing in intermittently connected networks[A]. Proc of IEEE COMSWARE[C]. 2006.

参数	默认值
网络空间尺寸	200m×200m
消息队列长度L	100
节点个数N	100
汇聚点数K	2
节点通信半径r	5
汇聚点广播半径R	100
消息最大生存时间	500s～2 000s

[1]	李竟博, 马礼, 李阳, 傅颖勋, 马东超. 感传算协同工业互联网优化设计[J]. 通信学报, 2023, 44(6): 12-22.
[2]	魏德宾, 潘成胜, 杨力, 颜佐任. 基于网络流量水平等级预测的自适应随机早期检测算法[J]. 通信学报, 2023, 44(6): 154-166.
[3]	任品毅,许茜. 基于移动边缘计算的时延能耗最小化安全传输[J]. 通信学报, 2020, 41(11): 52-63.
[4]	苏成龙,金光,江先亮,钮俊. 公平和低时延的主动队列管理算法研究[J]. 通信学报, 2017, 38(5): 199-206.
[5]	夏奕,邓广宏. DTN分发网络中基于数据投递概率的拥塞控制机制[J]. 通信学报, 2015, 36(Z1): 22-39.
[6]	胡晓艳,龚俭. 命名数据网络NDN的域间多路径路由机制[J]. 通信学报, 2015, 36(10): 211-223.
[7]	邓广宏,曹万华,张剑,程雄,冯力. DTN网络中基于生灭模型的节点运动模式检测[J]. 通信学报, 2015, 36(1): 57-67.
[8]	付中南，尚群，公绪晓. 校园网络接入层一体化的规划与实践[J]. 通信学报, 2014, 35(Z1): 18-97.
[9]	付中南,尚群,公绪晓. 校园网络接入层一体化的规划与实践[J]. 通信学报, 2014, 35(Z1): 91-97.
[10]	李飞龙，李广侠，李志强，彭锋彬. 基于多层分簇的北斗卫星导航系统拓扑结构与路由策略[J]. 通信学报, 2014, 35(10): 5-41.
[11]	李飞龙,李广侠,李志强,彭锋彬. 基于多层分簇的北斗卫星导航系统拓扑结构与路由策略[J]. 通信学报, 2014, 35(10): 31-41.
[12]	张兆心,杜跃进,王克,王轩春,郝志宇. Zone_Cut 网络模拟本地路由策略[J]. 通信学报, 2013, 34(7): 14-23.
[13]	张兆心1,2，杜跃进1,3，王克1，王轩春1，郝志宇2. Zone_Cut网络模拟本地路由策略[J]. 通信学报, 2013, 34(7): 2-23.
[14]	张希,王晓飞,张权,唐朝京. 基于信誉的延迟容忍网络双重Spray and Wait增强方案[J]. 通信学报, 2012, 33(12): 79-84.
[15]	别玉霞,潘成胜,刘海燕,王延春. 基于AOS的Hurst-优先级自适应RED与动态调度算法[J]. 通信学报, 2012, 33(10): 156-165.