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
Caching strategies in on-demand routing protocols for wireless ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th 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
Ensuring cache freshness in on-demand ad hoc network routing protocols
Proceedings of the second ACM international workshop on Principles of mobile computing
A Middleware Infrastructure for Active Spaces
IEEE Pervasive Computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Performance of Route Caching Strategies in Dynamic Source Routing
ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
Flooding strategy for target discovery in wireless networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Building intrusion tolerant applications
SSYM'99 Proceedings of the 8th conference on USENIX Security Symposium - Volume 8
Empirical evaluation of querying mechanisms for unstructured wireless sensor networks
ACM SIGCOMM Computer Communication Review
Using Heterogeneity to Enhance Random Walk-based Queries
Journal of Signal Processing Systems
Efficient information retrieval in mobile peer-to-peer networks
Proceedings of the 18th ACM conference on Information and knowledge management
PASCAL: power aware sectoring based clustering algorithm for wireless sensor networks
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
A tsunami warning system employing level controlled gossiping in wireless sensor networks
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Analysis of the Expected Number of Hops in Mobile Ad Hoc Networks with Random Waypoint Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
Querying dynamic wireless sensor networks with non-revisiting random walks
EWSN'10 Proceedings of the 7th European conference on Wireless Sensor Networks
Stopping ongoing broadcasts in large MANETs
Proceedings of the 1st European Workshop on AppRoaches to MObiquiTous Resilience
Broadcast cancellation in search mechanisms
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Hi-index | 0.02 |
In this paper, we address a fundamental problem concerning the best flooding strategy to minimize cost and latency for target discovery in wireless networks. Should we flood the network only once to search for the target, or should we apply a so-called "expansion ring" mechanism to reduce the cost? If the "expansion ring" mechanism is better in terms of the average cost, how many rings should there be and what should be the radius of each ring? We separate wireless networks based on network scale and explore these questions. We prove that two-ring and three-ring schemes can reduce the cost of flooding compared to a single attempt, and we provide a general formula to determine good parameters for the two-ring and three-ring hop-based flooding schemes. Through simulations, we show that choosing flooding parameters according to our techniques gives performance close to that of ideal flooding schemes. Afterwards, we extend our work from the single target discovery problem to the multi-target discovery problem. We show that a properly chosen searching radius can save much more searching cost than a simple radius selection scheme for multi-target discovery problems.