Correction to "An asymptotically nonadaptive algorithm for conflict resolution i
IEEE Transactions on Information Theory
A lower bound for radio broadcast
Journal of Computer and System Sciences
Single round simulation on radio networks
Journal of Algorithms
Multiple communication im multihop radio networks
SIAM Journal on Computing
Journal of Computer and System Sciences
Wireless information networks
Asymptotically optimal gossiping in radio networks
Discrete Applied Mathematics
Randomized algorithms
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Computation in noisy radio networks
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Deterministic broadcasting in unknown radio networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Deterministic Radio Broadcasting
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
The Impact of Knowledge on Broadcasting Time in Radio Networks
ESA '99 Proceedings of the 7th 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
A new model for scheduling packet radio networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Information theory and communication networks: an unconsummated union
IEEE Transactions on Information Theory
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
Gossiping with Bounded Size Messages in ad hoc Radio Networks
ICALP '02 Proceedings of the 29th 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
Deterministic Communication in Radio Networks with Large Labels
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Quantitative Analysis under Fairness Constraints
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Interference-aware gossiping scheduling in uncoordinated duty-cycled multi-hop wireless networks
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Broadcast and gossiping algorithms for mobile ad hoc networks based on breadth-first traversal
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
| Hi-index | 0.00 |
We present an O(n log4n)-time randomized algorithm for gossiping in radio networks with unknown topology. This is the first algorithm for gossiping in this model whose running time is only a poly-logarithmic factor away from the optimum. The fastest previously known (deterministic) algorithm for this problem works in time O(n3/2 log2 n).