Sensor allocation in diverse environments

Authors:
Amotz Bar-Noy;Theodore Brown;Simon Shamoun
Affiliations:
Department of Computer Science, CUNY Graduate Center, New York, USA 10016;Department of Computer Science, CUNY Graduate Center, New York, USA 10016;Department of Computer Science, CUNY Graduate Center, New York, USA 10016
Venue:
Wireless Networks
Year:
2012

Citing 11
Cited 0

The budgeted maximum coverage problem

Information Processing Letters
Uncertainty-aware and coverage-oriented deployment for sensor networks

Journal of Parallel and Distributed Computing
Analysis of a wireless sensor dropping problem in wide-area environmental monitoring

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Stochastic coverage in heterogeneous sensor networks

ACM Transactions on Sensor Networks (TOSN)
Bounds on coverage and target detection capabilities for models of networks of mobile sensors

ACM Transactions on Sensor Networks (TOSN)
Three-dimensional and two-dimensional deployment analysis for underwater acoustic sensor networks

Ad Hoc Networks
Data fusion improves the coverage of wireless sensor networks

Proceedings of the 15th annual international conference on Mobile computing and networking
Unreliable sensor grids: coverage, connectivity and diameter

Ad Hoc Networks
Coverage problem of wireless sensor networks

CJCDGCGT'05 Proceedings of the 7th China-Japan conference on Discrete geometry, combinatorics and graph theory
Coverage by randomly deployed wireless sensor networks

IEEE Transactions on Information Theory
A note on maximizing a submodular set function subject to a knapsack constraint

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.