基于K-最近邻基站的移动手机自组网路由协议  

Routing protocol for mobile Ad hoc cell phone network based on K-nearest neighboring base stations

作　　者：胡君[1] 徐署华[1] 王雷[2] 

机构地区：[1]湖南科技职业学院软件学院,长沙410118 [2]湖南大学软件学院,长沙410082

出　　处：《计算机应用研究》2010年第3期1163-1166,共4页Application Research of Computers

摘　　要：通过分析AODV算法及其存在的问题,结合节点的移动速度和方向等信息,提出了一种基于K-最近邻基站的移动手机自组网混合路由协议。在新协议中,当网络的本地基础设施发生故障时,每个本地节点首先生成并维护一个K-最近邻基站信息表,然后基于该K-最近邻基站信息表,利用改进的AODV协议来进行按需路由。理论分析与仿真结果表明,新算法的性能要优于传统的按需路由协议AODV,因此,更适合移动手机自组网中的路由。By analysing the AODV protocol and its defect, then considerded the inforniation about the moving speed and direction of nodes, this paper presented a new hybrid routing protocol for mobile Ad hoc cell phone network based on K-nearest neighboring base stations, in which, when the local network infrastructures fail or was destroyed, each local node would generate and maintenance a K-nearest neighboring base stations information table, and then, based on the table,used the improved AODV protocol to do on-demand routing. Theoretical analyses and simulation results show that, the newly proposed protocol has better performance than the traditional on-demand routing protocol AODV, so it is more suitable for routing in mobile Ad hoc cell phone networks.

关 键 词：移动手机自组网 按需路由 表驱动路由 混合路由 K-最近邻基站 

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