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

Jun Huang, Yuebin Bai, Xu Shao

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

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. ©2009 IEEE.
Original languageEnglish
Title of host publication2009 IEEE Wireless Communications and Networking Conference, WCNC 2009 - Proceedings
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event2009 IEEE Wireless Communications and Networking Conference, WCNC 2009 - Budapest, Hungary
Duration: 5 Apr 20098 Apr 2009

Publication series

NameIEEE Wireless Communications and Networking Conference, WCNC
ISSN (Print)1525-3511

Conference

Conference2009 IEEE Wireless Communications and Networking Conference, WCNC 2009
Country/TerritoryHungary
CityBudapest
Period5/04/098/04/09

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Fingerprint

Dive into the research topics of 'On minimum data replication for delay-bounded query in wireless Ad hoc networks'. Together they form a unique fingerprint.

Cite this