Welcome to the InfoSci Platform
Reference Hub2
Mobility Markov Chain and Matrix-Based Location-Aware Cache Replacement Policy in Mobile Environment: MMCM-CRP

Mobility Markov Chain and Matrix-Based Location-Aware Cache Replacement Policy in Mobile Environment: MMCM-CRP

Ajay Kumar Gupta, Udai Shanker
Copyright: © 2021 |Volume: 9 |Issue: 4 |Pages: 19
ISSN: 2166-7160|EISSN: 2166-7179|EISBN13: 9781799862796|DOI: 10.4018/IJSI.289171
Cite Article Cite Article

MLA

Gupta, Ajay Kumar, and Udai Shanker. "Mobility Markov Chain and Matrix-Based Location-Aware Cache Replacement Policy in Mobile Environment: MMCM-CRP." IJSI vol.9, no.4 2021: pp.88-106. http://doi.org/10.4018/IJSI.289171

APA

Gupta, A. K. & Shanker, U. (2021). Mobility Markov Chain and Matrix-Based Location-Aware Cache Replacement Policy in Mobile Environment: MMCM-CRP. International Journal of Software Innovation (IJSI), 9(4), 88-106. http://doi.org/10.4018/IJSI.289171

Chicago

Gupta, Ajay Kumar, and Udai Shanker. "Mobility Markov Chain and Matrix-Based Location-Aware Cache Replacement Policy in Mobile Environment: MMCM-CRP," International Journal of Software Innovation (IJSI) 9, no.4: 88-106. http://doi.org/10.4018/IJSI.289171

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In the location-aware services, past mobile device cache invalidation-replacement practises used are ineffective if the client travel route varies rapidly. In addition, in terms of storage expense, previous cache invalidation-replacement policies indicate high storage overhead. These limitations of past policies are inspiration for this research work. The paper describes the models to solve the aforementioned challenges using two different approaches separately for predicting the future path for the user movement. In the first approach, the most prevalent sequential pattern mining and clustering (SPMC) technique is used to pre-process the user's movement trajectory and find out the pattern that appears frequently. In the second approach, frequent patterns are forwarded into the mobility Markov chain and matrix (MMCM) algorithm leading to a reduction in the size of candidate sets and, therefore, efficiency enhancement of mining sequence patterns. Analytical results show significant caching performance improvement compared to previous caching policies.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.