Show simple item record

dc.contributor.advisorMarefat, Michaelen
dc.contributor.advisorReagan, Johnen
dc.contributor.authorChachra, Sumit
dc.contributor.authorElhourani, Theodore
dc.date.accessioned2016-04-14T15:42:14Zen
dc.date.available2016-04-14T15:42:14Zen
dc.date.issued2004-10en
dc.identifier.issn0884-5123en
dc.identifier.issn0074-9079en
dc.identifier.urihttp://hdl.handle.net/10150/605299en
dc.descriptionInternational Telemetering Conference Proceedings / October 18-21, 2004 / Town & Country Resort, San Diego, Californiaen_US
dc.description.abstractSeveral 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.
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.language.isoen_USen
dc.publisherInternational Foundation for Telemeteringen
dc.relation.urlhttp://www.telemetry.org/en
dc.rightsCopyright © International Foundation for Telemeteringen
dc.subjectDistributed Constraint Satisfaction/Optimizationen
dc.subjectSensor Networksen
dc.subjectMultiagent Systemsen
dc.subjectResource Allocationen
dc.titleRESOURCE ALLOCATION IN SENSOR NETWORKS USING DISTRIBUTED CONSTRAINT OPTIMIZATIONen_US
dc.typetexten
dc.typeProceedingsen
dc.contributor.departmentThe University of Arizonaen
dc.identifier.journalInternational Telemetering Conference Proceedingsen
dc.description.collectioninformationProceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection.en
refterms.dateFOA2018-06-16T16:27:42Z
html.description.abstractSeveral 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.


Files in this item

Thumbnail
Name:
ITC_2004_04-05-06.pdf
Size:
369.3Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record