|
Author(s):
|
Xiaopeng Fan, The Hong Kong Polytechnic University, Hong Kong ; Jiannong Cao, Hong Kong Polytechnic University, Hong Kong; Weigang Wu, Sun Yat-sen University, P.R. China
|
|
Abstract:
|
Data caching is an attractive technique that can increase the efficiency of data access in wireless multi-hop ad hoc networks. However, it is a challenging task to select cache nodes in order to provide an optimal trade-off between the total traffic cost and average access delay. In this paper, we address the problem of cache placement in wireless multi-hop ad hoc networks. We consider dynamic networks, in which there is a data source that stores one data item and other client nodes require accessing the data item. We define the cache placement problem on a dynamic network topology as Dynamic Cache Placement (DCP). Most of the existing cache placement algorithms use hop counts to measure the total cost of caching systems. Due to the impact of contentions in wireless networks, one hop delay is different from each other and it varies with the traffic load. The previous algorithms cannot achieve their expected performance. We propose two heuristic cache placement algorithms, named Centralized Contention-Aware Caching Algorithm (CCCA) and Distributed Contention-aware Caching Algorithm (DCCA), which detect the variation of contentions to evaluate the benefit of selecting a node as cache node. Simulation results show that the proposed algorithms achieve better performance than other alternative ones in terms of average query delay, caching overheads, and query success ratio.
|
