基于密度和距离的任播路由协议  

Anycast Routing Protocol Based on Density and Distance

作　　者：徐昕[1,2] 顾云丽[1,2] 杜杰[2] 钱焕延[1] 

机构地区：[1]南京理工大学计算机科学与技术学院,南京210094 [2]南京信息工程大学计算机与软件学院,南京210044

出　　处：《计算机科学》2009年第10期117-119,145,共4页Computer Science

基　　金：国防科工委应用基础资金项目(JI300D004)资助

摘　　要：针对任播中常用的最短路径算法在无线Adhoc网络等高动态性网络中路由健壮性不高的缺点,提出了一种基于密度和距离的任播路由协议。协议路由选择由目标距离及目标周边任播组员的数目(即密度)决定。在高动态性网络中,选择密度较大的组员作为目标,传输过程中若发现目标失效,可重路由至周围其他任播组员的概率较高,路由健壮性较好。协议通过参数k值可调节距离和密度的权重,从而影响任播组员的选择优先顺序,具有较好的可调节性和适应性。仿真实验表明,协议可以根据不同网络状况(链接故障率、移动节点速度)通过调节k值,在路由健壮性及路由效率两者之间做出较好的权衡。Aiming at bad performance of robustness of shortest path anyeast routing algorithm in highly dynamic net-works as an example of wireless Ad hoe network, an anycast routing protocol based on density and distance was proposed. In the protocol, routing target selection was determined by both the distance factor and anycast members sur- roundings（i, e. density） of the target. Routing towards a dense anycast member population increased the probability that a packet eventually reaches any anycast member because packets could more easily be re-routed to neighboring anycast members when the targeted one became unreachable, making this protocol＇s performance greater at robustness. In this protocol,parameter k adjusts the weight of distance and density hence influences respective selection priority of each anycast member. So, the protocol is characteristic of adaptable. Simulation was performed to evaluate this protocol. According to network status （link downtime and moving node speed）, by adjusting parameter k, routing robustness and routing efficiency are better balanced.

关 键 词：密度 距离 任播 路由协议 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]