Cache placement in sensor networks under an update cost constraint |
| |
Authors: | Bin Tang Himanshu Gupta |
| |
Affiliation: | aDepartment of Computer Science, Stony Brook University, Stony Brook, NY 11790, USA |
| |
Abstract: | In this paper, we address an optimization problem that arises in the context of cache placement in sensor networks. In particular, we consider the cache placement problem where the goal is to determine a set of nodes in the network to cache/store the given data item, such that the overall communication cost incurred in accessing the item is minimized, under the constraint that the total communication cost in updating the selected caches is less than a given constant. In our network model, there is a single server (containing the original copy of the data item) and multiple client nodes (that wish to access the data item). For various settings of the problem, we design optimal, near-optimal, heuristic-based, and distributed algorithms, and evaluate their performance through simulations on randomly generated sensor networks. |
| |
Keywords: | Cache placement problem Algorithm design Approximation algorithm Sensor networks |
本文献已被 ScienceDirect 等数据库收录! |
|