skip to main content
10.1145/1143549.1143709acmconferencesArticle/Chapter ViewAbstractPublication PagesiwcmcConference Proceedingsconference-collections
Article

Energy efficient distributed connected dominating sets construction in wireless sensor networks

Published:03 July 2006Publication History

ABSTRACT

One important characteristic of wireless sensor networks is energy stringency. Constructing a connected dominating set (CDS) has been widely used as a topology control strategy to reduce the network communication overhead. In the paper, a novel energy efficient distributed connected dominating set algorithm based on coordinated reconstruction mechanism is presented to further prolong the network lifetime and balance energy consumption. The algorithm is with O(n) time complexity and O(n) message complexity. The simulation results show that our algorithm outperforms several existing algorithms in terms of network lifetime and CDS performance.

References

  1. Pottie, G. J. and Kaiser, W .J. Wireless integrated network sensors. Communications of ACM, Vol. 43, No. 5, May 2000, 51--58. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Akyildiz, IF, Su, W., Sankarasubramaniam, Y., and Cayirci, E. A survey on sensor networks. IEEE Communications Magazine, vol. 40, no.8, 2002, 102--114. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Clark, B. N., Colbourn, C.J., and Johnson, D. S. Unit disk graphs. Discrete Mathematics, Vol. 86, 1990, 165--177. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Wan, P. J., Alzoubi, K. and Frieder, O. Distributed well connected dominating set in wireless ad hoc networks. In Proc. IEEE INFOCOM,2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Alzoubi, K., Wan, P. J., Frieder, O. New distributed algorithm for connected dominating set in wireless Ad Hoc networks. In Proc. 35th Hawaii Int'1 Conf, 2000,3881--3887. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Wu, J. and Li, H. On calculating connected dominating set for efficient routing in ad hoc wireless networks. In Proc. the 3rd ACM Int'l workshop Disc. Algor. and Methods for Mobile Computing and Commun., 1999,7--14. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Butenko, S., Cheng, X., Oliveira, C.A.S, and Pardalos, P. M. A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks. Cooperative Control and Optimization, 2004,61--73.Google ScholarGoogle Scholar
  8. Min, M., Huang, C. X., Huang, S. C.-H., Wu, W., Du, H. and Jia, X. Improving construction for connected dominating set with Steiner tree in wireless sensor networks. Global Optimization, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Wu, J., Dai, F., Gao, M., and Stojmenovic, I. On Calculating Power-Aware Connected Dominating Sets for Efficient Routing in Ad Hoc Wireless Networks. In Proc. IEEE Int'l ICPP, 2001,346--356. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Acharya, T. and Roy, R. Distributed Algorithm for Power Aware Minimum Connected Dominating set for Routing in Wireless Ad Hoc Networks. In Proc. ICPP Workshops, ,2005,387--394. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Wu, W., Du, H., Jia, X., Li, Y., Huang, C.-H., Du, D-Z. Minimum connected dominating sets and maximal independent sets in unit disk graphs. technical report 04-047, Department of Computer Science and Engineering, University of Minnesota, 2004.Google ScholarGoogle Scholar

Index Terms

  1. Energy efficient distributed connected dominating sets construction 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 Conferences
        IWCMC '06: Proceedings of the 2006 international conference on Wireless communications and mobile computing
        July 2006
        2006 pages
        ISBN:1595933069
        DOI:10.1145/1143549

        Copyright © 2006 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: 3 July 2006

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader