Optimizing Coverage in Wireless Sensor Networks: A Binary Ant Colony Algorithm with Hill Climbing

Document Type

Article

Publication Date

2-1-2024

Abstract

Wireless sensor networks (WSNs) play a vital role in various fields, but ensuring optimal coverage poses a significant challenge due to the limited energy resources that constrain sensor nodes. To address this issue, this paper presents a novel approach that combines the binary ant colony algorithm (BACA), a variant of ant colony optimization (ACO), with other search optimization algorithms, such as hill climbing (HC) and simulated annealing (SA). The BACA is employed to generate an initial solution by emulating the foraging behavior of ants and the pheromone trails they leave behind in their search for food. However, we acknowledge that the BACA alone may not guarantee the most optimal solution. Subsequently, HC and SA are optimization search algorithms that refine the initial solution obtained by the BACA to find a more enhanced solution. Through extensive simulations and experiments, we demonstrate that our proposed approach results in enhanced coverage and energy-efficient coverage in a two-dimensional (2D) field. Interestingly, our findings reveal that HC consistently outperforms SA, particularly in less complex search spaces, leveraging its robust exploitation approach. Our research contributes valuable insights into optimizing WSN coverage, highlighting the superiority of HC in this context. Finally, we outline promising future research directions that can advance the optimization of WSN coverage.

Identifier

85191538735 (Scopus)

Publication Title

Applied Sciences (Switzerland)

External Full Text Location

https://doi.org/10.3390/app14030960

e-ISSN

20763417

Issue

3

Volume

14

Grant

2338521

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS