research-article

Line Recovery by Programmable Particles

Authors:

Giuseppe Antonio Di Luna,

Paola Flocchini,

Giuseppe Prencipe,

Nicola Santoro,

Giovanni VigliettaAuthors Info & Claims

ICDCN '18: Proceedings of the 19th International Conference on Distributed Computing and Networking

Article No.: 4, Pages 1 - 10

https://doi.org/10.1145/3154273.3154309

Published: 04 January 2018 Publication History

Abstract

Shape formation has been recently studied in distributed systems of programmable particles. In this paper we consider the shape recovery problem of restoring the shape when f of the n particles have crashed. We focus on the basic line shape, used as a tool for the construction of more complex configurations.

We present a solution to the line recovery problem by the non-faulty anonymous particles; the solution works regardless of the initial distribution and number f < n -4 of faults, of the local orientations of the non-faulty entities, and of the number of non-faulty entities activated in each round (i.e., semi-synchronous adversarial scheduler).

References

[1]

N. Agmon and D. Peleg. Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM Journal on Computing, 36(1):56--82, 2006.

Digital Library

[2]

S. Cannon, J.J. Daymude, D. Randall, and A.W. Richa. A Markov chain algorithm for compression in self-organizing particle systems. In Proceedings of the 35th ACM Symposium on Principles of Distributed Computing, 279--288, 2016.

Digital Library

[3]

M. Cieliebak, P. Flocchini, G. Prencipe, and N. Santoro. Distributed computing by mobile robots: gathering. SIAM Journal on Computing, 41(4):829--879, 2012.

[4]

G.A. Di Luna, P. Flocchini, N. Santoro, G. Viglietta, and Y. Yamauchi. Brief Announcement: Shape formation by programmable particles. In Proceedings of the 31st International Symposium on Distributed Computing, to appear, 2017.

[5]

G.A. Di Luna, P. Flocchini, G. Prencipe, N. Santoro, and G. Viglietta. A Rupestrian algorithm. In Proceedings of 8th International Conference on Fun with Algorithms, 14:1--14:20, 2016.

[6]

G.A. Di Luna, P. Flocchini, G. Prencipe, N. Santoro, and G. Viglietta. Line-Recovery by Programmable Particles. Manuscript arXiv:1707.05041, 2017.

[7]

Z. Derakhshandeh, S. Dolev, R. Gmyr, A.W. Richa, C. Scheideler, and T. Strothmann. Brief announcement: Amoebot - a new model for programmable matter. In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 220--222, 2014.

Digital Library

[8]

J.J Daymude, Z. Derakhshandeh, R. Gmyr, A. Porter, A.W. Richa, C. Scheideler, and T. Strothmann. On the runtime of universal coating for programmable matter. In Proceedings of 22nd International Conference on DNA Computing and Molecular Programming, 148--164, 2016.

[9]

J.J. Daymude, R. Gmyr, A.W. Richa, C. Scheideler, and T. Strothmann. Improved leader election for self-organizing programmable matter. arXiv:1701.03616, 2017.

[10]

Z. Derakhshandeh, R. Gmyr, A.W. Richa, C. Scheideler, and T. Strothmann. Universal shape formation for programmable matter. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 289--299, 2016.

Digital Library

[11]

Z. Derakhshandeh, R. Gmyr, A.W. Richa, C. Scheideler, and T. Strothmann. An algorithmic framework for shape formation problems in self-organizing particle systems. In Proceedings of the 2nd International Conference on Nanoscale Computing and Communication, 21:1--21:2, 2015.

Digital Library

[12]

Z. Derakhshandeh, R. Gmyr, T. Strothmann, R.A. Bazzi, A.W. Richa, and C. Scheideler. Leader election and shape formation with self-organizing programmable matter. In Proceedings of the 21st International Conference on DNA Computing and Molecular Programming, 117--132, 2015.

Digital Library

[13]

