Open AccessContact duration aware cache refreshing for mobile opportunistic networks
Author(s) -
Wang Fang,
Wang Zhaocheng,
Yang Zhixing,
Chen Sheng
Publication year - 2016
Publication title -
iet networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.466
H-Index - 21
ISSN - 2047-4962
DOI - 10.1049/iet-net.2015.0086
Subject(s) - computer science , cache , computer network , cache invalidation , node (physics) , duration (music) , latency (audio) , mobile device , distributed computing , cache algorithms , cpu cache , operating system , telecommunications , art , literature , structural engineering , engineering
Caching is a practical data access approach in mobile opportunistic networks, which enables mobile terminals to obtain data from adjacent nodes and to reduces accessing latency, whereby the updating files should be delivered to the caching nodes on time when the source is refreshed in order to maintain the freshness of the cached data. Due to the node mobility and short communication range, the contact duration in mobile opportunistic networks is short and this limits the amount of data transmitted in one contact. However, current cache refreshing schemes often ignore this critical issue. In this study, the authors study the contact duration aware cache refreshing in mobile opportunistic networks. Specifically, they establish a two‐state Markov chain to describe the data delivered from one node to another. Based on the proposed model, they investigate a tree structure to refresh the cached data, where each node is responsible to refresh the data cached at its children and it may opportunistically rely on some relays outside the tree to improve the refreshing efficiency. Extensive trace‐driven simulations validate the effectiveness of the authors’ scheme in terms of improving cache refreshing in challenging mobile environments.