Energy-efficient caching strategies in ad hoc wireless networks

In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired network, and some nodes requiring access to the information stored at the server. In order to reduce access latency in such a communication environment, an effective strategy is caching the server information at some nodes distributed across the network. Caching, however, can considerably impact the system energy expenditure; for instance, disseminating information incurs additional energy burden. Since wireless devices have limited amounts of available energy, we need to design caching strategies that optimally trade-off between energy consumption and access latency. We pose our problem as an integer linear program. We show that this problem is the same as a special case of the connected facility location problem, which is known to be NP-hard. We devise a polynomial time algorithm which provides a sub-optimal s...

• Type: Conference
• Year: 2003
• Where: MOBIHOC
• Authors: Pavan Nuggehalli, Vikram Srinivasan, Carla-Fabiana Chiasserini
• Keywords: Arbitrary Network Topology, Candidate Caching Schemes, MOBIHOC 2003, Polynomial Time Algorithm, Wireless Networks