skip to main content
10.1145/1815396.1815419acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiwcmcConference Proceedingsconference-collections
research-article

Maximum lifetime scheduling for target coverage in wireless sensor networks

Published:28 June 2010Publication History

ABSTRACT

The best way to conserve energy in wireless sensor networks is to change the radio interface state to sleep mode. The sensors in sleep mode conserve energy, whereas the sensors in active mode use their energy to continue to monitor the target. How sensors are scheduled between active and sleep modes affects the lifetime of the sensor network.

Some existing scheduling schemes do not achieve maximum energy efficiency because they do not take into account both overlapping target coverage and the residual energy of sensors. It is important to reduce overlapping target coverage because it can waste sensor energy unnecessarily.

In this paper, we propose a new energy efficient algorithm that takes into account both overlapping target coverage and the residual energy of sensors. Simulation results show that this algorithm produces more number of cover sets than the existing algorithms, so that the network lifetime becomes higher.

References

  1. I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci. A survey on sensor networks. IEEE Communications magazine, 40(8):102--114, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. V. Raghunathan, C. Schurgers, S. Park, and M. B. Srivastava. Energy-aware wireless microsensor networks. IEEE Signal Processing Magazine, 19(2):40--50, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  3. D. Li, K. Wong, Y. H. Hu, and A. Sayeed. Detection, classification and tracking of targets in distributed sensor networks. IEEE Signal Processing Magazine, 19(2):17--29, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  4. W. Ye, J. Heidemann, and D. Estrin. Medium access control with coordinated adaptive sleeping for wireless sensor networks. IEEE/ACM Transactions on Networking (ToN), 12(3):493--506, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. X. Y. Li, P. J. Wan, and O. Frieder. Coverage in wireless ad hoc sensor networks. IEEE Transactions on Computers, 52(6):753--763, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava. Coverage problems in wireless ad hoc sensor networks. In IEEE INFOCOM, volume 3, pages 1380--1387. Citeseer, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  7. C. F. Huang and Y. C. Tseng. A survey of solutions to the coverage problems in wireless sensor networks. Journal of Internet Technology, 6(1):1--8, 2005.Google ScholarGoogle Scholar
  8. M. Cardei, M. T. Thai, Y. Li, and W. Wu. Energy-efficient target coverage in wireless sensor networks. In IEEE INFOCOM, volume 3, page 1976. Citeseer, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Cardei and D. Z. Du. Improving wireless sensor network lifetime through power aware organization. Wireless Networks, 11(3):333--340, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Sung-Yeop Pyun and Dong-Ho Cho. Power-saving scheduling for multiple-target coverage in wireless sensor networks. Comm. Letters., 13(2):130--132, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Maximum lifetime scheduling for target coverage in wireless sensor networks

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        IWCMC '10: Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
        June 2010
        1371 pages
        ISBN:9781450300629
        DOI:10.1145/1815396

        Copyright © 2010 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 28 June 2010

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader