Improved approximations for the Steiner tree problem
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
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
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
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
ACM Transactions on Sensor Networks (TOSN)
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
A biologically-inspired clustering protocol for wireless sensor networks
Computer Communications
Cora: correlation-based resilient aggregation in sensor networks
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Immune system based distributed node and rate selection in wireless sensor networks
Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems
Exploiting data correlation for multi-scale processing in sensor networks
Proceedings of the 2nd international conference on Scalable information systems
Sensor Selection for Minimizing Worst-Case Prediction Error
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Collaborative data gathering in wireless sensor networks using measurement co-occurrence
Computer Communications
Energy-efficient data gathering algorithm in sensor networks with partial aggregation
International Journal of Sensor Networks
Efficient Data Collection and Selective Queries in Sensor Networks
GeoSensor Networks
Gathering with Minimum Delay in Tree Sensor Networks
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Arch-AdSenNets: an architecture for inter-working MANET with wireless sensor and actor networks
International Journal of Communication Networks and Distributed Systems
Data aggregation and routing in Wireless Sensor Networks: Optimal and heuristic algorithms
Computer Networks: The International Journal of Computer and Telecommunications Networking
Collision-free path coloring with application to minimum-delay gathering in sensor networks
Discrete Applied Mathematics
Supporting asynchronous update for distributed data cubes
Journal of Network and Computer Applications
Energy scaling laws for distributed inference in random fusion networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
EDGES: Efficient data gathering in sensor networks using temporal and spatial correlations
Journal of Systems and Software
Dynamic multiroot, multiquery processing based on data sharing in sensor networks
ACM Transactions on Sensor Networks (TOSN)
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Predictive modeling-based data collection in wireless sensor networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
Node placement of linear wireless multimedia sensor networks for maximum network lifetime
GPC'08 Proceedings of the 3rd international conference on Advances in grid and pervasive computing
Spatial correlation-based mobile agent routing algorithm in wireless sensor networks
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Level the buffer wall: Fair channel assignment in wireless sensor networks
Computer Communications
On computing compression trees for data collection in wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Capacity aware optimal activation of sensor nodes under reproduction distortion measures
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
An adaptive and composite spatio-temporal data compression approach for wireless sensor networks
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Online packet admission and oblivious routing in sensor networks
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
ACM Transactions on Sensor Networks (TOSN)
Improved approximation algorithms for maximum lifetime problems in wireless networks
Theoretical Computer Science
ACM Transactions on Sensor Networks (TOSN)
Qute: quality-of-monitoring aware sensing and routing strategy in wireless sensor networks
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Hi-index | 0.00 |
In this paper, 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 non-exhaustive) 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 efficient 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.