Z. Derakhshandeh, R. Gmyr, A.W. Richa, C. Scheideler, and T. Strothmann. Universal coating for programmable matter. Theoretical Computer Science, to appear, 2017.

[14]

S. Dolev, S. Frenkel, M. Rosenbli, P. Narayanan, and K.M. Venkateswarlu. In-vivo energy harvesting nano robots. In the 3rd IEEE International Conference on the Science of Electrical Engineering, 1--5, 2016.

[15]

Y. Emek, T. Langner, J. Uitto, R. Wattenhofer. Solving the ANTS problem with asynchronous finite state machines. In Proceedings of the 41st International Colloquium on Automata, Languages, and Programming, 471--482, 2014.

[16]

P. Flocchini, G. Prencipe, and N. Santoro. Distributed computing by oblivious mobile robots. Morgan & Claypool, 2012.

Digital Library

[17]

P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theoretical Computer Science, 407(1):412--447, 2008.

Digital Library

[18]

N. Fujinaga, Y. Yamauchi, S. Kijima, and M. Yamashita. Pattern formation by oblivious asynchronous mobile robots. SIAM Journal of Computing, 44(3):740--785, 2016.

[19]

M.J. Patitz. An introduction to tile-based self-assembly and a survey of recent results. Natural Computing, 13(2):195--224, 2014.

[20]

I. Suzuki and M. Yamashita. Distributed anonymous mobile robots: formation of geometric patterns. SIAM Journal on Computing, 28(4):1347--1363, 1999.

Digital Library

[21]

T. Toffoli and N. Margolus. Programmable matter: concepts and realization. Physica D: Nonlinear Phenomena, 47(1):263--272, 1991.

Digital Library

[22]

J.E. Walter, J.L. Welch, and N.M. Amato. Distributed reconfiguration of metamorphic robot chains. Distributed Computing, 17(2):171--189, 2004.

Digital Library

[23]

Y. Yamauchi, T. Uehara, S. Kijima, and M. Yamashita. Plane formation by synchronous mobile robots in the three dimensional euclidean space. Journal of the ACM, 64(3):1--43, 2017.

Digital Library

Cited By

Nokhanji NFlocchini PSantoro N(2023)Dynamic Line Maintenance by Hybrid Programmable MatterInternational Journal of Networking and Computing10.15803/ijnc.13.1_1813:1(18-47)Online publication date: 2023
https://doi.org/10.15803/ijnc.13.1_18
Daymude JRicha AScheideler C(2023)The canonical amoebot model: algorithms and concurrency controlDistributed Computing10.1007/s00446-023-00443-336:2(159-192)Online publication date: 17-Feb-2023
https://doi.org/10.1007/s00446-023-00443-3
Nokhanji NFlocchini PSantoro N(2022)Fully Dynamic Line Maintenance by a Simple Robot2022 8th International Conference on Automation, Robotics and Applications (ICARA)10.1109/ICARA55094.2022.9738561(108-112)Online publication date: 18-Feb-2022
https://doi.org/10.1109/ICARA55094.2022.9738561
Show More Cited By

Index Terms

Line Recovery by Programmable Particles
1. Computer systems organization
  1. Dependable and fault-tolerant systems and networks
    1. Redundancy
  2. Embedded and cyber-physical systems
    1. Embedded systems
    2. Robotics
2. Networks
  1. Network properties
    1. Network reliability

Recommendations

Line Reconfiguration by Programmable Particles Maintaining Connectivity
Theory and Practice of Natural Computing
Abstract
In the geometric Amoebot model, programmable matter is viewed as a very large number of identical micro/nano-sized entities, called particles, operating on a hexagonal tessellation of the plane, with limited computational capabilities, interacting ...
Antecedence Graph Approach to Checkpointing for Fault Tolerance in Mobile Agent Systems

