Simulated Annealing based Wireless Sensor the SA Method Point Coverage

The sensor networks contain many sensors and each sensor has a limited and un-replaceable battery. As each node has a number of different 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 the increase of network lifetime, a vigorous algorithm is introduced that is able to cover all areas of network with the lowest cost. This suggested algorithm runs based on simulated annealing 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 our proposed algorithm can organize the best areas of networks with numerous sensors by the lowest possible cost, and it significantly enhances the network's lifetime. It also guarantees that during execution procedure, all network areas are covered by the selected sensors.