Share Email Print

Proceedings Paper

Integrated data lookup and replication scheme in mobile ad hoc networks
Author(s): Kai Chen; Klara Nahrstedt
Format Member Price Non-Member Price
PDF $17.00 $21.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

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

Paper Details

Date Published: 8 November 2001
PDF: 8 pages
Proc. SPIE 4534, Optoelectronic and Wireless Data Management, Processing, Storage, and Retrieval, (8 November 2001); doi: 10.1117/12.447999
Show Author Affiliations
Kai Chen, Univ. of Illinois/Urbana-Champaign (United States)
Klara Nahrstedt, Univ. of Illinois/Urbana-Champaign (United States)

Published in SPIE Proceedings Vol. 4534:
Optoelectronic and Wireless Data Management, Processing, Storage, and Retrieval
Robert Raymond; Pradip K. Srimani; Renjeng Su; Carl W. Wilmsen, Editor(s)

© SPIE. Terms of Use
Back to Top