The optimization of network lifetime with sensor deployment for target coverage problem in wireless sensor networks [Kablosuz algilayici aǧlarda hedef kapsama problemi için algilayici daǧitimi ile aǧin yaşam söresinin optimizasyonu]

Network lifetime is a critical factor in determining the effectiveness of wireless sensor networks (wsns). the optimization of the battery lives of the sensor nodes following the targets in terms of continuity of wsns coverage in military and civil applications plays an important role in extending the network's lifetime. since the sensor nodes that constitute wsns have limited battery life,the energy of the sensors gradually decreases as a result of communicating among themselves and perceiving field of interest. ultimately,the node consumes its energy completely and causes wsn to fail to function. for this reason,the optimization of the lifetime of wsns has been one of the most frequently studied topics in the literature.in this article,it was aimed to optimize the lifetime of the network by performing dynamic distributions of the nodes provided that the coverage requirements (1 ≤ k ≤ 4) of the maximum four sensor nodes are met to find solution to the target coverage problem in wsns. it was aimed to determine the accessible lifetime of the network by calculating the remaining battery life of the nodes and the upper limit of the network lifetime when the coverage requirements of the targets are met. in addition,electromagnetism-like (em) algorithm,which is meta-heuristic in performing the dynamic distributions of sensor nodes,was taken as a basis,and a new energy-efficient algorithm was developed. the accessible network lifetimes calculated with this algorithm were compared with the artificial bee colony (abc) and particle swarm optimization (pso) algorithms in the literature. according to the obtained simulation results,it was found that the algorithm developed in reaching the upper limit of the network lifetime gave more optimum results.