Energy Efficient Distributed Algorithms for Sensor Target Coverage Based on Properties of an Optimal Schedule

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

Abstract

A major challenge in Wireless Sensor Networks is that of maximizing the lifetime while maintaining coverage of a set of targets, a known NP-complete problem. In this paper, we present theoretically-grounded, energy-efficient, distributed algorithms that enable sensors to schedule themselves into sleep-sense cycles. We had earlier introduced a lifetime dependency (LD) graph model that captures the interdependencies between these cover sets by modeling each cover as a node and having the edges represent shared sensors. The key motivation behind our approach in this paper has been to start with the question of what an optimal schedule would do with the lifetime dependency graph. We prove some basic properties of the optimal schedule that relate to the LD graph. Based on these properties, we have designed algorithms which choose the covers that exhibit these optimal schedule like properties. We present three new sophisticated algorithms to prioritize covers in the dependency graph and simulate their performance against state-of-art algorithms. The net effect of the 1-hop version of these three algorithms is a lifetime improvement of more than 25-30% over the competing algorithms of other groups, and 10-15% over our own; the 2-hop versions have additional improvements, 30-35% and 20-25%, respectively.

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 Commun. Mag., 102–114 (2002)Google Scholar
  2. 2.
    Abrams, Z., Goel, A., Plotkin, S.: Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: Third International Symposium on Information Processing in Sensor Networks, pp. 424–432 (2004)Google Scholar
  3. 3.
    Cardei, M., Du, D.Z.: Improving wireless sensor network lifetime through power aware organization. Wireless Networks 11(8), 333–340 (2005)CrossRefGoogle Scholar
  4. 4.
    Slijepcevic, S., Potkonjak, M.: Power efficient organization of wireless sensor networks. In: IEEE International Conference on Communications (ICC), vol. 2, pp. 472–476 (2001)Google Scholar
  5. 5.
    Cardei, M., Thai, M., Li, Y., Wu, W.: Energy-efficient target coverage in wireless sensor networks. In: INFOCOM 2005, vol. 3 (March 2005)Google Scholar
  6. 6.
    Berman, P., Calinescu, G., Shah, C., Zelikovsky, A.: Power efficient monitoring management in sensor networks. In: Wireless Communications and Networking Conference (WCNC), vol. 4, pp. 2329–2334 (2004)Google Scholar
  7. 7.
    Miodrag, S.M.: Low power 0/1 coverage and scheduling techniques in sensor networks. UCLA Technical Reports 030001 (2003)Google Scholar
  8. 8.
    Dhawan, A., Vu, C.T., Zelikovsky, A., Li, Y., Prasad, S.K.: Maximum lifetime of sensor networks with adjustable sensing range. In: Proceedings of the International Workshop on Self-Assembling Wireless Networks (SAWN), pp. 285–289 (2006)Google Scholar
  9. 9.
    Lu, J., Suda, T.: Coverage-aware self-scheduling in sensor networks. In: 18th Annual Workshop on Computer Communications (CCW), pp. 117–123 (2003)Google Scholar
  10. 10.
    Berman, P., Calinescu, G., Shah, C., Zelikovsky, A.: Efficient energy management in sensor networks. In: Ad Hoc and Sensor Networks, Wireless Networks and Mobile Computing (2005)Google Scholar
  11. 11.
    Brinza, D., Zelikovsky, A.: Deeps: Deterministic energy-efficient protocol for sensor networks. In: Proceedings of the International Workshop on Self-Assembling Wireless Networks (SAWN), pp. 261–266 (2006)Google Scholar
  12. 12.
    Prasad, S.K., Dhawan, A.: Distributed algorithms for lifetime of wireless sensor networks based on dependencies among cover sets. In: Aluru, S., Parashar, M., Badrinath, R., Prasanna, V.K. (eds.) HiPC 2007. LNCS, vol. 4873, pp. 381–392. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  13. 13.
    Dhawan, A., Prasad, S.K.: A distributed algorithmic framework for coverage problems in wireless sensor networks. In: Procs. Intl. Parallel and Dist. Processing Symp. Workshops (IPDPS), Workshop on Advances in Parallel and Distributed Computational Models (APDCM), pp. 1–8 (2008)Google Scholar
  14. 14.
    Tian, D., Georganas, N.D.: A coverage-preserving node scheduling scheme for large wireless sensor networks. In: WSNA: Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications, pp. 32–41. ACM, New York (2002)CrossRefGoogle Scholar
  15. 15.
    Zhang, H., Hou, J.: Maintaining sensing coverage and connectivity in large sensor networks. In: Ad Hoc and Sensor Wireless Networks, AHSWN (2005)Google Scholar
  16. 16.
    Xing, G., Wang, X., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated coverage and connectivity configuration for energy conservation in sensor networks. ACM Trans. Sen. Netw. 1(1), 36–72 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Akshaye Dhawan
    • 1
  • Sushil K. Prasad
    • 1
  1. 1.Department of Computer ScienceGeorgia State UniversityAtlantaUSA

Personalised recommendations