Tree-Based Broadcasting in Multihop Radio Networks
IEEE Transactions on Computers
A lower bound for radio broadcast
Journal of Computer and System Sciences
Multiple communication im multihop radio networks
SIAM Journal on Computing
Journal of Computer and System Sciences
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Gossiping with Bounded Size Messages in ad hoc Radio Networks
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Deterministic Radio Broadcasting
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Gossiping with Unit Messages in Known Radio Networks
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Fast broadcasting and gossiping in radio networks
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Distributed broadcast in radio networks of unknown topology
Theoretical 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
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
Many-to-Many Communication in Radio Networks
Algorithmica
Decomposing broadcast algorithms using abstract MAC layers
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Distributed multiple-message broadcast in wireless ad-hoc networks under the SINR model
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Bounded-contention coding for wireless networks in the high SNR regime
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Randomized broadcast in radio networks with collision detection
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
Multiple-message broadcast, or k-broadcast, is one of the fundamental problems in network communication. In short, there are k packets distributed across the network, each of them has to be delivered to all other nodes. We consider this task in the model of multi-hop radio network, in which n nodes interact by transmitting and receiving messages. A message transmitted at a round reaches all neighbors of the transmitter at the end of the same round, but may not be successfully received by some, or even all, of these neighbors. More specifically, a node receives a message at a round if this is the only message that has reached this node in this round. Due to this specific interference-prone nature of radio networks, many communication tasks become more challenging and more costly than in other types of networks, especially in ad-hoc setting in which each node knows only its own id and linear estimates on the basic network parameters, such as the number of nodes n, diameter D and maximum node degree Δ. We design a new randomized k-broadcast algorithm combining the bestof two worlds: efficient randomized transmission schedules and network coding. We show that our algorithm accomplishes multi-broadcast in O(log Δ) amortized number of communication rounds per packet, with high probability. This improves over the best previous solution of Bar-Yehuda, Israeli and Itai, which guarantees only O(log Δ log n) of amortized number of rounds per packet, with high probability.