Efficient communication in an ad-hoc network

Authors:
Abraham Flaxman;Alan Frieze;Eli Upfal
Affiliations:
Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA;Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA;Department of Computer Science, Brown University, Providence, RI
Venue:
Journal of Algorithms
Year:
2004

Citing 0
Cited 2

The bin-covering technique for thresholding random geometric graph properties

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Thresholding random geometric graph properties motivated by ad hoc sensor networks

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We model the dynamics of an ad-hoc sensor network as a continuum percolation model, and prove that a simple local-flooding technique yields an efficient communication protocol in that setting.