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

基于K最近邻基站移动手机自组网路由协议 　　摘 要:通过分析AODV算法及其存在的问题,结合节点的移动速度和方向等信息, 提出了一种基于??K??-最近邻基站的移动手机自组网混合路由协议。在新协议中, 当网络的本地基础设施发生故障时,每个本地节点首先生成并维护一个??K??-最近邻基站信息表,然后基于该??K??-最近邻基站信息表,利用改进的AODV协议来进行按需路由。理论分析与仿真结果表明, 新算法的性能要优于传统的按需路由协议AODV,因此,更适合移动手机自组网中的路由。 　　关键词:移动手机自组网; 按需路由; 表驱动路由; 混合路由; ??K??-最近邻基站 　　中图分类号:TP393 文献标志码:A 　　文章编号:1001-3695(2010)03-1163-04 　　doi:10.3969/j.issn.1001-3695.2010.03.100 　　 　　Routing protocol for mobile Ad hoc cell phone networkbased on ??K??-nearest neighboring base stations 　　HU Jun??1,XU Shu-hua??1,WANG Lei??2 　　(1.College of Software, Hunan Vocational College of Science Technology, Changsha 410118, China;2.College of Software, Hunan University, Changsha 410082, China) 　　Abstract:By analysing the AODV protocol and its defect,then considerded the information 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. 　　Key words:mobile Ad hoc cell phone network; on-demand routing; table-driven routing; hybrid routing; ??K??-nearest neighboring base stations 　　 　　0 引言 　　Ad hoc网络由一组带有无线收发装置的移动终端组成的一个多跳的、临时性、自创建(self-creating)、自组织(self-organizing)、自管理(self-administering)系统, 具有较强的容错性和鲁棒性, 能够在战场、救灾等场合快速部署,具有广阔的应用前景。但由于其能量由主机所带电池决定, 带宽受无线网络限制, 并且由于主机具有移动性,网络拓扑结构变化频繁。因此, 路由协议成为移动自组网络研究中关键的问题之一[1~3]。目前, 国际上关于Ad hoc网络的路由协议研究正在逐步深入, 根据节点获得路由信息的途径, Ad hoc网络的路由协议可分为按需(on-demand)、表驱动(table-driven)和混合式(hybrid)三大类[4,5]。 　　 　　1)按需路由协议 又称为反应式(