Share Email Print
cover

Proceedings Paper

Sensor networks and network sensibility
Author(s): Ming Li; Hong Lin; John Rushing; Sara J. Graves
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

The conventional probabilistic argument has been used to analyze how many randomly distributed sensors are needed to cover a region. However, if these sensors move after deployment such as in mobile sensor networks, the probabilistic argument fails since the probability distribution is distorted. We provide an elementary argument that is not only as powerful as the probabilistic argument for analyzing the needed number of sensors to cover a predefined region, but also powerful enough to allow us to analyze the situations when the sensors move after deployment. This argument is the incompressibility method, using Kolmogorov complexity.

Paper Details

Date Published: 3 May 2007
PDF: 9 pages
Proc. SPIE 6577, Wireless Sensing and Processing II, 65770L (3 May 2007); doi: 10.1117/12.719980
Show Author Affiliations
Ming Li, Univ. of Waterloo (Canada)
Hong Lin, Univ. of Alabama, Huntsville (United States)
John Rushing, Univ. of Alabama, Huntsville (United States)
Sara J. Graves, Univ. of Alabama, Huntsville (United States)


Published in SPIE Proceedings Vol. 6577:
Wireless Sensing and Processing II
Raghuveer M. Rao; Sohail A. Dianat; Michael D. Zoltowski, Editor(s)

© SPIE. Terms of Use
Back to Top