The design and implementation of an intentional naming system
Proceedings of the seventeenth ACM symposium on Operating systems principles
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Multidimensional binary search trees used for associative searching
Communications of the ACM
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th 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
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Building efficient wireless sensor networks with low-level naming
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Resilient Data-Centric Storage in Wireless Ad-Hoc Sensor Networks
MDM '03 Proceedings of the 4th International Conference on Mobile Data Management
Approximate query processing using wavelets
The VLDB Journal — The International Journal on Very Large Data Bases
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Geographic routing for wireless networks
Geographic routing for wireless networks
Multi-dimensional range queries in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
An evaluation of multi-resolution storage for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Fine-grained network time synchronization using reference broadcasts
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Blind beamforming on a randomly distributed sensor array system
IEEE Journal on Selected Areas in Communications
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
Is data-centric storage and querying scalable?
Proceedings of the 4th international conference on Embedded networked sensor systems
Challenge: peers on wheels - a road to new traffic information systems
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Scaling laws for data-centric storage and querying in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Advantages of virtual addressing for efficient and failure tolerant routing in sensor networks
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
Practical 3D geographic routing for wireless sensor networks
Proceedings of the 8th ACM Conference on Embedded Networked Sensor Systems
| Hi-index | 0.00 |
Early sensor network data access systems were built upon the the idea of data-centric routing. Data-centricity allows robust and energy-efficient communication by abstracting the physical location of data. In this chapter, we introduce a complementary idea called data-centric storage. Data-centric storage provides efficient rendezvous between the producer of a data item, and its consumer. The primitives underlying data-centric storage can be used to construct different distributed data structures for efficiently answering a variety of queries.