Please use this identifier to cite or link to this item:
Title: Quality-of-service trade-off analysis for wireless sensor networks
Authors: Hoes, R.
Basten, T.
Tham, C.-K. 
Geilen, M.
Corporaal, H.
Keywords: Multi-objective optimisation
Pareto analysis
Wireless sensor networks
Issue Date: Mar-2009
Citation: Hoes, R., Basten, T., Tham, C.-K., Geilen, M., Corporaal, H. (2009-03). Quality-of-service trade-off analysis for wireless sensor networks. Performance Evaluation 66 (3-5) : 191-208. ScholarBank@NUS Repository.
Abstract: Quality of Service (QoS) support for wireless sensor networks (WSN) is a fairly new topic that is gaining more and more interest. This paper introduces a method for determining the node configurations of a WSN such that application-level QoS constraints are met. This is a complex task, since the search space is typically extremely large. The method is based on a recent algebraic approach to Pareto analysis, that we use to reason about QoS trade-offs. It features an algorithm that keeps the working set of possible configurations small, by analysing parts of the network in a modular fashion, and meanwhile discarding configurations that are inferior to other configurations. Furthermore, we give WSN models for two different applications, spatial mapping and target tracking, in which QoS trade-offs are made explicit. Test results for these applications and a heterogeneous WSN combining these two applications show that the models are accurate and that the method is scalable and thus practically usable for WSN, even with large numbers of nodes. Details are given on how to efficiently implement the algorithm. © 2008 Elsevier B.V. All rights reserved.
Source Title: Performance Evaluation
ISSN: 01665316
DOI: 10.1016/j.peva.2008.10.007
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Nov 16, 2018


checked on Nov 12, 2018

Page view(s)

checked on Nov 17, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.