.png){kind=icon}
.png){kind=icon}
Return
Optimal query assignment for wireless sensor networks
.png){kind=icon}
OA
AI
DOI：10.1016/j.aeue.2015.04.009.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Increasing computing capabilities of modern sensors have enabled current wireless sensor networks to process queries within the network. This complements the traditional features of the sensor networks such as sensing the environment and communicating the data. Query processing, however, poses Quality of Service challenges such as query waiting time and validity (age) of the data. We focus on the processing cost of queries as a trade-off between the time queries wait to be processed and the age of the data provided to the queries. To model this trade-off, we propose a Continuous Time Markov Decision Process which assigns queries either to the sensor network, where queries wait to be processed, or to a central database, which provides stored and possibly outdated data. To compute an optimal query assignment policy, a Discrete Time Markov Decision Process, shown to be stochastically equivalent to the initial continuous time process, is formulated. A comparative numerical analysis of the Performance of the optimal assignment policy and of several heuristics, derived from practice, is performed. This provides a theoretical support for the design and implementation of WSN applications, while ensuring a close-to-optimum performance of the system. (C) 2015 Elsevier GmbH. All rights reserved.
Keywords:
Wireless sensor networks
Markov Decision Processes
Quality of Service
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
A
IF:
3.2
Papers:
5.6K
Citations:
8.3K