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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.