CAJ | 학술논문

为克服传统基于概率的路由协议因消息多次转发而导致的网络开销问题，该文在不需获知目的节点先验知识前提下，基于节点局部信息定义包含延迟度和有效性的节点社交尺度，提出了一种基于社交尺度的延迟容忍网络路由算法。该算法通过自适应选择社交延迟度低节点作为消息中继节点，实现消息的局部快速转发；根据计算节点社交有效性实现消息转发队列的调度管理。实验结果表明：在保证消息投递成功率的前提下，提出的基于社交尺度的延迟容忍网络路由算法有效降低了消息转发数和负载比率，从而降低网络开销。
위극복전통기우개솔적로유협의인소식다차전발이도치적망락개소문제，해문재불수획지목적절점선험지식전제하，기우절점국부신식정의포함연지도화유효성적절점사교척도，제출료일충기우사교척도적연지용인망락로유산법。해산법통과자괄응선택사교연지도저절점작위소식중계절점，실현소식적국부쾌속전발；근거계산절점사교유효성실현소식전발대렬적조도관리。실험결과표명：재보증소식투체성공솔적전제하，제출적기우사교척도적연지용인망락로유산법유효강저료소식전발수화부재비솔，종이강저망락개소。
In order to solve the network load increasing problem due to multiple copies in traditional route protocol based on probability,a novel routing algorithm based on social scale is proposed here. By defining nodes’ social scale as delay degree and effectiveness according to nodes’ local information, message is forwarded rapidly by selecting relay node with lower social delay degree,and scheduling management of message forward queue is calculated based on nodes’ social validity. The experimental results prove that this algorithm can effectively reduce network load while message delivery ratio is well retained.