Query distribution estimation and predictive caching in mobile ad hoc networks

Authors:
Sheetal Gupta;Anupam Joshi;Justin Santiago;Anand Patwardhan
Affiliations:
University of Maryland, Baltimore, Maryland;University of Maryland, Baltimore, Maryland;Agnik, LLC, Columbia, Maryland;University of Maryland, Baltimore, Maryland
Venue:
Proceedings of the Seventh ACM International Workshop on Data Engineering for Wireless and Mobile Access
Year:
2008

Citing 7
Cited 0

GloMoSim: a library for parallel simulation of large-scale wireless networks

PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Proxy Cache Algorithms: Design, Implementation, and Performance

IEEE Transactions on Knowledge and Data Engineering
Data management issues in mobile and peer-to-peer environments

Data & Knowledge Engineering - DKE 40
Profile Driven Data Management for Pervasive Environments

DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Query Estimation by Adaptive Sampling

ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Supporting Cooperative Caching in Ad Hoc Networks

IEEE Transactions on Mobile Computing
Data management in mobile peer-to-peer networks

DBISP2P'04 Proceedings of the Second international conference on Databases, Information Systems, and Peer-to-Peer Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of data management has been studied widely in the field of mobile ad-hoc networks and pervasive computing. The issue addressed is that finding the data required by a device depends on chance encounter with the source of data. Most existing research has focused on specifying the required data by specifying the user or application intentions. These approaches take the semantics of data into account while caching data onto mobile devices from the wired sources. We propose a scheme by which mobile devices proactively increase the availability of data by pushing and caching the most popular data in the network. It involves a local distributed technique for estimating global query distribution in the network. The devices have a finite sized cache to store the pushed data and use their estimation of queries for prioritizing the data to cache. We implement this technique in the network simulator, Glomosim and show that our scheme improves data availability as well as the response latency.