A New Approach for Sensor Scheduling in Wireless Sensor Networks Using Simulated Annealing

A sensor network containing many sensors is supposed and each sensor has limited and un-replaceable energy. As each node has various duties, a node's wrong performance leads to energy waste and its omission from the network structure. In this paper, thanks to sensors placement due to increasing of network lifetime, this paper introduces a vigorous algorithm to place sensors to cover maximum areas of network with the lowest cost. This suggested algorithm runs based on simulated annealing (SA) and it can work on networks in which sensors are organized randomly. Since this algorithm analyses sensors' status regularly it can be taken as a dynamic algorithm. The simulation results indicate that proposed algorithm can organize the best areas of networks with numerous sensors through the lowest possible processing, and it significantly enhances the network's lifetime. It also guarantees that during execution procedure, the most possible coverage occurs using the selected sensors.