Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
A trade-off between information and communication in broadcast protocols
Journal of the ACM (JACM)
A lower bound for radio broadcast
Journal of Computer and System Sciences
An Ω(D log(N/D)) lower bound for broadcast in radio networks
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Journal of Computer and System Sciences
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Time and Cost Trade-Offs in Gossiping
SIAM Journal on Discrete Mathematics
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
Faster broadcasting in unknown radio networks
Information Processing Letters
Deterministic Radio Broadcasting
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Impact of Knowledge on Broadcasting Time in Radio Networks
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Lower bounds for the broadcast problem in mobile radio networks
Distributed Computing
Energy-Efficient Size Approximation of Radio Networks with No Collision Detection
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
| Hi-index | 0.00 |
We consider the problem of distributed deterministic broadcasting in radio networks. The network is synchronous. A node receives a message in a given round if and only if exactly one of its neighbors transmits. The source message has to reach all nodes. We assume that nodes do not know network topology or even their immediate neighborhood. We are concerned with two efficiency measures of broadcasting algorithms: its execution time (number of rounds), and its cost (number of transmissions). We focus our study on execution time of algorithms which have cost close to minimum. We consider two scenarios depending on whether nodes know or do not know global parameters of the network: the number n of nodes and the eccentricity D of the source. Our main contribution are lower bounds on time of low-cost broadcasting which show sharp differences between these scenarios.