{"title":"基于分解的分布式增强型多目标进化算法,用于无线传感器网络的聚类分析","authors":"Anita Panwar, Satyasai Jagannath Nanda","doi":"10.1016/j.jnca.2024.104032","DOIUrl":null,"url":null,"abstract":"<div><p>Conventional clustering algorithms do not recognize patterns and structures with contradicting objectives in large, distributed datasets. Distributed clustering leverages rapid processing capabilities to allow multiple nodes to work together. This paper proposes a Distributed clustering based on Multiobjective Evolutionary Algorithm by Decomposition (D-MOEA/d) to solve various multiobjective optimization problems in wireless sensor networks (WSNs). In MOEA/d, a multiobjective optimization problem decomposes into several scalar optimization subproblems, each focusing on a distinct objective. Each subproblem is expressed as a clustering problem that uses local data to perform distributed clustering. The proposed method has been extended to achieve improved accuracy in less time by using a smaller feature subset with less redundancy. The Distributed Enhanced MOEA/d (DE-MOEA/d) avoids local optima by achieving diversity in the population using fuzzy-based nearest neighbor selection, sparse population initialization, and evolved mutation operator. This integration improves the accuracy of the clustering process at WSN nodes, ensuring the attainment of well-balanced solutions across multiple optimization criteria in the distributed environment. Average Euclidean and total symmetrical deviations are the two cost functions used to minimize while clustering on the MOEA/d framework. Six real-life WSN datasets are used to assess the performance of the proposed technique: (1) the Delhi air pollution dataset, (2) the Canada weather station dataset, (3) the Thames River water quality dataset, (4) the Narragansett Bay water quality dataset, (5) the Cook Agricultural land dataset and 6) Gordon Soil dataset. The simulation results of both proposed algorithms are compared with Multiobjective distributed particle swarm optimization (DMOPSO) and Distributed K-means (DK-Means). The proposed algorithm DE-MOEA/d performs better in terms of the Silhouette index (SI), Dunn index (DI), Davies–Bouldin index (DBI), and Kruskal–Wallis (KW) statistical test.</p></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"232 ","pages":"Article 104032"},"PeriodicalIF":7.7000,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed enhanced multi-objective evolutionary algorithm based on decomposition for cluster analysis in wireless sensor network\",\"authors\":\"Anita Panwar, Satyasai Jagannath Nanda\",\"doi\":\"10.1016/j.jnca.2024.104032\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Conventional clustering algorithms do not recognize patterns and structures with contradicting objectives in large, distributed datasets. Distributed clustering leverages rapid processing capabilities to allow multiple nodes to work together. This paper proposes a Distributed clustering based on Multiobjective Evolutionary Algorithm by Decomposition (D-MOEA/d) to solve various multiobjective optimization problems in wireless sensor networks (WSNs). In MOEA/d, a multiobjective optimization problem decomposes into several scalar optimization subproblems, each focusing on a distinct objective. Each subproblem is expressed as a clustering problem that uses local data to perform distributed clustering. The proposed method has been extended to achieve improved accuracy in less time by using a smaller feature subset with less redundancy. The Distributed Enhanced MOEA/d (DE-MOEA/d) avoids local optima by achieving diversity in the population using fuzzy-based nearest neighbor selection, sparse population initialization, and evolved mutation operator. This integration improves the accuracy of the clustering process at WSN nodes, ensuring the attainment of well-balanced solutions across multiple optimization criteria in the distributed environment. Average Euclidean and total symmetrical deviations are the two cost functions used to minimize while clustering on the MOEA/d framework. Six real-life WSN datasets are used to assess the performance of the proposed technique: (1) the Delhi air pollution dataset, (2) the Canada weather station dataset, (3) the Thames River water quality dataset, (4) the Narragansett Bay water quality dataset, (5) the Cook Agricultural land dataset and 6) Gordon Soil dataset. The simulation results of both proposed algorithms are compared with Multiobjective distributed particle swarm optimization (DMOPSO) and Distributed K-means (DK-Means). The proposed algorithm DE-MOEA/d performs better in terms of the Silhouette index (SI), Dunn index (DI), Davies–Bouldin index (DBI), and Kruskal–Wallis (KW) statistical test.</p></div>\",\"PeriodicalId\":54784,\"journal\":{\"name\":\"Journal of Network and Computer Applications\",\"volume\":\"232 \",\"pages\":\"Article 104032\"},\"PeriodicalIF\":7.7000,\"publicationDate\":\"2024-09-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Network and Computer Applications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1084804524002091\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Network and Computer Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1084804524002091","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
Distributed enhanced multi-objective evolutionary algorithm based on decomposition for cluster analysis in wireless sensor network
Conventional clustering algorithms do not recognize patterns and structures with contradicting objectives in large, distributed datasets. Distributed clustering leverages rapid processing capabilities to allow multiple nodes to work together. This paper proposes a Distributed clustering based on Multiobjective Evolutionary Algorithm by Decomposition (D-MOEA/d) to solve various multiobjective optimization problems in wireless sensor networks (WSNs). In MOEA/d, a multiobjective optimization problem decomposes into several scalar optimization subproblems, each focusing on a distinct objective. Each subproblem is expressed as a clustering problem that uses local data to perform distributed clustering. The proposed method has been extended to achieve improved accuracy in less time by using a smaller feature subset with less redundancy. The Distributed Enhanced MOEA/d (DE-MOEA/d) avoids local optima by achieving diversity in the population using fuzzy-based nearest neighbor selection, sparse population initialization, and evolved mutation operator. This integration improves the accuracy of the clustering process at WSN nodes, ensuring the attainment of well-balanced solutions across multiple optimization criteria in the distributed environment. Average Euclidean and total symmetrical deviations are the two cost functions used to minimize while clustering on the MOEA/d framework. Six real-life WSN datasets are used to assess the performance of the proposed technique: (1) the Delhi air pollution dataset, (2) the Canada weather station dataset, (3) the Thames River water quality dataset, (4) the Narragansett Bay water quality dataset, (5) the Cook Agricultural land dataset and 6) Gordon Soil dataset. The simulation results of both proposed algorithms are compared with Multiobjective distributed particle swarm optimization (DMOPSO) and Distributed K-means (DK-Means). The proposed algorithm DE-MOEA/d performs better in terms of the Silhouette index (SI), Dunn index (DI), Davies–Bouldin index (DBI), and Kruskal–Wallis (KW) statistical test.
期刊介绍:
The Journal of Network and Computer Applications welcomes research contributions, surveys, and notes in all areas relating to computer networks and applications thereof. Sample topics include new design techniques, interesting or novel applications, components or standards; computer networks with tools such as WWW; emerging standards for internet protocols; Wireless networks; Mobile Computing; emerging computing models such as cloud computing, grid computing; applications of networked systems for remote collaboration and telemedicine, etc. The journal is abstracted and indexed in Scopus, Engineering Index, Web of Science, Science Citation Index Expanded and INSPEC.