The flexibility offered by mobile agents is quite noticeable in distributed computing environments. However, the greater flexibility of the mobile agent paradigm compared to the client/server computing paradigm comes at an additional threats since agent ...
A Dynamic Shadow Approach to Fault-Tolerant Mobile Agents in an Autonomic Environment

Large-scale distributed applications such as online information retrieval and collaboration over computational elements demand an approach to self-managed computing systems with a minimum of human interference. However, large scales and full ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ICDCN '18: Proceedings of the 19th International Conference on Distributed Computing and Networking

January 2018

494 pages

ISBN:9781450363723

DOI:10.1145/3154273

Copyright © 2018 ACM.

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]

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 January 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Conference

ICDCN '18

ICDCN '18: 19th International Conference on Distributed Computing and Networking

January 4 - 7, 2018

Varanasi, India

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
113
Total Downloads

Downloads (Last 12 months)6
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Nokhanji NFlocchini PSantoro N(2023)Dynamic Line Maintenance by Hybrid Programmable MatterInternational Journal of Networking and Computing10.15803/ijnc.13.1_1813:1(18-47)Online publication date: 2023
https://doi.org/10.15803/ijnc.13.1_18
Daymude JRicha AScheideler C(2023)The canonical amoebot model: algorithms and concurrency controlDistributed Computing10.1007/s00446-023-00443-336:2(159-192)Online publication date: 17-Feb-2023
https://doi.org/10.1007/s00446-023-00443-3
Nokhanji NFlocchini PSantoro N(2022)Fully Dynamic Line Maintenance by a Simple Robot2022 8th International Conference on Automation, Robotics and Applications (ICARA)10.1109/ICARA55094.2022.9738561(108-112)Online publication date: 18-Feb-2022
https://doi.org/10.1109/ICARA55094.2022.9738561
Kant KPattanayak DMandal P(2021)Fort Formation by an Automaton2021 International Conference on COMmunication Systems & NETworkS (COMSNETS)10.1109/COMSNETS51098.2021.9352839(540-547)Online publication date: 5-Jan-2021
https://doi.org/10.1109/COMSNETS51098.2021.9352839
D'Angelo GD'Emidio MDas SNavarra APrencipe GEl Fallah Seghrouchni ASukthankar GAn BYorke-Smith N(2020)Leader Election and Compaction for Asynchronous Silent Programmable MatterProceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3398761.3398798(276-284)Online publication date: 5-May-2020
https://dl.acm.org/doi/10.5555/3398761.3398798
Di Luna GAnceaume EBonomi SQuerzoni L(2020)Synchronous Byzantine Lattice Agreement in O(log(f) Rounds2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS47774.2020.00056(146-156)Online publication date: Nov-2020
https://doi.org/10.1109/ICDCS47774.2020.00056
Almethen AMichail OPotapov I(2020)Pushing lines helps: Efficient universal centralised transformations for programmable matterTheoretical Computer Science10.1016/j.tcs.2020.04.026Online publication date: May-2020
https://doi.org/10.1016/j.tcs.2020.04.026
Nokhanji NSantoro N(2020)Line Reconfiguration by Programmable Particles Maintaining ConnectivityTheory and Practice of Natural Computing10.1007/978-3-030-63000-3_13(157-169)Online publication date: 30-Nov-2020
https://doi.org/10.1007/978-3-030-63000-3_13
Di Luna GFlocchini PSantoro NViglietta GYamauchi Y(2019)Shape formation by programmable particlesDistributed Computing10.1007/s00446-019-00350-6Online publication date: 16-Mar-2019
https://doi.org/10.1007/s00446-019-00350-6
Almethen AMichail OPotapov I(2019)Pushing Lines Helps: Efficient Universal Centralised Transformations for Programmable MatterAlgorithms for Sensor Systems10.1007/978-3-030-34405-4_3(41-59)Online publication date: 5-Nov-2019
https://doi.org/10.1007/978-3-030-34405-4_3
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents