4.7 Article

Node depth Representation-based Evolutionary Multitasking Optimization for Maximizing the Network Lifetime of Wireless Sensor Networks

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.engappai.2023.107463

关键词

Evolutionary multitasking optimization; Multifactorial evolutionary algorithm; Node-depth encoding; Network lifetime; Wireless sensor network

向作者/读者索取更多资源

Wireless Sensor Networks (WSNs) face challenges related to limited energy resources, and network lifetime and energy consumption are critical considerations. This paper introduces a novel approach to extend network lifetime and reduce energy consumption in WSNs by optimizing network architecture selection. The proposed method addresses limitations of previous studies and consistently generates valid solutions by incorporating efficient encoding and tailor-made genetic operators. It also harnesses knowledge transfer in a multitask evolutionary algorithm to explore various network architectures and achieve state-of-the-art results in terms of solution quality, convergence rate, and running time.
Wireless Sensor Networks (WSNs) face challenges related to limited energy resources in sensor nodes, making network lifetime and energy consumption critical considerations. In this paper, we introduce a novel approach to extend network lifetime and reduce energy consumption in WSNs by optimizing network architecture selection. We explore various architecture options, including single-layer and multi-layer networks, to determine the most suitable configuration. Several studies have applied knowledge transfer in evolutionary multitasking optimization to maximize network lifetime, achieving state-of-the-art results for the problem. However, they still have some drawbacks, such as redundant representations, i.e., many genotypes represent the same phenotype, and invalid solution generation. To address these limitations, we propose a new evolutionary multitasking algorithm incorporating efficient encoding to represent tree-structure solutions (network architectures) to the problem. Additionally, we tailor new genetic operators, such as recombination and mutation, to meet the specific requirements of our proposed evolutionary multitasking algorithm. The standout feature of our proposal lies in its ability to consistently generate valid solutions for the problem, which significantly reduces redundancy within the genotype search space and effectively satisfies the problem constraints. Additionally, our multitask evolutionary algorithm facilitates the exploration of various network architectures, harnessing knowledge transfer to enhance optimal performance and reduce computation time compared to single-task methods. We conduct comprehensive experiments on diverse datasets and use statistical tests, e.g., the Wilcoxon signed rank test, to verify the performance of our proposed algorithms. The empirical results demonstrate that our proposed algorithm outperforms existing methods and achieves state-of-the-art results in terms of solution quality, convergence rate, and running time across a wide range of data instances. Specifically, our algorithm provides 49.54% better solution quality on average across all data types compared to the previous state-of-the-art method.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据