Sensor networks: from dependence analysis via matroid bases to online synthesis
From MaRDI portal
(Redirected from Publication:742408)
Abstract: Consider the two related problems of sensor selection and sensor fusion. In the first, given a set of sensors, one wishes to identify a subset of the sensors, which while small in size, captures the essence of the data gathered by the sensors. In the second, one wishes to construct a fused sensor, which utilizes the data from the sensors (possibly after discarding dependent ones) in order to create a single sensor which is more reliable than each of the individual ones. In this work, we rigorously define the dependence among sensors in terms of joint empirical measures and incremental parsing. We show that these measures adhere to a polymatroid structure, which in turn facilitates the application of efficient algorithms for sensor selection. We suggest both a random and a greedy algorithm for sensor selection. Given an independent set, we then turn to the fusion problem, and suggest a novel variant of the exponential weighting algorithm. In the suggested algorithm, one competes against an augmented set of sensors, which allows it to converge to the best fused sensor in a family of sensors, without having any prior data on the sensors' performance.
Recommendations
- Sensor selection for random field estimation in wireless sensor networks
- Sensor fusion using entropic measures of dependence
- Sensor selection for Kalman filtering of linear dynamical systems: complexity, limitations and greedy algorithms
- Some progress in sensor network decision fusion
- On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 1804105 (Why is no real title available?)
- scientific article; zbMATH DE number 1301979 (Why is no real title available?)
- A game of prediction with expert advice
- A simple randomized algorithm for sequential prediction of ergodic time series
- A zero-delay sequential scheme for lossy coding of individual sequences
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Chernoff-type bound for finite Markov chains
- Compression of individual sequences via variable-rate coding
- Dualities Between Entropy Functions and Network Codes
- Efficient Adaptive Algorithms and Minimax Bounds for Zero-Delay Lossy Source Coding
- Elements of Information Theory
- How to use expert advice
- Learning with stochastic inputs and adversarial outputs
- Minimum cycle bases for network graphs
- Noiseless coding of correlated information sources
- On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
- On limited-delay lossy coding and filtering of individual sequences
- On prediction of individual sequences
- On sequential strategies for loss functions with memory
- On the (co)girth of a connected matroid
- Optimal sequential probability assignment for individual sequences
- Redundancy of the Lempel-Ziv incremental parsing rule
- Scanning and Sequential Decision Making for Multidimensional Data–Part I: The Noiseless Case
- Scanning and Sequential Decision Making for Multidimensional Data—Part II: The Noisy Case
- Sequential prediction of individual sequences under general loss functions
- The on-line shortest path problem under partial monitoring
- The weighted majority algorithm
- Two Constructions on Limits of Entropy Functions
- Universal prediction
Cited in
(2)
This page was built for publication: Sensor networks: from dependence analysis via matroid bases to online synthesis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742408)
