IEICE TRANSACTIONS on Communications
Expanding Ring-Based Data Query with Delay Constraints for Dense Wireless Ad Hoc Networks
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E93-B No.11 pp.3023-3034
- Publication Date
- 2010/11/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E93.B.3023
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yuebin BAI, Jun HUANG, "Expanding Ring-Based Data Query with Delay Constraints for Dense Wireless Ad Hoc Networks" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 11, pp. 3023-3034, November 2010, doi: 10.1587/transcom.E93.B.3023.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.3023/_p
Copy
@ARTICLE{e93-b_11_3023,
author={Yuebin BAI, Jun HUANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Expanding Ring-Based Data Query with Delay Constraints for Dense Wireless Ad Hoc Networks},
year={2010},
volume={E93-B},
number={11},
pages={3023-3034},
abstract={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.},
keywords={},
doi={10.1587/transcom.E93.B.3023},
ISSN={1745-1345},
month={November},}
Copy
TY - JOUR
TI - Expanding Ring-Based Data Query with Delay Constraints for Dense Wireless Ad Hoc Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3023
EP - 3034
AU - Yuebin BAI
AU - Jun HUANG
PY - 2010
DO - 10.1587/transcom.E93.B.3023
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2010
AB - 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.
ER -
English
