---
res:
bibo_abstract:
- We consider the k-token dissemination problem, where k initially arbitrarily distributed
tokens have to be disseminated to all nodes in a dynamic network (as introduced
by Kuhn et al., STOC 2010). In contrast to general dynamic networks, our dynamic
networks are unit disk graphs, i.e., nodes are embedded into the Euclidean plane
and two nodes are connected if and only if their distance is at most R. Our worst-case
adversary is allowed to move the nodes on the plane, but the maximum velocity
v_max of each node is limited and the graph must be connected in each round. For
this model, we provide almost tight lower and upper bounds for k-token dissemination
if nodes are restricted to send only one token per round. It turns out that the
maximum velocity v_max is a meaningful parameter to characterize dynamics in our
model.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Sebastian
foaf_name: Abshoff, Sebastian
foaf_surname: Abshoff
- foaf_Person:
foaf_givenName: Markus
foaf_name: Benter, Markus
foaf_surname: Benter
- foaf_Person:
foaf_givenName: Andreas
foaf_name: Cord-Landwehr, Andreas
foaf_surname: Cord-Landwehr
- foaf_Person:
foaf_givenName: Manuel
foaf_name: Malatyali, Manuel
foaf_surname: Malatyali
- foaf_Person:
foaf_givenName: Friedhelm
foaf_name: Meyer auf der Heide, Friedhelm
foaf_surname: Meyer auf der Heide
foaf_workInfoHomepage: http://www.librecat.org/personId=15523
bibo_doi: 10.1007/978-3-642-45346-5_3
dct_date: 2013^xs_gYear
dct_title: Token Dissemination in Geometric Dynamic Networks@
...