An optimal query assignment for wireless sensor networks

Research output: Book/ReportReportProfessional

62 Downloads (Pure)

Abstract

With the increased use of large-scale real-time embedded sensor networks, new control mechanisms are needed to avoid congestion and meet required Quality of Service (QoS) levels. In this paper, we propose a Markov Decision Problem (MDP) to prescribe an optimal query assignment strategy that achieves a trade-off between two QoS requirements: query response time and data validity. Query response time is the time that queries spend in the sensor network until they are solved. Data validity (freshness) indicates the time elapsed between data acquisition and query response and whether that time period exceeds a predefined tolerance. We assess the performance of the proposed model by means of a discrete event simulation. Compared with three other heuristics, derived from practical assignment strategies, the proposed policy performs better in terms of average assignment costs. Also in the case of real query traffic simulations, results show that the proposed policy achieves cost gains compared with the other heuristics considered. The results provide useful insight into deriving simple assignment strategies that can be easily used in practice.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages14
Publication statusPublished - Dec 2012

Publication series

NameMemorandum
PublisherUniversity of Twente, Department of Applied Mathematics
No.2001
ISSN (Print)1874-4850
ISSN (Electronic)1874-4850

Keywords

  • EWI-22817
  • Optimal query admission
  • IR-84379
  • METIS-293285
  • Wireless Sensor Network
  • MSC-90C40

Cite this