Replicating Data with Aperiodic Update in Ad Hoc Networks

T. Hara (Japan)


Ad hoc networks, Replica allocation, Data accessibility, Mobile computing environment


In ad hoc networks, since mobile hosts move freely, network division occurs frequently, and thus data accessibility is lower than that in the conventional fixed networks. In our previous work, we have proposed three replica allocation methods assuming an environment where each data item is periodically updated. In this paper, we extend the proposed methods to adapt an environment where each data item is updated at inconstant intervals. The first extension is for maximizing the number of successful access requests. The second extension is for keeping the ratio of reading dirty items to the total access requests below a certain value. These extensions can be also applied to a situation in which each data item is basically updated at constant intervals but there are some errors.

Important Links:

Go Back