Leader Election and Shape Formation with Self-organizing Programmable Matter

  • Zahra Derakhshandeh
  • Robert Gmyr
  • Thim Strothmann
  • Rida Bazzi
  • Andréa W. Richa
  • Christian Scheideler
Conference paper

DOI: 10.1007/978-3-319-21999-8_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9211)
Cite this paper as:
Derakhshandeh Z., Gmyr R., Strothmann T., Bazzi R., Richa A.W., Scheideler C. (2015) Leader Election and Shape Formation with Self-organizing Programmable Matter. In: Phillips A., Yin P. (eds) DNA Computing and Molecular Programming. DNA 2015. Lecture Notes in Computer Science, vol 9211. Springer, Cham

Abstract

In this paper we consider programmable matter consisting of simple computational elements, called particles, that can establish and release bonds and can actively move in a self-organized way, and we investigate the feasibility of solving fundamental problems relevant for programmable matter. As a model for such self-organizing particle systems, we will use a generalization of the geometric amoebot model first proposed in [21]. Based on the geometric model, we present efficient local-control algorithms for leader election and line formation requiring only particles with constant size memory, and we also discuss the limitations of solving these problems within the general amoebot model.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Zahra Derakhshandeh
    • 1
  • Robert Gmyr
    • 2
  • Thim Strothmann
    • 2
  • Rida Bazzi
    • 1
  • Andréa W. Richa
    • 1
  • Christian Scheideler
    • 2
  1. 1.Computer Science, CIDSEArizona State UniversityTempeUSA
  2. 2.Department of Computer ScienceUniversity of PaderbornPaderbornGermany

Personalised recommendations