Decentralized activation in sensor networks - global games and adaptive filtering games

Authors:
Vikram Krishnamurthy
Affiliations:
University of British Columbia, Department of Electrical and Computer Engineering, 2356 Main Mall, Vancouver, Canada, V6T 1Z4
Venue:
Digital Signal Processing
Year:
2011

Citing 10
Cited 0

Stochastic systems: estimation, identification and adaptive control

Stochastic systems: estimation, identification and adaptive control
Adaptive algorithms and stochastic approximations

Adaptive algorithms and stochastic approximations
Neuro-Dynamic Programming

Neuro-Dynamic Programming
Stochastic Approximations and Differential Inclusions, Part II: Applications

Mathematics of Operations Research
Decentralized spectrum access amongstcognitive radios: an interacting multivariate global game-theoretic approach

IEEE Transactions on Signal Processing
Decentralized dynamic spectrum access for cognitive radios: cooperative design of a non-cooperative game

IEEE Transactions on Communications
Decentralized Adaptive Filtering Algorithms for Sensor Activation in an Unattended Ground Sensor Network

IEEE Transactions on Signal Processing
Decentralized Activation in Dense Sensor Networks via Global Games

IEEE Transactions on Signal Processing - Part I
Recursive algorithms for estimation of hidden Markov models and autoregressive models with Markov regime

IEEE Transactions on Information Theory
Game theory and the design of self-configuring, adaptive wireless networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers two methodologies for decentralized sensor activation in wireless sensor networks for energy-efficient monitoring. First, decentralized activation in wireless sensor networks is investigated using the theory of global games. Given a large number of sensors which can operate in either an energy-efficient ''low-resolution'' monitoring mode, or a more costly ''high-resolution'' mode, the problem of computing and executing a strategy for mode selection is formulated as a global game with diverse utilities and noise conditions. We formulate Bayes-Nash equilibrium conditions for which a simple threshold strategy is competitively optimal for each sensor, and propose a scheme for decentralized threshold computation. The second class of results we consider is in a non-Bayesian context where sensors deploy simple adaptive filtering algorithms and the global behavior converges to the set of correlated equilibria.