An integrated data lookup and replication scheme in mobile ad hoc networks

Kai Chen, Klara Nahrstedt

Research output: Contribution to journalConference articlepeer-review


Accessing remote data is a challenging task in mobile ad hoc networks. Two problems have to be solved: 1) how to learn about available data in the network; and 2) how to access desired data even when the original copy of the data is unreachable. In this paper, we develop an integrated data lookup and replication scheme to solve these problems. In our scheme, a group of mobile nodes collectively host a set of data to improve data accessibility for all members of the group. They exchange data availability information by broadcasting advertising (ad) messages to the group using an adaptive sending rate policy. The ad messages are used by other nodes to derive a local data lookup table, and to reduce data redundancy within a connected group. Our data replication scheme predicts group partitioning based on each node's current location and movement patterns, and replicates data to other partitions before partitioning occurs. Our simulations show that data availability information can quickly propagate throughout the network, and that the successful data access ratio of each node is significantly improved.

Original languageEnglish (US)
Pages (from-to)1-8
Number of pages8
JournalProceedings of SPIE - The International Society for Optical Engineering
StatePublished - 2001
EventOptoelectric and Wireless Data Management, Processing, Storage, and Retrieval - Denver, CO, United States
Duration: Aug 22 2001Aug 24 2001


  • Ad hoc networks
  • Data accessibility
  • Data lookup
  • Data replication

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering


Dive into the research topics of 'An integrated data lookup and replication scheme in mobile ad hoc networks'. Together they form a unique fingerprint.

Cite this