A lower bound for radio broadcast
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Proceedings of the international workshop on Broadcasting and gossiping 1990
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Fault-tolerant broadcasting in radio networks
Journal of Algorithms
The Wakeup Problem in Synchronous Broadcast Systems
SIAM Journal on Discrete Mathematics
The impact of information on broadcasting time in linear radio networks
Theoretical Computer Science
Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Centralized broadcast in multihop radio networks
Journal of Algorithms
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Broadcasting Algorithms in Radio Networks with Unknown Topology
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Deterministic broadcasting in ad hoc radio networks
Distributed Computing
The wake-up problem in multi-hop radio networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
SIAM Journal on Computing
A better wake-up in radio networks
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks
WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
Improved schedule for radio broadcast
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The bin-covering technique for thresholding random geometric graph properties
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
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
Theoretical Computer Science - Foundations of software science and computation structures
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
A new model for scheduling packet radio networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
On the cover time of random geometric graphs
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
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
On Radio Broadcasting in Random Geometric Graphs
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
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
Acknowledged broadcasting in ad hoc radio networks
Information Processing Letters
Impact of Information on the Complexity of Asynchronous Radio Broadcasting
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Fast radio broadcasting with advice
Theoretical Computer Science
Time-efficient broadcasting in radio networks: a review
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Interference-aware broadcast scheduling in wireless networks
Ad Hoc Networks
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
Theoretical Computer Science
Hi-index | 0.00 |
We consider broadcasting in radio networks, modeled as unit disk graphs (UDG). Such networks occur in wireless communication between sites (e.g., stations or sensors) situated in a terrain. Network stations are represented by points in the Euclidean plane, where a station is connected to all stations at distance at most 1 from it. A message transmitted by a station reaches all its neighbors, but a station hears a message (receives the message correctly) only if exactly one of its neighbors transmits at a given time step. One station of the network, called the source, has a message which has to be disseminated to all other stations. Stations are unaware of the network topology. Two broadcasting models are considered. In the conditional wake up model, the stations other than the source are initially idle and cannot transmit until they hear a message for the first time.In the spontaneous wake up model, all stations are awake (and may transmit messages) from the beginning. It turns out that broadcasting time depends on two parameters of the UDG network, namely, its diameter D and its granularity g, which is the inverse of the minimum distance between any two stations. We present a deterministic broadcasting algorithm which works in time O(Dg) under the conditional wake up model and prove that broadcasting in this model cannot be accomplished by any deterministic algorithm in time better than Ω(D√g). For the spontaneous wake up model, we design two deterministic broadcasting algorithms: the first works in time O(D + g2) and the second intime O(Dlog g). While none of these algorithms alone is optimal for all parameter values, we prove that the algorithm obtained by interleaving their steps, and thus working in time O(min{D +g2,Dlogg}), turns out to be optimalby establishing a matching lower bound.