Fast self-healing gradients
- 16 March 2008
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1969-1975
- https://doi.org/10.1145/1363686.1364163
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- Infrastructure for Engineered Emergence on Sensor/Actuator NetworksIEEE Intelligent Systems, 2006
- GLIDER gradient landmark-based distributed routing for sensor networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- GRAdient Broadcast: A Robust Data Delivery Protocol for Large Scale Sensor NetworksWireless Networks, 2005
- Programming an Amorphous Computational MediumLecture Notes in Computer Science, 2005
- The nesC languagePublished by Association for Computing Machinery (ACM) ,2003
- Directed diffusionPublished by Association for Computing Machinery (ACM) ,2000