Brief Announcement: Deterministic Leader Election in Self-organizing Particle Systems

被引：0

作者：

Bazzi, Rida A. ^{[1
]}

Briones, Joseph L. ^{[1
]}

机构：

[1] Arizona State Univ, Tempe, AZ 85281 USA

来源：

STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2018 | 2018年 / 11201卷

关键词：

D O I：

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

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：381 / 386

页数：6

共 8 条

[1]

[Anonymous], 2015, P 2 ANN INT C NAN CO

[2] A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems [J].

Cannon, Sarah ;

Daymude, Joshua J. ;

Randall, Dana ;

Richa, Andrea W. .

PROCEEDINGS OF THE 2016 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC'16), 2016, :279-288

[3]

Daymude Joshua J., 2017, Algorithms for Sensor Systems. 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2017. Revised Selected Papers: LNCS 10718, P127, DOI 10.1007/978-3-319-72751-6_10

[4] Universal coating for programmable matter [J].