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
Rumor routing algorthim for sensor networks
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
Revisiting the TTL-based controlled flooding search: optimality and randomization
Proceedings of the 10th annual international conference on Mobile computing and networking
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
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
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
Balancing Push and Pull for Efficient Information Discovery in Large-Scale Sensor Networks
IEEE Transactions on Mobile Computing
A queueing approach to optimal resource replication in wireless sensor networks
Performance Evaluation
Scaling laws for data-centric storage and querying in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Journal of Systems and Software
Information storage, reduction and dissemination in sensor networks: a survey
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Design and implementation of a flexible location directory service for tiered sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
SDIP3: structured and dynamic information push and pull protocols for distributed sensor networks
DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
BodyNets '13 Proceedings of the 8th International Conference on Body Area Networks
| Hi-index | 0.00 |
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 ANY-type 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 find that there exist “magic number” event rate thresholds, independent of network size or query probability, which dictate the choice of querying protocol. While our analysis is based on a single-sink square-grid deployment, we believe the insights can be generalized to random deployments.