Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
On the complexity of radio communication
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Information Dissemination in Distributed Systems with Faulty Units
IEEE Transactions on Computers
| Hi-index | 14.98 |
Consider a network in which each unit initially knows only its own identity and the identity of its immediate neighbors. Suppose each unit has a message intended for all other units. The authors give a distributed algorithm to accomplish this in point-to-point networks which is optimal in the number of transmissions it requires. They also show that this algorithm accomplishes this efficiently for broadcast (radio) networks, although the problem of finding a solution with the least number of transmissions, in broadcast networks, is shown to be NP-hard.