skip to main content
10.1145/1774088.1774251acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
poster

Towards lightweight self-configuration in wireless sensor networks

Published: 22 March 2010 Publication History

Abstract

This paper proposes a new algorithm called SDS for solving distributed constraint satisfaction problems in wireless sensor networks. It introduces minimal overhead by using piggybacking for information dissemination and is naturally insusceptible against message loss. Partitioning into coordinating cliques has been used to demonstrate the feasibility of our approach.

References

[1]
S. G. Akojwar and R. M. Patrikar. Improving Life Time of Wireless Sensor Networks Using Neural Network Based Classification Techniques With Cooperative Routing. International Journal of Communications, 2(1), 2008.
[2]
B. Krishnamachari, R. Bejar, and S. Wicker. Distributed problem solving and the boundaries of self-configuration in multi-hop wireless networks. HICSS, 9:297b, 2002.
[3]
S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, 2nd edition, 2002.
[4]
M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving. In ICDCS, pages 614--621, 1992.

Index Terms

  1. Towards lightweight self-configuration in wireless sensor networks

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      SAC '10: Proceedings of the 2010 ACM Symposium on Applied Computing
      March 2010
      2712 pages
      ISBN:9781605586397
      DOI:10.1145/1774088
      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]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 22 March 2010

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. constraint satisfaction problem (CSP)
      2. distributed CSP (DCSP)
      3. self-configuration
      4. wireless

      Qualifiers

      • Poster

      Conference

      SAC'10
      Sponsor:
      SAC'10: The 2010 ACM Symposium on Applied Computing
      March 22 - 26, 2010
      Sierre, Switzerland

      Acceptance Rates

      SAC '10 Paper Acceptance Rate 364 of 1,353 submissions, 27%;
      Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

      Upcoming Conference

      SAC '25
      The 40th ACM/SIGAPP Symposium on Applied Computing
      March 31 - April 4, 2025
      Catania , Italy

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 129
        Total Downloads
      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 15 Feb 2025

      Other Metrics

      Citations

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media