Abstract:

Energy conservation in wireless sensor networks is an important research subject. In this paper, we studied energy conservation in wireless sensor networks based on the maximum cover sets problem. First, the distributed tokenbased mechanism was proposed for the collection of the path between a sink and a sensor. Through the mechanism, sink nodes can collect at most K paths for each sensor, and the parameter K can be adjusted to make a balance between algorithm performance and communication overhead. Then, based on the selected paths, an iterative optimization mechanism was presented to find a cover set of the network while using the number of sensors as small as possible. Finally, simulation work was done to evaluate the proposed energysaving strategies and algorithms. Simulation results show that the proposed algorithm performs better than the other two algorithms. Moreover, experimental analysis shows that algorithm parameters have the impact on the experimental results.

Key words: wireless sensor network;energy conservation;cover set;node organization