Mobile Sensor movement using Simulated Annealing

Abstract

Movement of mobile sensor nodes is an important aspect in wireless sensor networks, and there is considerable research underway into the design of mobile sensor movement algorithms for wireless sensor networks. Various mobile sensor movement algorithms have been proposed using different combinatorial optimization techniques such as Tahu Search, Ant Colony Optimization, and Genetic Algorithms. In this paper we present a mobile sensor movement Algorithm for Heterogenenous Sensor Networks using a Simulated annealing search technique. This paper also discusses the various factors that are taken into account while making a decision about the movement of a mobile sensor node in the event of a sensor node failure. With the help of Simulated annealing, a Movement Algorithm is proposed with an Annealing schedule that is suitable for Heterogeneous Sensor Networks, and its performance is evaluated for various sensor deployment scenarios in Heterogenenous Sensor Networks.