A Dual-Layer Fuzzy Consensus Optimization Algorithm for Exponential Convergence in Distributed Networks

Distributed epidemic network scenarios have been widely employed as the foundational basis for robust and adaptive consensus estimation, leveraging data-driven methods to manage uncertainties in both epidemic parameters and network conditions. Traditional fixed-step gossip consensus protocols exhibit suboptimal performance due to their inability to dynamically adapt to fluctuations in local uncertainty and network quality. In this paper, we propose the Dual-Layer Fuzzy Consensus Optimization Algorithm (DLFCOA) scheme to address these challenges and achieve exponential convergence of the consensus error. Our approach integrates dual-layer Type'2 fuzzy inference with an adaptive step-size mechanism and rigorous Lyapunov stability analysis to dynamically adjust the gossip update rate based on real-time feedback. Experimental results demonstrate that DLFCOA reduces the global consensus error to the order of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$10^{-4}$</tex-math></inline-formula>, achieves a convergence rate of approximately 0.12, and requires significantly fewer iterations—around 150 compared to up to 800 in conventional methods—thus offering enhanced scalability, robustness, and efficiency.

Institutions

Publication Details

Journal
IEEE Transactions on Fuzzy Systems
Published
2025-09-26
DOI
https://doi.org/10.1109/tfuzz.2025.3614729
Primary Topic
Galaxies: Formation, Evolution, Phenomena
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Dual-Layer Fuzzy Consensus Optimization Algorithm for Exponential Convergence in Distributed Networks

IEEE Transactions on Fuzzy Systems
Galaxies: Formation, Evolution, Phenomena
article

A Dual-Layer Fuzzy Consensus Optimization Algorithm for Exponential Convergence in Distributed Networks

article en

Abstract

Distributed epidemic network scenarios have been widely employed as the foundational basis for robust and adaptive consensus estimation, leveraging data-driven methods to manage uncertainties in both epidemic parameters and network conditions. Traditional fixed-step gossip consensus protocols exhibit suboptimal performance due to their inability to dynamically adapt to fluctuations in local uncertainty and network quality. In this paper, we propose the Dual-Layer Fuzzy Consensus Optimization Algorithm (DLFCOA) scheme to address these challenges and achieve exponential convergence of the consensus error. Our approach integrates dual-layer Type'2 fuzzy inference with an adaptive step-size mechanism and rigorous Lyapunov stability analysis to dynamically adjust the gossip update rate based on real-time feedback. Experimental results demonstrate that DLFCOA reduces the global consensus error to the order of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$10^{-4}$</tex-math></inline-formula>, achieves a convergence rate of approximately 0.12, and requires significantly fewer iterations—around 150 compared to up to 800 in conventional methods—thus offering enhanced scalability, robustness, and efficiency.

IEEE Transactions on Fuzzy SystemsVol. 33(12)
Harbin Normal University (CN), Harbin Engineering University (CN), La Trobe University (AU), Harbin Institute of Technology (CN), Northeast Forestry University (CN)
Openalex Percentile: Top 50%
Galaxies: Formation, Evolution, Phenomena
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.