Efficient communication in an ad-hoc network

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.

[1]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[2]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[3]  S. Muthukrishnan,et al.  The bin-covering technique for thresholding random geometric graph properties , 2005, SODA '05.

[4]  D. Klarner.  Cell Growth Problems , 1967, Canadian Journal of Mathematics.

[5]  Deborah Estrin,et al.  ASCENT: adaptive self-configuring sensor networks topologies , 2004, IEEE Transactions on Mobile Computing.

[6]  M. Penrose,et al.  Large deviations for discrete and continuous percolation , 1996, Advances in Applied Probability.

[7]  M. Penrose.  The longest edge of the random minimal spanning tree , 1997 .

[8]  Deborah Estrin,et al.  ASCENT: Adaptive Self-Configuring sEnsor Networks Topologies , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[9]  Esther Jennings,et al.  On the diameter of sensor networks , 2002, Proceedings, IEEE Aerospace Conference.

[10]  Deborah Estrin,et al.  Highly-resilient, energy-efficient multipath routing in wireless sensor networks , 2001, MOCO.