ThesisAuthors: Avin, Chen (2006)
A random geometric graph g(n, r) is a graph resulting from placing n points uniformly at random on the unit square (or on the unit disk) and connecting two points iff their Euclidean distance is at most the radius r(n). Recently, this class of random graphs has gained relevance as a natural model for wireless ad-hoc and sensor networks. Investigating properties of these graphs can unearth properties of the real-life systems they model and allow for the design of efficient algorithms. In this work, we study properties of random geometric graphs motivated by challenges encounter in sensor networks applications.
Sensor networks are constructed from a large number of low-cost, low-power sensors equipped with wireless communication and limited processing capabilities. These devices are ... 
