Sensor networks and network sensibility
Ming Li, Hong Lin, John A. Rushing, Sara J. Graves · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2007
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.