Abstract
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.
Funded by the NWO Gravitation project NETWORKS, grant no. 024.002.003.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In the anycast setting packets have a set of one or more destination nodes and leave the network when they reach any one of these nodes.
References
Conti, M., Giordano, S.: Mobile ad hoc networking: milestones, challenges, and new research directions. IEEE Commun. Mag. 52(1), 85–96 (2014)
Deshpande, H., Bawa, M., Garcia-Molina, H.: Streaming live media over peers. Technical report 2002–21, Stanford InfoLab (2002)
Edmonds, J.: Edge-disjoint branchings. In: Rustin, R. (ed.) Combinatorial Algorithms, pp. 91–96. Algorithmics Press (1972)
Gandhi, R., Mishra, A., Parthasarathy, S.: Minimizing broadcast latency and redundancy in ad hoc networks. IEEE/ACM Trans. Netw. 16(4), 840–851 (2008)
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)
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)
Kundu, S.: Bounds on the number of disjoint spanning trees. J. Comb. Theory 17, 199–203 (1974)
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)
Neely, M.J.: Stochastic Network Optimization with Application to Communication and Queueing Systems, vol. 3. Morgan & Claypool Publishers, San Rafael (2010)
Rajaraman, R.: Topology control and routing in ad hoc networks: a survey. SIGACT News 33(2), 60–73 (2002)
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)
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)
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)
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)
Towsley, D., Twigg, A.: Rate-optimal decentralized broadcasting: the wireless case. In: International Technology Alliance, pp. 323–333 (2008)
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)
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)
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)
Zukerman, M.: Introduction to Queueing Theory and Stochastic Teletraffic Models. https://arxiv.org/abs/1307.2968 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
de Berg, M., Carstens, C.J., Mandjes, M. (2019). Throughput and Packet Displacements of Dynamic Broadcasting Algorithms. In: Dressler, F., Scheideler, C. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2019. Lecture Notes in Computer Science(), vol 11931. Springer, Cham. https://doi.org/10.1007/978-3-030-34405-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-34405-4_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-34404-7
Online ISBN: 978-3-030-34405-4
eBook Packages: Computer ScienceComputer Science (R0)