MaxCUCL: Achieving Max-Consensus in Networks with Unreliable Communication Links
Основні поняття
MaxCUCL algorithm ensures deterministic convergence to achieve max-consensus in networks with unreliable communication links.
Анотація
MaxCUCL introduces a novel distributed algorithm designed to guarantee max-consensus in networks with unreliable communication links. The algorithm achieves deterministic convergence, allowing nodes to calculate the maximum of their states regardless of packet drops. It enables nodes to determine convergence and transition to subsequent tasks. The operation relies on narrowband error-free feedback channels for successful packet transmission acknowledgment. The algorithm converges after a finite number of time steps and is practically applied in environmental monitoring sensor networks.
MaxCUCL
Статистика
MaxCUCL guarantees max-consensus in networks with unreliable communication links.
Nodes calculate the maximum state regardless of packet drops.
Algorithm relies on narrowband error-free feedback channels for successful transmission acknowledgment.
Convergence is achieved after a finite number of time steps.
Цитати
"MaxCUCL ensures deterministic convergence for achieving max-consensus in networks with unreliable communication links."
"Nodes can determine convergence and transition to subsequent tasks using the MaxCUCL algorithm."
"The practical applicability of MaxCUCL is demonstrated in environmental monitoring sensor networks."