Metaheuristic algorithms and their applications in wireless sensor networks: review, open issues, and challenges

Abstract

AbstractMetaheuristic algorithms have wide applicability, particularly in wireless sensor networks (WSNs), due to their superior skill in solving and optimizing many issues in different domains. However, WSNs suffer from several issues, such as deployment, localization, sink node placement, energy efficiency, and clustering. Unfortunately, these issues negatively affect the already limited energy of the WSNs; therefore, the need to employ metaheuristic algorithms is inevitable to alleviate the harm imposed by these issues on the lifespan and performance of the network. Some associated issues regarding WSNs are modelled as single and multi-objective optimization issues. Single-objective issues have one optimal solution, and the other has multiple desirable solutions that compete, the so-called non-dominated solutions. Several optimization strategies based on metaheuristic algorithms are available to address various types of optimization concerns relating to WSN deployment, localization, sink node placement, energy efficiency, and clustering. This review reports and discusses the literature research on single and multi-objective metaheuristics and their evaluation criteria, WSN architectures and definitions, and applications of metaheuristics in WSN deployment, localization, sink node placement, energy efficiency, and clustering. It also proposes definitions for these terms and reports on some ongoing difficulties linked to these topics. Furthermore, this review outlines the open issues, challenge paths, and future trends that can be applied to metaheuristic algorithms (single and multi-objective) and WSN difficulties, as well as the significant efforts that are necessary to improve WSN efficiency.