摘要
针对无线传感器网络中地理位置和能量路由(GEAR)算法可能产生的路由空洞问题,GEAR算法通过改变自身和邻居节点的代价来解决问题,但同一节点可能会再次遇到同一路由空洞.文中提出了一种基于Dijkstra+策略的路由空洞GEAR+算法可以避免上述问题.仿真分析表明,该算法在平均能量消耗和节点发送数据分组的数量上都优于GEAR算法.
In the Wireless Sensing Network (WSN), GeogTaphic and Energy Aware Routing (GEAR) algorithm solved its routing hole problem by changing the cost value of the current routing node and his neighbors. However, the same node may again encounter the identical hole issue. This article proposes a routing hole algorithm named GEAR+ , which is based on Dijkstra + strategy and can avoids suffering the same hole again. Simulation and analysis shows that the GEAR + algo-rithm is superior to the GEAR algorithm in the average consumption of energy and the amout of data packets transmitted by node.
出处
《微电子学与计算机》
CSCD
北大核心
2009年第10期181-184,188,共5页
Microelectronics & Computer
基金
国家自然科学基金项目(602730350)
国防科工委应用基础基金(K1704060511)
江苏省自然科学基金(BK2007074)