A Survey of Location Based Services Caching for Efficient Data Access in DTN

Data caching can significantly improve the efficiency of information access in a wireless mobile network by reducing the access latency and bandwidth usage. Whenever, designing efficient distributed caching algorithms is on trivial when network nodes have limited memory. In this article, we consider the cache placement problem of minimizing total data access cost in mobile network networks with multiple data items and nodes with limited memory capacity. Our distributed algorithm naturally extends to networks with mobile nodes. We simulate our distributed algorithm using a network simulator (ns2) and demonstrate that it significantly outperforms another existing caching technique in all important performance metrics. In this paper, The location based services monitor a new node and a set of moving objects and answer queries pertaining to their locations and access the data efficiently in DTN. The performance differential is particularly large in more challenging scenarios such as higher access frequency and smaller.