Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem

DOI10.1007/978-3-642-00602-9_13zbMath1237.90105OpenAlexW13009568MaRDI QIDQ3624571

Daniele Fontanelli, Roberto Passerone, Luigi Palopoli

Publication date: 30 April 2009

Published in: Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00602-9_13

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete-time control/observation systems (93C55) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Stochastic scheduling theory in operations research (90B36)

Cites Work

• Optimal sensor placement and motion coordination for target tracking
• Maximizing system lifetime in wireless sensor networks
• Communication constraints in the average consensus problem
• Consensus and Cooperation in Networked Multi-Agent Systems
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Formations of Vehicles in Cyclic Pursuit
• On Synchronous Robotic Networks—Part I: Models, Tasks, and Complexity
• On Synchronous Robotic Networks—Part II: Time Complexity of Rendezvous and Deployment Algorithms

This page was built for publication: Convergence of Distributed WSN Algorithms: The Wake-Up Scattering Problem