TY - JOUR
T1 - Popularity-aware caching increases the capacity of wireless networks
AU - Qiu, Li
AU - Cao, Guohong
N1 - Funding Information:
This work was supported in part by the US National Science Foundation (NSF) under grants CNS-1526425 and CNS-1815465.
Publisher Copyright:
© 2002-2012 IEEE.
PY - 2020/1/1
Y1 - 2020/1/1
N2 - In wireless ad hoc networks, due to the interference between concurrent transmissions, the per-node capacity generally decreases with the increasing number of nodes in the network. Caching can help improve the network capacity, as it shortens the content transmission distance and reduces the communication interference. However, current researches on the capacity of wireless ad hoc networks with caching generally assume that content popularity follows a uniform distribution. They ignore the fact that contents in reality have skewed popularity, which may lead to totally different capacity results. In this paper, we evaluate how the distribution of the content popularity affects the per-node capacity, and derive different capacity scaling laws based on the skewness of the content popularity. Our results suggest that for wireless networks with caching, when contents have skewed popularity, increasing the number of nodes monotonically increases the per-node capacity.
AB - In wireless ad hoc networks, due to the interference between concurrent transmissions, the per-node capacity generally decreases with the increasing number of nodes in the network. Caching can help improve the network capacity, as it shortens the content transmission distance and reduces the communication interference. However, current researches on the capacity of wireless ad hoc networks with caching generally assume that content popularity follows a uniform distribution. They ignore the fact that contents in reality have skewed popularity, which may lead to totally different capacity results. In this paper, we evaluate how the distribution of the content popularity affects the per-node capacity, and derive different capacity scaling laws based on the skewness of the content popularity. Our results suggest that for wireless networks with caching, when contents have skewed popularity, increasing the number of nodes monotonically increases the per-node capacity.
UR - http://www.scopus.com/inward/record.url?scp=85077716681&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85077716681&partnerID=8YFLogxK
U2 - 10.1109/TMC.2019.2892419
DO - 10.1109/TMC.2019.2892419
M3 - Article
AN - SCOPUS:85077716681
SN - 1536-1233
VL - 19
SP - 173
EP - 187
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 1
M1 - 8611133
ER -