Fundamentals of statistical signal processing: estimation theory
Fundamentals of statistical signal processing: estimation theory
Improved approximations for the Steiner tree problem
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Embedding the Internet: introduction
Communications of the ACM
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
On the interdependence of routing and data compression in multi-hop sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Introduction to Algorithms
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Selection of Views to Materialize in a Data Warehouse
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Selection and maintenance of views in a data warehouse
Selection and maintenance of views in a data warehouse
Power efficient gathering of correlated data: optimization, NP-completeness and heuristics
ACM SIGMOBILE Mobile Computing and Communications Review
The impact of spatial correlation on routing with compression in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Scattered data selection for dense sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Gathering correlated data in sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Simulating the power consumption of large-scale sensor network applications
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Spatial correlation-based collaborative medium access control in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Uncertainty-aware Wireless Sensor Networks
International Journal of Mobile Communications
Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links
Proceedings of the 15th annual international conference on Mobile computing and networking
Compressive data gathering for large-scale wireless sensor networks
Proceedings of the 15th annual international conference on Mobile computing and networking
Modeling of extreme data in wireless sensor networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Adaptive data collection in sensor networks
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
Data mining and data gathering in a refinery
ACS'10 Proceedings of the 10th WSEAS international conference on Applied computer science
Efficient measurement generation and pervasive sparsity for compressive data gathering
IEEE Transactions on Wireless Communications
Optimizing in-network aggregate queries in wireless sensor networks for energy saving
Data & Knowledge Engineering
Energy-aware sparse approximation technique (EAST) for rechargeable wireless sensor networks
EWSN'10 Proceedings of the 7th European conference on Wireless Sensor Networks
Efficient path planning and data gathering protocols for the wireless sensor network
Computer Communications
Energy-balanced sampling workload allocation in wireless sensor networks
Computers & Mathematics with Applications
Deployment guidelines for achieving maximum lifetime and avoiding energy holes in sensor network
Information Sciences: an International Journal
Active node determination for correlated data gathering in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Wireless Personal Communications: An International Journal
Compressed data aggregation: energy-efficient and high-fidelity data collection
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
In this article, we design techniques that exploit data correlations in sensor data to minimize communication costs (and hence, energy costs) incurred during data gathering in a sensor network. Our proposed approach is to select a small subset of sensor nodes that may be sufficient to reconstruct data for the entire sensor network. Then, during data gathering only the selected sensors need to be involved in communication. The selected set of sensors must also be connected, since they need to relay data to the data-gathering node. We define the problem of selecting such a set of sensors as the connected correlation-dominating set problem, and formulate it in terms of an appropriately defined correlation structure that captures general data correlations in a sensor network. We develop a set of energy-efficient distributed algorithms and competitive centralized heuristics to select a connected correlation-dominating set of small size. The designed distributed algorithms can be implemented in an asynchronous communication model, and can tolerate message losses. We also design an exponential (but nonexhaustive) centralized approximation algorithm that returns a solution within O(log n) of the optimal size. Based on the approximation algorithm, we design a class of centralized heuristics that are empirically shown to return near-optimal solutions. Simulation results over randomly generated sensor networks with both artificially and naturally generated data sets demonstrate the efficiency of the designed algorithms and the viability of our technique—even in dynamic conditions.