有约束的动态局部化查询优化Ad Hoc网络DSR协议  

Optimization of DSR protocol of Ad Hoc network with constrained dynamic query localization technique

作　　者：郭中华[1] 史浩山[1] 

机构地区：[1]西北工业大学电子信息学院,西安710072

出　　处：《计算机工程与应用》2007年第26期121-124,共4页Computer Engineering and Applications

摘　　要：Ad Hoc网络DSR路由协议因采用泛洪机制导致较高路由开销,提出一种有约束的局部化查询优化方案,称为LDSR协议。在原有DSR协议基础上,以小世界理论确定局部化查询跳数上限,以移动网络保持连通的临界传输半径和移动节点的最大移动速度确定路由有效时间,在两个约束条件下LDSR协议利用动态选择机制实现局部化查询,形成局部泛洪。仿真表明,LDSR协议在路由负载较大和网络移动性较高的情况下可以大大减小路由开销和平均端到端时延,而分组成功传送率损失很小。To resolve the routing overhead problem of the Ad Hoc network DSR protocol resulted from flooding,this paper puts forward the optimization of DSR protocol with constrained dynamic query localization technique called LDSR protocol.Based on original DSR protocol and constrained by two factors： （1）the maximum number of hops of query localization flooding determined by the small-world theory; （2）routing effective time determined by mobile critical transmitting range for connectivity in Ad Hoc network and the maximum mobile speed of node,the LDSR protocol uses dynamic choice mechanism to limit query to a small region and to complete flooding localization.Simulations results show that the LDSR protocol can reduce routing overhead and average end-to-end delay notably,but the loss of packet delivery fraction is small,compares with DSR without using them.

关 键 词：Ad HOC网络 泛洪 路由开销 临界传输半径 查询局部化 

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