Abstract

Task-centric wireless sensor network environments are often characterized by the simultaneous operation of multiple tasks. Individual tasks compete for constrained resources and thus need resource mediation algorithms at two levels. First, different sensors must be allocated to different tasks based on the combination of sensor attributes and task requirements. Subsequently, sensor data rates on various data routes must be dynamically adapted to share the available wireless bandwidth, especially when links experience traffic congestion. In this paper we investigate heuristics for incrementally modifying the sensor-task matching process to incorporate changes in the transport capacity constraints or feasible task utility values.


Original document

The different versions of the original document can be found in:

http://dx.doi.org/10.1109/acssc.2008.5074598
http://orca.cf.ac.uk/14199,
http://orca-mwe.cf.ac.uk/14199,
http://comet.lehman.cuny.edu/mjohnson/pubs.php?key=asilomar08&bib=mpj.bib,
https://academic.microsoft.com/#/detail/2102208139
Back to Top

Document information

Published on 01/01/2009

Volume 2009, 2009
DOI: 10.1109/acssc.2008.5074598
Licence: CC BY-NC-SA license

Document Score

0

Views 1
Recommendations 0

Share this document

Keywords

claim authorship

Are you one of the authors of this document?