Broadcasting in UDG Radio Networks with Missing and Inaccurate Information

  title={Broadcasting in UDG Radio Networks with Missing and Inaccurate Information},
  author={Emanuele G. Fusco and Andrzej Pelc},
We study broadcasting time in radio networks, modeled as unit disk graphs (UDG). Emek et al. showed that broadcasting time depends on two parameters of the UDG network, namely, its diameter D(in hops) and its granularityg. The latter is the inverse of the densitydof the network which is the minimum Euclidean distance between any two stations. They proved that the minimum broadcasting time is $ \Theta \left( \min\left\{ D + g^2, D \log{g} \right\} \right) $, assuming that each node knows the… 


Deterministic broadcasting in ad hoc radio networks
For the model with collision detection, efficient algorithms for broadcasting and for acknowledged broadcasting in strongly connected graphs are developed and it is shown that broadcasting with acknowledgement is not possible in this model at all.
Broadcasting in UDG radio networks with unknown topology
A deterministic broadcasting algorithm is presented which works in time O (Dg) under the conditional wake up model and it is proved that broadcasting in this model cannot be accomplished by any deterministic algorithm in time better than $${\Omega (D \sqrt{g})}$$ .
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
An algorithm is constructed that broadcasts in logarithmic time on all graphs from the Bar-Yehuda, Goldreich, and Itai paper (BGI), giving the first correct proof of an exponential gap between determinism and randomization in the time of radio broadcasting.
Deterministic broadcasting in unknown radio networks
This work considers the problem of distributed deterministic broadcasting in radio networks of unknown topology and size, and develops a linear-time broadcasting algorithm for symmetric graphs, which is optimal and develops efficient algorithms for broadcasting and for acknowledged broadcasting in strongly connected graphs.
The Impact of Knowledge on Broadcasting Time in Radio Networks
These are the first results concerning broadcasting algorithms that are distributed and deterministic at the same time and it is shown that in this case the amount of knowledge available to nodes influences the efficiency of broadcasting in a significant way.
The impact of information on broadcasting time in linear radio networks
Broadcasting algorithms in radio networks with unknown topology
  • A. Czumaj, W. Rytter
  • Computer Science
    44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
  • 2003
An optimal randomized broadcasting algorithm whose running time complexity is O(D log(n/D) + log/sup 2/n), with high probability is described, and a deterministic oblivious algorithm is described that completes broadcasting in almost optimal time O(n log/Sup 2/D).
Deterministic Radio Broadcasting
Three new deterministic distributed algorithms are developed for broadcasting in radio networks: one node of the network knows a message that needs to be learned by all the remaining nodes, and one of these algorithms improves the performance for general networks running in time O(n3/2).
Optimal Deterministic Broadcasting in Known Topology Radio Networks
A deterministic polynomial algorithm is given which produces a broadcast scheme of length D, for every n-node graph of diameter D, thus improving a result of Gąsieniec et al. (PODC 2005) and solving a problem stated there.
Faster communication in known topology radio networks
A new (efficiently computable) deterministic schedule is proposed that uses O(D+Δ log n) time units to complete the gossiping task in any radio network with size n, diameter D and max-degree Δ, and improves and simplifies the currently best known gossiping schedule.