Efficient optical communication in parallel computers
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Multiple communication im multihop radio networks
SIAM Journal on Computing
Journal of Computer and System Sciences
An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
SIAM Journal on Computing
Selective families, superimposed codes, and broadcasting on unknown radio networks
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
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 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
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
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
On selection problem in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Optimal Initialization and Gossiping Algorithms for Random Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Bootstrapping a hop-optimal network in the weak sensor model
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
DISC'10 Proceedings of the 24th international conference on Distributed computing
Unbounded contention resolution in multiple-access channels
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Unbounded contention resolution in multiple-access channels
DISC'11 Proceedings of the 25th international conference on Distributed computing
Deterministic recurrent communication in restricted Sensor Networks
Theoretical Computer Science
On efficient gossiping in radio networks
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
An early-stopping protocol for computing aggregate functions in Sensor Networks
Journal of Parallel and Distributed Computing
Optimal memory-aware Sensor Network Gossiping (or how to break the Broadcast lower bound)
Theoretical Computer Science
| Hi-index | 0.00 |
Gossiping is an important problem in Radio Networks that has been well studied, leading to many important results. Due to strong resouce limitations of sensor nodes, previous solutions are frequently not feasible in Sensor Networks. In this paper, we study the gossiping problem in the restrictive context of Sensor Networks. By exploiting the geometry of sensor node distributions, we present reduced, optimal running time of O(D + Δ) for an algorithm that completes gossiping with high probability in a Sensor Network of unknown topology and adversarial wake-up, where D is the diameter and Δ the maximum degree of the network. Given that an algorithm for gossiping also solves the broadcast problem, our result proves that the classic lower bound of [16] can be broken if nodes are allowed to do preprocessing.