GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Data-centric storage in sensornets
ACM SIGCOMM Computer Communication Review
Data-centric storage in sensornets with GHT, a geographic hash table
Mobile Networks and Applications
Fundamental scaling laws for energy-efficient storage and querying in wireless sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Practical data-centric storage
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
DCOSS '08 Proceedings of the 4th IEEE international conference on Distributed Computing in Sensor Systems
On the lifetime of wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Scaling laws for data-centric storage and querying in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
A grid-based dynamic load balancing approach for data-centric storage in wireless sensor networks
Computers and Electrical Engineering
Spatial Model for Energy Burden Balancing and Data Fusion in Sensor Networks Detecting Bursty Events
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
Improving security in data-centric storage for wireless sensor networks
Proceedings of the 10th ACM symposium on Performance evaluation of wireless ad hoc, sensor, & ubiquitous networks
Hi-index | 0.00 |
This article presents a novel framework for data-centric storage (DCS) in a wireless sensor and actor network (WSAN) that employs a randomly selected set of data replication nodes, which also change over time. This enables reductions in the average network traffic and energy consumption by adapting the number of replicas to applications' traffic, while balancing energy burdens by varying their locations. To that end, we propose and validate a simple model to determine the optimal number of replicas, in terms of minimizing average traffic/energy consumption, based on measurements of applications' production and consumption traffic. Simple mechanisms are proposed to decide when the current set of replication nodes should be changed, to enable new applications and nodes to efficiently bootstrap into a working WSAN, to recover from failing nodes, and to adapt to changing conditions. Extensive simulations demonstrate that our approach can extend a WSAN's lifetime by at least 60%, and up to a factor of 10× depending on the lifetime criterion being considered. The feasibility of the proposed framework has been validated in a prototype with 20 resource-constrained motes, and the results obtained via simulation for large WSANs have been also corroborated in that prototype.