37,682 research outputs found
Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey
Wireless sensor networks (WSNs) consist of autonomous and resource-limited
devices. The devices cooperate to monitor one or more physical phenomena within
an area of interest. WSNs operate as stochastic systems because of randomness
in the monitored environments. For long service time and low maintenance cost,
WSNs require adaptive and robust methods to address data exchange, topology
formulation, resource and power optimization, sensing coverage and object
detection, and security challenges. In these problems, sensor nodes are to make
optimized decisions from a set of accessible strategies to achieve design
goals. This survey reviews numerous applications of the Markov decision process
(MDP) framework, a powerful decision-making tool to develop adaptive algorithms
and protocols for WSNs. Furthermore, various solution methods are discussed and
compared to serve as a guide for using MDPs in WSNs
PocketCare: Tracking the Flu with Mobile Phones using Partial Observations of Proximity and Symptoms
Mobile phones provide a powerful sensing platform that researchers may adopt
to understand proximity interactions among people and the diffusion, through
these interactions, of diseases, behaviors, and opinions. However, it remains a
challenge to track the proximity-based interactions of a whole community and
then model the social diffusion of diseases and behaviors starting from the
observations of a small fraction of the volunteer population. In this paper, we
propose a novel approach that tries to connect together these sparse
observations using a model of how individuals interact with each other and how
social interactions happen in terms of a sequence of proximity interactions. We
apply our approach to track the spreading of flu in the spatial-proximity
network of a 3000-people university campus by mobilizing 300 volunteers from
this population to monitor nearby mobile phones through Bluetooth scanning and
to daily report flu symptoms about and around them. Our aim is to predict the
likelihood for an individual to get flu based on how often her/his daily
routine intersects with those of the volunteers. Thus, we use the daily
routines of the volunteers to build a model of the volunteers as well as of the
non-volunteers. Our results show that we can predict flu infection two weeks
ahead of time with an average precision from 0.24 to 0.35 depending on the
amount of information. This precision is six to nine times higher than with a
random guess model. At the population level, we can predict infectious
population in a two-week window with an r-squared value of 0.95 (a random-guess
model obtains an r-squared value of 0.2). These results point to an innovative
approach for tracking individuals who have interacted with people showing
symptoms, allowing us to warn those in danger of infection and to inform health
researchers about the progression of contact-induced diseases
Sensor configuration selection for discrete-event systems under unreliable observations
Algorithms for counting the occurrences of special events in the framework of partially-observed discrete event dynamical systems (DEDS) were developed in previous work. Their performances typically become better as the sensors providing the observations become more costly or increase in number. This paper addresses the problem of finding a sensor configuration that achieves an optimal balance between cost and the performance of the special event counting algorithm, while satisfying given observability requirements and constraints. Since this problem is generally computational hard in the framework considered, a sensor optimization algorithm is developed using two greedy heuristics, one myopic and the other based on projected performances of candidate sensors. The two heuristics are sequentially executed in order to find best sensor configurations. The developed algorithm is then applied to a sensor optimization problem for a multiunit- operation system. Results show that improved sensor configurations can be found that may significantly reduce the sensor configuration cost but still yield acceptable performance for counting the occurrences of special events
Value of Information in Feedback Control
In this article, we investigate the impact of information on networked
control systems, and illustrate how to quantify a fundamental property of
stochastic processes that can enrich our understanding about such systems. To
that end, we develop a theoretical framework for the joint design of an event
trigger and a controller in optimal event-triggered control. We cover two
distinct information patterns: perfect information and imperfect information.
In both cases, observations are available at the event trigger instantly, but
are transmitted to the controller sporadically with one-step delay. For each
information pattern, we characterize the optimal triggering policy and optimal
control policy such that the corresponding policy profile represents a Nash
equilibrium. Accordingly, we quantify the value of information
as the variation in the cost-to-go of the system given
an observation at time . Finally, we provide an algorithm for approximation
of the value of information, and synthesize a closed-form suboptimal triggering
policy with a performance guarantee that can readily be implemented
- …