On k−coverage in a mostly sleeping sensor network
- 138 Downloads
- 31 Citations
Abstract
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their lifetime. On the other hand, event monitoring applications require guaranteed k-coverage of the protected region at all times. As a result, determining the appropriate number of sensors to deploy that achieves both goals simultaneously becomes a challenging problem. In this paper, we consider three kinds of deployments for a sensor network on a unit square—a √n×√n grid, random uniform (for all n points), and Poisson (with density n). In all three deployments, each sensor is active with probability p, independently from the others. Then, we claim that the critical value of the function npπ r 2/log (np) is 1 for the event of k-coverage of every point. We also provide an upper bound on the window of this phase transition. Although the conditions for the three deployments are similar, we obtain sharper bounds for the random deployments than the grid deployment, which occurs due to the boundary condition. In this paper, we also provide corrections to previously published results. Finally, we use simulation to show the usefulness of our analysis in real deployment scenarios.
Keywords
Sensor network Deterministic deployment Random deployment Coverage Connectivity Power managementPreview
Unable to display preview. Download preview PDF.
References
- 1.N. Alon and J.H. Spencer, The probabilistic method, (John Wiley & Sons, 2000).Google Scholar
- 2.A. Arora et al., Line in the sand: A wireless sensor network for target detection, classification, and tracking. Technical report, OSU-CISRC-12/03-TR71, Ohio State University (2003).Google Scholar
- 3.C. Bettstetter, On the minimum node degree and connectivity of a wireless multihop network, in: Proceedings of ACM MobiHoc, Lausanne Switzerland (2002) pp. 80–91.Google Scholar
- 4.B. Bollobás, Random Graphs, (Cambridge University Press 2001).Google Scholar
- 5.Crossbow, Power management and batteries, Application Notes, Available at http://www.xbow.com/Support/appnotes.htm (2004).
- 6.P. Gupta and P.R. Kumar, Critical power for asymptotic connectivity in wireless networks, in: IEEE 37th Conference on Decision and Control. Tampa, FL (1998) pp. 1106–1110.Google Scholar
- 7.D.L. Hall and J. Llinas, Handbook of Multisensor Data Fusion, (CRC Press 2001).Google Scholar
- 8.P. Hall, Introduction to the Theory of Coverage Processes, (John Wiley & Sons, 1988).Google Scholar
- 9.T. He, S. Krishnamurthy, J.A. Stankovic, T. Abdelzaher, L. Luo, R. Stoleru, T. Yan and L. Gu, Energy-efficient surveillance system using wireless sensor networks, in: Proceedings of ACM Mobisys, Boston, MA (2004).Google Scholar
- 10.M. Horton, D.E. Culler, K. Pister, J. Hill, R. Szewczyk and A. Woo, The commercialization of microsensor motes, in: Sensors volume Vol. 19, No. 4, (April 2002) pp. 40–48.Google Scholar
- 11.C. Huang and Y. Tseng, The coverage problem in a wireless sensor network, in: Proceedings of WSNA, San Diego, CA (2003) pp. 115–121.Google Scholar
- 12.J. Hui, Z. Ren and B.H. Krogh, Sentry-based power management in wireless sensor networks, in: Proceedings of IPSN, Palo Alto, CA (2003) pp. 458–472.Google Scholar
- 13.X. Li, P. Wan, Y. Wang and C. Yi, Fault tolerant deployment and topology control in wireless networks, in: Proceedings of ACM MobiHoc, Annapolis, MD (2003) pp. 117–128.Google Scholar
- 14.R. Meester and R. Roy, Continuum Percolation, Cambridge University Press (1996).Google Scholar
- 15.S. M. Ross, Introduction to Probability Models, Academic Press (2000).Google Scholar
- 16.S. Shakkottai, R. Srikant and N.B. Shroff, Unreliable sensor grids: coverage, connectivity and diameter, in: Proceedings of IEEE INFOCOM vol. 2, San Francisco, CA (2003) pp. 1073–1083.Google Scholar
- 17.R. Szewczyk, J. Polastre, A.M. Mainwaring and D.E. Culler, Lessons from a sensor network expedition, in: EWSN, Berlin, Germany (2004).Google Scholar
- 18.X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless and C. Gill, Integrated coverage and connectivity configuration in wireless sensor networks, in; Proceedings of ACM Sensys, Los Angeles, CA (2003) pp. 28–39.Google Scholar
- 19.H. Zhang and J. Hou, On deriving the upper bound of α-lifetime for large sensor networks, in: Proceedings of ACM MobiHoc, Tokyo, Japan (2004) pp. 121–132.Google Scholar
- 20.J. Zhao and R. Govindan, Understanding packet delivery performance in dense wireless sensor networks, in: Proceedings of ACM Sensys, Los Angeles, CA (2003) pp. 1–13.Google Scholar