Token Dissemination in Geometric Dynamic Networks
Abshoff, Sebastian
Benter, Markus
Cord-Landwehr, Andreas
Malatyali, Manuel
Meyer auf der Heide, Friedhelm
ddc:040
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.
2013
info:eu-repo/semantics/conferenceObject
doc-type:conferenceObject
text
https://ris.uni-paderborn.de/record/477
Abshoff S, Benter M, Cord-Landwehr A, Malatyali M, Meyer auf der Heide F. Token Dissemination in Geometric Dynamic Networks. In: <i>Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers</i>. Lecture Notes in Computer Science. ; 2013:22-34. doi:<a href="https://doi.org/10.1007/978-3-642-45346-5_3">10.1007/978-3-642-45346-5_3</a>
info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-642-45346-5_3
info:eu-repo/semantics/closedAccess