| dc.contributor.advisor | Gerald Sussman | |
| dc.contributor.author | Beal, Jacob | |
| dc.contributor.author | Bachrach, Jonathan | |
| dc.contributor.author | Tobenkin, Mark | |
| dc.contributor.other | Mathematics and Computation | |
| dc.date.accessioned | 2007-08-27T14:23:35Z | |
| dc.date.available | 2007-08-27T14:23:35Z | |
| dc.date.issued | 2007-08-24 | |
| dc.identifier.other | MIT-CSAIL-TR-2007-044 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/38484 | |
| dc.description.abstract | Long-lived sensor network applications must be able to self-repair and adapt to changing demands. We introduce a new approach for doing so: Constraint and Restoring Force. CRF is a physics-inspired framework for computing scalar fields across a sensor network with occasional changes. We illustrate CRFs usefulness by applying it to gradients, a common building block for sensor network systems. The resulting algorithm, CRF-Gradient, determines locally when to self-repair and when to stop and save energy. CRF-Gradient is self-stabilizing, converges in O(diameter) time, and has been verified experimentally in simulation and on a network of Mica2 motes. Finally we show how CRF can be applied to other algorithms as well, such as the calculation of probability fields. | |
| dc.format.extent | 12 p. | |
| dc.relation.ispartofseries | Massachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory | |
| dc.subject | amorphous computing | |
| dc.subject | spatial computing | |
| dc.subject | Proto | |
| dc.title | Constraint and Restoring Force | |