Optimum deployment of sensors in WSNs

Abstract

Ant Colony Optimization (ACO) is one of the important techniques for solving optimization problems. It has been used to find locations to deploy sensors in a grid environment [12], in which the targets, called point of interest (PoI), are located on grid points in a square grid. The locations of sensors, which are grid points, are determined by considering the sink location as the starting point for deploying sensors. Though that work provides optimum number of sensors to cover all targets with respect to the given sink location, yet it does not provide which sink location provides minimum number of sensors to cover the targets. In this paper, we use ACO technique and find the sink location for which the number of sensors is minimum among all available locations in the grid. In our algorithm, we compute sum of distances of the targets from that sensor, which are in its range. Then we add these sums for all sensors in the grid. This distance corresponds to the given sink location. We repeat same process for computing the distance by changing the sink location in the grid. We choose that sink location for which the distance is minimum and this sink location requires minimum number of sensors to cover all targets. We carry out simulations to demonstrate the effectiveness of our proposed work.