Optimum sink location for sensor deployment in wireless sensor networks

Abstract

Deploying sensors for monitoring targets depends on the sink location. For optimal sensors deployment, ant colony optimization with three classes of ant transition (ACO-TCAT) has recently been discussed. This algorithm provides optimal number of sensors, called points of solution (PoSs) to cover the given targets, called points of interest (POIs), for a given sink location. The starting point of the ant is called sink in this work. This algorithm, however has some drawbacks. First, its solution is locally developed. In other words, it does not give the optimal number of sensors globally, i.e., for all possible sink locations. Second, it does not consider redundancy, if any. Third, it requires large number of iterations. In this paper, we propose an algorithm that overcomes the above mentioned drawbacks. In our algorithm, we provide the minimum number of sensors (PoSs) globally to cover all targets (PoIs) with less number of iterations. It also makes redundancy check to remove the redundant sensors.

Keywords:

• Optimization
• PoIs
• PoSs
• Ant colony optimization
• Sensor deployment