We study two-party communication in the context of directed dynamic networks that are controlled by an adaptive adversary. This adversary is able to change all edges as long as the networks stay strongly-connected in each round. In this work, we establish a relation between counting the total number of nodes in the network and the problem of exchanging tokens between two communication partners which communicate through a dynamic network. We show that the communication problem for a constant fraction of n tokens in a dynamic network with n nodes is at most as hard as counting the number of nodes in a dynamic network with at most 4n + 3 nodes. For the proof, we construct a family of directed dynamic networks and apply a lower bound from two-party communication complexity. © 2013 Springer International Publishing.
CITATION STYLE
Abshoff, S., Benter, M., Malatyali, M., & Meyer Auf Der Heide, F. (2013). On two-party communication through dynamic networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8304 LNCS, pp. 11–22). https://doi.org/10.1007/978-3-319-03850-6_2
Mendeley helps you to discover research relevant for your work.