1,392 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
Distributed Detection in Sensor Networks with Limited Range Sensors
We consider a multi-object detection problem over a sensor network (SNET)
with limited range sensors. This problem complements the widely considered
decentralized detection problem where all sensors observe the same object.
While the necessity for global collaboration is clear in the decentralized
detection problem, the benefits of collaboration with limited range sensors is
unclear and has not been widely explored. In this paper we develop a
distributed detection approach based on recent development of the false
discovery rate (FDR). We first extend the FDR procedure and develop a
transformation that exploits complete or partial knowledge of either the
observed distributions at each sensor or the ensemble (mixture) distribution
across all sensors. We then show that this transformation applies to
multi-dimensional observations, thus extending FDR to multi-dimensional
settings. We also extend FDR theory to cases where distributions under both
null and positive hypotheses are uncertain. We then propose a robust
distributed algorithm to perform detection. We further demonstrate scalability
to large SNETs by showing that the upper bound on the communication complexity
scales linearly with the number of sensors that are in the vicinity of objects
and is independent of the total number of sensors. Finally, we deal with
situations where the sensing model may be uncertain and establish robustness of
our techniques to such uncertainties.Comment: Submitted to IEEE Transactions on Signal Processin
The Sensing Capacity of Sensor Networks
This paper demonstrates fundamental limits of sensor networks for detection
problems where the number of hypotheses is exponentially large. Such problems
characterize many important applications including detection and classification
of targets in a geographical area using a network of sensors, and detecting
complex substances with a chemical sensor array. We refer to such applications
as largescale detection problems. Using the insight that these problems share
fundamental similarities with the problem of communicating over a noisy
channel, we define a quantity called the sensing capacity and lower bound it
for a number of sensor network models. The sensing capacity expression differs
significantly from the channel capacity due to the fact that a fixed sensor
configuration encodes all states of the environment. As a result, codewords are
dependent and non-identically distributed. The sensing capacity provides a
bound on the minimal number of sensors required to detect the state of an
environment to within a desired accuracy. The results differ significantly from
classical detection theory, and provide an ntriguing connection between sensor
networks and communications. In addition, we discuss the insight that sensing
capacity provides for the problem of sensor selection.Comment: Submitted to IEEE Transactions on Information Theory, November 200
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
Performance Analysis of the Decentralized Eigendecomposition and ESPRIT Algorithm
In this paper, we consider performance analysis of the decentralized power
method for the eigendecomposition of the sample covariance matrix based on the
averaging consensus protocol. An analytical expression of the second order
statistics of the eigenvectors obtained from the decentralized power method
which is required for computing the mean square error (MSE) of subspace-based
estimators is presented. We show that the decentralized power method is not an
asymptotically consistent estimator of the eigenvectors of the true measurement
covariance matrix unless the averaging consensus protocol is carried out over
an infinitely large number of iterations. Moreover, we introduce the
decentralized ESPRIT algorithm which yields fully decentralized
direction-of-arrival (DOA) estimates. Based on the performance analysis of the
decentralized power method, we derive an analytical expression of the MSE of
DOA estimators using the decentralized ESPRIT algorithm. The validity of our
asymptotic results is demonstrated by simulations.Comment: 18 pages, 5 figures, submitted for publication in IEEE Transactions
on Signal Processin
Efficient Distributed Detection for Wireless Sensor Networks
Negli ultimi anni si è assistito ad una crescita esponenziale delle tecnologie per la fabbricazione di micro dispositivi ed, in particolare, di sensori. Il costo di tali sensori si è ridotto, portando ad un crescente interesse in reti di sensori, ad esempio, per il monitoraggio ambientale. D'altro canto, l'utilizzo di reti di sensori nel campo militare ha una lunga storia. In tutti i casi, l'obiettivo di una rete di sensori è quello di identificare lo stato di un fenomeno di interesse attraverso l'azione collaborativo di più sensori. Un esempio di tale azione è la rivelazione distribuita. In questa tesi, viene studiato come incorporare le caratteristiche intrisìnseche del fenomeno sotto osservazione nella progettazione di algoritmi di rivelazione distribuita in reti di sensori.Recent years have witnessed an exponential growth of micro device manufacturing techniques and, in particular, of powerful sensor devices. The costs of these sensors have dropped, leading to an increasing interest on sensor networks for civilian applications, e.g., environmental monitoring. The use of sensor networks in the military field has, on the other hand, a long history. In all cases, the goal of a sensor network is to identify the status of a phenomenon of interest through a collaborative action of the sensors. An instance of this collaborative action is given by distributed detection. The increasing interest for sensor networks has, therefore, spurred a significant activity on the design of efficient distributed detection techniques. In this thesis, we investigate how the structural properties of the physical phenomenon under observation can be taken into account in designing distributed detection algorithms for sensor networks
- …