Throughput and Packet Displacements of Dynamic Broadcasting Algorithms

  • Mark de BergEmail author
  • Corrie Jacobien Carstens
  • Michel Mandjes
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11931)


Most dynamic broadcasting algorithms focus on maximizing throughput. We present several broadcasting algorithms focusing on low maximum displacement, that is, that limit how far out of order packets may be received. Experiments show that in many settings our algorithms have smaller displacement than existing algorithms, while still guaranteeing high throughput. As a result of independent interest, we show that modelling decisions on the order of edge activations in one round of a broadcasting algorithm can have substantial impact on the throughput.


  1. 1.
    Conti, M., Giordano, S.: Mobile ad hoc networking: milestones, challenges, and new research directions. IEEE Commun. Mag. 52(1), 85–96 (2014)CrossRefGoogle Scholar
  2. 2.
    Deshpande, H., Bawa, M., Garcia-Molina, H.: Streaming live media over peers. Technical report 2002–21, Stanford InfoLab (2002)Google Scholar
  3. 3.
    Edmonds, J.: Edge-disjoint branchings. In: Rustin, R. (ed.) Combinatorial Algorithms, pp. 91–96. Algorithmics Press (1972)Google Scholar
  4. 4.
    Gandhi, R., Mishra, A., Parthasarathy, S.: Minimizing broadcast latency and redundancy in ad hoc networks. IEEE/ACM Trans. Netw. 16(4), 840–851 (2008)CrossRefGoogle Scholar
  5. 5.
    Haenggi, M., Andrews, J.G., Baccelli, F., Dousse, O., Franceschetti, M.: Stochastic geometry and random graphs for the analysis and design of wireless networks. IEEE J. Sel. Areas Commun. 27(7), 1029–1046 (2009)CrossRefGoogle Scholar
  6. 6.
    Keshavarz-Haddad, A., Ribeiro, V., Riedi, R.: Broadcast capacity in multihop wireless networks. In Proceedings of the 12th Annual International Conference on Mobile Computing and Networking, pp. 239–250 (2006)Google Scholar
  7. 7.
    Kundu, S.: Bounds on the number of disjoint spanning trees. J. Comb. Theory 17, 199–203 (1974)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Massoulié, L., Twigg, A., Gkantsidis, C., Rodriguez, P.: Randomized decentralized broadcasting algorithms. In: Proceedings of the 26th IEEE International Conference on Computer Communications, pp. 1073–1081 (2007)Google Scholar
  9. 9.
    Neely, M.J.: Stochastic Network Optimization with Application to Communication and Queueing Systems, vol. 3. Morgan & Claypool Publishers, San Rafael (2010)zbMATHGoogle Scholar
  10. 10.
    Rajaraman, R.: Topology control and routing in ad hoc networks: a survey. SIGACT News 33(2), 60–73 (2002)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Sinha, A., Paschos, G., Li, C., Modiano, E.: Throughput-optimal broadcast on directed acyclic graphs. In: Proceedings of the IEEE Conference on Computer Communications, INFOCOM 2015, pp. 1248–1256 (2015)Google Scholar
  12. 12.
    Sinha, A., Paschos, G., Modiano, E.: Throughput-optimal multi-hop broadcast algorithms. In: Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 51–60 (2016)Google Scholar
  13. 13.
    Sinha, A., Tassiulas, L., Modiano, E.: Throughput-optimal broadcast in wireless networks with dynamic topology. In: Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 21–30 (2016)Google Scholar
  14. 14.
    Tassiulas, L., Ephremides, A.: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Autom. Control 37(12), 1936–1948 (1992)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Towsley, D., Twigg, A.: Rate-optimal decentralized broadcasting: the wireless case. In: International Technology Alliance, pp. 323–333 (2008)Google Scholar
  16. 16.
    Williams, B., Camp, T.: Comparison of broadcasting techniques for mobile ad hoc networks. In: Proceedings 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 194–205 (2002)Google Scholar
  17. 17.
    Zanella, A., Pierobon, G., Merlin, S.: On the limiting performance of broadcast algorithms over unidimensional ad-hoc radio networks. In: Proceedings of WMPC, pp. 165–169 (2004)Google Scholar
  18. 18.
    Zhang, Z.: Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges. IEEE Commun. Surv. Tutor. 8(1), 24–37 (2006)CrossRefGoogle Scholar
  19. 19.
    Zukerman, M.: Introduction to Queueing Theory and Stochastic Teletraffic Models. (2018)

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Mark de Berg
    • 1
    Email author
  • Corrie Jacobien Carstens
    • 2
  • Michel Mandjes
    • 2
  1. 1.Department of Mathematics and Computer ScienceTU EindhovenEindhovenThe Netherlands
  2. 2.Korteweg-de Vries Institute for MathematicsAmsterdamThe Netherlands

Personalised recommendations