Online computation and competitive analysis
Online computation and competitive analysis
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
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
AMRoute: ad hoc multicast routing protocol
Mobile Networks and Applications
Manycast: exploring the space between anycast and multicast in ad hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
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
Revisiting the TTL-based controlled flooding search: optimality and randomization
Proceedings of the 10th annual international conference on Mobile computing and networking
Flood search under the California Split rule
Operations Research Letters
Adaptive strategies for efficiently locating internet-based servers in MANETs
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Design and analysis of adaptive strategies for locating internet-based servers in MANETs
Performance Evaluation
Novel approaches to efficient flooding search in peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A hybrid query scheme to speed up queries in unstructured peer-to-peer networks
Advances in Multimedia
Flooding time in edge-Markovian dynamic graphs
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Broadcasting in sensor networks: the role of local information
IEEE/ACM Transactions on Networking (TON)
Pub/sub content sharing for mobile networks format
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Efficient information retrieval in mobile peer-to-peer networks
Proceedings of the 18th ACM conference on Information and knowledge management
Probabilistic flooding for efficient information dissemination in random graph topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Flooding Time of Edge-Markovian Evolving Graphs
SIAM Journal on Discrete Mathematics
Securing communication trees in sensor networks
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
| Hi-index | 0.00 |
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large wireless network. We consider the class of controlled flooding search strategies where query/search packets are broadcast and propagated in the network until a preset TTL (time-to-live) value carried in the packet expires. Every unsuccessful search attempt results in an increased TTL value (i.e., larger search area) and the same process is repeated. We derive search strategies that minimize the search cost in the worst-case, via a performance measure in the form of the competitive ratio between the average search cost of a strategy and that of an omniscient observer. This ratio is shown in prior work to be lower bounded by 4 among all deterministic search strategies. In this paper we show that by using randomized strategies this ratio is lower bounded by e. We derive an optimal strategy that achieves this lower bound, and discuss its performance under other performance criteria.