ON THE COVERAGE OF A RANDOM SENSOR NETWORK IN A BOUNDED DOMAIN

We examine the area coverage of random sensor networks in bounded domains under a Boolean coverage disk model where all sensors are assumed to have a common sensing range. We solve the expected area coverage analytically for a circular domain with border effects and for an arbitrary bounded domain without border effects, i.e., when the locations of the sensors are and are not, respectively, confined to the domain to be covered. We also consider the problem of full coverage of the domain and recognize that this problem, like that of network connectivity, reduces to the problem of determining the distribution of a well-defined threshold range. Focusing on a square domain, again with and without border effects, we utilize existing asymptotic results in building empirical regression models for the threshold range for full coverage. These models allow predicting the relation between the parameters of the sensor network and the probability of full coverage.