Document Open Access Logo

Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks

Authors Aris Pagourtzis , Tomasz Radzik



PDF
Thumbnail PDF

File

LIPIcs.MFCS.2018.80.pdf
  • Filesize: 450 kB
  • 13 pages

Document Identifiers

Author Details

Aris Pagourtzis
  • School of ECE, National Technical University of Athens, Athens, Greece
Tomasz Radzik
  • Department of Informatics, King’s College London, London, the United Kingdom

Cite AsGet BibTex

Aris Pagourtzis and Tomasz Radzik. Tight Bounds for Deterministic h-Shot Broadcast in Ad-Hoc Directed Radio Networks. In 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 117, pp. 80:1-80:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.MFCS.2018.80

Abstract

We consider the classical broadcast problem in ad-hoc (that is, unknown topology) directed radio networks with no collision detection, under the additional assumption that at most h transmissions (shots) are available per node. We focus on adaptive deterministic protocols for small values of h. We provide asymptotically matching lower and upper bounds for the cases h=2 and h=3. While for h=2 our bound is quadratic, similar to the bound obtained for oblivious protocols, for h=3 we prove a sub-quadratic bound of Theta(n^2 log log n / log n), where n is the number of nodes in the network. The latter is the first result showing an adaptive algorithm which is asymptotically faster than oblivious h-shot broadcast protocols, for which a tight quadratic bound is known for every constant h. Our upper bound for h=3 is constructive, making use of constructions of graphs with large girth. We also show an improved upper bound of O(n^(1+alpha/sqrt{h})) for h >= 4, where alpha is an absolute constant independent of h. Our upper bound for h >= 4 is non-constructive.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
  • Mathematics of computing → Extremal graph theory
Keywords
  • Ad-hoc radio networks
  • wireless networks
  • deterministic broadcast
  • adaptive protocols
  • limited transmissions

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Reuven Bar-Yehuda, Oded Goldreich, and Alon Itai. On the time-complexity of broadcast in radio networks: An exponential gap between determinism and randomization. In PODC '87, pages 98-108, 1987. Google Scholar
  2. Petra Berenbrink, Colin Cooper, and Zengjian Hu. Energy efficient randomised communication in unknown adhoc networks. Theoretical Computer Science, 410(27-29):2549-2561, 2009. URL: http://dx.doi.org/10.1016/j.tcs.2009.02.002.
  3. Norman Biggs. Algebraic Graph Theory. Cambridge University Press, Cambridge, 2nd edition, 1993. Google Scholar
  4. Danilo Brusci and Massimiliano Del Pinto. Lower bounds for the broadcast problem in mobile radio networks. Distributed Computing, 10(3):129-135, 1997. Google Scholar
  5. Imrich Chlamtac and Shay Kutten. On broadcasting in radio networks-problem analysis and protocol design. IEEE Transactions on Communications 33, pages 1240-1246, 1985. Google Scholar
  6. Bogdan S. Chlebus, Leszek Ga̧sieniec, Alan Gibbons, Andrzej Pelc, and Wojciech Rytter. Deterministic broadcasting in unknown radio networks. In Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'00), pages 861-870. ACM/SIAM, 2000. Google Scholar
  7. Bogdan S. Chlebus, Leszek Ga̧sieniec, Anna Östlin, and John Michael Robson. Deterministic radio broadcasting. In Proc. 27th International Colloquium on Automata, Languages and Programming (ICALP'00), volume 1853 of Lecture Notes in Computer Science, pages 717-728. Springer Verlag, 2000. Google Scholar
  8. Marek Chrobak, Leszek Ga̧sieniec, and Wojciech Rytter. Fast broadcasting and gossiping in radio networks. Journal of Algorithms, 43(2):177-189, 2002. Google Scholar
  9. Andrea E. F. Clementi, Angelo Monti, and Riccardo Silvestri. Distributed broadcast in radio networks of unknown topology. Theoretical Computer Science, 302(1-3):337-364, 2003. URL: http://dx.doi.org/10.1016/S0304-3975(02)00851-4.
  10. Artur Czumaj and Wojciech Rytter. Broadcasting algorithms in radio networks with unknown topology. In Proc. 44th Symposium on Foundations of Computer Science (FOCS'03), pages 492-501. IEEE Computer Society, 2003. Google Scholar
  11. Gianluca De Marco. Distributed broadcast in unknown radio networks. SIAM Journal on Computing, 39(6):2162-2175, March 2010. Google Scholar
  12. Leszek Ga̧sieniec, Erez Kantor, Dariusz R. Kowalski, David Peleg, and Chang Su. Time efficient k-shot broadcasting in known topology radio networks. Distributed Computing, 21(2):117-127, 2008. URL: http://dx.doi.org/10.1007/s00446-008-0058-0.
  13. Erez Kantor and David Peleg. Efficient k-shot broadcasting in radio networks. Discrete Applied Mathematics, 202:79-94, 2016. Google Scholar
  14. Sushanta Karmakar, Paraschos Koutris, Aris Pagourtzis, and Dimitris Sakavalas. Energy-efficient broadcasting in ad hoc wireless networks. Journal of Discrete Algorithms, 42:2-13, 2017. URL: http://dx.doi.org/10.1016/j.jda.2016.11.004.
  15. Dariusz R. Kowalski and Andrzej Pelc. Broadcasting in undirected ad hoc radio networks. Distributed Computing, 18(1):43-57, 2005. URL: http://dx.doi.org/10.1007/s00446-005-0126-7.
  16. Felix Lazebnik and Vasiliy A. Ustimenko. Explicit construction of graphs with an arbitrary large girth and of large size. Discrete Applied Mathematics, 60(1-3):275-284, 1995. URL: http://dx.doi.org/10.1016/0166-218X(94)00058-L.
  17. Gianluca De Marco and Andrzej Pelc. Faster broadcasting in unknown radio networks. Inf. Process. Lett., 79(2):53-56, 2001. URL: http://dx.doi.org/10.1016/S0020-0190(00)00178-2.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail