Abstract
We consider a problem of computing the maximal value associated to the nodes of a network in the model of unknown symmetric radio network with availability of collision detection. We assume that the nodes have no initial knowledge about the network topology, number of nodes and even they have no identifiers. The network contains one distinguished node, called initiator, that starts the process of computing. We design a series of algorithms that result into an asymptotically optimal deterministic algorithm completing the task in Θ(ecc + logMax) rounds, where ecc is the eccentricity of the initiator and Max is the maximal value among the integer values associated to the nodes. Some other utilisations of the developed algorithm are presented as well.
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
Preview
Unable to display preview. Download preview PDF.
References
Chlebus, B.S., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic Broadcasting in Unknown Radio Networks. In: Proceedings of 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’00), pp. 861–870 (2000)
Chrobak, M., Gasieniec, L., Rytter, W.: Fast Broadcasting and Gossiping in Radio Networks. In: Proceedings of 41st Annual Symposium on Foundations of Computer Science (FOCS’2000), pp. 575–581 (2000)
Dessmark, A., Pelc, A.: Broadcasting in Geometric Radio Networks. Journal of Discrete Algorithms (to appear)
Galčík, F.: Broadcasting in Radio Networks with Specific Topology. Manuscript (2006)
Martel, C.U.: Maximum Finding on a Multiple Access Broadcast Network. Information Processing Letters 52, 7–13 (1994)
Okuwa, T., Chen, W., Wada, K.: An Optimal Algorithm of Acknowledged Broadcasting in Ad Hoc Radio Networks. In: Second International Symposium on Parallel and Distributed Computing, pp. 178–184 (2003)
Pelc, A.: Broadcasting in Radio Networks. In: Stojmenovic, I. (ed.) Handbook of Wireless Networks and Mobile Computing, pp. 509–528. John Wiley and Sons, New York (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Galčík, F., Semanišin, G. (2007). Maximum Finding in the Symmetric Radio Networks with Collision Detection. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds) SOFSEM 2007: Theory and Practice of Computer Science. SOFSEM 2007. Lecture Notes in Computer Science, vol 4362. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69507-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-69507-3_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69506-6
Online ISBN: 978-3-540-69507-3
eBook Packages: Computer ScienceComputer Science (R0)