Dynamic deployment optimization of wireless sensor networks in prioritized areas

Area Priority based wireless sensor deployment problem aims optimizing the total coverage and reducing the cost of deployment for areas having regions with different priority values. In this study, sensor deployment problem has been extended for the dynamic prioritized areas in which the priorities move, and a solution technique has been proposed. This type of the sensor deployment problem and the solution technique have been studied for the first time in the literature. In this technique; at first, the first frame is preprocessed using the prioritized color ranges defined by the expert/user. Then, sensors are deployed in the optimal positions by adapting the Simulated Annealing (SA) algorithm to the problem. For this purpose, the total priority value of the pixels in the area covered by the sensors is calculated. After this step, for the following frames, the locations of the sensors are optimized continuously considering movements of the prioritized areas. This technique provides rapid relocation to adapt sensors to the changes in the environment. A dynamic images data set is prepared in experimental studies and the results for different satellite images with different movement scenarios are obtained and presented. A significant increase in the success rate by the proposed technique is observed and discussed.