Cache Placement in Sensor Networks Under Update Cost Constraint

— In this paper, we address an optimization problem that arises in 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 networkmodel, 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, heuristicbased, and distributed algorithms, and evaluate their performance through simulations on randomly generated sensor networks.

• Type: Conference
• Year: 2005
• Where: ADHOCNOW
• Authors: Bin Tang, Samir R. Das, Himanshu Gupta
• Keywords: ADHOCNOW 2005, Cache Placement, Data Item, Sensor Networks, Wireless Networks