论文标题
领导者选举和3D可编程问题的本地标识符
Leader Election And Local Identifiers For 3D Programmable Matter
论文作者
论文摘要
在本文中，我们介绍了两种确定性的领导者选举算法，用于以面部为中心的立方网格。以面部为中心的立方网格是一个3维的12个规范无限网格，它代表了3维空间中包装球（即在可编程物质的上下文中的球形颗粒或模块的最佳方法）。虽然第一个领导者选举算法需要关于粒子的初始配置的强烈假设，并且对粒子形成的系统配置没有假设，但第二个关于颗粒的初始配置的假设较少，但对所有可能的粒子的排列不起作用。我们还描述了一种将本地标识符计算到该网格中的粒子的方法，其中记忆空间不取决于粒子的数量。 A-Local标识符是分配给每个粒子的变量，以使每个粒子最多都具有不同的标识符。
In this paper, we present two deterministic leader election algorithms for programmable matter on the face-centered cubic grid. The face-centered cubic grid is a 3-dimensional 12-regular infinite grid that represents an optimal way to pack spheres (i.e., spherical particles or modules in the context of the programmable matter) in the 3-dimensional space. While the first leader election algorithm requires a strong hypothesis about the initial configuration of the particles and no hypothesis on the system configurations that the particles are forming, the second one requires fewer hypothesis about the initial configuration of the particles but does not work for all possible particles' arrangement. We also describe a way to compute and assign-local identifiers to the particles in this grid with a memory space not dependent on the number of particles. A-local identifier is a variable assigned to each particle in such a way that particles at distance at most each have a different identifier.
