A New Meta-Heuristic Approach for Optimization of Probabilistic Coverage Rate in Wireless Sensor Networks

Kablosuz Algılayıcı Ağlarda Olasılıksal Kapsama Oranının Optimizasyonu için Yeni Bir Meta-Sezgisel Yaklaşım

Abstract

The optimization of the coverage rate of the entire field of interest in terms of active surveillance of critical regions in military and civil environments determines the efficiency of the Wireless Sensor Networks (WSN) in the area. The coverage problem in WSNs is one of the critical factors that have determined the effective coverage of the area by the sensor nodes. The purpose in coverage problem, which is classified as area coverage and target coverage in the literature, is to ensure that the entire area or deterministically-specified targets in the area are effectively covered by the distributed nodes. In accordance with this purpose, an optimum solution can be found for the coverage problem in WSNs by performing the optimum dynamic deployments of sensor nodes in the field of interest.In this study, an attempt to optimize the coverage rate of the network was made according to the Probabilistic Deployment Model using heterogeneous nodes consisting of mobile and static nodes by taking into account the area coverage problem. For this purpose, a new dynamic distribution algorithm approach was developed for WSNs based on Electromagnetism-Like (EM) algorithm which is meta-heuristic. The developed approach was compared with the OSDA-EM in the literature, and the performance and effectiveness of this method were measured. Simulation results indicated that the developed method produced optimum results in terms coverage rate and convergence rate of the nodes in the solution of the probabilistic coverage problem of the entire area and that it could be proposed.

Özet

Askeri ve sivil ortamlardaki kritik bölgelerin aktif olarak gözetlenmesi bakımından ilgili alanın tümünün kapsanma oranının optimizasyonu Kablosuz Algılayıcı Ağ (KAA)’ların alandaki etkinliğini belirler. KAA‘lardaki kapsama problemi alanın algılayıcı düğümler tarafından etkin olarak kapsanmasını belirleyen kritik faktörlerden biridir. Literatürde alan kapsama ve hedef kapsama olarak sınıflandırılan kapsama problemindeki amaç; tüm alanın veya alanda deterministik olarak belirlenen hedeflerin dağıtılan düğümler tarafından etkin olarak kapsanmasını sağlamaktır. Bu amaç doğrultusunda ilgili alanda algılayıcı düğümlerin optimum dinamik dağıtımları yapılarak KAA’lardaki kapsanma problemine optimum bir çözüm bulunabilir.