|
|||||
|
|
| 基于密度和距离的任播路由协议 | |
| 引用本文： | 徐听,顾云丽,杜杰,钱焕延.基于密度和距离的任播路由协议[J].计算机科学,2009,36(10):117-119. |
| 作者姓名： | 徐听 顾云丽 杜杰 钱焕延 |
| 作者单位： | 1. 南京理工大学计算机科学与技术学院,南京,210094;南京信息工程大学计算机与软件学院,南京,210044 2. 南京信息工程大学计算机与软件学院,南京,210044 3. 南京理工大学计算机科学与技术学院,南京,210094 |
| 基金项目： | 国防科工委应用基础资金项目(JI300D004)资助 |
| 摘 要： | 针对任播中常用的最短路径算法在无线Adhoc网络等高动态性网络中路由健壮性不高的缺点,提出了一种基于密度和距离的任播路由协议。协议路由选择由目标距离及目标周边任播组员的数目(即密度)决定。在高动态性网络中,选择密度较大的组员作为目标,传输过程中若发现目标失效,可重路由至周围其他任播组员的概率较高,路由健壮性较好。协议通过参数k值可调节距离和密度的权重,从而影响任播组员的选择优先顺序,具有较好的可调节性和适应性。仿真实验表明,协议可以根据不同网络状况(链接故障率、移动节点速度)通过调节k值,在路由健壮性及路由效率两者之间做出较好的权衡。 |
| 关 键 词： | 密度 距离 任播 路由协议 |
| 收稿时间： | 2008/12/3 0:00:00 |
| 修稿时间： | 2/9/2009 12:00:00 AM |
Anycast Routing Protocol Based on Density and Distance |
|
| XU Xin,GU Yun-li,DU Jie,QIAN Huan-yan.Anycast Routing Protocol Based on Density and Distance[J].Computer Science,2009,36(10):117-119. | |
| Authors: | XU Xin GU Yun-li DU Jie QIAN Huan-yan |
| Affiliation: | School of Computer Science and Technology;Nanjing University of Science & Technology;Nanjing 210094;China;Institute of Computer & Software;Nanjing University of Information Science & Technology;Nanjing 210044;China |
| Abstract: | Aiming at bad performance of robustness of shortest path anycast routing algorithm in highly dynamic networks as an example of wireless Ad hoc 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 surroundings(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 cou... |
| Keywords: | Density Distance Anycast Routing protocol |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |
| 点击此处可从《计算机科学》浏览原始摘要信息 | |
| 点击此处可从《计算机科学》下载全文 | |