
Area‐priority‐based sensor deployment optimisation with priority estimation using K ‐means
Author(s) -
Ateş Enes,
Kalayci Tahir Emre,
Uğur Aybars
Publication year - 2017
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2016.1264
Subject(s) - software deployment , computer science , wireless sensor network , simulated annealing , real time computing , data mining , computer network , algorithm , operating system
Deployment in wireless sensor networks (WSN) addresses maximising the coverage of sensors and reducing the total cost of deployment. The area‐priority concept for WSN deployment that the authors contributed to the literature recently allows environments with regions that have different importance or priority levels. In this study, the authors propose the first priority‐estimation method for area‐priority‐based WSN deployments. First, a satellite image of the environment that will be used in the deployment of the sensors is clustered by a K ‐means algorithm using the colour features of the regions. In the sensor deployment phase, this cluster information is used to determine the priorities of the sensor coverage areas on positions of the image. Sensors are initially deployed quickly using a priority queue‐based technique. Then, a simulated annealing algorithm is used to maximise the total covered area priority and to minimise the gaps between the sensors. Various experiments are performed for different scenarios (land, sea, and forest) on images captured from Google Maps using different parameter values. The experiments confirm that the proposed approach performs well and outperforms the random deployment of sensors.