自适应喷雾聚焦机会网络路由算法  

Adaptive Spray and Focus Routing Algorithm in Opportunistic Networks

作　　者：刘艳玲[1] 姚建盛[1,2] 

机构地区：[1]吉林师范大学计算机学院 [2]哈尔滨工程大学计算机学院

出　　处：《电子世界》2012年第24期170-171,共2页Electronics World

摘　　要：针对现有喷雾路由算法不能依据实际情况动态调整消息拷贝数,而导致资源浪费的问题,提出一种自适应喷雾聚焦路由算法ADPSF。ADPSF依据节点密度估算消息拷贝数,依据相遇概率历史信息选择中继节点和分配消息副本数。仿真试验表明,ADPSF算法在保证消息交付率和时延的情况下有效降低网络开销。In view of the existing spray routing algorithm cannot be based on the actual situation to dynamically adjust the news copies, which leads to problem of resource waste, this paper proposes an adaptive routing algorithm ADPSF spray focus.Aecording to node density estimation news copies, ADPSF selects relay node and assignments message copies based on the probability of encounter historical information.Simulated results show that, ADPSF algorithm in guaranteed message delivery rate and delay the case effectively reduce the network cost.

关 键 词：机会网络 喷雾聚焦路由 节点密度 相遇概率 

分 类 号：TN241[电子电信—物理电子学]