摘要
针对机会网络中节点分布不规则造成分割的网络区域相隔较远的情况,提出了一种基于全局消息摆渡和节点中继的多摆渡路由算法(GMF-NRA)。该算法使用一个全局消息摆渡节点和各个区域内的中继节点为运行于区域内部的局部消息摆渡节点中继消息,共同完成区域间的信息传输。摆渡节点在中继节点处交互区域间的信息,以至于不再需要摆渡节点之间实现在线协作转发消息。最后,仿真结果表明GMF-NRA较现有的节点中继算法在网络的平均传输时延和数据交付率方面能获得更好的网络性能。
This paper proposed a new routing algorithm for multiples ferries based on global message ferry and node relaying（GMF-NRA）,which aimed at the scenario there are remote distances between the partitioned regions due to the irregular distribution of nodes in the opportunistic networks.The algorithm used a global message ferry and relay nodes located in individual region to relay messages for those local message ferries moving within region,which helped to complete inter-region messages transmission.Two kinds of message ferries exchange inter-region messages in the relay node deployed for each region,so that the online collaboration between ferries is not necessary again.The simulation shows GMF-NRA can provide the better performance than the existing node relay algorithm（NRA） in terms of the average delivery delay and the delivery rate.
出处
《计算机应用研究》
CSCD
北大核心
2013年第6期1775-1778,共4页
Application Research of Computers
基金
国家自然科学基金资助项目(61071118)
关键词
机会网络
路由协议
中继节点
局部消息摆渡
全局消息摆渡
多摆渡路由
opportunistic networks
routing protocol
relay node
local message ferry
global message ferry
multi-ferries routing
