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

DOI10.1016/J.IPL.2014.11.009MaRDI QIDQ483049zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Sensor Networks With Random Links: Topology Design for Distributed Consensus
• Configuration‐based approach for topological problems in the design of wireless sensor networks
• Game theory based construction efficient topology in wireless sensor networks
• Algorithms and Simulation Methods for Topology-Aware Sensor Networks

Cites work

• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Consensus and Cooperation in Networked Multi-Agent Systems
• Distributed average consensus with least-mean-square deviation
• Fast linear iterations for distributed averaging
• Handbook of metaheuristics
• On the hardness of range assignment problems
• Optimal Topology Control and Power Allocation for Minimum Energy Consumption in Consensus Networks
• The Laplacian Spectrum of a Graph II

Cited in

(5)

• Sensor Networks With Random Links: Topology Design for Distributed Consensus
• Step-size sequence design for finite-time average consensus in secure wireless sensor networks
• Distributed control for energy-efficient and fast consensus in wireless sensor networks
• Effect of network geometry and interference on consensus in wireless networks
• Distributed adjacency weight design for second-order consensus in wireless sensor and actuator networks

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

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