Advertisement

Lifetime Maximization of Sensor Networks Under Connectivity and k-Coverage Constraints

  • Wei Mo
  • Daji Qiao
  • Zhengdao Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4026)

Abstract

In this paper, we study the fundamental limits of a wireless sensor network’s lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network with n sensors deployed independently and uniformly in a square field of unit area. Each sensor is active with probability p, independently from others, and each active sensor can sense a disc area with radius r s . Moreover, considering the inherent irregularity of a sensor’s sensing range caused by time-varying environments, we model the sensing radius r s as a random variable with mean r 0 and variance r \(_{\rm 0}^{\rm 2}\) σ \(_{s}^{\rm 2}\). Two active sensors can communicate with each other if and only if the distance between them is smaller than or equal to the communication radius r c .

The key contributions of this paper are: (1) we introduce a new definition of a wireless sensor network’s lifetime from a novel probabilistic perspective, called ω-lifetime (0 ≤ ω ≤ 1). It is defined as the expectation of the time interval during which the probability of guaranteeing connectivity and k-coverage simultaneously is at least ω; and (2) based on the analysis results, we propose a near-optimal scheduling algorithm, called PIS (Pre-planned Independent Sleeping), to achieve the network’s maximum ω-lifetime, which is validated by simulation results, and present a possible implementation of the PIS scheme in the distributed manner.

Keywords

Sensor Network Wireless Sensor Network Outage Probability Schedule Scheme Active Sensor 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A survey on sensor networks. IEEE Communication Magazine 40(8), 102–114 (2002)CrossRefGoogle Scholar
  2. 2.
    Estrin, D., Govindan, R., Heidemann, J., Kumar, S.: Next century challenges: scalable coordination in sensor networks. In: Proc. ACM MobiCom 1999, Seattle, WA, pp. 263–270 (1999)Google Scholar
  3. 3.
    Gupta, P., Kumar, P.: Critical power for asymptotic connectivity. In: Proc. the 37th IEEE Conference on Decision and Control, vol. 1, pp. 1106–1110 (1998)Google Scholar
  4. 4.
    Miorandi, D., Altman, E.: Coverage and connectivity of ad hoc networks in presence of channel randomness. In: Proc. IEEE INFOCOM 2005, Miami, FL, pp. 491–502 (March 2005)Google Scholar
  5. 5.
    Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated coverage and connectivity configuration in wireless sensor networks. In: Proc. ACM SenSys 2003, Los Angeles, CA, pp. 28–39 (2003)Google Scholar
  6. 6.
    Liu, B., Towsley, D.: A study of the coverage of large-scale sensor networks. In: Proc. IEEE MASS 2004, Fort Lauderdale, FL, October 2004, pp. 475–483 (2004)Google Scholar
  7. 7.
    Shakkottai, S., Srikant, R., Shroff, N.: Unreliable sensor grids: coverage, connectivity and diameter. In: Proc. IEEE INFOCOM 2003, vol. 2, pp. 1073–1083 (2003)Google Scholar
  8. 8.
    Kumar, S., Lai, T., Balogh, J.: On k-coverage in a mostly sleeping sensor network. In: Proc. ACM MobiCom 2004, Philadelphia, PA, pp. 144–158 (2004)Google Scholar
  9. 9.
    Ye, F., Zhong, G., Cheng, J., Lu, S., Zhang, L.: PEAS: a robust energy conserving protocol for long-lived sensor networks. In: Proc. IEEE ICDCS 2003, Providence, RI, pp. 28–37 ( May 2003)Google Scholar
  10. 10.
    Zhang, H., Hou, J.: On deriving the upper bound of α-lifetime for large sensor networks. In: Proc. ACM MobiHoc 2004, Roppongi Hills, Tokyo, Japan, pp. 121–132 (2004)Google Scholar
  11. 11.
    Xu, Y., Heidemann, J., Estrin, D.: Geography-informed energy conservation for ad hoc routing. In: Proc. ACM MobiCom 2001, Rome, Italy (July 2001)Google Scholar
  12. 12.
    Hsin, C., Liu, M.: Network coverage using low duty-cycled sensors: random and coordinated sleep algorithms. In: Proc. IEEE IPSN 2004, Berkeley, CA, pp. 433–442 (April 2004)Google Scholar
  13. 13.
    Gui, C., Mohapatra, P.: Power convervation and quality of surveillance in target tracking sensor networks. In: Proc. ACM MobiCom 2004, Philadelphia, PA (September 2004)Google Scholar
  14. 14.
    Hall, P.: Introduction to the Theory of Coverage Process. John Wiley, Chichester (1988)Google Scholar
  15. 15.
    Mo, W., Qiao, D., Wang, Z.: Mostly sleeping wireless sensor networks: connectivity, k-coverage, and lifetime. Electrical and Computer Engineering Department, Iowa State University, Tech. Rep. (2005)Google Scholar
  16. 16.
    Billingsley, P.: Probability and Measure. Wiley, New York (1979)MATHGoogle Scholar
  17. 17.
    Rappaport, T.: Wireless Communications: Principles and Practice. Prentice-Hall, Englewood Cliffs (2001)Google Scholar
  18. 18.
    Blough, D., Santi, P.: Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks. In: Proc. MobiCom 2002, pp. 183–192 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Wei Mo
    • 1
  • Daji Qiao
    • 1
  • Zhengdao Wang
    • 1
  1. 1.Iowa State UniversityAmesUSA

Personalised recommendations