Oblivious gossiping in ad-hoc radio networks
- 21 July 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
We study oblivious deterministic and randomized algorithms for gossiping in unknown radio networks. In oblivious algorithms the fact (or probability in case of randomized algorithm) that a processor transmits or not at a given time-step depends solely on its identification number, the total number of processors and the number of the time-step. We distinguish oblivious deterministic algorithms which allow onlKeywords
This publication has 10 references indexed in Scilit:
- Distributed multi-broadcast in unknown radio networksPublished by Association for Computing Machinery (ACM) ,2001
- A Randomized Algorithm for Gossiping in Radio NetworksPublished by Springer Nature ,2001
- An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio NetworksSIAM Journal on Computing, 1998
- Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract)Published by Springer Nature ,1998
- Lower bounds for the broadcast problem in mobile radio networksDistributed Computing, 1997
- Asymptotically optimal gossiping in radio networksDiscrete Applied Mathematics, 1995
- Multiple Communication in Multihop Radio NetworksSIAM Journal on Computing, 1993
- A lower bound for radio broadcastJournal of Computer and System Sciences, 1991
- Short strings containing all k-element permutationsDiscrete Mathematics, 1982
- A lower bound on the length of a sequence containing all permutations as subsequencesJournal of Combinatorial Theory, Series A, 1976