On minimum data replication for delay-bounded query in wireless ad hoc networks

Authors:
Jun Huang;Yuebin Bai;Xu Shao
Affiliations:
School of Computer Science and Engineering, Beihang University, Beijing, P. R. China;School of Computer Science and Engineering, Beihang University, Beijing, P. R. China;Networking Protocols Department, Institute for Infocomm Research, Singapore
Venue:
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Year:
2009

Citing 6
Cited 0

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
Replication strategies in unstructured peer-to-peer networks

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
SHARP: a hybrid adaptive routing protocol for mobile ad hoc networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
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
Data-centric storage in sensornets with GHT, a geographic hash table

Mobile Networks and Applications
Revisiting the TTL-based controlled flooding search: optimality and randomization

Proceedings of the 10th annual international conference on Mobile computing and networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.