首页 | 官方网站   微博 | 高级检索  
     

基于K-最近邻基站的移动手机自组网路由协议
引用本文:胡君,徐署华,王雷.基于K-最近邻基站的移动手机自组网路由协议[J].计算机应用研究,2010,27(3):1163-1166.
作者姓名:胡君  徐署华  王雷
作者单位:1. 湖南科技职业学院,软件学院,长沙,410118
2. 湖南大学,软件学院,长沙,410082
摘    要:通过分析AODV算法及其存在的问题,结合节点的移动速度和方向等信息, 提出了一种基于K-最近邻基站的移动手机自组网混合路由协议。在新协议中, 当网络的本地基础设施发生故障时,每个本地节点首先生成并维护一个K-最近邻基站信息表,然后基于该K-最近邻基站信息表,利用改进的AODV协议来进行按需路由。理论分析与仿真结果表明, 新算法的性能要优于传统的按需路由协议AODV,因此,更适合移动手机自组网中的路由。

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

Routing protocol for mobile Ad hoc cell phone network based on K-nearest neighboring base stations
HU Jun,XU Shu-hu,WANG Lei.Routing protocol for mobile Ad hoc cell phone network based on K-nearest neighboring base stations[J].Application Research of Computers,2010,27(3):1163-1166.
Authors:HU Jun  XU Shu-hu  WANG Lei
Affiliation:1.College of Software/a>;Hunan Vocational College of Science & Technology/a>;Changsha 410118/a>;China/a>;2.College of Software/a>;Hunan University/a>;Changsha 410082/a>;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 routi...
Keywords:mobile Ad hoc cell phone network  on-demand routing  table-driven routing  hybrid routing  K-nearest neighboring base stations
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号