CAJ | 학술논문

针对现有喷雾路由算法不能依据实际情况动态调整消息拷贝数,而导致资源浪费的问题,提出一种自适应喷雾聚焦路由算法ADPSF.ADPSF依据节点密度估算消息拷贝数,依据相遇概率历史信息选择中继节点和分配消息副本数.仿真试验表明,ADPSF算法在保证消息交付率和时延的情况下有效降低网络开销.
침대현유분무로유산법불능의거실제정황동태조정소식고패수,이도치자원낭비적문제,제출일충자괄응분무취초로유산법ADPSF.ADPSF의거절점밀도고산소식고패수,의거상우개솔역사신식선택중계절점화분배소식부본수.방진시험표명,ADPSF산법재보증소식교부솔화시연적정황하유효강저망락개소.
In view of the existing spray routing algorithm cannot be based on the actual situation to dynamical y adjust the news copies,which leads to problem of resource waste,this paper proposes an adaptive routing algorithm ADPSF spray focus.According 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.