Abstract
Cooperative caching is especially desirable for wireless ad hoc networks to achieve efficient data access. Although studies have been conducted on cooperative cache placement and cache consistency, the cache discovery problem has been largely ignored. In this paper, we propose a Voronoi Diagram (VD) based cooperative cache discovery approach to reduce data access cost by limiting the cache information update and query within a single Voronoi Region (VR). By addressing several challenging issues caused by the lack of geometrical coordinate in ad hoc networks, we design two topological VD algorithms for different network environments. To our knowledge, this is the first work for the construction of topological VD. Simulation results show that our proposed approach can get cache copies faster while incurring much lower message cost compared with existing ones.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2012 IEEE 18th International Conference on Parallel and Distributed Systems, ICPADS 2012 |
Pages | 323-330 |
Number of pages | 8 |
DOIs | |
Publication status | Published - 1 Dec 2012 |
Event | 18th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2012 - Singapore, Singapore Duration: 17 Dec 2012 → 19 Dec 2012 |
Conference
Conference | 18th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2012 |
---|---|
Country/Territory | Singapore |
City | Singapore |
Period | 17/12/12 → 19/12/12 |
Keywords
- Ad hoc network
- Cache discovery
- Cooperative cache
- Mobile computing
- Voronoi diagram
ASJC Scopus subject areas
- Hardware and Architecture