Ad Hoc网络中一种随机化分布式QoS路由算法  

A Distributed Random-Based QoS Routing Algorithm in Ad Hoc Network

作　　者：张书奎[1] 

机构地区：[1]苏州大学计算机科学与技术学院,江苏苏州215006

出　　处：《微电子学与计算机》2007年第3期45-48,共4页Microelectronics & Computer

基　　金：江苏省高校自然科学研究计划项目(03KJD520191)

摘　　要：针对无线移动Ad Hoc网络(Mobile Ad Hoc Network,MANET),采用一种基于随机化分布式QoS路由算法RBAD(Random-Based Distributed QoS Routing Algorithm),该算法依据信道条件和业务量优化分组在多条路径上的路由,及寻找路由和存储路由表的代价,通过对结点排序,达到实现网络平均时延和平均消息复杂度最小的目标。仿真结果表明该算法能够以较小的路由消息开销获得较高的路由成功率,此外,算法具有可扩展性,可以应用于较大规模的Ad Hoc网络。Contrapasing mobile ad hoc networks, a new distributed QoS routing algorithm, RBAD （Random-Based distributed QoS Routing Algorithm）algorithm is proposed in the Ad Hoc network. The key idea of RBAD algorithm is For achieving the minimum total delay, single path or multi paths would be selected to route packets, according to both random and traffic load. Considering the costs and overheads of searching and spending of routing tables, the node sorted and distributing were taken into account, simulation shows that the algorithm can acquire a higher routing success ratio with the low message overhead. In addition, the algorithm is sealable and applicable to large-scale Ad Hoc netWork.

关 键 词：移动通信 AD HOC网络 随机适应 QOS路由 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]