Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Enabling design of performance-controlled sensor network applications through task allocation and reallocation
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Architecture and Computer Communication. (Communication Research)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
2015 (English)In: Proc. 11th International Conference on Distributed Computing in Sensor Systems, IEEE Computer Society, 2015, 248-253 p.Conference paper, Published paper (Refereed)
Abstract [en]

Task Graph (ATaG) is a sensor network application development paradigm where the application is visually described by a graph where the nodes correspond to application-level tasks and edges correspond to dataflows. We extend ATaG with the option to add nonfunctional requirements: constraints on end-to-end delay and packet delivery rate. Setting up these constraints at the design phase naturally leads to enabling run-time assurance at the deployment phase, when the conditions of the constraints are used as network's performance goals. We provide both run-time middleware that checks the conditions of these constraints and a central management unit that dynamically adapts the system by doing task reallocation and putting task copies on redundant nodes. Through extensive simulations we show that the system is efficient enough to enable adaptations within tens of seconds even in large networks.

Place, publisher, year, edition, pages
IEEE Computer Society, 2015. 248-253 p.
National Category
Computer Science
Identifiers
URN: urn:nbn:se:uu:diva-256773DOI: 10.1109/DCOSS.2015.44ISI: 000380515100035ISBN: 9781479988563 (print)OAI: oai:DiVA.org:uu-256773DiVA: diva2:826953
Conference
PWSN 2015, June 12, Fortaleza, Brazil
Projects
ProFuN
Funder
Swedish Foundation for Strategic Research , RIT08-0065
Available from: 2015-06-26 Created: 2015-06-26 Last updated: 2016-09-15Bibliographically approved

Open Access in DiVA

fulltext(761 kB)307 downloads
File information
File name FULLTEXT01.pdfFile size 761 kBChecksum SHA-512
414e6d31a6cc4aec7fe61e0b15157a5a166391ac661bebab98ea27992741bebf59ed115db9e48a8fefaad5cea41feec5fea4663f55d033ca5110be06756169e7
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Elsts, AtisHassani Bijarbooneh, FarshidJacobsson, MartinSagonas, Konstantinos
By organisation
Computing ScienceComputer Architecture and Computer Communication
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 307 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 563 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf