Abstract
We study the time of distributed deterministic broadcasting in synchronous radio networks of unknown topology and size. If a node u can be reached from two nodes which send messages in the same round, none of the messages is received by u. We assume that nodes are completely ignorant of the network: they know neither its topology, nor size, nor even their immediate neighborhood. The initial knowledge of every node is limited to its own label. Chlebus et al. [Proc. 11th Annual ACM-SIAM Symp. on Discrete Algorithms, 2000, p. 861] constructed a broadcasting algorithm working in time O(n 11/6) under this total ignorance scenario. We improve this result by showing how to broadcast in time O(n 5/3( logn) 1/3) in the same model.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
