Multi-coverage Algorithm Based on Grid-plotting in WSN
Liu Zhi-ku · Fire Control and Command Control · 2014
In order to prolong the lifetime of Wireless Sensor Netwoks(WSN)while keeping the coverage performance,the scheduling algorithm can make some nodes sleep and the energy is saved. A multi-coverage algorithm based on grid-plotting in WSN is proposed,it contains two parts which are redundant node judging and node scheduling. The node coverage area is divided into grids and the redundant nodes are determined through judging each grid can satisfy the coverage requirement or not.The boundary redundant node judging rule is given and the boundary effect influence can be overcome in the scheduling process. Besides,the off-duty conflict and coverage blind area are avoided.Simulation results show that,compares with CPNSS,the new algorithm can judge redundant nodes more correctly and has better performance on two evaluating indicators: on-duty node number and average coverage degree. It's not sensitive to the influence of the increase of node number and can reduce the redundancy of network effectively. It achieves the purpose of improving the performance of network.