The Study On K-Coverage Algorithm For Wireless Sensor Networks

Wireless sensor networks (WSN) is a distributed network system constituted by large number of tiny sensor nodes through wireless communication and self-organization. WSN involves sensor technology, MEMS technology, modern network technology, wireless communications and other technologies, which is one of the focus in IT areas. As one of the fundamental problems in WSN, coverage control can optimize the allocation of space resources, and thus fulfill the task of regional perception, information access and efficient transmission in a better way.In this paper, we introduce wireless sensor networks about its background knowledge, architecture, and network characteristics firstly. Then we state related concepts about network coverage in WSN, and make classification for the problem.We propose a algorithm based on no-crossing divided subsets. In this paper, This algorithm first create no cross-subset subset for grouped network nodes, and every subset can coverage the hole targeted area. Then we mobilize a subset of k nodes by the method of K-coverage determining to finish K-coverage quickly. This algorithm works easily and quickly, and it avoids using complex determining and scheduling algorithm. At the same time, it can meet the needs of different size of network coverage.At last, in this paper, we bring forward K-coverage algorithm based on perceiving probability and energy. We first adopt the perceived probability to present the sensor nodes'detection capability for target nodes. Then select K groups of no-crossed nodes using the feature of exchanging information among nodes. This method can guarantee K-coverage, and reduce energy consumption and prolong the life of network efficiently. By simulation with NS2, this method is proved efficient.