New WSN Redundant Coverage and Energy Efficient Routing Algorithm
Shuo Li · Jisuanji gongcheng · 2011
Aiming at the problem of redundant coverage of the nodes in Wireless Sensor Network(WSN),an adjustable redundant covering algorithm is proposed based on K-coverage determination algorithm and partial redundancy covering algorithm.The algorithm follows the principle of maximizing coverage of the network while reducing energy consumption.After the efficient network is processed with the adjustable redundant covering algorithm,an energy-saving routing algorithm combined with the shortest path and the minimum spanning tree is posed.This algorithm constructs a number of shortest path trees to the Sink node for the root in the network,which reduce the energy consumption of network.Simulation results show that when the coverage redundancy is set for two,the two algorithms can reduce about 20.27% the energy consumption in the randomly deployed network.