Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
An approximation algorithm to the file allocation problem in computer networks
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Data-centric storage in sensornets
ACM SIGCOMM Computer Communication Review
Dimensions: why do we need a new data handling architecture for sensor networks?
ACM SIGCOMM Computer Communication Review
Multi-dimensional range queries in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
On coresets for k-means and k-median clustering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Combs, needles, haystacks: balancing push and pull for discovery in large-scale sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
Data storage placement in sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Constraint chaining: on energy-efficient continuous monitoring in sensor networks
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Double rulings for information brokerage in sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Distributed Localization Using a Moving Beacon in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Detecting selective forwarding attacks in wireless sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Constructing the Web of Events from raw data in the Web of Things
Mobile Information Systems - Internet of Things
Hi-index | 0.24 |
Data storage in wireless sensor networks (WSNs) involves producers (such as sensor nodes) storing in storage positions a large amount of data which they have collected and consumers (e.g., base stations, users, and sensor nodes) then retrieving that data. When addressing this issue, previous work failed to utilize data rates and locations of multiple producers and consumers to determine optimal data storage positions to be communication cost-effective in a mesh network topology. In this paper, we first formalize the data storage problem into a one-to-one (one producer and one consumer) model and a many-to-many (m producers and n consumers) model with the goal of minimizing the total energy cost. Based on above models, we propose optimal data storage (ODS) algorithms that can produce global optimal data storage position in linear, grid, and mesh network topologies. To reduce the computation of ODS in the mesh network topology, we present a near-optimal data storage (NDS) algorithm, which is an approximation algorithm and can obtain a local optimal position. Both ODS and NDS are locality-aware and are able to adjust the storage position adaptively to minimize energy consumption. Simulation results show that NDS not only provides substantial cost benefit over centralized data storage (CDS) and geographic hash table (GHT), but performs as well as ODS in over 75% cases.