An analysis and application of distributed constraint satisfaction and optimization algorithms in sensor networks

  • Authors:

  • Weixiong Zhang;Zhao Xing;Guandong Wang;Lars Wittenburg

  • Affiliations:

  • Washington University in St. Louis, St. Louis, MO;Washington University in St. Louis, St. Louis, MO;Washington University in St. Louis, St. Louis, MO;Washington University in St. Louis, St. Louis, MO

  • Venue:
  • AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This research is motivated by a distributed scheduling problem in distributed sensor networks, in which computational resources are scarce. To cope with limited computational resources and restricted real-time requirement, it is imperative to apply distributed algorithms that have low overhead on resource requirement and high anytime performance. In this paper, We study distributed stochastic algorithm (DSA) and distributed breakout algorithm (DBA), two distributed algorithms developed earlier for distributed constraint satisfaction problems. We experimentally investigate their properties and compare their performance using our distributed scheduling problem as a benchmark. We first formulate the scheduling problem as a distributed multi-coloring problem. We then experimentally show that the solution quality and communication cost of DSA exhibit phase-transition or threshold behavior, in that the performance degenerates abruptly and dramatically when the degree of parallel executions of distributed agents increases beyond some critical value. The results show that when controlled properly, DSA is superior to DBA, having better or competitive solution quality and significantly smaller communication cost than DBA. Therefore, DSA is the algorithm of choice for our distributed scan scheduling problem.