We study the problem of information brokerage in sensor networks, where information consumers (sinks, users) search for data acquired by information producers (sources). Innetwork storage such as geographical hash table (GHTs) has been proposed to store data at rendezvous nodes for consumers to retrieve. In this paper, we propose a double rulings scheme which stores data replica at a curve instead of one or multiple isolated sensors. The consumer travels along another curve which guarantees to intersect with the producer curve. The double rulings is a natural extension of the flat hashing scheme such as GHTs with 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. Further, by the flexibility of retrieval mechanisms we have better routing robustness and data robustness. We show by simulation that the double rulings scheme provide reduced communication costs and more balanced traffic load on the sensors.
The double ruling algorithm REF distributes the data of the events around the network in a circle.
Double rulings for information brokerage in sensor networks
MobiCom '06
Computer Science