摘要
针对无线自组网贪心法周边无状态路由协议(GPSR)在空洞存在时会引起过多的路由跳数的问题,提出了一种新的路由算法——GPSR-AD。该算法同时考虑了距离和角度两个因素对跳数的影响。分析结果表明:GPSR-AD比GPSR较大地降低了路由跳数,并且在包传送率和丢包率方面优于GPSR。
The paper proposed a new routing algorithm GPSR based on Angle and Distance （GPSR-AD） for the problem which GPSR may produce excessive unwanted route hops when spatial neighbor is existing in the Ad Hoc network. The algorithm took into consideration of the influence by two factors： distance and angle. Analytical results reveal that GPSR-AD reduces a large portion of hops than GPSR, and it performs better than GPSR in terms of average delivery success rate and packet lost rate.
出处
《计算机应用》
CSCD
北大核心
2009年第12期3215-3217,共3页
journal of Computer Applications
关键词
无线自组网
平面周边遍历算法
贪婪转发
贪心法周边无状态路由
空洞
Ad Hoc network
planer perimeter
greedy forwarding
Greedy Perimeter Stateless Routing （GPSR）
spatial neighbor
