Distributed Algorithms for Lifetime of Wireless Sensor Networks Based on Dependencies Among Cover Sets

  • Sushil K. Prasad
  • Akshaye Dhawan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4873)


We present a new set of distributed algorithms for scheduling sensors to enhance the total lifetime of a wireless sensor network. These algorithms are based on constructing minimal cover sets each consisting of one or more sensors which can collectively cover the local targets.  Some of the covers are heuristically better than others for a sensor trying to decide its own sense-sleep status.  This leads to various ways to assign priorities to the covers. The algorithms work by having each sensor transition through these possible prioritized cover sets, settling for the best cover it can negotiate with its neighbors.   A local lifetime dependency graph consisting of the cover sets as nodes with any two nodes connected if the corresponding covers intersect captures the interdependencies among the covers. We present several variations of the basic algorithmic framework.  The priority function of a cover is derived from its degree or connectedness in the dependency graph - usually lower the better.  Lifetime improvement is 10% to 20% over the existing algorithms, while maintaining comparable communication overheads.   We also show how previous algorithms can be formulated within our framework.


Sensor Network Wireless Sensor Network Network Lifetime Minimal Cover Gateway Node 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: A Survey on Sensor Networks. In: IEEE Communications Magazine, pp. 102–114 (2002)Google Scholar
  2. 2.
    Berman, P., Calinescu, G., Shah, C., Zelikovsky, A.: Power Efficient Monitoring Management in Sensor Networks. In: IEEE Wireless Communication and Networking Conference (WCNC 2004), Atlanta, pp. 2329–2334 (March 2004)Google Scholar
  3. 3.
    Berman, P., Calinescu, G., Shah, C., Zelikovsky, A.: Efficient Energy Management in Sensor Networks. In: Xiao, Y., Pan, Y. (eds.) Ad Hoc and Sensor Networks, Wireless Networks and Mobile Computing, vol. 2, Nova Science Publishers (2005)Google Scholar
  4. 4.
    Brinza, D., Zelikovsky, A.: DEEPS: Deterministic Energy-Efficient Protocol for Sensor networks. In: ACIS International Workshop on Self-Assembling Wireless Networks (SAWN 2006) Proc. of SNPD, pp. 261–266 (2006)Google Scholar
  5. 5.
    Cardei, M., Thai, M.T., Li, Y., Wu, W.: Energy-efficient target coverage in wireless sensor networks. In: Proc. of IEEE Infocom (2005)Google Scholar
  6. 6.
    Cardei, M., Du, D.-Z.: Improving Wireless Sensor Network Lifetime through Power Aware Organization. ACM Wireless Networks 11(3) (May 2005)Google Scholar
  7. 7.
    Chong, C.-Y., Kumar, S.P.: Sensor Networks: Evolution, Opportunities and Challenges. Proceeding of the IEEE 91(8) (August 2003)Google Scholar
  8. 8.
    Garey, M.R, Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, Newyork (1979)zbMATHGoogle Scholar
  9. 9.
    Kumar, S., Lai, T.H., Balogh, J.: On k-coverage in a mostly sleeping sensor network. In: Proceedings of the 10th annual international conference on Mobile computing and networking, Philadelphia, PA, USA (2004)Google Scholar
  10. 10.
    Slijepcevic, S., Potkonjak, M.: Power efficient organization of wireless sensor networks. In: Proc. IEEE International Conference on Communications (ICC), pp. 472–476 (2001)Google Scholar
  11. 11.
    Li, W.: On calculating connected dominating set for efficient routing in ad hoc wireless networks. In: Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications, pp. 7–14 (1999)Google Scholar
  12. 12.
    Wu, J., Dai, F., Gao, M., Stojmenovic, I.: On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks. Journal Of Communications And Networks 4(1) (March 2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Sushil K. Prasad
    • 1
  • Akshaye Dhawan
    • 1
  1. 1.Computer Science Department, Georgia State University, Atlanta, GA 30303U.S.A

Personalised recommendations