Networking and Communication Engineering

A. Valarmozhi ¹, M. Priya ¹, Sasikumar Gurumurthy ²

Affiliations
1 Department of Information Technology, Bannari Amman Institute of Technology, Sathyamangalam, IN
2 School of Computing Science and Engg., VIT University, IN

Abstract

In this paper, we address the problem of effective cache placement in multi-hop wireless networks. We consider a network comprising a server with an interface to the wired network, and other 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 of the nodes distributed across the network. Caching, however, can imply a considerable overhead cost; for instance, disseminating information incurs additional energy as well as bandwidth burden. Since wireless systems are plagued by scarcity of available energy and bandwidth, we need to design caching strategies that optimally trade-off between overhead cost and access latency. We pose our problem as an integer linear program. We devise a polynomial time algorithm which provides a sub optimal solution. The proposed algorithm applies to any arbitrary network topology and can be implemented in a distributed and asynchronous manner.

Keywords

Heuristic Optimization, Web Cache Placement, Wireless Multi-Hop Networks.

Full Text