Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Mobile facility location (extended abstract)
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
IEEE/ACM Transactions on Networking (TON)
Web caching and replication
Internet-Based Mobile Ad Hoc Networking
IEEE Internet Computing
Coordinated Placement and Replacement for Large-Scale Distributed Caches
IEEE Transactions on Knowledge and Data Engineering
Replication Algorithms in a Remote Caching Architecture
IEEE Transactions on Parallel and Distributed Systems
Primal-Dual Algorithms for Connected Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Energy-efficient caching strategies in ad hoc wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Exploiting Locality for Data Management in Systems of Limited Bandwidth
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Supporting Cooperative Caching in Ad Hoc Networks
IEEE Transactions on Mobile Computing
Efficient cache placement in multi-hop wireless networks
IEEE/ACM Transactions on Networking (TON)
Wireless sensor networks: A survey on the state of the art and the 802.15.4 and ZigBee standards
Computer Communications
Benefit-based Data Caching in Ad Hoc Networks
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Approximating connected facility location problems via random facility sampling and core detouring
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Opportunity-Based Topology Control in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
A Reliability-Oriented Transmission Service in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
A management Ad Hoc networks model for rescue and emergency scenarios
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
This paper studies a challenging problem of cache placement in wireless multi-hop ad hoc networks. More specifically, we study how to achieve an optimal tradeoff between total access delay and caching overheads, by properly selecting a subset of wireless nodes as cache nodes when the network topology changes. We assume a data source updates a data item to be accessed by other client nodes. Most of the existing cache placement algorithms use hop counts to measure the total cost of a caching system, but hop delay in wireless networks varies much due to the contentions among these nodes and the traffic load on each link. Therefore, we evaluate the per-hop delay for each link according to the contentions detected by a wireless node from the MAC layer. We propose two heuristic cache placement algorithms, named Centralized Contention-aware Caching Algorithm (CCCA) and Distributed Contention-aware Caching Algorithm (DCCA), both of which detect the variation of contentions and the change of the traffic flows, in order to evaluate the benefit of selecting a node as a cache node. We also apply a TTL-based cache consistency strategy to maintain the delta consistency among all the cache nodes. 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.