Flexible self-healing gradients

• Authors: Jacob Beal
• Venue: Proceedings of the 2009 ACM symposium on Applied Computing
• Year: 2009

Self-healing gradients are distributed estimates of the distance from each device in a network to the nearest device designated as a source, and are used in many pervasive computing systems. With previous self-healing gradient algorithms, even the smallest changes in the source or network can produce small estimate changes throughout the network, leading to high communication and energy costs. We observe, however, that in many applications, such as routing and geometric restriction of processes, devices far from the source need only coarse estimates, and that a device need not communicate when its estimate does not change. We have therefore developed Flex-Gradient, a new self-healing gradient algorithm with a tunable trade-off between precision and communication cost. When distance is estimated using Flex-Gradient, the constraints between neighboring devices are flexible, allowing estimates to vary by an amount proportional to a device's distance to the source. Frequent small changes in the network or source thus cause frequent estimate changes only within a distance proportional to the magnitude of the change, as verified in simulation on a network of 1000 devices. This can enable drastic reductions in the communication and energy cost of gradient-based algorithms.