---
res:
bibo_abstract:
- "We consider the clock synchronization problem in the (discrete) beeping model:
Given a network of $n$ nodes with each node having a clock value $\\delta(v) \\in
\\{0,\\ldots T-1\\}$, the goal is to synchronize the clock values of all nodes
such that they have the same value in any round.\r\nAs is standard in clock synchronization,
we assume \\emph{arbitrary activations} for all nodes, i.e., the nodes start their
protocol at an arbitrary round (not limited to $\\{0,\\ldots,T-1\\}$).\r\nWe give
an asymptotically optimal algorithm that runs in $4D + \\Bigl\\lfloor \\frac{D}{\\lfloor
T/4 \\rfloor} \\Bigr \\rfloor \\cdot (T \\mod 4) = O(D)$ rounds, where $D$ is
the diameter of the network.\r\nOnce all nodes are in sync, they beep at the same
round every $T$ rounds.\r\nThe algorithm drastically improves on the $O(T D)$-bound
of \\cite{firefly_sync} (where $T$ is required to be at least $4n$, so the bound
is no better than $O(nD)$).\r\nOur algorithm is very simple as nodes only have
to maintain $3$ bits in addition to the $\\lceil \\log T \\rceil$ bits needed
to maintain the clock.\r\nFurthermore we investigate the complexity of \\emph{self-stabilizing}
solutions for the clock synchronization problem: We first show lower bounds of
$\\Omega(\\max\\{T,n\\})$ rounds on the runtime and $\\Omega(\\log(\\max\\{T,n\\}))$
bits of memory required for any such protocol.\r\nAfterwards we present a protocol
that runs in $O(\\max\\{T,n\\})$ rounds using at most $O(\\log(\\max\\{T,n\\}))$
bits at each node, which is asymptotically optimal with regards to both, runtime
and memory requirements.@eng"
bibo_authorlist:
- foaf_Person:
foaf_givenName: Michael
foaf_name: Feldmann, Michael
foaf_surname: Feldmann
foaf_workInfoHomepage: http://www.librecat.org/personId=23538
- foaf_Person:
foaf_givenName: Ardalan
foaf_name: Khazraei, Ardalan
foaf_surname: Khazraei
- foaf_Person:
foaf_givenName: Christian
foaf_name: Scheideler, Christian
foaf_surname: Scheideler
foaf_workInfoHomepage: http://www.librecat.org/personId=20792
bibo_doi: 10.1145/3350755.3400246
dct_date: 2020^xs_gYear
dct_language: eng
dct_publisher: ACM@
dct_title: Time- and Space-Optimal Discrete Clock Synchronization in the Beeping
Model@
...