Aida. O. Abd Gwad , Ahmed .E. Saleh & Shereen .H. Ali
Dept. of Computer-And System-Mans University-Egypt
Hoarding has become an attractive area for research as it has been used by many of mobile computing
systems. Hoarding allows a mobile device to store an elected subset of known files for future use.
Accordingly, it gives the voluntary disconnected users the illusion of complete file system in spite of
the presence of limited storage. Many challenges have not been addressed yet by existing hoard
approaches, such as conflicts that may arise out of write sharing and cache miss. The innovation of
this paper presents a novel hoarding algorithm for disconnected write operations that address the prementioned
challenges. According to the proposed algorithm, the needed data during the disconnection
is predicted on the based semantic similarity with considering the update probability of each data item.
Simulation results show that the proposed algorithm increases hoard hit rate, hoard utilization and
reduces the cache miss and amount of download.