International Telemetering Conference Proceedings / October 18-21, 2004 / Town & Country Resort, San Diego, California / Several algorithms have been proposed for solving constraint satisfaction and the more general
constraint optimization problem in a distributed manner. In this paper we apply two such algorithms
to the task of dynamic resource allocation in the sensor network domain using appropriate
abstractions. The aim is to effectively track multiple targets by making the sensors coordinate with
each other in a distributed manner, given a probabilistic representation of tasks (targets). We present
simulation results and compare the performance of the DBA and DSA algorithms under varying
experimental settings.
| Identifer | oai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/605299 |
| Date | 10 1900 |
| Creators | Chachra, Sumit, Elhourani, Theodore |
| Contributors | Marefat, Michael, Reagan, John, The University of Arizona |
| Publisher | International Foundation for Telemetering |
| Source Sets | University of Arizona |
| Language | en_US |
| Detected Language | English |
| Type | text, Proceedings |
| Rights | Copyright © International Foundation for Telemetering |
| Relation | http://www.telemetry.org/ |
Page generated in 0.0019 seconds