Name
Abstract | ||
|---|---|---|
Mobile clients often need to operate while disconnected from the network due to limited battery life and network coverage. Hoarding supports this by fetching frequently accessed data into clients' local caches prior to disconnection. Existing work on hoarding have focused on improving data accessibility for individual mobile clients. However, due to storage limitations, mobile clients may not be able to hoard every data object they need. This leads to cache misses and disruption to clients' operations. In this paper, a new concept called cooperative hoarding is introduced to reduce the risks of cache misses for mobile clients. Cooperative hoarding takes advantage of group mobility behaviour, combined with peer cooperation in ad-hoc mode, to improve hoard performance. Two cooperative hoarding approaches are proposed that take into account access frequency, connection probability, and cache size of mobile clients so that hoarding can be performed cooperatively. Simulation results show that the proposed methods significantly improve cache hit ratio and provides better support for disconnected operations compared to existing schemes. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ICCCN.2005.1523804 | ICCCN |
Keywords | Field | DocType |
cooperative hoarding,ad-hoc mode,network coverage,cache storage,connection probability,data accessibility,cache misses,mobile radio,peer cooperation,mobility behaviour,peer-to-peer computing,ad hoc networks,mobile client,mobile computing,data access | Mobile computing,Mobile radio,Cache,Computer security,Computer science,CPU cache,Computer network,Cache algorithms,Wireless ad hoc network,Disconnection,Access frequency,Distributed computing | Conference |
ISSN | ISBN | Citations |
1095-2055 | 0-7803-9428-3 | 1 |
PageRank | References | Authors |
0.35 | 19 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kwong Yuen Lai | 1 | 40 | 4.14 |
| Zahir Tari | 2 | 2409 | 368.61 |
| Peter Bertók | 3 | 158 | 35.62 |