{"title":"随机不连续传输HetNets中的随机缓存策略","authors":"Li Hu, F. Zheng, Jingjing Luo, Xu Zhu","doi":"10.1109/WCNC45663.2020.9120642","DOIUrl":null,"url":null,"abstract":"In this paper, we jointly explore random caching and cooperative transmission in heterogenous networks (HetNets) with random discontinuous transmission (DTX). We consider a realistic scenario where joint transmission is not always available and assume two cases depending on whether joint transmission is available. With the help of stochastic geometry, a tractable expression for the average successful transmission probability (STP) is obtained. We then formulate the STP optimization problem to find the optimal caching policy. In addition, we analyze the STP under random DTX. Compared with several existing caching policies in the previous works, we show that the optimal caching policy indeed achieves a significant performance gain.","PeriodicalId":415064,"journal":{"name":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"521 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Random Caching Strategy in HetNets with Random Discontinuous Transmission\",\"authors\":\"Li Hu, F. Zheng, Jingjing Luo, Xu Zhu\",\"doi\":\"10.1109/WCNC45663.2020.9120642\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we jointly explore random caching and cooperative transmission in heterogenous networks (HetNets) with random discontinuous transmission (DTX). We consider a realistic scenario where joint transmission is not always available and assume two cases depending on whether joint transmission is available. With the help of stochastic geometry, a tractable expression for the average successful transmission probability (STP) is obtained. We then formulate the STP optimization problem to find the optimal caching policy. In addition, we analyze the STP under random DTX. Compared with several existing caching policies in the previous works, we show that the optimal caching policy indeed achieves a significant performance gain.\",\"PeriodicalId\":415064,\"journal\":{\"name\":\"2020 IEEE Wireless Communications and Networking Conference (WCNC)\",\"volume\":\"521 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE Wireless Communications and Networking Conference (WCNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNC45663.2020.9120642\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC45663.2020.9120642","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Random Caching Strategy in HetNets with Random Discontinuous Transmission
In this paper, we jointly explore random caching and cooperative transmission in heterogenous networks (HetNets) with random discontinuous transmission (DTX). We consider a realistic scenario where joint transmission is not always available and assume two cases depending on whether joint transmission is available. With the help of stochastic geometry, a tractable expression for the average successful transmission probability (STP) is obtained. We then formulate the STP optimization problem to find the optimal caching policy. In addition, we analyze the STP under random DTX. Compared with several existing caching policies in the previous works, we show that the optimal caching policy indeed achieves a significant performance gain.