Advertisement

Coverage in Wireless Sensor Networks

  • Jennifer C. Hou
  • David K. Y. Yau
  • Chris Y. T. Ma
  • Yong Yang
  • Honghai Zhang
  • I- Hong Hou
  • Nageswara S. V. Rao
  • Mallikarjun Shankar
Chapter
Part of the Computer Communications and Networks book series (CCN)

Abstract

Ad-hoc networks of devices and sensors with (limited) sensing and wireless communication capabilities are becoming increasingly available for commercial and military applications. The first step in deploying these wireless sensor networks is to determine, with respect to application-specific performance criteria, (i) in the case that the sensors are static, where to deploy or activate them; and (ii) in the case that (a subset of) the sensors are mobile, how to plan the trajectory of the mobile sensors. These two cases are collectively termed as the coverage problem in wireless sensor networks. In this chapter, we give a comprehensive treatment of the coverage problem. Specifically, we first introduce several fundamental properties of coverage that have been derived in the literature and the corresponding algorithms that will realize these properties. While giving insights on how optimal operations can be devised, most of the properties are derived (and hence their corresponding algorithms are constructed) under the perfect disk assumption. Hence, we consider in the second part of the chapter coverage in a more realistic setting, and allow (i) the sensing area of a sensor to be anisotropic and of arbitrary shape, depending on the terrain and the meteorological conditions, and (ii) the utilities of coverage in different parts of the monitoring area to be nonuniform, to account for the impact of a threat on the population, or the likelihood of a threat taking place at certain locations. Finally, in the third part of the chapter, we consider mobile sensor coverage, and study how mobile sensors may navigate in a deployment area to maximize threat-based coverage.

Keywords

