Analysis of Max-Consensus Algorithms in Wireless Channels

DOI10.1109/TSP.2012.2211593MaRDI QIDQ4574160zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(14)

• Second-order min-consensus on switching topology
• A Lyapunov analysis of the continuous-time adaptive Bellman-Ford algorithm
• Over-the-Air computation for distributed machine learning and consensus in large wireless networks
• A distributed methodology for approximate uniform global minimum sharing
• Consensusability of linear multi-agent systems with time delay
• Convergence analysis of max-consensus algorithm in probabilistic communication networks with Bernoulli dropouts
• Performance and robustness of discrete and finite time average consensus algorithms
• Discrete-Time Dynamic Consensus on the Max Value
• A dual approach for optimal algorithms in distributed optimization over networks
• Max-consensus of multi-agent systems in random networks
• Min-max group consensus of discrete-time multi-agent systems under directed random networks
• A finite-time distributed dynamic consensus protocol for tracking maximum (minimum) reference signals
• Robust bipartite output regulation with time delays: an internal model principle based approach
• Global asymptotic stability of a general biased min-consensus protocol

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4574160)