Sciweavers

Share
JDA
2007

Cache placement in sensor networks under an update cost constraint

8 years 11 months ago
Cache placement in sensor networks under an update cost constraint
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. © 2006 Published by Elsevier B.V.
Bin Tang, Himanshu Gupta
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2007
Where JDA
Authors Bin Tang, Himanshu Gupta
Comments (0)
books