Abstract
Sensor deployment is an important issue in wireless sensor network (WSN), which is a typical nonlinear system. Conditions of both area coverage and point coverage should be considered in research studies on sensor coverage. It is generally necessary to ensure high coverage ratio of area when controlling sensor locations, and covering specific point targets to ensure long lifetime is also important sometimes. In current studies, swarm intelligence algorithms such as particle swarm optimization (PSO) are widely used to solve the sensor deployment problem in WSN. In this paper, coverage rate and network life indicators are analyzed comprehensively with establishment of a more general K-coverage model. In related calculation examples with different coverage requirements including target coverage, area coverage, and boundary coverage, several improved algorithms based on PSO are applied to solve the problem in the paper. Simulation results show that the improved algorithms can achieve a good performance and deployment effect.
Highlights
Wireless sensor network (WSN) is generally composed of a large number of sensor nodes distributed in a specific area whose main task is to jointly monitor the region [1]
E coverage problem of the sensor node deployment can be divided into two types: area coverage and target coverage. e area coverage problem focuses on monitoring the entire space, while the target coverage problem focuses on some specific points in the monitoring area. e main index of area coverage is coverage rate, which can measure the service quality of wireless sensor networks
In order to compare the three algorithms in different K-coverage conditions, we suppose different positive integer values of K, which are 2, 3, and 4 in this paper, and the corresponding sensor nodes number N are, respectively, 32, 48, and 64. e coverage range of each sensor node is fixed and equals to 88 m. To execute these improved particle swarm optimization (PSO) algorithms, we considered an initial population of 10 particles, and the value of the parameter m in ICLPSO is chosen to be 10. e termination criterion of every run of each algorithm is the maximum number of iterations, which is equal to 5000
Summary
Wireless sensor network (WSN) is generally composed of a large number of sensor nodes distributed in a specific area whose main task is to jointly monitor the region [1]. When evaluating the deployment of sensor nodes in WSN, the following two performance indicators should be generally considered: one is the coverage ability of the sensor and the other is the life cycle of the whole network [7]. Several improved PSO algorithms are proposed to solve the sensor deployment problem. E main features and contributions of this paper are highlighted as follows: Based on the comprehensive analysis of both coverage ratio and network lifetime, a more general K-coverage problem is sum up, and a sensor optimal deployment model considering point target and regional coverage is established.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
