• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

¿µ¹® ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ¿µ¹® ³í¹®Áö > TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

TIIS (Çѱ¹ÀÎÅͳÝÁ¤º¸ÇÐȸ)

Current Result Document : 4,064 / 4,064

ÇѱÛÁ¦¸ñ(Korean Title) Joint Optimization Algorithm Based on DCA for Three-tier Caching in Heterogeneous Cellular Networks
¿µ¹®Á¦¸ñ(English Title) Joint Optimization Algorithm Based on DCA for Three-tier Caching in Heterogeneous Cellular Networks
ÀúÀÚ(Author) Jun Zhang   Qi Zhu  
¿ø¹®¼ö·Ïó(Citation) VOL 15 NO. 07 PP. 2650 ~ 2667 (2021. 07)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
In this paper, we derive the expression of the cache hitting probability with random caching policy and propose the joint optimization algorithm based on difference of convex algorithm (DCA) in the three-tier caching heterogeneous cellular network assisted by macro base stations, helpers and users. Under the constraint of the caching capacity of caching devices, we establish the optimization problem to maximize the cache hitting probability of the network. In order to solve this problem, a convex function is introduced to convert the nonconvex problem to a difference of convex (DC) problem and then we utilize DCA to obtain the optimal caching probability of macro base stations, helpers and users for each content respectively. Simulation results show that when the density of caching devices is relatively low, popular contents should be cached to achieve a good performance. However, when the density of caching devices is relatively high, each content ought to be cached evenly. The algorithm proposed in this paper can achieve the higher cache hitting probability with the same density.
Å°¿öµå(Keyword) cache hitting probability   DCA   edge caching   heterogeneous cellular networks   Poisson point process (PPP)  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå