Expanding Ring-Based Data Query with Delay Constraints for Dense Wireless Ad Hoc Networks

Yuebin BAI  Jun HUANG  

IEICE TRANSACTIONS on Communications   Vol.E93-B   No.11   pp.3023-3034
Publication Date: 2010/11/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E93.B.3023
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
wireless ad hoc networks,  data query,  index replication,  data replication,  delay guarantee,  

Full Text: PDF>>
Buy this Article

Data query is one of the most important issues in wireless ad hoc networks, since the ultimate goal of these networks is to support efficient data sharing among wireless nodes. In this paper, we study the issue of data query for delay-sensitive applications in dense wireless ad hoc networks. We focus our attention on step-by-step expanding ring-based data query, which provides an upper bound on query delay to any expanding ring based query strategies. Two replication strategies including Index Replication (IR) and Data Replication (DR) are considered, to improve the delay performance of data query. We analyze the probabilistic behavior of query delay for both DR and IR by theoretical methods, and develop analytical models to approximate the minimum number of replicas required for both query strategies if an application-specified delay bound is imposed. Our work is validated through extensive simulations.