ACO FOR OPTIMAL SENSOR LAYOUT
Stefka Stoyanova Fidanova, Pencho Marinov, Enrique Alba · 2010
Metaheuristic methods have frequently been applied to telecommunication problems in the last years. One of these problems is Wireless Sensor Network (WSN) layout, which is an NP-hard optimization problem. The sensors sent their sensing results to a special station called the High Energy Communication Node (HECN). The sensing area of the WSN is the union of the individual sensing areas of the nodes. When deploying a WSN, the major objective is to achieve full coverage of the terrain (sensor field). Another objectives are also to use a minimum number of sensor nodes and to keep the connectivity of the network. In this paper we address a WSN layout problem in which full coverage and connectivity are treated as constraints, while objective function is the number of the sensors. To solve it we propose Ant Colony Optimization (ACO) algorithm. The terrain is modeled with 500× 500 points grid and both sensing radius and communication radius are set to 30. We compare our results with existing evolutionary algorithms.