On Minimum Data Replication for Delay-Bounded Query in Wireless Ad Hoc Networks

In this paper, we study the problem of minimizing the number of data replicas for delay-bounded queries in wireless ad hoc networks. We focus our attention on step-by-step expanding ring search, which provides an upper bound on query delay to any expanding ring based search strategies. We analyze the probabilistic behavior of query delay, and develop an analytical approach to approximate the minimum number of data replicas for delay bounded data query in wireless ad hoc networks. We validate our analysis through extensive simulations.