Wireless integrated network sensors
Communications of the ACM
Gossip-Based Computation of Aggregate Information
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Locally constructed algorithms for distributed computations in ad-hoc networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Geographic gossip: efficient aggregation for sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
A scheme for robust distributed sensor fusion based on average consensus
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Distributed Detection in Sensor Networks With Packet Losses and Finite Capacity Links
IEEE Transactions on Signal Processing
The capacity of wireless networks
IEEE Transactions on Information Theory
Signal Reconstruction From Noisy Random Projections
IEEE Transactions on Information Theory
Correction of “The Distributed Karhunen–Loève Transform”
IEEE Transactions on Information Theory
Distributed sparse random projections for refinable approximation
Proceedings of the 6th international conference on Information processing in sensor networks
Hierarchical spatial gossip for multi-resolution representations in sensor networks
Proceedings of the 6th international conference on Information processing in sensor networks
Information fusion for wireless sensor networks: Methods, models, and classifications
ACM Computing Surveys (CSUR)
Distributed adaptive sampling using bounded-errors
Proceedings of the 1st international conference on Robot communication and coordination
Compressive data gathering for large-scale wireless sensor networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Polynomial filtering for fast convergence in distributed consensus
IEEE Transactions on Signal Processing
Power-efficient dimensionality reduction for distributed channel-aware kalman tracking using WSNs
IEEE Transactions on Signal Processing
Decentralized Aggregation Protocols in Peer-to-Peer Networks: A Survey
MACE '09 Proceedings of the 4th IEEE International Workshop on Modelling Autonomic Communications Environments
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
EWSN'07 Proceedings of the 4th European conference on Wireless sensor networks
Distributed sampling of signals linked by sparse filtering: theory and applications
IEEE Transactions on Signal Processing
Image representation by compressive sensing for visual sensor networks
Journal of Visual Communication and Image Representation
A distributed sensor fusion algorithm for the inversion of sparse fields
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Greedy gossip with eavesdropping
IEEE Transactions on Signal Processing
Order-optimal consensus through randomized path averaging
IEEE Transactions on Information Theory
Joint manifolds for data fusion
IEEE Transactions on Image Processing - Special section on distributed camera networks: sensing, processing, communication, and implementation
Efficient measurement generation and pervasive sparsity for compressive data gathering
IEEE Transactions on Wireless Communications
Hierarchical Spatial Gossip for Multiresolution Representations in Sensor Networks
ACM Transactions on Sensor Networks (TOSN)
Anomaly detection in large-scale data stream networks
Data Mining and Knowledge Discovery
| Hi-index | 0.07 |
Developing energy efficient strategies for the extraction, transmission, and dissemination of information is a core theme in wireless sensor network research. In this paper we present a novel system for decentralized data compression and predistribution. The system simultaneously computes random projections of the sensor data and disseminates them throughout the network using a simple gossiping algorithm. These summary statistics are stored in an efficient manner and can be extracted from a small subset of nodes anywhere in the network. From these measurements one can reconstruct an accurate approximation of the data at all nodes in the network, provided the original data is compressible in a certain sense which need not be known to the nodes ahead of time. The system provides a practical and universal approach to decentralized compression and content distribution in wireless sensor networks. Two example applications, network health monitoring and field estimation, demonstrate the utility of our method.