10.46298/dmtcs.489
https://dmtcs.episciences.org/489
Pignolet, Yvonne Anne
Yvonne Anne
Pignolet
Schmid, Stefan
Stefan
Schmid
Wattenhofer, Roger
Roger
Wattenhofer
Tight Bounds for Delay-Sensitive Aggregation
Distributed Computing and Networking
This article studies the fundamental trade-off between delay and communication cost in networks. We consider an online optimization problem where nodes are organized in a tree topology. The nodes seek to minimize the time until the root is informed about the changes of their states and to use as few transmissions as possible. We derive an upper bound on the competitive ratio of O(min (h, c)) where h is the tree's height, and c is the transmission cost per edge. Moreover, we prove that this upper bound is tight in the sense that any oblivious algorithm has a ratio of at least Omega(min (h, c)). For chain networks, we prove a tight competitive ratio of Theta(min (root h, c)). Furthermore, we introduce a model for value-sensitive aggregation, where the cost depends on the number of transmissions and the error at the root.
episciences.org
Competitive Analysis
Wireless Sensor Networks
Distributed Algorithms
Aggregation
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
2015-06-09
2010-01-01
2010-01-01
en
journal article
https://hal.archives-ouvertes.fr/hal-00990442v1
1365-8050
https://dmtcs.episciences.org/489/pdf
VoR
application/pdf
Discrete Mathematics & Theoretical Computer Science
Vol. 12 no. 1
Distributed Computing and Networking
Researchers
Students