The Research On Target Coverage Problem In Wireless Sensor Network

Wireless sensor network (WSN) has become a hot of research on evolutionary computation system,and promote the development of many fields such as national defense security,intelligent household,agriculture and medical treatment.Based on WSN having strong ability of contacting physical and digital world,it help people more effectively with observation target,collecting information,and execution of strategy.It shows WSN having a great potential for development and application in target monitoring situation,such as forest fires,battlefield environment and more.But considering the complexity of this kind of system and the most important problem of target coverage, and there are few deep theoretical research, which have hindered WSN application in practical. In this paper aiming at the shortcomings of the this study universal optimization model is established, based on the analysis of the theory,practical and effective energy saving algorithm is put forward,to promote the wireless sensor network in the practical application. In this paper,the specific content as follows:(1) For homogeneous WSN stationary target coverage problem,two theories,relaxation techniques and algorithm based on column generation, are proposed.The former is established based on the linear optimization equation of the network lifetime's upper bound and this theory provides the benchmark for the algorithm's performance. Column generation algorithm based on the thoughts of divide-and-conquer and iterative overcomes the previous algorithm's deficiency which is without the performance security. Importantly, the proposed theory has universality.(2) The paper studies the real-time stationary target coverage problem with routing constraints for heterogeneous wireless sensor network (WSN),and focus on how to maximize network lifetime by scheduling routing while fulfilling target coverage situation of different types and different requirements.Mathematical modeling on the problem, the improved column production algorithm is proposed, which combines the column generation based algorithm and a random selection algorithm who can get better basic feasible set to speed up the convergence speed,and improved termination conditions for further accelerating convergence, then get the optimal solution.By experiments,the influence of the parameters on network lifetime are revealed and analyzed,which to establish the actual system provides a useful guide.(3) The non integer stationary target coverage problem is put forward, and the new coverage model is established. New non integer coverage model:the target is not need be overridden at any time, if so, the bottleneck of network goal will greatly limit the network lifetime, relatively, the partial coverage, such as 80% of the network lifetime are covered, can meet the requirements. Based on the new coverage model the optimal nodes allocation algorithm is designed.The proposed algorithm is verified by experiment and comparing it with the column generation algorithm based approach in terms of computing time and performance parameters it shows obvious advantages.