贪婪周边无状态路由转发算法GPSR的分析及改进  

Analysis and Improvement of the Routing Algorithm GPSR

作　　者：王丽娟[1] 梁海涛 秦建敏[2] 任新华[3] 

机构地区：[1]太原理工大学计算机学院,太原030024 [2]太原理工大学测控技术研究所,太原030024 [3]太原理工大学信息化管理与建设中心,太原030024

出　　处：《太原理工大学学报》2012年第5期587-590,共4页Journal of Taiyuan University of Technology

基　　金：山西省留学回国资助项目(2011-029);山西省人力资源和社会保障厅留学回国择优科技资助项目

摘　　要：分析了贪婪周边无状态路由算法GPSR(Greedy Perimeter Stateless Routing),并对其缺陷进行了改进。利用NS2网络模拟平台仿真实现了GPSR算法及改进的算法GPSRI(GPSR-Improved),并对两种算法的传输时延,转发跳数等重要参数进行了比较;验证了改进的算法GPSRI能更有效地传输数据。该算法降低了传输时延,减少了转发跳数,实现了多路径数据传输,保证了网络数据传输的可靠性;有效地解决了GPSR算法中出现的空洞(void)问题。This paper presented a brief introduction and analysis of GPSR algorithm and achieved the corresponding improved algorithm GPSRI. The experimental results for the two algo-rithm were simulated and compared via NS2 network simulation platform. The results show that GPSRI algorithm behaved better than GPSR algorithm in terms of improving data transfer rate, solving the void problem, reducing transfer delay and hop count. Furthermore, the improved GPSRI algorithm found multiple node-disjoint paths while the GPSR algorithm could not.

关 键 词：贪婪周边无状态路由算法 时延 跳数 空洞 

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