K-coverage Problem In Wireless Sensor Networks

Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensor networks. Sensor networks have been applied in various aspects. A wireless sensor network consisting of a large number of sensors deployed randomly. One of the main problems is energy conservation since most of the sensors are devices with limited battery life.In this paper, covering sensor locations approximates covering the whole area. In order to prolong the network lifetime, we usually activate the minimum set of sensors to save energy. In this paper, we consider k-coverage problem as selecting a hitting set H. A new approximate algorithm is proposed. First, we utilize adjusting sensing range to ensure k-coverage and give two kinds of arranging idea. Second, according to two kinds of priority mentioned in this paper, the algorithm selects sensor nodes which are the most valuable sensors and must activate for k-coverage. Then, the algorithm adds such sensor nodes to hitting set H for saving energy. This paper shows a new algorithm to achieve k-coverage based on above discussion.Time complexity of the algorithm is better than RKC algorithm proposed before. The time complexity is O(nlogn). Simulations results verify theoretical analysis.