A new metaheuristic approach based on orbit in the multi-objective optimization of wireless sensor networks

Özdağ R., Canayaz M.

WIRELESS NETWORKS, cilt.27, sa.1, ss.285-305, 2021 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 27 Sayı: 1
  • Basım Tarihi: 2021
  • Doi Numarası: 10.1007/s11276-020-02454-5
  • Dergi Adı: WIRELESS NETWORKS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, PASCAL, ABI/INFORM, Aerospace Database, Applied Science & Technology Source, Communication Abstracts, Compendex, Computer & Applied Sciences, INSPEC, Metadex, zbMATH, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.285-305
  • Anahtar Kelimeler: Wireless sensor networks, Sensor deployment, Area coverage problem, Whale optimization algorithm, Binary detection model, Degree ofk-coverage, COVERAGE, PLACEMENT
  • Van Yüzüncü Yıl Üniversitesi Adresli: Evet

Özet

Wireless sensor networks (WSNs) is a research area which has been used in various applications and has continuously developed up to now. WSNs are used in many applications, especially in military and civilian applications, with the aim of monitoring the environment and tracking objects. For this purpose, increasing the coverage rate of WSNs is one of the important criteria that determine the effective monitoring of the network. Since the sensors that make up the WSNs have a limited capacity in terms of energy, process and memory, various algorithmic solutions have been developed to optimize this criterion. The effective dynamic deployment of sensor nodes, which is the primary goal of these solutions, has a critical role in determining the performance of the network. A new orbit-based dynamic deployment approach based on metaheuristic Whale Optimization Algorithm has been proposed in this study. The goal is to optimize the convergence speed of the nodes, the coverage rate of the network, the total displacement (movement) distances of sensors and the degree ofk-coverage of each target (Grid) point in the area by effectively performing the dynamic deployments of sensors after their random distribution. This approach is compared with MADA-WOA and MADA-EM in the literature. Simulation results indicated that the approach developed in rapidly converging sensors to each other, increasing the network's coverage rate, and in minimizing the total movement distances of the sensors in the area and the degrees ofk-coverage of Grid points covered by the sensors could be proposed.