A lower bound for radio broadcast
Journal of Computer and System Sciences
Journal of Computer and System Sciences
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
The impact of information on broadcasting time in linear radio networks
Theoretical Computer Science
Deterministic Radio Broadcasting
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
SIAM Journal on Computing
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
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
Coloring unstructured radio networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Theoretical Computer Science - Foundations of software science and computation structures
Broadcasting in geometric radio networks
Journal of Discrete Algorithms
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
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
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Hi-index | 0.00 |
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 density of the network and knows exactly its own position in the plane.In many situations these assumptions are unrealistic. Does removing them influence broadcasting time? The aim of this paper is to answer this question, hence we assume that density is unknown and nodes perceive their position with some unknown error margin 茂戮驴. It turns out that this combination of missing and inaccurate information substantially changes the problem: the main new challenge becomes fast broadcasting in sparse networks (with constant density), when optimal time is O(D). Nevertheless, under our very weak scenario, we construct a broadcasting algorithm that maintains optimal time $ O \left( \min\left\{ D + g^2, D \log{g} \right\}\right)$ for all networks with at least 2 nodes, of diameter Dand granularity g, if each node perceives its position with error margin 茂戮驴= 茂戮驴d, for any (unknown) constant 茂戮驴茂戮驴(D+ g2). Thus, the mere stopping requirement for the special case of the lonely source causes an exponential increase in broadcasting time, for networks of any density and any small diameter. Finally, broadcasting is impossible if 茂戮驴茂戮驴 d/2.