Comparative Analysis of Push-Pull Query Strategies for Wireless Sensor Networks

Abstract. We present a comparative mathematical analysis of two important distinct approaches to hybrid push-pull querying in wireless sensor networks: structured hash-based data-centric storage (DCS) and the unstructured comb-needle (CN) rendezvous mechanism. Our analysis yields several interesting insights. For ALL-type queries pertaining to information about all events corresponding to a given attribute, we examine the conditions under which the two approaches outperform each other in terms of the average query and event rates. For the case of ANYtype queries where it is sufficient to obtain information from any one of the desired events for a given attribute, we propose and analyze a modified sequential comb-needle technique (SCN) to compare with DCS. We find that DCS generally performs better than CN/SCN for high query rates and low event rates, while CN/SCN perform better for high event rates. Surprisingly, for the cases of ALL-type aggregated queries and ANY-type queries, we fin...

• Type: Conference
• Year: 2006
• Where: DCOSS
• Authors: Shyam Kapadia, Bhaskar Krishnamachari
• Keywords: DCOSS 2006, Distributed And Parallel Computing, Event Rate, Hash-based Data-centric Storage, Important Distinct Approaches