, in which the mobile users contact each other opportunistically. While cooperative caching in the Internet has been studied extensively, cooperative caching in MOSNs is a considerably different and challenging problem due to the probabilistic nature of contact among the mobile users in MOSNs. In order to reduce the total access delay, we let the mobile users cooperatively cache these data items in their limited buffer space. We balance between selfishness (caching the data items according to its own preference) and unselfishness (helping other nodes to cache). The friends with higher contact frequency may share similar interests, hence, caching the data items for friend users can lead to some benefit. In this paper, we present a hierarchical cooperative caching scheme, which divides the buffer space into three components: self, friends, and strangers. In the self component, mobile users cache the data items according to their preference. In the friends component, mobile users help their friends to cache some data items. In the strangers component, mobile users randomly cache the remaining data items. We formally analyze the access delay of the proposed scheme. The effectiveness of our approach is verified through extensive real world trace-driven simulations. Index Terms-Access delay, cooperative caching, mobile opportunistic social networks (MOSNs), Zipf-like distribution.
Wang et al. REF described a cooperative caching scheme which studies the relationship between nodes and divides buffer space into three components to cache data according to the accessing frequency.
Hierarchical cooperative caching in mobile opportunistic social networks
2014 IEEE Global Communications Conference
2014 IEEE Global Communications Conference
Computer Science