LOCASS: Local Optimal Caching Algorithm With Social Selfishness for Mixed Cooperative and Selfish Devices

Device caching has emerged as a promising solution to alleviate backhaul overload in future wireless networks with mixed cooperative and selfish devices. The behaviors of these devices actually represent the inherent social-network characteristics of their users, i.e., people treat each other differ...

Full description

Bibliographic Details
Main Authors: Yang Yang, Yecheng Wu, Nanxi Chen, Kunlun Wang, Shanzhi Chen, Sha Yao
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8357529/
id doaj-dd3bdef322864c549bd5da651f7f531a
record_format Article
spelling doaj-dd3bdef322864c549bd5da651f7f531a2021-03-29T21:18:01ZengIEEEIEEE Access2169-35362018-01-016300603007210.1109/ACCESS.2018.28353688357529LOCASS: Local Optimal Caching Algorithm With Social Selfishness for Mixed Cooperative and Selfish DevicesYang Yang0https://orcid.org/0000-0003-0608-9408Yecheng Wu1Nanxi Chen2Kunlun Wang3Shanzhi Chen4Sha Yao5Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai, ChinaShanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai, ChinaShanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai, ChinaShanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai, ChinaState Key Laboratory of Wireless Mobile Communications, China Academy of Telecommunication Technology, Beijing, ChinaEnigma Investment, Shanghai, ChinaDevice caching has emerged as a promising solution to alleviate backhaul overload in future wireless networks with mixed cooperative and selfish devices. The behaviors of these devices actually represent the inherent social-network characteristics of their users, i.e., people treat each other differently according to the closeness of their social relationships. In this paper, the concept of social selfishness is adopted to capture the social characteristics in mobile device caching. Devices can be cooperative or be selfish in dynamic content sharing environments according to their social tie strengths, just like their users tend to cooperate with their friends and show selfishness to strangers. Based on social selfishness, a novel device caching game model is proposed to analyze the limited resource and privacy issues in a typical mobile caching scenario. Then, a local optimal caching algorithm with social selfishness (LOCASS) is developed to address these challenging problems. Analytical results show that LOCASS can approach Nash equilibrium of the game, and therefore, achieving the best caching strategy for mixed cooperative and selfish devices. Further, extensive simulation results show that LOCASS offers much better performance, in terms of average offloading ratio and resource utilization, than traditional random, Most-popular-content and Greedy caching algorithms. Besides, under LOCASS, devices with low degrees are most likely to store popular contents, while devices with high degrees are more willing to store those comparatively unpopular contents and fetch popular ones from their cooperative-devices.https://ieeexplore.ieee.org/document/8357529/Device cachingsocial selfishnessoffloading ratioNash equilibrium
collection DOAJ
language English
format Article
sources DOAJ
author Yang Yang
Yecheng Wu
Nanxi Chen
Kunlun Wang
Shanzhi Chen
Sha Yao
spellingShingle Yang Yang
Yecheng Wu
Nanxi Chen
Kunlun Wang
Shanzhi Chen
Sha Yao
LOCASS: Local Optimal Caching Algorithm With Social Selfishness for Mixed Cooperative and Selfish Devices
IEEE Access
Device caching
social selfishness
offloading ratio
Nash equilibrium
author_facet Yang Yang
Yecheng Wu
Nanxi Chen
Kunlun Wang
Shanzhi Chen
Sha Yao
author_sort Yang Yang
title LOCASS: Local Optimal Caching Algorithm With Social Selfishness for Mixed Cooperative and Selfish Devices
title_short LOCASS: Local Optimal Caching Algorithm With Social Selfishness for Mixed Cooperative and Selfish Devices
title_full LOCASS: Local Optimal Caching Algorithm With Social Selfishness for Mixed Cooperative and Selfish Devices
title_fullStr LOCASS: Local Optimal Caching Algorithm With Social Selfishness for Mixed Cooperative and Selfish Devices
title_full_unstemmed LOCASS: Local Optimal Caching Algorithm With Social Selfishness for Mixed Cooperative and Selfish Devices
title_sort locass: local optimal caching algorithm with social selfishness for mixed cooperative and selfish devices
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2018-01-01
description Device caching has emerged as a promising solution to alleviate backhaul overload in future wireless networks with mixed cooperative and selfish devices. The behaviors of these devices actually represent the inherent social-network characteristics of their users, i.e., people treat each other differently according to the closeness of their social relationships. In this paper, the concept of social selfishness is adopted to capture the social characteristics in mobile device caching. Devices can be cooperative or be selfish in dynamic content sharing environments according to their social tie strengths, just like their users tend to cooperate with their friends and show selfishness to strangers. Based on social selfishness, a novel device caching game model is proposed to analyze the limited resource and privacy issues in a typical mobile caching scenario. Then, a local optimal caching algorithm with social selfishness (LOCASS) is developed to address these challenging problems. Analytical results show that LOCASS can approach Nash equilibrium of the game, and therefore, achieving the best caching strategy for mixed cooperative and selfish devices. Further, extensive simulation results show that LOCASS offers much better performance, in terms of average offloading ratio and resource utilization, than traditional random, Most-popular-content and Greedy caching algorithms. Besides, under LOCASS, devices with low degrees are most likely to store popular contents, while devices with high degrees are more willing to store those comparatively unpopular contents and fetch popular ones from their cooperative-devices.
topic Device caching
social selfishness
offloading ratio
Nash equilibrium
url https://ieeexplore.ieee.org/document/8357529/
work_keys_str_mv AT yangyang locasslocaloptimalcachingalgorithmwithsocialselfishnessformixedcooperativeandselfishdevices
AT yechengwu locasslocaloptimalcachingalgorithmwithsocialselfishnessformixedcooperativeandselfishdevices
AT nanxichen locasslocaloptimalcachingalgorithmwithsocialselfishnessformixedcooperativeandselfishdevices
AT kunlunwang locasslocaloptimalcachingalgorithmwithsocialselfishnessformixedcooperativeandselfishdevices
AT shanzhichen locasslocaloptimalcachingalgorithmwithsocialselfishnessformixedcooperativeandselfishdevices
AT shayao locasslocaloptimalcachingalgorithmwithsocialselfishnessformixedcooperativeandselfishdevices
_version_ 1724193248747978752