Graduate Thesis Or Dissertation
 

Data Collection in Sensor Networks via the Novel Fast Markov Decision Process Framework

Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/bz60d019p

Descriptions

Attribute NameValues
Creator
Abstract
  • We investigate the data collection problem in sensor networks. The network consists of a number of stationary sensors deployed at different sites for sensing and storing data locally. A mobile element moves from sites to sites to collect data from the sensors periodically. There are different costs associated with the mobile element moving from one site to another, and different rewards for obtaining data at different sensors. Furthermore, the costs and the rewards are assumed to change abruptly. The goal is to find a "fast" optimal movement pattern/policy of the mobile element that optimizes for the costs and rewards in non-stationary environments. We formulate and solve this problem using a novel optimization framework called Fast Markov Decision Process (FMDP). The proposed FMDP framework extends the classical Markov Decision Process theory by incorporating the notion of mixing time that allows for the trade-off between the optimality and the convergence rate to the optimality of a policy. Theoretical and simulation results are provided to verify the proposed approach.
License
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Publisher
Peer Reviewed
Language
Replaces

Relationships

Parents:

This work has no parents.

In Collection:

Items

Thumbnail Title Date Uploaded Visibility Actions
file details DuongThaiP2015.pdf 2017-08-10 Public Download