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

Kai Chen, Klara Nahrstedt

Research output: Contribution to journalConference article

Abstract

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
Volume4534
DOIs
StatePublished - Dec 1 2001
EventOptoelectric and Wireless Data Management, Processing, Storage, and Retrieval - Denver, CO, United States
Duration: Aug 22 2001Aug 24 2001

Fingerprint

Replication
Marketing
Availability
messages
Table lookup
Electronic data interchange
availability
Broadcasting
Redundancy
broadcasting
redundancy
Vertex of a graph
partitions
Advertising
Partitioning
Data Replication
Look-up Table
Data Exchange
Accessibility
simulation

Keywords

  • 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

Cite this

An integrated data lookup and replication scheme in mobile ad hoc networks. / Chen, Kai; Nahrstedt, Klara.

In: Proceedings of SPIE - The International Society for Optical Engineering, Vol. 4534, 01.12.2001, p. 1-8.

Research output: Contribution to journalConference article

@article{d3592fc760a7483789998c998aaaa4ca,
title = "An integrated data lookup and replication scheme in mobile ad hoc networks",
abstract = "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.",
keywords = "Ad hoc networks, Data accessibility, Data lookup, Data replication",
author = "Kai Chen and Klara Nahrstedt",
year = "2001",
month = "12",
day = "1",
doi = "10.1117/12.447999",
language = "English (US)",
volume = "4534",
pages = "1--8",
journal = "Proceedings of SPIE - The International Society for Optical Engineering",
issn = "0277-786X",
publisher = "SPIE",

}

TY - JOUR

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

AU - Chen, Kai

AU - Nahrstedt, Klara

PY - 2001/12/1

Y1 - 2001/12/1

N2 - 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.

AB - 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.

KW - Ad hoc networks

KW - Data accessibility

KW - Data lookup

KW - Data replication

UR - http://www.scopus.com/inward/record.url?scp=0035766601&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035766601&partnerID=8YFLogxK

U2 - 10.1117/12.447999

DO - 10.1117/12.447999

M3 - Conference article

AN - SCOPUS:0035766601

VL - 4534

SP - 1

EP - 8

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

SN - 0277-786X

ER -