Brief announcement: Deterministic leader election in self-organizing particle systems

Rida Bazzi, Joseph L. Briones

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

We consider the leader election problem in the geometric Amoebot model in which nodes have no unique identifiers and only share a common local sense of direction. Unlike other works, we consider the deterministic leader election problem for general connected systems. We propose a new deterministic leader election protocol that always succeeds in finding 1, 2, 3, or 6 leaders. We show that if the protocol does not elect a unique leader, deterministic leader election impossible for the system.

Original languageEnglish (US)
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings
EditorsTaisuke Izumi, Petr Kuznetsov
PublisherSpringer Verlag
Pages381-386
Number of pages6
ISBN (Print)9783030032319
DOIs
StatePublished - Jan 1 2018
Event20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018 - Tokyo, Japan
Duration: Nov 4 2018Nov 7 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11201 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018
CountryJapan
CityTokyo
Period11/4/1811/7/18

Fingerprint

Self-organizing Systems
Leader Election
Particle System
Geometric Model
Vertex of a graph

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Bazzi, R., & Briones, J. L. (2018). Brief announcement: Deterministic leader election in self-organizing particle systems. In T. Izumi, & P. Kuznetsov (Eds.), Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings (pp. 381-386). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11201 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-03232-6_25

Brief announcement : Deterministic leader election in self-organizing particle systems. / Bazzi, Rida; Briones, Joseph L.

Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings. ed. / Taisuke Izumi; Petr Kuznetsov. Springer Verlag, 2018. p. 381-386 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11201 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bazzi, R & Briones, JL 2018, Brief announcement: Deterministic leader election in self-organizing particle systems. in T Izumi & P Kuznetsov (eds), Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11201 LNCS, Springer Verlag, pp. 381-386, 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2018, Tokyo, Japan, 11/4/18. https://doi.org/10.1007/978-3-030-03232-6_25
Bazzi R, Briones JL. Brief announcement: Deterministic leader election in self-organizing particle systems. In Izumi T, Kuznetsov P, editors, Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings. Springer Verlag. 2018. p. 381-386. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-03232-6_25
Bazzi, Rida ; Briones, Joseph L. / Brief announcement : Deterministic leader election in self-organizing particle systems. Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings. editor / Taisuke Izumi ; Petr Kuznetsov. Springer Verlag, 2018. pp. 381-386 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{eefbfc90d5a74f69bced1d45b28260c7,
title = "Brief announcement: Deterministic leader election in self-organizing particle systems",
abstract = "We consider the leader election problem in the geometric Amoebot model in which nodes have no unique identifiers and only share a common local sense of direction. Unlike other works, we consider the deterministic leader election problem for general connected systems. We propose a new deterministic leader election protocol that always succeeds in finding 1, 2, 3, or 6 leaders. We show that if the protocol does not elect a unique leader, deterministic leader election impossible for the system.",
author = "Rida Bazzi and Briones, {Joseph L.}",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-030-03232-6_25",
language = "English (US)",
isbn = "9783030032319",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "381--386",
editor = "Taisuke Izumi and Petr Kuznetsov",
booktitle = "Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings",

}

TY - GEN

T1 - Brief announcement

T2 - Deterministic leader election in self-organizing particle systems

AU - Bazzi, Rida

AU - Briones, Joseph L.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - We consider the leader election problem in the geometric Amoebot model in which nodes have no unique identifiers and only share a common local sense of direction. Unlike other works, we consider the deterministic leader election problem for general connected systems. We propose a new deterministic leader election protocol that always succeeds in finding 1, 2, 3, or 6 leaders. We show that if the protocol does not elect a unique leader, deterministic leader election impossible for the system.

AB - We consider the leader election problem in the geometric Amoebot model in which nodes have no unique identifiers and only share a common local sense of direction. Unlike other works, we consider the deterministic leader election problem for general connected systems. We propose a new deterministic leader election protocol that always succeeds in finding 1, 2, 3, or 6 leaders. We show that if the protocol does not elect a unique leader, deterministic leader election impossible for the system.

UR - http://www.scopus.com/inward/record.url?scp=85056484757&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85056484757&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-03232-6_25

DO - 10.1007/978-3-030-03232-6_25

M3 - Conference contribution

AN - SCOPUS:85056484757

SN - 9783030032319

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 381

EP - 386

BT - Stabilization, Safety, and Security of Distributed Systems - 20th International Symposium, SSS 2018, Proceedings

A2 - Izumi, Taisuke

A2 - Kuznetsov, Petr

PB - Springer Verlag

ER -