AdHoc网络中信道自适应多径路由算法  

Channel Adaptive Multi-Path Routing for Ad Hoc Networks

作　　者：田辉[1] 谢芳[1] 杨宁[1] 张平[1] 

机构地区：[1]北京邮电大学电信工程学院,北京100876

出　　处：《北京邮电大学学报》2005年第1期59-62,共4页Journal of Beijing University of Posts and Telecommunications

基　　金："十五863"重大项目(2003AA12331004);三星电子中国通信研究院项目

摘　　要：针对自组织移动通信网络,研究了基于自适应调整和编码的多径路由算法.该算法根据信道条件和业务量优化分组在多条路径上的路由,实现整个网络平均分组时延最小的目标.考虑寻找路由以及存储路由表的代价和开销因素,多径路由限制为2条路径,使业务在最小代价路径和次小代价路径中分配.仿真结果表明,最多2条路径的信道自适应路由算法可以获得较小的网络时延.The design and performance of a multi-path routing based on adaptive modulation and coding algorithm for mobile ad-hoc networks were presented. For achieving the minimum total delay, single-path or multi-paths would be selected to route packets, according to both channel condition and traffic load. Considering the costs and overheads of searching and spending of routing tables, the maximum two paths (minimum cost and secondary cost path) were taken into account. The simulation results show that the channel adaptive routing of maximum two-path can obtain better delay performance.

关 键 词：移动通信 AD HOC网络 信道自适应 路由 

分 类 号：TN914.41[电子电信—通信与信息系统]