Conference proceeding
Fast Self-stabilization for Gradients
DISTRIBUTED COMPUTING IN SENSOR SYSTEMS, PROCEEDINGS, Vol.5516, pp.15-27
Lecture Notes in Computer Science
01/01/2009
DOI: 10.1007/978-3-642-02085-8_2
Abstract
Gradients are distributed distance estimates used as a building block in many sensor network applications. In large or long-lived deployments, it is important for the estimate to self-stabilize in response to changes in the network or ongoing computations, but existing algorithms may repair very slowly, produce distorted estimates, or stiffer large transients. The CRF-Gradient algorithm[1] addresses these shortcomings, and in this paper we prove that it self-stabilizes in O(diameter) time-more specifically, in 4 . diameter/c + k seconds, where k is a small constant and c is the minimum speed of multi-hop message propagation.
Details
- Title: Subtitle
- Fast Self-stabilization for Gradients
- Creators
- Jacob Beal - BBN Syst & Technol Corp, Cambridge, MA 02138 USAJonathan Bachrach - MIT, CSAIL, 77 Massachusetts Ave, Cambridge, MA 02139 USADan Vickery - MIT, CSAIL, 77 Massachusetts Ave, Cambridge, MA 02139 USAMark Tobenkin - MIT, CSAIL, 77 Massachusetts Ave, Cambridge, MA 02139 USA
- Contributors
- B Krishnamachari (Editor)S Suri (Editor)W Heinzelman (Editor)U Mitra (Editor)
- Resource Type
- Conference proceeding
- Publication Details
- DISTRIBUTED COMPUTING IN SENSOR SYSTEMS, PROCEEDINGS, Vol.5516, pp.15-27
- Publisher
- Springer Nature
- Series
- Lecture Notes in Computer Science
- DOI
- 10.1007/978-3-642-02085-8_2
- ISSN
- 0302-9743
- eISSN
- 1611-3349
- Number of pages
- 2
- Language
- English
- Date published
- 01/01/2009
- Academic Unit
- Electrical and Computer Engineering
- Record Identifier
- 9984627283602771
Metrics
1 Record Views