Skip to main navigation Skip to search Skip to main content

Towards lightweight self-configuration in wireless sensor networks

  • Benjamin Satzger*
  • , Faruk Bagci
  • , Florian Kluge
  • , Theo Ungerer
  • *Corresponding author for this work
  • Department of Computer Science
  • Augsburg University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original languageEnglish
Title of host publicationAPPLIED COMPUTING 2010 - The 25th Annual ACM Symposium on Applied Computing
Pages791-792
Number of pages2
DOIs
StatePublished - 2010
Externally publishedYes
Event25th Annual ACM Symposium on Applied Computing, SAC 2010 - Sierre, Switzerland
Duration: 22 Mar 2010 → 26 Mar 2010

Publication series

NameProceedings of the ACM Symposium on Applied Computing

Conference

Conference25th Annual ACM Symposium on Applied Computing, SAC 2010
Country/TerritorySwitzerland
CitySierre
Period22/03/10 → 26/03/10

Keywords

  • constraint satisfaction problem (CSP)
  • distributed CSP (DCSP)
  • self-configuration
  • wireless

Fingerprint

Dive into the research topics of 'Towards lightweight self-configuration in wireless sensor networks'. Together they form a unique fingerprint.

Cite this