Approximation algorithms for geometric median problems
Information Processing Letters
Improved approximations for the Steiner tree problem
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Embedding the Internet: introduction
Communications of the ACM
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
IEEE/ACM Transactions on Networking (TON)
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Steiner-Optimal Data Replication in Tree Networks with Storage Costs
IDEAS '01 Proceedings of the International Database Engineering & Applications Symposium
Data-centric storage in sensornets
ACM SIGCOMM Computer Communication Review
Energy-efficient caching strategies in ad hoc wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Selection and maintenance of views in a data warehouse
Selection and maintenance of views in a data warehouse
Energy-conserving data placement and asynchronous multicast in wireless sensor networks
Proceedings of the 1st international conference on Mobile systems, applications and services
Energy-conserving data cache placement in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Data storage placement in sensor networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
World Wide Web caching: trends and techniques
IEEE Communications Magazine
Placement problems for transparent data replication proxy services
IEEE Journal on Selected Areas in Communications
Optimization on Data Object Compression and Replication in Wireless Multimedia Sensor Networks
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Cache consistency in Wireless Multimedia Sensor Networks
Ad Hoc Networks
| Hi-index | 0.00 |
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.