Hao Dai , Chao Zhai , Jiachao Yu , Jie Gao , Jie Tian
{"title":"Edge-caching assisted underlay spectrum sharing in large-scale cognitive radio networks","authors":"Hao Dai , Chao Zhai , Jiachao Yu , Jie Gao , Jie Tian","doi":"10.1016/j.comnet.2025.111238","DOIUrl":null,"url":null,"abstract":"<div><div>Edge-caching and spectrum sharing are promising techniques to meet the fast-growing wireless transmission requirements. In this paper, we propose an edge-caching based underlay spectrum sharing scheme for a large-scale cognitive radio network. In the primary system, primary users (PUs) request files from their associated base stations. In the secondary system, secondary transmitters (STs) intend to communicate with their receivers by sharing the spectrum, and secondary helpers (SHs) actively cache the files of primary system. In the device-to-device (D2D) communication range around each PU, the SH that has cached the file requested by the PU and has the shortest distance to the PU is selected for the cooperative file transfer. With the cooperation from SHs, the transmission quality towards PUs can be greatly improved, and STs can achieve more opportunities for the spectrum sharing. An optimization problem is formulated to maximize the area throughput of secondary system under the performance constraint of primary system. We propose a low-complexity CVX-SA algorithm by decomposing the original problem into two subproblems to jointly determine the file caching policy and system critical parameters. Numerical results show that, compared with the benchmark schemes, our proposed scheme can significantly improve the area throughput of the secondary system.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"263 ","pages":"Article 111238"},"PeriodicalIF":4.4000,"publicationDate":"2025-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625002063","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
Abstract
Edge-caching and spectrum sharing are promising techniques to meet the fast-growing wireless transmission requirements. In this paper, we propose an edge-caching based underlay spectrum sharing scheme for a large-scale cognitive radio network. In the primary system, primary users (PUs) request files from their associated base stations. In the secondary system, secondary transmitters (STs) intend to communicate with their receivers by sharing the spectrum, and secondary helpers (SHs) actively cache the files of primary system. In the device-to-device (D2D) communication range around each PU, the SH that has cached the file requested by the PU and has the shortest distance to the PU is selected for the cooperative file transfer. With the cooperation from SHs, the transmission quality towards PUs can be greatly improved, and STs can achieve more opportunities for the spectrum sharing. An optimization problem is formulated to maximize the area throughput of secondary system under the performance constraint of primary system. We propose a low-complexity CVX-SA algorithm by decomposing the original problem into two subproblems to jointly determine the file caching policy and system critical parameters. Numerical results show that, compared with the benchmark schemes, our proposed scheme can significantly improve the area throughput of the secondary system.
期刊介绍:
Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.