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

被引:3
作者
Chen, K [1 ]
Nahrstedt, K [1 ]
机构
[1] Univ Illinois, Dept Comp Sci, Urbana, IL 61801 USA
来源
OPTOELECTRONIC AND WIRELESS DATA MANAGEMENT, PROCESSING, STORAGE, AND RETRIEVAL | 2001年 / 4534卷
关键词
ad hoc networks; data accessibility; data lookup; data replication;
D O I
10.1117/12.447999
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:1 / 8
页数:8
相关论文
共 14 条
  • [1] [Anonymous], OPTIMIZED LINK STATE
  • [2] BROCH J, 1998, P ACM MOB 98 OCT
  • [3] CAO G, 2000, P ACM MOB 2000 AUG
  • [4] CZERWINSKI S, 1999, P ACM MOB 99 SEPT
  • [5] GUTTMAN E, 1998, 2165 RFC IETF
  • [6] HARA T, 2001, P IEEE INFOCOM 2001
  • [7] NI S, 1999, P MOB 99 AUG
  • [8] PENG W, 2000, P 1 ANN WORKSH MOB A
  • [9] REN Q, 2000, P ACM MOB 2000 AUG
  • [10] Shah S., 2001, P 5 WORLD MULT SYST