Research On Optimal Targets Covering In Wireless Sensor Network

With the influence of The Internet of things, Wireless Sensor Network has raised a lot of attention from all aspects on its research and application. Due to the characteristic of WSN, targets sensing is a basic problem in wireless sensor network, which have something to the network lifetime and other technology development. So it researches the constraint condition and objective function of the WSN targets covering algorithm, builds the mathematic model of the algorithm, and gives the covering rules, which has special important meanings for realization of high energy-efficient targets covering.In this paper, firstly, It make a short introduction on the basic structure of WSN and its characteristic, the conclusion about network energy-saving technology and the analysis for network topology and targets covering problem. Secondly, regarding to the targets covering problem in WSN, it discusses the current sensing algorithm, which including all targets cover algorithm, section targets cover algorithm and sets split algorithm and tries to analyze the main principle and the advantages and disadvantages of a variety of typical algorithms. With the aim to maximize the network lifetime, it proposes the targets sensing algorithm SSAR (Sets Split Adjusting sensing Radius) that founded on the two principle theory:scheduling the sensor between sleep and active, the relation of energy consumption and Euclidean distance. On the one hand, it designs a SCS (Sets of Cover Seeking) algorithm to seek all sets of cover. On the other hand, in the guide of linear programming optimizing ideal, it maximizes the network lifetime to allocate work-time to each covers by optimizer. And then, it adjusts the sensing radius of each sensor in covers to deduce the energy consumption. Finally, it uses CPLEX optimization tool to compute and analyze the SSAR algorithm and which tells us that SSAR can effectively prolong the network lifetime, and then improve the network performance.