Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
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
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
A Middleware Infrastructure for Active Spaces
IEEE Pervasive Computing
SHARP: a hybrid adaptive routing protocol for mobile ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & 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
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
Adaptive Local Searching and Caching Strategies for On-Demand Routing Protocols in Ad Hoc Networks
ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
Building intrusion tolerant applications
SSYM'99 Proceedings of the 8th conference on USENIX Security Symposium - Volume 8
| Hi-index | 0.00 |
In this paper, we address a fundamental problem concerning the optimal searching strategy in terms of searching cost for the target discovery problem in wireless networks. In order to find the nearest k targets from a total of m members using the minimum cost, should we search the network only once, or should we apply a so-called ''expansion ring scheme?'' Specifically, how many searching attempts should we use, and how large should each searching area be? To answer these questions, we provide a generic model and formulate the expected cost as a function of the parameters of the number of searching attempts n and the searching area for each attempt, A"i. Using this model, we propose several algorithms to determine the optimal parameters, either pre-calculated or performed online. We experiment with these algorithms on general wireless network scenarios and show that our algorithms perform consistently close to optimal and better than other heuristic schemes. The desired performance is achieved by adapting the searching radius to estimates of network parameters such as the total number of nodes and the total number of targets.