Analysis of Max-Consensus Algorithms in Wireless Channels

DOI10.1109/TSP.2012.2211593zbMath1393.94831OpenAlexW1979665513MaRDI QIDQ4574160

Franck Iutzeler, Philippe Ciblat, Jérémie Jakubowicz

Publication date: 18 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2012.2211593

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Channel models (including quantum) in information and communication theory (94A40)

Related Items (9)

Discrete-Time Dynamic Consensus on the Max Value ⋮ Consensusability of linear multi‐agent systems with time delay ⋮ A distributed methodology for approximate uniform global minimum sharing ⋮ Second-order min-consensus on switching topology ⋮ A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm ⋮ A dual approach for optimal algorithms in distributed optimization over networks ⋮ Over-the-Air computation for distributed machine learning and consensus in large wireless networks ⋮ Convergence analysis of max-consensus algorithm in probabilistic communication networks with Bernoulli dropouts ⋮ Performance and robustness of discrete and finite time average consensus algorithms

This page was built for publication: Analysis of Max-Consensus Algorithms in Wireless Channels