On Two-Party Communication through Dynamic Networks

  • Sebastian Abshoff
  • Markus Benter
  • Manuel Malatyali
  • Friedhelm Meyer auf der Heide
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8304)


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.


Directed Dynamic Networks Two-Party Communication Counting Token Dissemination Communication Complexity 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Biely, M., Robinson, P., Schmid, U.: Agreement in directed dynamic networks. In: SIROCCO, pp. 73–84 (2012)Google Scholar
  2. 2.
    Brandes, P., Meyer auf der Heide, F.: Distributed computing in fault-prone dynamic networks. In: TADDS, pp. 9–14 (2012)Google Scholar
  3. 3.
    Dutta, C., Pandurangan, G., Rajaraman, R., Sun, Z., Viola, E.: On the complexity of information spreading in dynamic networks. In: SODA, pp. 717–736 (2013)Google Scholar
  4. 4.
    Frischknecht, S., Holzer, S., Wattenhofer, R.: Networks cannot compute their diameter in sublinear time. In: SODA, pp. 1150–1162 (2012)Google Scholar
  5. 5.
    Haeupler, B., Karger, D.R.: Faster information dissemination in dynamic networks via network coding. In: PODC, pp. 381–390 (2011)Google Scholar
  6. 6.
    Kuhn, F., Lenzen, C., Locher, T., Oshman, R.: Optimal gradient clock synchronization in dynamic networks. In: PODC, pp. 430–439 (2010)Google Scholar
  7. 7.
    Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: STOC, pp. 513–522 (2010)Google Scholar
  8. 8.
    Kuhn, F., Moses, Y., Oshman, R.: Coordinated consensus in dynamic networks. In: PODC, pp. 1–10 (2011)Google Scholar
  9. 9.
    Kuhn, F., Oshman, R.: Dynamic networks: models and algorithms. SIGACT News 42(1), 82–96 (2011)CrossRefGoogle Scholar
  10. 10.
    Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Brief announcement: Naming and counting in anonymous unknown dynamic networks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 437–438. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  11. 11.
    Michail, O., Chatzigiannakis, I., Spirakis, P.G.: Causality, influence, and computation in possibly disconnected synchronous dynamic networks. In: Baldoni, R., Flocchini, P., Binoy, R. (eds.) OPODIS 2012. LNCS, vol. 7702, pp. 269–283. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  12. 12.
    O’Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: DIALM-POMC, pp. 104–110 (2005)Google Scholar
  13. 13.
    Oshman, R.: Distributed Computation in Wireless and Dynamic Networks. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, MA 02139 (September 2012)Google Scholar
  14. 14.
    Sarma, A.D., Holzer, S., Kor, L., Korman, A., Nanongkai, D., Pandurangan, G., Peleg, D., Wattenhofer, R.: Distributed verification and hardness of distributed approximation. SIAM J. Comput. 41(5), 1235–1265 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Das Sarma, A., Molla, A.R., Pandurangan, G.: Fast distributed computation in dynamic networks via random walks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 136–150. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  16. 16.
    Yao, A.C.-C.: Some complexity questions related to distributive computing (preliminary report). In: STOC, pp. 209–213 (1979)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Sebastian Abshoff
    • 1
  • Markus Benter
    • 1
  • Manuel Malatyali
    • 1
  • Friedhelm Meyer auf der Heide
    • 1
  1. 1.Heinz Nixdorf Institute & Computer Science DepartmentUniversity of PaderbornPaderbornGermany

Personalised recommendations