Covering, Percolation, and Wireless Networks

Thursday, August 9, 2001 - 2:20pm - 2:40pm
Keller 3-180
Massimo Franceschetti (California Institute of Technology)
In this talk we show a connection between covering algorithms and continuum percolation, and present a new stochastic model of wireless communication networks.

We consider clustered wireless networks, abstracted as a set of disks (wireless gateways) that cover a set of random points (wireless clients) in the plane.

We extend Continuum Percolation Theory to describe the covering process that forms the wireless network, and look at the percolation properties of this extended model.

In this way, we describe the global connectivity state of the network, for different classes of covering algorithms.

Finally, some open problems and possible extensions of the theory will be presented.