Research On The Maximum Cover Set Problem In WSN

With the widely use of wireless sensors, WSN becomes popular among kinds of fields, but WSN’s sensing distance, communication distance and energy are all limited to affect its applications, while the finite energy is the main topic in this paper, which is to use the energy saving algorithms to prolong the lifetime of networks. Due to the fact that most of researchers use the switching theory of batteries and the thought of the maximum cover set, so the paper also conducts researches based on these two techniques, the main work including the following parts:Firstly, the energy saving techniques about the wireless sensor networks are explained in this paper;Secondly, a new heuristic algorithm based on Cov strategy is proposed. In this paper, first of all a network model is established according to the MDS-MCC heuristic algorithm, and then Cov strategy is come up with based on Greedy, which amends two shortcomings of the original algorithm, that are the division of sub-graph and limitation of Greedy. The simulation results reveal that the new strategy is better than the original one in the aspects of value of NF, stability and the running time;Finally, two methods to solve remaining sensor nodes are proposed to the single-hop and multi-hop networks respectly, which are coverage adjusting algorithm and network rebuilding. The simulation result proves that these two algorithms can reduce waste of sleeping sensors effectively, and it can also prolong value of NF and guarantee the stability.Overall, this paper is mainly to propose new algorithms for redundant nodes and remaining nodes, the simulation results prove that these new methods could solve problems effectively.