Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/8946
Title: Efficient cache discovery for cooperative caching in wireless ad hoc networks
Authors: Wu, W
Cao, J 
Keywords: Ad hoc network
Cache discovery
Cooperative cache
Mobile computing
Voronoi diagram
Issue Date: 2012
Source: Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS, 2012, 6413680, p. 323-330 How to cite?
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.
Description: 18th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2012, Singapore, 17-19 December 2012
URI: http://hdl.handle.net/10397/8946
ISBN: 9780769549033
ISSN: 1521-9097
DOI: 10.1109/ICPADS.2012.52
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

6
Last Week
0
Last month
0
Citations as of Jul 28, 2017

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Aug 15, 2017

Page view(s)

28
Last Week
3
Last month
Checked on Aug 21, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.