A greedy topology design to accelerate consensus in broadcast wireless sensor networks

DOI10.1016/J.IPL.2014.11.009zbMath1317.68267OpenAlexW2090060412MaRDI QIDQ483049

Massimo Vecchio, Roberto López-Valcarce

Publication date: 15 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.11.009

zbMATH Keywords

graph algorithmsaverage consensustopology controlrange assignmentwireless multicast advantage

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed average consensus with least-mean-square deviation
• Fast linear iterations for distributed averaging
• On the hardness of range assignment problems
• The Laplacian Spectrum of a Graph II
• Optimal Topology Control and Power Allocation for Minimum Energy Consumption in Consensus Networks
• Consensus and Cooperation in Networked Multi-Agent Systems
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Handbook of metaheuristics

This page was built for publication: A greedy topology design to accelerate consensus in broadcast wireless sensor networks