TY - JOUR
T1 - Content delivery in cache-enabled wireless evolving social networks
AU - Qin, Zhida
AU - Gan, Xiaoying
AU - Fu, Luoyi
AU - Di, Xin
AU - Tian, Jun
AU - Wang, Xinbing
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/10
Y1 - 2018/10
N2 - Cache-enabled wireless networks have gained increasing popularity in recent years for facilitating the delivery of content. Most existing works assumed that the network is static without the change of users and content, which is not the case in the real world. In this paper, we study the content delivery in cache-enabled wireless networks, where the network evolves in terms of users and content. We adopt the affiliation network model to reveal the network evolution process, where new users and content are added into the network randomly and connected with existing nodes via the preferential attachment. Users with strong social relations tend to request the same content objects, thus content popularity is sharply concentrated. Therefore, caching technique is more effective. To maximize the content delivery rate, we formulate the optimization problem of caching replication jointly with routing strategy. We show that network evolution can greatly improve the content delivery rate. In particular, when per-user cache capacity is in the order of Θ (1) , per-user delivery rate can achieve constant, i.e., the network can scale. Finally, theoretical results are validated based on a real-world data set from Facebook.
AB - Cache-enabled wireless networks have gained increasing popularity in recent years for facilitating the delivery of content. Most existing works assumed that the network is static without the change of users and content, which is not the case in the real world. In this paper, we study the content delivery in cache-enabled wireless networks, where the network evolves in terms of users and content. We adopt the affiliation network model to reveal the network evolution process, where new users and content are added into the network randomly and connected with existing nodes via the preferential attachment. Users with strong social relations tend to request the same content objects, thus content popularity is sharply concentrated. Therefore, caching technique is more effective. To maximize the content delivery rate, we formulate the optimization problem of caching replication jointly with routing strategy. We show that network evolution can greatly improve the content delivery rate. In particular, when per-user cache capacity is in the order of Θ (1) , per-user delivery rate can achieve constant, i.e., the network can scale. Finally, theoretical results are validated based on a real-world data set from Facebook.
KW - Wireless network
KW - content delivery
KW - evolving social network
UR - http://www.scopus.com/inward/record.url?scp=85052704698&partnerID=8YFLogxK
U2 - 10.1109/TWC.2018.2863687
DO - 10.1109/TWC.2018.2863687
M3 - Article
AN - SCOPUS:85052704698
SN - 1536-1276
VL - 17
SP - 6749
EP - 6761
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 10
M1 - 8444457
ER -