WSN中基于虚拟网格的分簇路由算法

A Routing Algorithm Based on Virtual Grid in WSN

为了延长无线传感器网络生命周期,降低通信时延,提出一种基于虚拟网格的分簇路由算法CRVB。该算法将监测区域划分为若干虚拟网格,同一网格内节点自组织成簇,分布式地构建生成树进行路由,从而减小簇内通信代价。根据节点剩余能量启动计时器选取本地簇首,采用多跳的方式完成与基站通信,可避免能耗的不均衡。同时,均衡的网格分簇,能保证较低的通信时延。实验结果表明,CRVB算法在延长网络生存时间和降低通信时延方面优于LEACH和PEGASIS算法。

In order to extend the network lifetime and reduce communication delay in wireless sensor network,a routing algorithm based on virtual grid（CRVB） was presented.In this algorithm,the area was divided into some virtual grids and nodes in the same grid joined a cluster,a spanning routing tree was formed in every cluster concurrently.The cluster head was chosen by the node＇s residual energy and communicated with base station by multi-hop.Based on the balanced clustering strategy,the communication delay was lower.The simulation experiments showed that compared to the classical LEACH and PEGASIS,this algorithm significantly prolongs network lifetime and reduces communication delay.