Approximation algorithms for the geometric covering salesman problem
Discrete Applied Mathematics
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
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A two-tier data dissemination model for large-scale wireless sensor networks
Proceedings of the 8th 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
Data-centric storage in sensornets
ACM SIGCOMM Computer Communication Review
ACM SIGCOMM Computer Communication Review
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
Multi-dimensional range queries in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Locality-sensitive hashing scheme based on p-stable distributions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
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
An analysis of a large scale habitat monitoring application
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
MAP: medial axis based geometric routing in sensor networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Multi-hop wireless sensor networks with mobile sink
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Locating and bypassing holes in sensor networks
Mobile Networks and Applications
Boundary recognition in sensor networks by topological methods
Proceedings of the 12th annual international conference on Mobile computing and networking
Practical data-centric storage
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Ad hoc networks beyond unit disk graphs
Wireless Networks
Distance-Sensitive information brokerage in sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Multiple controlled mobile elements (data mules) for data collection in sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Information discovery in mission-critical wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed distance sensitive imesh based service discovery in dense WSAN
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
Hi-index | 0.00 |
We study the problem of information brokerage in sensor networks, where information consumers (sinks, users) search for data acquired by information producers (sources). In-network storage such as geographical hash table (GHT) has been proposed to store data at rendezvous nodes for consumers to retrieve. In this paper, we propose a double rulings scheme that stores data replicas on a curve instead of one or multiple isolated sensors. The consumer travels along another curve that is guaranteed to intersect the producer curve. The double rulings is a natural extension of the flat hashing scheme such as GHTs. It has improved query locality--i.e., consumers close to producers find the data quickly--and structured aggregate queries, i.e., a consumer following a curve is able to retrieve all the data. Furthermore, by the flexibility of retrieval mechanisms, we have better routing robustness (as multiple retrieval paths are available) and data robustness against regional node failures. We show by simulation that the double rulings scheme provides reduced communication costs and more balanced traffic load on the sensors.