The wake-up problem in multi-hop radio networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Broadcast in radio networks tolerating byzantine adversarial behavior
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Broadcasting with locally bounded Byzantine faults
Information Processing Letters
Improved schedule for radio broadcast
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Faster communication in known topology radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Feasibility and complexity of broadcasting with random transmission failures
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Fast distributed algorithm for convergecast in ad hoc geometric radio networks
Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
Oracle size: a new measure of difficulty for communication tasks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
An improved algorithm for radio broadcast
ACM Transactions on Algorithms (TALG)
Theoretical Computer Science - Foundations of software science and computation structures
Deterministic M2M multicast in radio networks
Theoretical Computer Science
Feasibility and complexity of broadcasting with random transmission failures
Theoretical Computer Science
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
Acknowledged broadcasting and gossiping in ad hoc radio networks
Theoretical Computer Science
Broadcasting in udg radio networks with unknown topology
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Distributed broadcast in unknown radio networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Secure communication over radio channels
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
On the effect of the deployment setting on broadcasting in Euclidean radio networks
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Fast Radio Broadcasting with Advice
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Broadcasting in UDG Radio Networks with Missing and Inaccurate Information
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Information and Computation
Acknowledged broadcasting in ad hoc radio networks
Information Processing Letters
On neighbor discovery in cognitive radio networks
Journal of Parallel and Distributed Computing
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
The wireless synchronization problem
Proceedings of the 28th ACM symposium on Principles of distributed computing
Coloring unstructured wireless multi-hop networks
Proceedings of the 28th ACM symposium on Principles of distributed computing
Optimal clock synchronization in networks
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Broadcasting with locally bounded Byzantine faults
Information Processing Letters
Fast radio broadcasting with advice
Theoretical Computer Science
Communication algorithms with advice
Journal of Computer and System Sciences
Sensor network gossiping or how to break the broadcast lower bound
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Deterministic communication in the weak sensor model
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Efficient k-shot broadcasting in radio networks
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Consensus and mutual exclusion in a multiple access channel
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Minimum-latency gossiping in multi-hop wireless mesh networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Decomposing broadcast algorithms using abstract MAC layers
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Deterministic recurrent communication and synchronization in restricted sensor networks
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Distributed Broadcast in Unknown Radio Networks
SIAM Journal on Computing
Improved lower bound for deterministic broadcasting in radio networks
Theoretical Computer Science
Time-efficient randomized multiple-message broadcast in radio networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Leveraging channel diversity to gain efficiency and robustness for wireless broadcast
DISC'11 Proceedings of the 25th international conference on Distributed computing
On many-to-many communication in packet radio networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Average-Time complexity of gossiping in radio networks
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
On the wake-up problem in radio networks
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Optimal gossiping with unit size messages in known topology radio networks
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Tree exploration with an oracle
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Almost optimal explicit selectors
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Waking up anonymous ad hoc radio networks
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Communication complexity of consensus in anonymous message passing systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Communication problems in random line-of-sight ad-hoc radio networks
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Bounded-contention coding for wireless networks in the high SNR regime
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Distributed backbone structure for algorithms in the SINR model of wireless networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
Theoretical Computer Science
Round complexity of leader election and gossiping in bidirectional radio networks
Information Processing Letters
Oblivious k-shot broadcasting in ad hoc radio networks
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Oblivious k-shot broadcasting in ad hoc radio networks
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Randomized broadcast in radio networks with collision detection
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Distributed deterministic broadcasting in wireless networks of weak devices
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Distributed deterministic broadcasting in uniform-power ad hoc wireless networks
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Decomposing broadcast algorithms using abstract MAC layers
Ad Hoc Networks
Information dissemination in unknown radio networks with large labels
Theoretical Computer Science
| Hi-index | 0.01 |
In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed n-node radio networks with specified eccentricity D (maximum distance from the source node to any other node). In a seminal work on randomized broadcasting, Bar-Yehuda et al. presented an algorithm that for any n-node radio network with eccentricity D completes the broadcasting in O(D log n + log2 n) time, with high probability. This result is almost optimal, since as it has been shown by Kushilevitz and Mansour and Alon et al., every randomized algorithm requires \Omega(D log(n/D) + log2 n) expected time to complete broadcasting.Our first main result closes the gap between the lower and upper bound: we describe an optimal randomized broadcasting algorithm whose running time complexity is O(D log(n/D) + log2 n), with high probability. In particular, we obtain a randomized algorithm that completes broadcasting in any n-node radio network in time O(n), with high probability; the best previously existing algorithm achieved the running time O(n log n).The main source of our improvement is a better "selecting sequence" used by the algorithm that brings some stronger property and improves the broadcasting time. Two types of "selecting sequence" are considered: randomized and deterministic ones. The algorithm with a randomized sequence is easier (more intuitive) to analyze but both randomized and deterministic sequences give algorithms of the same asymptotic complexity.Next, we demonstrate how to apply our approach to deterministic broadcasting, and describe a deterministic oblivious algorithm that completes broadcasting in almost optimal time O(n log2 D), which improves upon best known algorithms in this case. The fastest previously known algorithm had the broadcasting time of O(n log n log D), it was non-oblivious and it was significantly more complicated; our algorithm can be seen as a natural extension of our randomized algorithm.Finally, we show how our randomized broadcasting algorithm can be used to improve the randomized complexity of the gossiping problem.