摘要
由于自然环境和传感器节点自身的原因,在无线传感器网络中很难避免出现洞。GPSR路由算法中数据包沿洞边界传送,它容易导致洞边界节点能量过度消耗和数据碰撞,没有很好地解决局部最优现象问题。本文提出的改进算法给出了源节点和目的节点出现在网络中任何位置的洞路由方案,优化了洞路由路径,合理解决了无线传感器网络中的洞路由问题。
Holes are hardly avoided in wireless sensor networks because of geographical environments and characteristics of sensor nodes. Since data packets transmit around the boundary of holes in greedy perimeter stateless routing (GPSR), in which is easy to result in excessively energy consume of nodes and data collisions, so it couldn't solve the problem of local minimum phenomenon very well. In this paper, an improved algorithm proposes a routing scheme optimizes the routing path no matter where the source node and the destination node appears in the networks, also solves hole routing problem reasonably in wireless sensor networks.
出处
《传感技术学报》
CAS
CSCD
北大核心
2009年第7期1024-1028,共5页
Chinese Journal of Sensors and Actuators
基金
湖南省自然科学基金项目资助(2006GK3010)
关键词
无线传感器网络
洞路由
贪婪转发
椭圆
协议
wireless sensor networks
hole-routing
greedy forwarding
ellipse
protocol