Sensor allocation in diverse environments
Sensor coverage varies with location due to factors such as weather, terrain, and obstacles. If a field can be partitioned into zones of homogeneous sensing areas, then the area covered by a random deployment of sensors can be optimized by controlling the number of sensors deployed in each zone. This paper provides formulas to directly calculate the optimal sensor partition in runtime asymptotically equal to the number of zones; to determine the minimum sensor count required to achieve a specific coverage threshold; and to bound the maximum increase in coverage over a strategy oblivious to differences in sensing areas. Results show that this bound is no greater than 13% for a field with two zones. While the analytical solutions assume that each zone is covered independently, sensors are allowed to affect neighboring zones in simulations. Nevertheless, the simulation results support the optimality of the solutions.
coverage deployment optimization sensor networks