Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1529282.1529550acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

Flexible self-healing gradients

Published: 08 March 2009 Publication History

Abstract

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.

References

[1]
J. Bachrach and J. Beal. Programming a sensor network as an amorphous medium. In Distributed Computing in Sensor Systems (DCOSS) 2006 Poster, June 2006.
[2]
J. Bachrach, R. Nagpal, M. Salib, and H. Shrobe. Experimental results and theoretical analysis of a self-organizing global coordinate system for ad hoc sensor networks. Telecommunications Systems Journal, Special Issue on Wireless System Networks, 2003.
[3]
J. Beal, J. Bachrach, D. Vickery, and M. Tobenkin. Fast self-healing gradients. In ACM Symposium on Applied Computing, March 2008.
[4]
W. Butera. Programming a Paintable Computer. PhD thesis, MIT, 2002.
[5]
L. Clement and R. Nagpal. Self-assembly and self-repairing topologies. In Workshop on Adaptability in Multi-Agent Systems, RoboCup Australian Open, Jan. 2003.
[6]
Q. Fang, J. Gao, L. Guibas, V. de Silva, and L. Zhang. Glider: Gradient landmark-based distributed routing for sensor networks. In INFOCOM 2005, March 2005.
[7]
C. Intanagonwiwat, R. Govindan, and D. Estrin. Directed diffusion: A scalable and robust communication paradigm for sensor networks. In Sixth Annual International Conference on Mobile Computing and Networking (MobiCOM '00), August 2000.
[8]
H. Luo, F. Ye, J. Cheng, S. Lu, and L. Zhang. Ttdd: A two-tier data dissemination model for large-scale wireless sensor networks. Journal of Mobile Networks and Applications (MONET), 2003.
[9]
M. Mamei, F. Zambonelli, and L. Leonardi. Co-fields: an adaptive approach for motion coordination. Technical Report 5--2002, University of Modena and Reggio Emilia, 2002.
[10]
F. Ye, G. Zhong, S. Lu, and L. Zhang. Gradient broadcast: a robust data delivery protocol for large scale sensor networks. ACM Wireless Networks (WINET), 11(3): 285--298, 2005.

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SAC '09: Proceedings of the 2009 ACM symposium on Applied Computing
March 2009
2347 pages
ISBN:9781605581668
DOI:10.1145/1529282
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 March 2009

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. amorphous computing
  2. spatial computing

Qualifiers

  • Research-article

Conference

SAC09
Sponsor:
SAC09: The 2009 ACM Symposium on Applied Computing
March 8, 2009 - March 12, 2008
Hawaii, Honolulu

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)6
  • Downloads (Last 6 weeks)1
Reflects downloads up to 18 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)The eXchange Calculus (XC)Journal of Systems and Software10.1016/j.jss.2024.111976210:COnline publication date: 1-Apr-2024
  • (2024)A general framework and decentralised algorithms for collective computational processesFuture Generation Computer Systems10.1016/j.future.2024.04.020158(11-27)Online publication date: Sep-2024
  • (2022)Aggregate processes as distributed adaptive services for the Industrial Internet of ThingsPervasive and Mobile Computing10.1016/j.pmcj.2022.10165885:COnline publication date: 1-Sep-2022
  • (2020)FCPP: an efficient and extensible Field Calculus framework2020 IEEE International Conference on Autonomic Computing and Self-Organizing Systems (ACSOS)10.1109/ACSOS49614.2020.00037(153-159)Online publication date: Aug-2020
  • (2020)Resilient Distributed Collection Through Information Speed ThresholdsCoordination Models and Languages10.1007/978-3-030-50029-0_14(211-229)Online publication date: 10-Jun-2020
  • (2019)Effective Collective Summarisation of Distributed Data in Mobile Multi-Agent SystemsProceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3306127.3331882(1618-1626)Online publication date: 8-May-2019
  • (2019)Robustness of the Adaptive Bellman –Ford Algorithm: Global Stability and Ultimate BoundsIEEE Transactions on Automatic Control10.1109/TAC.2019.290423964:10(4121-4136)Online publication date: Oct-2019
  • (2019)From distributed coordination to field calculus and aggregate computingJournal of Logical and Algebraic Methods in Programming10.1016/j.jlamp.2019.100486(100486)Online publication date: Sep-2019
  • (2018)Engineering Resilient Collective Adaptive Systems by Self-StabilisationACM Transactions on Modeling and Computer Simulation10.1145/317777428:2(1-28)Online publication date: 9-Mar-2018
  • (2018)Robust Stability of Spreading Blocks in Aggregate Computing2018 IEEE Conference on Decision and Control (CDC)10.1109/CDC.2018.8618735(6007-6012)Online publication date: 17-Dec-2018
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media