Research On Minimum Cover Set In Wireless Sensor Network

As one of the hottest spots in IT research, wireless sensor network (WSN) related to the technology of sensor, modem networks and wireless communication, and it is widely used such as in military affairs, environment protect, intelligent fitment, control flood and so on.Nodes in WSN are usually deployed in the monitoring area by randomly sowing and very unevenly distributed. The energy of these nodes is limited and cannot be added. The node density is high to meet the demands of specific application. Thus some nodes are redundant. The appearance of redundant node complicates the network topology and data routing protocol, aggravates the competition of limited channel, wastes the sensor energy for redundant data sending and receiving. So effective energy-saving coverage and balanced energy consumption mechanism is used to reduce the network energy consumption of each round and extend the lifetime of network. Finally, LEACH algorithm has been improved to reduce the cluster heads mortality, balance network energy consumption, and extend the network lifetime.To determine redundant nodes in the target area, an algorithm of minimal coverage set based on discrete node sensing area is presented in this thesis. Discrete sensing area lattice turns the coverage of circle into the position between point and circle to simplify redundant nodes determination.Experimental simulation show that the algorithm effects the initial coverage little, and it is more simple and effective for coverage set determination than the existing algorithm. Lifetime of network in improved LEACH algorithm is longer than LEACH.