Sciweavers

SAC
2008
ACM

Fast self-healing gradients

13 years 4 months ago
Fast self-healing gradients
We present CRF-Gradient, a self-healing gradient algorithm that provably reconfigures in O(diameter) time. Selfhealing gradients are a frequently used building block for distributed self-healing systems, but previous algorithms either have a healing rate limited by the shortest link in the network or must rebuild invalid regions from scratch. We have verified CRF-Gradient in simulation and on a network of Mica2 motes. Our approach can also be generalized and applied to create other self-healing calculations, such as cumulative probability fields. Categories and Subject Descriptors
Jacob Beal, Jonathan Bachrach, Daniel Vickery, Mar
Added 28 Dec 2010
Updated 28 Dec 2010
Type Journal
Year 2008
Where SAC
Authors Jacob Beal, Jonathan Bachrach, Daniel Vickery, Mark Tobenkin
Comments (0)