A lower bound for radio broadcast
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Faster broadcasting in unknown radio networks
Information Processing Letters
On adaptive deterministic gossiping in ad hoc radio networks
Information Processing Letters
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
On Randomized Broadcasting and Gossiping in Radio Networks
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
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
Deterministic Communication in Radio Networks with Large Labels
ESA '02 Proceedings of the 10th 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
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
Acknowledged broadcasting and gossiping in ad hoc radio networks
Theoretical Computer Science
Acknowledged broadcasting in ad hoc radio networks
Information Processing Letters
Optimal deterministic broadcasting in known topology radio networks
Distributed Computing
Distributed Broadcast in Unknown Radio Networks
SIAM Journal on Computing
An optimal algorithm of acknowledged broadcasting in ad hoc radio networks
ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
Optimal gossiping with unit size messages in known topology radio networks
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
On efficient gossiping in radio networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Hi-index | 5.23 |
We consider the problems of deterministic broadcasting and gossiping in completely unknown ad-hoc radio networks. It is assumed that nothing is known to the nodes of the network about the topology of the network, that is even the size of the network is not known, except that n1. This lack of knowledge, about the value of n, is what distinguishes this setting from the vanilla model. For this setting, protocols for the vanilla model, may be executed with multiplicatively large estimates, say 2^i in the ith phase, on the upper bound on the size of the network n. When the respective protocol with estimate 2^i=n on the size of the network is run, it will accomplish the task successfully. However, the problem that still remains is to determine when this process should terminate. Thus, to apply this design paradigm successful completion or incompletion of the process should be detected and this knowledge circulated in the network after appropriate number of rounds/phases of the protocol. In radio networks literature, this setting is known as the Acknowledged setting and broadcasting and gossiping problems for it are referred to as Acknowledged broadcasting and gossiping. An important feature of dynamic radio networks is that radio nodes can be dynamically introduced in the network from time to time and can be assigned labels in a much larger range, say polynomial in the size of the network, e.g. [1,...,n^c] for some constant c. It is easy to see that protocols can be designed for the acknowledged setting only when the underlying communication network is strongly connected. We present the following results for these networks: (a) A deterministic protocol for Acknowledged broadcasting which takes NRG(n,n^c) rounds, where NRG(n,n^c) is the round complexity of deterministic gossiping for vanilla model. (b) A deterministic protocol for acknowledged gossiping, which takes O(n^2lgn) rounds when collision detection mechanism is available. The schedule of the transmissions of nodes in the network, to enable them to infer collisions and discover existence of unknown in-neighborhood as a result, is abstracted as a family of sets of natural numbers which we call the Selecting-Colliding family. We prove the existence of Selecting-Colliding families using the probabilistic method and employ them to design protocol for acknowledged gossiping when no collision detection mechanism is available. Finally, we present a deterministic protocol for Acknowledged broadcasting for bidirectional networks, with a round complexity of O(nlgn) rounds.