Log-logarithmic selection resolution protocols in a multiple access channel
SIAM Journal on Computing
Faster broadcasting in unknown radio networks
Information Processing Letters
Fast broadcasting and gossiping in radio networks
Journal of Algorithms
On adaptive deterministic gossiping in ad hoc radio networks
Information Processing Letters
Deterministic Radio Broadcasting
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Randomized O (log log n)-Round Leader Election Protocols in Packet Radio Networks
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
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
Broadcasting in undirected ad hoc radio networks
Distributed Computing - Special issue: PODC 02
Acknowledged broadcasting in ad hoc radio networks
Information Processing Letters
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Distributed Broadcast in Unknown Radio Networks
SIAM Journal on Computing
Improved lower bound for deterministic broadcasting in radio networks
Theoretical Computer Science
On efficient gossiping in radio networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Hi-index | 0.89 |
We consider the setting of ad hoc radio networks when the underlying network is bidirectional, the number of nodes in the network n is known and nodes can be assigned labels which are polynomially large in n. For this setting we present a protocol for deterministic gossiping which takes O(nlg^2nlglgn) rounds improving upon the previous best result by [L. Gasieniec, A. Pagourtizis, I. Potapov, Deterministic gossiping in radio networks with large labels, Algorithmica 47 (2007) 97-117], who give a complex protocol with the round complexity of O(nlg^3nlglgn), resolving an open problem posed by Gasieniec in the survey article [L. Gasieniec, On efficient gossiping in radio networks, in: Proceedings of Sixteenth International Colloquium on Structural Information and Communication Complexity, SIROCCO 2009, Sirince, Turkey, in: LNCS, vol. 5869, 2010, pp. 2-14]. The relationship between the asymptotic round complexity of deterministic Leader Election and Gossiping problem has not been known even for bidirectional networks. The gossiping protocol given by Gasieniec et al. invokes the leader election protocol O(lgn) times. Our gossiping protocol achieves this by a single invocation to the leader election protocol. We then use a known fact about the lower bound for leader election for bidirectional radio networks to conclude that the asymptotic round complexity of deterministic Leader Election and Gossiping is the same for bidirectional networks.