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
Asymptotically optimal gossiping in radio networks
Discrete Applied Mathematics
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh 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
Oblivious gossiping in ad-hoc radio networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
On adaptive deterministic gossiping in ad hoc radio networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
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
A Randomized Algorithm for Gossiping in Radio Networks
COCOON '01 Proceedings of the 7th 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
Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks
ESA '01 Proceedings of the 9th 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
Radio communication in random graphs: extended abstract
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Radio communication in random graphs
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Time efficient centralized gossiping in radio networks
Theoretical Computer Science
Minimum-latency gossiping in multi-hop wireless mesh networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
On many-to-many communication in packet radio networks
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
On efficient gossiping in radio networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Information dissemination in unknown radio networks with large labels
Theoretical Computer Science
| Hi-index | 0.00 |
We study deterministic gossiping in ad-hoc radio networks, where labels of the nodes are large, i.e., they are polynomially large in the size n of the network. A label-free model was introduced in the context of randomized broadcasting in ad-hoc radio networks, see [2]. Most of the work on deterministic communication in ad-hoc networks was done for the model with labels of size O(n), with few exceptions; Peleg [19] raised the problem of deterministic communication in ad-hoc radio networks with large labels and proposed the first deterministic O(n2 log n)- time broadcasting algorithm. In [11] Chrobak et al. proved that deterministic radio broadcasting can be performed in time O(n log2 n); their result holds for large labels.Here we propose two new deterministic gossiping algorithms for ad-hoc radio networks with large labels. In particular: - a communication procedure giving an O(n5/3 log3 n)-time deterministic gossiping algorithm for directed networks and an O(n4/3 log3 n)- time algorithm for undirected networks; - a gossiping procedure designed particularly for undirected networks resulting in an almost linear O(n log3 n)-time algorithm.