A lower bound for radio broadcast
Journal of Computer and System Sciences
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
Multiple communication im multihop radio networks
SIAM Journal on Computing
Journal of Computer and System Sciences
Proceedings of the international workshop on Broadcasting and gossiping 1990
Wireless information networks
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Computation in noisy radio networks
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
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
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
Time efficient centralized gossiping in radio networks
Theoretical Computer Science
Trade-offs between the size of advice and broadcasting time in trees
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
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
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
Latency-optimal communication in wireless mesh networks
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Faster centralized communication in radio networks
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Almost optimal distributed M2M multicasting in wireless mesh networks
Theoretical Computer Science
| Hi-index | 5.23 |
We consider the problem of distributed deterministic broadcasting in radio networks whose nodes are located on a line. Nodes send messages in synchronous time-slots. Each node υ has a given transmission range. All nodes located within this range can receive messages from υ. However, a node situated in the range of two or more nodes that send messages simultaneously, cannot receive these messages and hears only noise. Each node knows only its own position and range, as well as the maximum of all ranges. Broadcasting is adaptive: nodes can decide on the action to take on the basis of previously received messages, silence or noise. We prove lower bounds on broadcasting time in this model and construct broadcasting protocols whose performance nearly matches these bounds for the simplest case when nodes are situated on a line. We also show that if nodes do not even know their own range, every broadcasting protocol must be hopelessly slow. While distributed randomized broadcasting algorithms, and, on the other hand, deterministic off-line broadcasting algorithms assuming full knowledge of the radio network, have been extensively studied in the literature, ours are the first results concerning broadcasting algorithms that are distributed and deterministic at the same time. We show that in this case, information available to nodes influences the efficiency of broadcasting in a significant way.