The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
On the reduction of broadcast redundancy in mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Spine routing in ad hoc networks
Cluster Computing
ACM SIGCOMM Computer Communication Review
The design of an acquisitional query processor for sensor networks
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Data-centric storage in sensornets with GHT, a geographic hash table
Mobile Networks and Applications
Multi-dimensional range queries in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Matching data dissemination algorithms to application requirements
Proceedings of the 1st international conference on Embedded networked sensor systems
Power conservation and quality of surveillance in target tracking sensor networks
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
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
Comparative analysis of push-pull query strategies for wireless sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
A scalable quorum-based location service in ad hoc and sensor networks
International Journal of Communication Networks and Distributed Systems
A Data Dissemination Algorithm Based on Geographical Quorum System in Wireless Sensor Networks
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
Pervasive and Mobile Computing
The crossroads approach to information discovery in wireless sensor networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Information discovery in mission-critical wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Supple: a flexible probabilistic data dissemination protocol for wireless sensor networks
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
A holistic sensor network design for energy conservation and efficient data dissemination
Computer Networks: The International Journal of Computer and Telecommunications Networking
Multimedia data in hybrid vehicular networks
Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
Optimizing push/pull envelopes for energy-efficient cloud-sensor systems
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Making data-centric storage adaptive and cost-optimal
Computer Networks: The International Journal of Computer and Telecommunications Networking
Mobile Peer-to-Peer data dissemination in wireless ad-hoc networks
Information Sciences: an International Journal
| Hi-index | 0.01 |
In this paper, we investigate efficient strategies for supporting on-demand information dissemination and gathering in large-scale wireless sensor networks. In particular, we propose a “comb-needle” discovery support model resembling an ancient method: Use a comb to help find a needle in sand or a haystack. The model combines push and pull for information dissemination and gathering. The push component features data duplication in a linear neighborhood of each node. The pull component features a dynamic formation of an on-demand routing structure resembling a comb. The comb-needle model enables us to investigate the cost of a spectrum of push and pull combinations for supporting query and discovery in large-scale sensor networks. Our result shows that the optimal routing structure depends on the frequency of query occurrence and the spatial-temporal frequency of related events in the network. The benefit of balancing push and pull for information discovery is demonstrated.