Fairness-aware cooperative caching scheme for Mobile Social Networks

Data access is an important and challenging issue in Mobile Social Networks (MSNs), and cooperative caching is an effective technique to improve the access performance. Most of current research efforts in data access of MSNs focus on improving the access performance while neglecting the fair treatment of users. Because fairness is considered as a major incentive for peer-to-peer service especially in infrastructure-less wireless networks, in this paper we propose a novel approach to support fairness aware cooperative caching scheme in MSNs. Through capturing close friend set of each node, we cache data prior at nodes which are overlapped by most nodes' close friend sets. Then we derive the optimal cooperative scheme by using the minimum dominating set, which is an NP-Complete problem, and we design a heuristic algorithm to handle it. Experimental results show that our scheme can effectively improve data access fairness as well as maintain nearly the same access performance compared to existing cooperative caching schemes.