fast self-healing gradients
We present CRF-Gradient , a self-healing gradient algorithm that provably reconfigures in O(diameter ) time. Self-healing 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.
spatial computing amorphous computing