A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
A Fault-Tolerant Algorithm for Replicated Data Management
IEEE Transactions on Parallel and Distributed Systems
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
IEEE Transactions on Knowledge and Data Engineering
Resilient Logical Structures for Efficient Management of Replicated Data
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Resilient Data-Centric Storage in Wireless Ad-Hoc Sensor Networks
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Data-centric storage in sensornets
ACM SIGCOMM Computer Communication Review
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks
WMCSA '02 Proceedings of the Fourth IEEE Workshop on Mobile Computing Systems and Applications
TAG: a Tiny AGgregation service for ad-hoc sensor networks
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Are quorums an alternative for data replication?
ACM Transactions on Database Systems (TODS)
Multi-dimensional range queries in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Medians and beyond: new aggregation techniques for 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
On the pitfalls of geographic face routing
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Multiresolution storage and search in sensor networks
ACM Transactions on Storage (TOS)
Double rulings for information brokerage in sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Balancing Push and Pull for Efficient Information Discovery in Large-Scale Sensor Networks
IEEE Transactions on Mobile Computing
Data Dissemination with Ring-Based Index for Wireless Sensor Networks
IEEE Transactions on Mobile 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
Adaptive Storage Policy Switching for Wireless Sensor Networks
Wireless Personal Communications: An International Journal
Q-NiGHT: Adding QoS to Data Centric Storage in Non-Uniform Sensor Networks
MDM '07 Proceedings of the 2007 International Conference on Mobile Data Management
Optimize Storage Placement in Sensor Networks
IEEE Transactions on Mobile Computing
Adaptive data transmission algorithm for event-based ad hoc query
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Adaptive data dissemination in wireless sensor networks
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Hi-index | 0.00 |
We present an adaptive and cost-optimal mechanism called Tug-of-War (ToW) for data storage and query mechanism in wireless sensor networks. ToW is based on the concept of data-centric storage (DCS), where a unique home location is used to store events of a given type so that queries of the event type can be directed to the location without flooding. However, rather than using just a single home location, the mechanism can dynamically adjust the number of home locations according to the event and query rates ratio so as to minimize the total communication cost. We also generalize the framework so that different schemes can be used to construct home locations as well as to ensure rendezvous of events and queries, thereby to fine-tune the system performance.