Root Mean Square Error Sensor Node Wireless Sensor Network Network Lifetime Coverage Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    D. Estrin, R. Govindan, J. S. Heidemann, and S. Kumar. Next century challenges: Scalable coordination in sensor networks. In Proc. of ACM MobiCom’99, Washington, August 1999.Google Scholar
  2. 2.
    J. M. Kahn, R. H. Katz, and K. S. J. Pister. Next century challenges: Mobile networking for “smart dust”. In Proc. of ACM MobiCom’99, August 1999.Google Scholar
  3. 3.
    I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. Wireless Sensor Networks: A Survey, Computer Networks. March 2002.Google Scholar
  4. 4.
    A. Mainwaring, J. Polastre, R. Szewczyk, and D. Culler. Wireless sensor networks for habitat monitoring. In First ACM International Workshop on Wireless Workshop in Wireless Sensor Networks and Applications (WSNA 2002), August 2002.Google Scholar
  5. 5.
    E. Shih, S. Cho, N. Ickes, R. Min, A. Sinha, A. Wang, and A. Chandrakasan. Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks. In Proc. of ACM MobiCom’01, Rome, Italy, July 2001.Google Scholar
  6. 6.
    F. Ye, G. Zhong, S. Lu, and L. Zhang. PEAS: A robust energy conserving protocol for long-lived sensor networks. In The 23nd International Conference on Distributed Computing Systems (ICDCS), 2003.Google Scholar
  7. 7.
    H. Zhang and J. C. Hou, “Maintaining sensing coverage and connectivity in large sensor networks,” Wireless Ad Hoc and Sensor Networks: An International Journal, Vol. 1, No. 1–2, pp. 89–123, January 2005.Google Scholar
  8. 8.
    S. Slijepcevic and M. Potkonjak. Power efficient organization of wireless sensor networks. In Proc. of ICC, Helsinki, Finland, June 2001.Google Scholar
  9. 9.
    H. Gupta, S. Das, and Q. Gu. Connected sensor cover: Self-organization of sensor networks for efficient query execution. In Proc. of ACM MOBIHOC, 2003.Google Scholar
  10. 10.
    X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless, and C. Gill. Integrated coverage and connectivity configuration in wireless sensor networks. In Proc. of SENSYS, 2003.Google Scholar
  11. 11.
    A. Cerpa and D. Estrin. Ascent: Adaptive self-configuring sensor networks topologies. In Proc. of IEEE INFOCOM, March 2002.Google Scholar
  12. 12.
    D. Tian and N. D. Georganas. A coverage-preserving node scheduling scheme for large wireless sensor networks. In First ACM International Workshop on Wireless Sensor Networks and Applications, Georgia, GA, 2002.Google Scholar
  13. 13.
    F. Ye, H. Zhang, S. Lu, L. Zhang, and J. C. Hou. A randomized energy-conservation protocol for resilient sensor networks. ACM Wireless Network (WINET), 12(5):637–652, Oct. 2006.Google Scholar
  14. 14.
    K. Chakrabarty, S. Iyengar, H. Qi, and E. Cho. Grid coverage for surveillance and target location in distributed sensor networks. IEEE Trans. on Computers, 51(12), 2002.Google Scholar
  15. 15.
    Z. Zhou, S. Das, and H. Gupta. Connected k-coverage problem in sensor networks. In Proc. of International Conference on Computer Communication and Networks (ICCCN’04), Chicago, IL, October 2004.Google Scholar
  16. 16.
    S. Yang, F. Dai, M. Cardei, and J. Wu. On multiple point coverage in wireless sensor networks. In Proc. of MASS, Washington, DC, November 2005.Google Scholar
  17. 17.
    T. Feder and D. Greene. Optimal algorithms for approximate clustering. In Proc. of the 20th Annual ACM Symposium on Theory of Computing (STOC’88), New York, NY, 1988.Google Scholar
  18. 18.
    Ronald W. Lee and James J. Kulesz. A risk-based sensor deployment methodology. Technical report, Oak Ridge National Laboratory, 2006.CrossRefGoogle Scholar
  19. 19.
    C.-F. Huang and Y.-C. Tseng. The coverage problem in a wireless sensor network. In Proc. of 2nd ACM International Conf. on Wireless Sensor Networks and Applications (WSNA’03), pages 115–121, 2003.Google Scholar
  20. 20.
    P. Hall. Introduction to the Theory of Coverage Processes. 1988.Google Scholar
  21. 21.
    A. Savvides, C. Han, and M. Strivastava. Dynamic fine-grained localization in ad-hoc networks of sensors. In Proc. of ACM MOBICOM’01, pages 166–179. ACM Press, 2001.Google Scholar
  22. 22.
    S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava. Coverage problems in wireless ad-hoc sensor networks. In INFOCOM, pages 1380–1387, 2001.Google Scholar
  23. 23.
    L. Doherty, L. El Ghaoui, and K. S. J. Pister. Convex position estimation in wireless sensor networks. In Proc. of IEEE Infocom 2001, Anchorage, AK, April 2001.Google Scholar
  24. 24.
    Y. Xu, J. Heidemann, and D. Estrin. Geography-informed energy conservation for ad hoc routing. In Proc. of ACM MOBICOM’01, Rome, Italy, July 2001.Google Scholar
  25. 25.
    R. I. Sykes, C. P. Cerasoli, and D. S. Henn. The representation of dynamic flow effects in a lagrangian puff dispersion model. J. Haz. Mat., 64:223–247, 1999.CrossRefGoogle Scholar
  26. 26.
    R. I. Sykes and R. S. Gabruk. A second-order closure model for the effect of averaging time on turbulent plume dispersion. J. Appl. Met., 36:165–184, 1997.CrossRefGoogle Scholar
  27. 27.
    National Geophysical Data Center. Global Land One-km Base Elevation Database. http://www.ngdc.noaa.gov/mgg/topo/globe.html, 2007.
  28. 28.
    Google Eearth. http://earth.google.com/, 2007.
  29. 29.
    Oak Ridge National Laboratory. Landscan main page. http://www.ornl.gov/sci/gist/landscan, 2005.
  30. 30.
    Defense Threat Reduction Agency. Hazard prediction and assessment capability (hpac). http://www.dtra.mil/Toolbox/Directorates/td/programs/acec/hpac.cfm.
  31. 31.
    J. Broch, D. A. Maltz, D. B. Johnson, Y. C. Hu, and J. Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Proc. of MobiCom, Dallas, Texas, USA, October 1998.Google Scholar
  32. 32.
    C. Y. T. Ma, J.-C. Chin, D. K. Y. Yau, N. S. V. Rao, and M. Shankar. Matching and fairness in threat-based mobile sensor coverage. Technical report, Department of Computer Science, Purdue University, March 2007.Google Scholar
  33. 33.
    R. E. Lapp and H. L. Andrews. Nuclear Radiation Physics. Prentice-Hall, 1948.Google Scholar
  34. 34.
    A. Sundaresan, P. K. Varshney, and N. S. V. Rao. Distributed detection of a nuclear radiaoactive source using fusion of correlated decisions. In Proc. of International Conference on Information Fusion, Quebec, Canada, July 2007.Google Scholar
  35. 35.
    C. Y. T. Ma, D. K. Y. Yau, J.-C. Chin, N. S. V. Rao, and M. Shankar. Distributed Detection and Data Fusion. Springer-Verlag, 1997.Google Scholar
  36. 36.
    Chris Y. T. Ma, David K. Y. Yau, Jren chit Chin, Nageswara S. Rao, and Mallikarjun Shankar. Resource-constrained coverage of radiation threats using limited mobility. Technical report, Department of Computer Science, Purdue University, June 2007.Google Scholar
  37. 37.
    N. Bisnik, A. Abouzeid, and V. Isler. Stochastic event capture using mobile sensors subject to a quality metric. In Proc. of MobiCom, Los Angeles, California, USA, September 2006.Google Scholar
  38. 38.
    B. Liu, P. Brass, O. Dousse, P. Nain, and D. Towsley. Mobility improves coverage of sensor networks. In Proc. of MobiHoc, Urbana-Champaign, IL, USA, May 2005.Google Scholar

Copyright information

© Springer-Verlag London Limited 2009

Authors and Affiliations

  • Jennifer C. Hou
  • David K. Y. Yau
    • 1
  • Chris Y. T. Ma
  • Yong Yang
  • Honghai Zhang
  • I- Hong Hou
  • Nageswara S. V. Rao
  • Mallikarjun Shankar
  1. 1.Purdue UniversityWest LafayetteIN

Personalised recommendations