摘要： 针对无线传感网络中地理位置路由(GEAR)算法产生的路由空洞，GEAR 算法通过改变自身和邻居节点的代价来解决该问题，但同一节点可能会再次遇到同一路由空洞。该文提出一种改进算法，通过解决节点自身的代价问题，避免了上述情况。在ns2上的仿真结果表明，改进后的GEAR算法在平均能量消耗和节点发送数据分组的数量上都优于GEAR算法。
关键词:
无线传感网络,
地理位置路由,
路由空洞,
能量消耗
Abstract: Hole problem which is produced in view of the Wireless Sensing Network(WSN)’s by geographical location routing algorithm, is solved by changing cost value of node and its neighbors. But the identical node may possibly meet the identical hole once more. This article proposes one kind of improved algorithm in view of this algorithm by changing the cost value of node itself, and it avoids encountering the same hole again. The result indicates that the improved GEAR algorithm advances the GEAR algorithm in the moderate energy consumption and in node transmission data grouping’s quantity.
Key words:
Wireless Sensing Network(WSN),
Geographic and Energy Aware Routing(GEAR),
routing hole,
energy loss
中图分类号:
张 耀;贾振红. 求解路由空洞问题的GEAR改进算法[J]. 计算机工程, 2008, 34(12): 94-96.
ZHANG Yao; JIA Zhen-hong. Improved GEAR Algorithm for Solving Routing Hole Problem[J]. Computer Engineering, 2008, 34(12): 94-96.