A spectrum sharing method for large-scale cognitive radio networks assisted by edge cache

By adopting edge caching technology and random geometry theory in large-scale cognitive radio networks, optimizing cache and resource allocation, the problem of low spectrum resource utilization is solved, efficient spectrum sharing and network capacity improvement is achieved, and suitable for B5G/6G network.

CN118233904BActive Publication Date: 2024-11-08SHANDONG UNIV
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410321459.5
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-03-20
Publication Date
2024-11-08
Estimated Expiration
2044-03-20

AI Technical Summary

Technical Problem

In large-scale cognitive radio networks, traditional static spectrum management methods lead to low utilization of spectrum resources and cannot meet the growing demand for wireless transmission. In addition, edge caching technology is not fully applied in cognitive radio networks, affecting spectrum sharing efficiency .

Method used

Adopting the cognitive spectrum sharing method of base liner based on edge cache, the secondary user (the secondary helper) assists the authorized user in exchange for spectrum resources, and optimizes file cache and resource allocation by setting protection zones and cache transmission zones around the main user. The cache probability, subsystem transmission power ratio and protection area radius are optimized using stochastic geometry theory and CVX-SA algorithm.

Benefits of technology

It improves spectrum efficiency and network capacity, improves the communication performance of the main system and the throughput performance of the secondary system, meets the needs of the B5G/6G network standards, and provides theoretical foundation and technical support for spectrum sharing.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118233904B_ABST
    Figure CN118233904B_ABST
Patent Text Reader

Abstract

The present invention relates to an edge cache-assisted large-scale cognitive radio network spectrum sharing method, comprising: step 1: SH downloads and caches the main system file content from the Internet content library according to the cache mechanism during idle time; step 2: PU requests content from PB, and PB determines whether there is an SH that caches the requested file in the CTZ around PU; transmission is performed according to the following four situations; step 3: SH obtains the opportunity of spectrum sharing for secondary user transmission, and STs outside the PU protection zone randomly access the spectrum according to the ALOHA protocol, and performs D2D single-hop communication with the corresponding SRs. The present invention can reduce the size of the protection zone, so that more secondary system links can be accommodated in a large-scale network, thereby improving the regional throughput performance of the secondary system.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention relates to an edge cache-assisted large-scale cognitive radio network spectrum sharing method, belonging to the technical field of wireless communications. Background Art

[0002] The large-scale deployment of 5G networks has led to a leapfrog improvement in mobile communication capabilities and service quality. Some new application requirements are constantly emerging, such as immersive cloud XR (extended reality), ultra-high-definition / 3D video, sensory interconnection, digital twins, etc., which urgently need more spectrum resources to meet the growing demand for wireless transmission. The frequency bands within 6GHz of very high frequency (VHF), ultra-high frequency (UHF) and ultra-high frequency (SHF) have good transmission characteristics, strong penetration ability, small path loss, and long transmission distance. They are generally used in mobile communications, but this band has been allocated through authorization. In fact, precious spectrum resources are not fully utilized and are often idle in time and space. On the one hand, the growing demand for wireless transmission requires more spectrum, while on the other hand, the utilization rate of licensed spectrum is very low. In the case of massive coexistence of users and a surge in wireless transmission demand, the rigid transmission mode and low utilization rate of spectrum resources have become bottlenecks restricting the improvement of network capacity. Therefore, the traditional static spectrum management method restricts the efficient use of spectrum, and cognitive radio technology has emerged. In cognitive radio networks, primary users with licensed spectrum have higher priority, and secondary users detect and occupy idle spectrum, or secondary users and primary users occupy spectrum at the same time, but the transmission power and access parameters must be strictly controlled, or secondary users assist primary users in transmitting data in exchange for spectrum. Under the premise of ensuring the performance requirements of the primary system, the throughput of the secondary system is maximized to achieve coexistence and win-win results between the primary and secondary systems.

[0003] Users deploy various types of networks on demand to meet various business needs. Wireless networks gradually present a large-scale cognitive heterogeneity with multiple access mechanisms coexisting and various types of base stations deployed in overlapping manners. In the traditional unicast communication mode, users request services from the associated base stations. The base stations are connected to the core network through the backhaul link, connected to the Internet through the packet data gateway, and obtain files from the content server. The file requirements of adjacent users are similar, but the file requests are generally not synchronized. Every time the base station receives the same file request, it must obtain the file from the content server, resulting in a large amount of transmission redundancy and waste of transmission resources. Based on limited spectrum resources, scholars generally adopt efficient transmission technology to cope with the continuous growth of wireless demand, but the channel capacity has approached the Shannon limit, and the rate capacity has limited room for improvement. In recent years, edge caching technology has received widespread attention. The network caches file content when it is idle and performs local efficient transmission when it is busy, which can effectively alleviate network congestion, reduce transmission delay, and increase network capacity. Edge caching technology greatly improves the communication quality and efficiency with the help of cheap and continuously growing storage space. When the network is idle, the file content is transferred from the remote server to the local, and advanced wireless communication technology is used to achieve fast and reliable content transmission. The existing edge caching mechanism focuses on the hit rate of cached files, but the load transfer effect is poor. Edge caching has not yet been applied to cognitive radio networks. It is urgent to study the mechanism of edge caching on cognitive spectrum sharing, innovate network architecture and spectrum sharing mode, and significantly improve spectrum efficiency and network capacity. Summary of the invention

[0004] In response to the above problems, the present invention provides an edge cache-based underlay spectrum sharing method in which unauthorized users (secondary users) assist authorized users (primary users) in transmitting data in exchange for spectrum resources in a large-scale cognitive radio network under Rayleigh channel fading conditions.

[0005] The present invention fully considers the realistic factors of cognitive radio networks, and studies the theory of underlay cognitive spectrum sharing based on edge cache cooperative transmission. The secondary users with caching function in the secondary system are called secondary helpers. The secondary helpers actively cache the file content of the primary user and assist the primary user to realize local transmission of the file content. By improving the communication performance of the primary system, more spectrum sharing opportunities are obtained for the secondary system. The present invention reasonably constructs a large-scale cognitive radio network model and designs an underlay spectrum sharing mechanism based on edge cache. Considering the popularity of the primary user's file, the secondary helper caches the primary user's file according to a certain probability. In order to reduce the strong interference from the secondary system, a protection zone is set around the primary user. The secondary users located in the protection zone are prohibited from occupying the spectrum, and the secondary users located outside the protection zone randomly occupy the spectrum according to a certain probability. A cache transmission zone is set around the primary user, and the secondary helper with the cached files required by the primary user and the best channel quality to the primary user is selected to assist in transmitting the file content to the primary user. Since selecting the best secondary helper can achieve a certain cooperative diversity effect, and the distance between the secondary helper and the primary user is relatively close, the secondary helper assisting in transmitting file content to the primary user can more easily meet the communication performance requirements of the primary system, and the primary system can withstand stronger interference. Therefore, the size of the protection zone can be reduced, and the entire network can accommodate more secondary users for spectrum sharing, which helps to improve the throughput performance of the secondary system.

[0006] The present invention uses random geometry theory to properly model the random position distribution of each node in the network and analyzes the regional throughput performance of the primary and secondary systems under full frequency reuse. The joint optimization problem of caching scheme and resource allocation is constructed to maximize the regional throughput of the secondary system while meeting the requirements of the regional throughput of the primary system. The present invention proposes a CVX-SA algorithm to jointly optimize the file caching probability, the transmission power ratio of the secondary system and the protection zone radius.

[0007] The technical solution of the present invention is as follows:

[0008] A spectrum sharing method for a large-scale cognitive radio network assisted by edge caching, in which a main system includes a primary base station (PB) and a primary user (PU), and a secondary system includes a secondary transmitter (ST), a secondary receiver (SR) and a secondary helper (SH); each ST corresponds to an SR, and D2D (Devide-to-Device) single-hop communication is performed; the SH actively caches files required by the PU, and actively assists the PB in transmitting files to the PU; a protection zone is set around the PU, and the STs located in the protection zone are prohibited from occupying the spectrum, and only the STs located outside the protection zone opportunistically share the spectrum of the main system; a caching transmission zone (CTZ) is also set around the PU, and the SH located in the CTZ and caching the file content required by the PU will assist in transmitting the file content to the PU; the method includes:

[0009] Step 1: SH downloads and caches the main system file content from the Internet content library during idle time according to the cache mechanism;

[0010] Step 2: PU requests content from PB. PB determines whether there is an SH caching the requested file in the CTZ around PU and transmits it according to the following four situations:

[0011] The first transmission situation: when there is no SH for caching the requested file in the CTZ, the PB transmits the requested file content to the PU, the PU correctly receives the data packet from the PB and feeds back an ACK frame, and the PB continues to transmit new data packets;

[0012] The second transmission situation: when there is no SH for caching the requested file in the CTZ, the PB transmits the requested file content to the PU. The PU receives the data packet from the PB incorrectly and feeds back a NACK frame. The PB retransmits the original data.

[0013] The third transmission situation: when there is at least one SH in the CTZ that has the requested file required by the PU, one SH with the best channel quality to the PU is selected from these SHs to actively transmit the file content to the PU. At this time, the PB does not transmit and remains silent. The PU correctly receives the data packet from the SH and feeds back an ACK frame. The SH continues to transmit new data packets.

[0014] The fourth transmission situation: if there is at least one SH in the CTZ that has the file content required by the PU cached, one of these SHs will select the one with the best channel quality to the PU and actively transmit the file content to the PU. At this time, the PB does not transmit and remains silent. The PU receives the main data from the SH by mistake and releases a NACK frame. In this case, the SH retransmits the original data.

[0015] Step 3: SH obtains the opportunity to share the spectrum for secondary user transmission. STs outside the PU protection zone randomly access the spectrum according to the ALOHA protocol and perform D2D single-hop communication with the corresponding SRs.

[0016] Preferably, in a large-scale cognitive radio network, PBs, STs and SHs coexist on a two-dimensional plane; the positions of PBs are modeled as a homogeneous Poisson point process (HPPP) b , the density is λ b ; In the subsystem, the distribution of ST and SH is modeled as two independent HPPPΠ s and Π h , the densities are λ s and λ h ; The transmission powers of PBs, STs and SHs are p b 、p s and p h , where p s =β1p b , p h =β2p b ; In the entire large-scale cognitive radio network, considering the full reuse of a specific frequency band, all PBs on the entire plane share this frequency band to transmit data to the PU they serve, and at the same time, the secondary system also shares this spectrum resource; the target transmission rates of the primary link and the secondary link are set to v p and v s , when the channel capacity is greater than the transmission rate, the data can be successfully transmitted; a protection zone with a radius of σ is set around each PU; STs located in the protection zone are prohibited from occupying spectrum resources, and STs outside the protection zone randomly access the spectrum according to the ALOHA protocol, with a media access probability of ξ. When an ST successfully occupies the channel, a D2D single-hop communication link is established between the ST and its corresponding SR.

[0017] Preferably, according to the present invention, it is assumed that all terminals operate in half-duplex mode and cannot transmit and receive data at the same time; during data transmission, the relative positions of the terminals remain unchanged; the entire transmission time is divided into equal-length periods; each period contains two time blocks, and each SH is equipped with an omnidirectional antenna and a cache space of the same capacity.

[0018] According to the preferred embodiment of the present invention, in an Internet content library containing M files, all files are arranged in descending order of popularity; in each time block, assuming that a PU requests at most one file from the content library, the popularity distribution vector of the file is Q=[q1, ..., q i , ..., q M ] indicates that, where q i is the request probability of the i-th file;

[0019] Without loss of generality, it is assumed that all files are of equal size and all SHs have the same cache capacity, which is C, C<<M. For scenarios with different file sizes, by dividing the files into blocks of equal size, when the large-scale cognitive radio network is in non-peak hours, SH downloads and caches the main system file content based on the cache mechanism; is defined as the set of probabilities of caching each file in SH, where 0 ≤ p i ≤1; for i=1, 2, ..., i, ..., M, the SH of storage file i follows density λ h p i PPP distribution.

[0020] Further preferably, the popularity of the file follows the Zipf distribution, and the popularity of the i-th content is expressed as formula (1):

[0021]

[0022] where γ is the Zipf slope, reflecting the skewness of the popularity distribution, and γ ≥ 0.

[0023] According to the preferred embodiment of the present invention, the cache hit rate (Hitting Rate) refers to the probability that a primary user finds a SH that caches the requested file in its surrounding CTZ, denoted by H i represents the cache hit probability of file i. The SHs distribution of cache file i follows the density p i λ h PPP, for file i in radius The cache hit probability of SH in the CTZ is expressed as H i =1-exp(-πp i λ h τ 2 ), the probability of selecting a suitable SH to transfer files to PU is When a typical PU obtains file i from the selected SH, the distance between the typical PU and the SH is d h , its probability density function (PDF, Probability Density Function) is expressed as formula (2):

[0024]

[0025] The average number of SHs that cache content i in a CTZ is πτ 2 p i λ h , the probability that there are n SHs caching content i in the CTZ is expressed as

[0026] According to the preferred embodiment of the present invention, in the first transmission situation, there is no SH in the CTZ that caches the PU request file content, and the request file content must be provided by PBx0. PB retrieves the request file content through the backhaul link and transmits it to PU through the wireless link. Given the distance between PBx0 and its typical PU is The signal-to-interference ratio of a typical PU is Then the success probability of the original data transmission is:

[0027]

[0028] in, The Laplace transform of is:

[0029]

[0030] Laplace transform of for:

[0031]

[0032] In the second transmission situation, there is no SH in the CTZ that caches the PU request file content, and PB fails to transmit the original data to PU, and PB retransmits; the conditional success probability is:

[0033]

[0034] In the third transmission case, there is at least one SH in the CTZ area that caches the PU request file i. The cache SH with the best transmission channel quality to the PU transmits the main data to the typical PU. The signal-to-interference ratio of the typical PU is in, is the SH set of cached request contents in CTZ; the probability of successful transmission is:

[0035]

[0036] in,

[0037]

[0038] In the fourth transmission case, there is at least one SH in the CTZ area caching the PU request file i, and the cache SH with the best transmission channel quality to the PU transmits the main data to the typical PU; the PU receives the main data from the SH incorrectly, and the SH retransmits the original data. The conditional success probability is:

[0039]

[0040] in,

[0041]

[0042] The regional throughput is defined as the average number of bits successfully transmitted per unit area; the average throughput of CRN1 is:

[0043]

[0044] According to the preferred embodiment of the present invention, a typical secondary transmitter ST is selected, and its corresponding typical SRz 0′ Communication, the typical SRz 0′ Placed at the origin; typical ST z0 and its SR z 0′ The distance between z 0′ The signal-to-interference ratio at Interference caused by main system transmission Among them, P x =p b or P x =p s ; All simultaneous subsystem transmissions to z 0′ Cause interference The success probability of the subsystem transmission for:

[0045]

[0046] in, and They are and The Laplace transform of

[0047]

[0048] parameter function Therefore, the probability of success is for:

[0049]

[0050] Through the above analysis, the average throughput of the secondary system is obtained as follows:

[0051]

[0052] Preferably, according to the present invention, the optimization problem of constructing a large-scale cognitive radio network is to maximize the secondary system throughput while meeting the primary system throughput requirement, and jointly optimize the cache probability, the secondary system transmission power ratio and the protection zone radius; the optimization problem is the cache probability set The function of the protection zone radius σ and the transmission power ratios β1 and β2; the optimization problem is constructed as follows:

[0053]

[0054]

[0055] β1,β2∈(0,1) (b)

[0056] 0<σ<R (c)

[0057]

[0058] Among them, constraint (a) represents the storage space limitation of SHs, constraint (b) represents the possible value range of the transmission power ratio of STs and SHs relative to PBs, constraint (c) represents the protection zone radius control, and constraint (d) represents the main system area throughput of the large-scale cognitive radio network CRN1 compared with the cacheless cognitive radio network CRN2. The reduction ratio does not exceed ∈1;

[0059] The optimization problem of cacheless cognitive radio network CRN2 is formulated as:

[0060]

[0061] stβ1∈(0,1) (e)

[0062] 0<σ≤R(f)

[0063]

[0064] Among them, constraint (e) represents the possible value range of the transmission power ratio of the secondary user to the primary base station, constraint (f) represents the protection zone radius control, and constraint (g) represents the throughput of the cellular network CN3. Compared with the non-cached cognitive radio network, the regional throughput reduction ratio of the main system of CRN2 does not exceed ∈2;

[0065] The cellular user receives the data correctly, or the cellular user receives the data incorrectly, and the base station retransmits; the success probability of transmitting the original data is:

[0066]

[0067] in, It is interference Laplace transform of; if the original transmission fails, the probability of success of the retransmission is:

[0068]

[0069] The average regional throughput of the cellular network CN3 is obtained as:

[0070]

[0071] Preferably, according to the present invention, the optimization problem P1 is solved by the CVX-SA algorithm; the original optimization problem P1 is decomposed into two sub-problems, namely P1(a) and P1(bc), including:

[0072] Given σ, β1, and β2, the optimization problem of constructing the cache probability set is as follows:

[0073]

[0074]

[0075] The goal of P1(a) is to maximize the secondary system area throughput by optimizing the caching strategy of SHs when PUs obtain the requested content from SHs through D2D communication;

[0076] For the obtained The optimization problem of power and protection zone radius is constructed as follows:

[0077]

[0078] stβ1,β2∈(0,1)

[0079] 0<σ<R.

[0080] Subproblem P1(bc) considers the interference caused by ST-SR communication, SH-PU communication and PB-PU communication, and maximizes the secondary system area throughput by optimizing parameters β1, β2 and σ;

[0081] P1(a) is a convex optimization problem. We use the CVX-SA algorithm to solve the convex optimization problem and find the cache probability set The global optimal solution is the optimal cache probability set, which is used in P1(bc) and the improved simulated annealing method to determine the optimal settings of the transmission power ratio and the protection area radius.

[0082] The beneficial effects of the present invention are:

[0083] 1. The present invention fully considers the realistic factors of cognitive radio networks and proposes a theory of cognitive spectrum sharing based on edge caching. Unauthorized users (secondary users) assist authorized users (primary users) in transmitting data in exchange for spectrum resources. The present invention innovates the theory of cognitive spectrum sharing, using cheap and massive storage space to realize underlying spectrum sharing based on file cache collaborative transmission, improving the wireless communication performance of the main system while meeting the data transmission requirements of the secondary system, which helps to greatly improve the spectrum efficiency and provide a theoretical basis and technical support for the formulation of B5G / 6G network standards and system development.

[0084] 2. The present invention proposes a cognitive radio network transmission method based on edge caching. In a large-scale cognitive radio network, the main system includes a main base station and a main user, and the secondary system includes a secondary transmitter, a secondary receiver, and a secondary helper. The secondary helper actively caches the files required by the PU and assists the PB in transmitting data to the PU. Since the SH is usually close to the PU and has better communication quality, the SH assists the PB in transmission, which can improve the communication performance of the main user PU. A protection zone is set around each main user PU, and only STs outside the protection zone can opportunistically share the main system spectrum. Selecting the optimal SH to assist in transmitting the cached files to the PU can more easily meet the communication quality requirements of the main system, and the main system can withstand more interference. Therefore, the size of the protection zone can be reduced, so that more secondary system links can be accommodated in large-scale networks, thereby improving the regional throughput performance of the secondary system.

[0085] 3. The present invention proposes a probability-based caching mechanism. Given all the primary user files and their popularity, SH caches each file according to a certain probability. The present invention constructs a joint optimization problem of caching scheme and resource allocation. Under the premise of meeting the requirements of the primary system regional throughput, the secondary system regional throughput is maximized by jointly optimizing the caching probability, the secondary system transmission power ratio and the protection zone radius.

[0086] 4. The present invention proposes a CVX-SA algorithm to solve the optimization problem of cache probability, subsystem transmission power ratio and protection zone radius. P1(a) is a convex optimization problem. The present invention introduces the CVX method into the SA algorithm to solve the convex optimization problem. The CVX method can find the cache probability set The global optimal solution is obtained, and this optimal cache probability set is used in the second sub-problem P1(bc), and the improved simulated annealing method is used to determine the optimal settings of the transmission power ratio and the protection area radius. In the optimization problem P2, the present invention can use the improved simulated annealing method to maximize the secondary system area throughput by optimizing the parameters β1 and σ.

[0087] 5. The present invention establishes network capacity models for edge cache-assisted cognitive radio networks and two benchmark networks. By writing a large-scale cognitive radio network simulation program, the influence of key factors such as transmission distance, transmission rate, protection zone radius, density of various types of nodes and transmission power on network performance is revealed. In order to reflect the advantages of the present invention in network performance, the present invention proposes two benchmark networks and two benchmark cache schemes. Numerical results show that compared with the benchmark network and the benchmark scheme, the method proposed by the present invention can significantly improve the regional throughput of the system. BRIEF DESCRIPTION OF THE DRAWINGS

[0088] Figure 1 Schematic diagram of spectrum sharing transmission for edge cache-assisted large-scale cognitive radio networks;

[0089] Figure 2 Transmission flow chart for edge cache-assisted large-scale cognitive radio network main system;

[0090] Figure 3 Schematic diagram of spectrum sharing transmission in a cache-free large-scale cognitive radio network;

[0091] Figure 4 Schematic diagram of the change of regional throughput of the CRN1 main system with the main link distance;

[0092] Figure 5 Schematic diagram of the variation of CRN1 secondary system area throughput with secondary link distance;

[0093] Figure 6 It is a schematic diagram of the change of regional throughput of the CRN1 main system with the Zipf distribution parameter;

[0094] Figure 7 Schematic diagram of the change of regional throughput of the CRN1 main system with the density of secondary helpers;

[0095] Figure 8 Schematic diagram of the system area throughput of the three networks changing with the density of the main base stations;

[0096] Fig. 9 Schematic diagram of the system area throughput of the three networks changing with the transmission power ratio of STs and PBs. DETAILED DESCRIPTION

[0097] The present invention will be further defined below in conjunction with the accompanying drawings and embodiments, but is not limited thereto.

[0098] Example 1

[0099] A spectrum sharing method for a large-scale cognitive radio network assisted by edge caching is provided. In a large-scale cognitive radio network CRN1, the primary system includes a primary base station PB (Primary Base-station) and a primary user PU (Primary User), and the secondary system includes a secondary transmitter ST (Secondary Transmitter), a secondary receiver SR (Secondary Receiver) and a secondary helper SH (Secondary Helper); each ST corresponds to an SR and performs D2D (Devide-to-Device) single-hop communication; the SH actively caches the files required by the PU and actively assists the PB in transmitting the files to the PU; since the selected SH is usually close to the PU and has good communication quality, the SH assists the PB in transmission to improve the communication performance of the PU. In order to avoid strong interference from the secondary system, a protection zone is set around the PU, and the STs located in the protection zone are prohibited from occupying the spectrum, and only the STs located outside the protection zone opportunistically share the spectrum of the primary system; benefiting from the assistance of the SH, the PU can withstand more interference, and the communication requirements of the primary system are easier to meet. Therefore, the size of the protection zone can be effectively reduced, so that more secondary user links can be accommodated in the large-scale network, thereby improving the regional throughput performance of the secondary system. A caching transmission zone (CTZ) is also set around the PU. The SH located in the CTZ and caching the file content required by the PU will assist in transmitting the file content to the PU; including:

[0100] Step 1: SH downloads and caches the main system file content from the Internet content library during idle time according to the cache mechanism;

[0101] Step 2: PU requests content from PB. PB determines whether there is an SH caching the requested file in the CTZ around PU and transmits it according to the following four situations:

[0102] The first transmission situation: when there is no SH for caching the requested file in the CTZ, the PB transmits the requested file content to the PU, the PU correctly receives the data packet from the PB and feeds back an ACK frame, and the PB continues to transmit new data packets;

[0103] The second transmission situation: when there is no SH for caching the requested file in the CTZ, the PB transmits the requested file content to the PU. The PU receives the data packet from the PB incorrectly and feeds back a NACK frame. The PB retransmits the original data.

[0104] The third transmission situation: when there is at least one SH in the CTZ that has the requested file required by the PU, one SH with the best channel quality to the PU is selected from these SHs to actively transmit the file content to the PU. At this time, the PB does not transmit and remains silent. The PU correctly receives the data packet from the SH and feeds back an ACK frame. The SH continues to transmit new data packets.

[0105] The fourth transmission situation: if there is at least one SH in the CTZ that has the file content required by the PU cached, one of these SHs will select the one with the best channel quality to the PU and actively transmit the file content to the PU. At this time, the PB does not transmit and remains silent. The PU receives the main data from the SH by mistake and releases a NACK frame. In this case, the SH retransmits the original data.

[0106] Step 3: SH obtains spectrum sharing opportunities for secondary user transmissions. STs outside the PU protection zone randomly access the spectrum according to the ALOHA protocol and perform D2D single-hop communication with the corresponding SRs. Since the SH is closer to the primary user, the SH assists in transmitting file content to the PU, which can improve the communication performance of the primary system. Therefore, the PU can withstand more interference, the size of the protection zone can be reduced accordingly, there are more STs outside the protection zone in the entire network, and the secondary system obtains more spectrum sharing opportunities. STs outside the protection zone randomly occupy the spectrum based on a certain media access probability (MAP) according to the ALOHA protocol to achieve D2D single-hop communication with their corresponding SRs.

[0107] Example 2

[0108] The edge cache-assisted large-scale cognitive radio network spectrum sharing method according to Embodiment 1 is different in that:

[0109] In order to reflect the performance advantages of the network model of the present invention, the present invention proposes two benchmark networks: a cacheless cognitive radio network and a traditional cellular network. In order to reflect the network performance advantages of the cache scheme of the present invention, the present invention proposes two benchmark cache schemes: a popularity-based cache scheme, in which the secondary helper caches files according to the popularity of the primary user's files; a uniform cache scheme, in which the secondary helper randomly caches each primary user's file with the same probability. Numerical results show that compared with the benchmark network and the benchmark scheme, the scheme proposed by the present invention can significantly improve the regional throughput of the secondary system while meeting the performance requirements of the primary system. The present invention innovates the theory of cognitive spectrum sharing, and uses cheap and massive storage space to realize cache collaborative transmission of primary system files, so that the secondary system obtains more spectrum sharing opportunities, which helps to significantly improve spectrum efficiency and provide a theoretical basis and technical support for B5G / 6G network standard formulation and system research and development.

[0110] The present invention establishes network capacity models of edge cache-assisted cognitive radio networks and two benchmark networks. By writing a large-scale cognitive radio network simulation program, the influence of key factors such as transmission distance, transmission rate, protection zone radius, density of various types of nodes and transmission power on network performance is revealed. In order to reflect the advantages of the present invention in network performance, the present invention proposes two benchmark networks and two benchmark cache schemes. Numerical results show that in comparison with the benchmark network and the benchmark scheme, the scheme proposed by the present invention can significantly improve the secondary system area throughput.

[0111] In order to reflect the advantages of edge cache-assisted cognitive radio networks in network performance, the present invention considers cacheless cognitive radio networks and cellular networks as benchmark networks. The cache-assisted cognitive radio network is marked as "CRN1", the cacheless cognitive radio network is marked as "CRN2", and the cellular network is marked as "CN3". The main system communication link adopts a truncated ARQ (Truncated Automatic Repeat Request) scheme with one retransmission. If the original data transmission is successful, the PU will feedback an acknowledgment (ACK) frame, and the transmitter continues to transmit new data packets. Otherwise, the PU feeds back a negative acknowledgment (NACK) frame, and the transmitter retransmits the same data packet. In both the original transmission and retransmission stages, the PU uses the maximum ratio combining (MRC) technology to detect the received signal. In order to verify the superiority of the proposed probability-based caching scheme, the present invention proposes two benchmark caching schemes for comparison. (1) Maximum Popular Content Placement (MPCP): SH caches the most popular content resources to its local storage according to the popularity of the file content until the cache space is exhausted; (2) Uniform Content Placement (UCP): SH randomly caches each file content with the same probability until the local cache space is completely occupied. In the performance analysis, the suffix characters "p1" and "s1" represent the primary system and secondary system of the edge cache-assisted cognitive radio network CRN1, respectively, and "p2" and "s2" represent the primary system and secondary system of the cache-free cognitive radio network CRN2, respectively.

[0112] like Figure 1 As shown in Figure 2, in a large-scale cognitive radio network, PBs, STs, and SHs coexist on a two-dimensional plane; the location of PBs is modeled as a homogeneous Poisson point process (HPPP)Πb , the density is λ b ; In the subsystem, the distribution of ST and SH is modeled as two independent HPPPΠ s and Π h , the densities are λ s and λ h ; The transmission powers of PBs, STs and SHs are p b 、p s and p h , where p s =β1p b , p h =β2p b ; In the entire large-scale cognitive radio network, considering the full reuse of a specific frequency band, all PBs on the entire plane share this frequency band to transmit data to the PU they serve, and at the same time, the secondary system also shares this spectrum resource; the target transmission rates of the primary link and the secondary link are set to v p and v s , when the channel capacity is greater than the transmission rate, data can be successfully transmitted; in order to ensure the transmission quality of the primary system, a protection zone with a radius of σ is set around each PU; STs located in the protection zone are prohibited from occupying spectrum resources, thereby avoiding strong interference of the secondary link to the primary link. STs outside the protection zone randomly access the spectrum according to the ALOHA protocol, and the media access probability is ξ. When an ST successfully occupies the channel, a D2D single-hop communication link is established between the ST and its corresponding SR.

[0113] It is assumed that all terminals operate in half-duplex mode and cannot transmit and receive data at the same time; during data transmission, the relative positions of the terminals remain unchanged; the entire transmission time is divided into equal-length periods; each period contains two time blocks, and the duration of each time block is normalized to 1 second; each SH is equipped with an omnidirectional antenna and a cache space of the same capacity.

[0114] In an Internet content library containing M files, all files are arranged in descending order of popularity; in each time block, assuming that a PU requests at most one file from the content library, the popularity distribution vector of the file is Q = [q1, ..., q i , ..., q M ] indicates that, where q i is the request probability of the i-th file; a large number of statistical results show that the popularity distribution of files changes slowly over time and can be approximated as static.

[0115] Without loss of generality, assume that all files are of equal size and all SHs have the same cache capacity, which is C, C<<M; for scenarios with different file sizes, by dividing the files into blocks of equal size, the analysis of the present invention is still applicable. When the large-scale cognitive radio network is in non-peak hours, the SH downloads and caches the main system file content based on the cache mechanism; is defined as the set of probabilities of caching each file in SH, where 0 ≤ p i ≤1; for i=1,2,…,i,…,M, the SH of storage file i follows density λ h p i Considering the fairness of using buffering to exchange spectrum access, in order to avoid unbearable interference to the primary system, the transmission power of ST and SH should be constrained, and the buffer capacity of SH should also be constrained.

[0116] The popularity of a file follows the Zipf distribution, and the popularity of the i-th content is expressed as formula (1):

[0117]

[0118] Among them, γ is the Zipf slope, which reflects the skewness of the popularity distribution, and γ ≥ 0. The larger the value of γ, the more uneven the file popularity distribution.

[0119] The cache hit rate refers to the probability that a primary user finds a SH that caches the requested file in its surrounding CTZ, denoted by H. i represents the cache hit probability of file i. The SHs distribution of cache file i follows the density p i λ h PPP, for files with a radius of The cache hit probability of SH in the CTZ is expressed as H i =1-exp(-πp i λ h τ 2 ), the probability of selecting a suitable SH to transfer files to PU is When a typical PU obtains file i from the selected SH, the distance between the typical PU and the SH is d h , its probability density function (PDF, Probability Density Function) is expressed as formula (2):

[0120]

[0121] The average number of SHs that cache content i in a CTZ is πτ 2 p i λ h, the probability that there are n SHs caching content i in the CTZ is expressed as

[0122] In order to illustrate the communication mechanism of the present invention, a typical main base station PB, i.e., a typical PB, is selected. The typical PB communicates with a typical PU, and the typical PU is placed at the origin. By analyzing the performance of the typical link, the average performance of the entire system can be characterized, and constructing a coordinate system with the typical PU as the origin is helpful for analyzing the average performance of the network. In a large-scale network, there are a huge number of PUs, and each PB has a PU requesting content. A cache transmission zone (CTZ) is set up around the PU, and a secondary helper SH that caches the file content required by the PU and has the best channel quality is selected in the CTZ to assist in transmitting files. When the typical PU requests content from the PB, the following will occur depending on whether there is an SH that caches the required file content in the surrounding CTZ and whether the data transmission is correct. Figure 2 The four cases shown are transmitted;

[0123] During the main link transmission, a typical PU will be subjected to two types of interference. One is the aggregate interference caused by other simultaneous main link transmissions. Second, the interference caused by other simultaneous secondary user STs transmissions To simplify the analysis of interference without reducing accuracy, the distance between the active secondary helpers and the typical PU can be approximated by the distance between the PB it serves and the typical PU. The aggregate interference from the primary link can be expressed as Where P x =p b or P x =p h The interference caused by all simultaneous secondary link transmissions to a typical PU is expressed as A protection zone is set around the PU, and STs in the protection zone are prohibited from sharing the spectrum with the PB for transmission at the same time. Therefore, the distribution of active STs is not uniform, but follows the Poisson Hole Point Process. For the convenience of analysis and accuracy, it is assumed that the position distribution of all active STs follows the density HPPP

[0124] In the first transmission case, there is no SH in the CTZ that caches the PU's requested file content. The requested file content must be provided by PBx0, which retrieves the requested file content through the backhaul link and transmits it to the PU through the wireless link. Given the distance between PBx0 and its typical PU is The signal-to-interference ratio of a typical PU is Then the success probability of the original data transmission is:

[0125]

[0126] in, The Laplace transform of is:

[0127]

[0128] Laplace transform of for:

[0129]

[0130] In the second transmission situation, there is no SH in the CTZ that caches the PU request file content, and PB fails to transmit the original data to PU, and PB retransmits; the conditional success probability is:

[0131]

[0132] In the third transmission case, there is at least one SH in the CTZ area that caches the PU request file i. The cache SH with the best transmission channel quality to the PU transmits the main data to the typical PU. The signal-to-interference ratio of the typical PU is in, is the SH set of cached request contents in CTZ; the probability of successful transmission is:

[0133]

[0134] in,

[0135]

[0136] In the fourth transmission case, there is at least one SH in the CTZ area caching the PU request file i, and the cache SH with the best transmission channel quality to the PU transmits the main data to the typical PU; the PU receives the main data from the SH incorrectly, and the SH retransmits the original data. The conditional success probability is:

[0137]

[0138] in,

[0139]

[0140] The regional throughput is defined as the average number of bits successfully transmitted per unit area; the average throughput of CRN1 is:

[0141]

[0142] In order to analyze the success probability of subsystem transmission, a typical sub-transmitter ST is selected, and its corresponding typical SRz 0′ Communication, the typical SR z 0′ Placed at the origin; typical ST z0 and its SR z 0′ The distance between z 0′ The signal-to-interference ratio at Interference caused by main system transmission Among them, P x =p b or P x =p s ; In addition to the typical subsystem transmission, all simultaneous subsystem transmissions to z 0′ Cause interference The success probability of the subsystem transmission for:

[0143]

[0144] in, and They are and The Laplace transform of

[0145]

[0146] parameter function Therefore, the probability of success is for:

[0147]

[0148] Through the above analysis, the average throughput of the secondary system is obtained as follows:

[0149]

[0150] In the cacheless cognitive radio network CRN2, the primary system transmission includes the original phase and the retransmission phase. Since the transmission time is very short, the channel state of all interfering nodes does not change in the original phase and the retransmission phase. The distance between the typical primary base station x0 and the typical primary user y0 is Typical primary base station x0 and secondary user z in the typical primary user protection zone j The distance between in is the distance between the secondary user and the typical primary user, The probability density function (PDF) of is

[0151]

[0152] The probability density function (PDF) of angle θ is

[0153]

[0154] In order to analyze the average success probability of the primary system, the present invention selects a typical primary base station PB to communicate with the associated typical primary user PU, and places the typical PU at the origin position. Three transmission situations are analyzed.

[0155] Case I: The typical PU directly obtains the main content from the typical primary base station x0, and the probability of successful transmission is:

[0156]

[0157] in

[0158]

[0159]

[0160] Case II: The original data transmission fails, there is no decoding secondary user in the typical PU protection area, and the PB performs retransmission. It is assumed that the distance between the decoding secondary user causing interference and the typical primary user can be approximated as the distance between the PB served by the decoding secondary user and the typical primary user, and they have the same channel state. Therefore, the aggregate interference between the PB and the decoding secondary user is Where P x =p b or P x =p s . and They represent the potential secondary users z in the protected area due to the simultaneous transmission of the primary system and the secondary system. j The conditional success probability of Case II is:

[0161]

[0162] Among them, the probability that there are n secondary users in the protected area can be expressed as

[0163]

[0164] Further deducing the success probability, we can get

[0165]

[0166] in

[0167]

[0168] In order to simplify the analysis of the overall interference without reducing the accuracy, the interfering node and the secondary user z j The distance between can be approximated as the distance between the interference node and the typical primary user, so the present invention can obtain therefore,

[0169]

[0170] Where (c) is a binomial expansion. Substituting A1 and A2 into the original formula, applying the binomial expansion and PGFL of PPP, the present invention can obtain

[0171] in

[0172]

[0173]

[0174] Case III: The original data transmission fails, and there is at least one secondary user in the protected area that correctly decodes the primary data. Each decoding secondary user can estimate the channel quality to the typical primary user by measuring the strength of the NACK frame. Based on the channel quality, each secondary user can start a backoff timer or send a burst sequence to compete for channel access. j Retransmission is performed, and the probability of successful retransmission is:

[0175]

[0176] in, is the set of decoding secondary users in the protected area. Further derivation yields

[0177] The probability B1 is:

[0178] The probability B2 is divided into two parts:

[0179] The second probability D is derived as follows:

[0180]

[0181] Since the integral term is not easy to analyze, the present invention derives the approximate values ​​of the upper and lower bounds in the analysis. In the MRC detection process, if the present invention assumes that the typical decoded ST retransmission is interfered by the main system from all base stations, and ignores the interference caused by the decoded ST, that is, in the integral term, replace The present invention can deduce the upper limit of D Will Substituting into B2, the present invention can obtain the upper bound of B2. It is expressed as follows:

[0182]

[0183] The present invention expresses the lower bound of D as In the integral term, use replace The present invention can obtain Will Substituting into B2, the present invention can obtain the lower bound of B2

[0184]

[0185] in Combine the first probability B1 and the second probability or And considering the probability Pr{N=n}, we can get The upper and lower bounds of

[0186]

[0187] In order to ensure the communication quality of the main system of the edge cache assisted cognitive wireless network CRN1, in the optimization problem P1, we use The upper bound of In the optimization problem P2, use The lower bound of constitute.

[0188] The average throughput of the main system is expressed as:

[0189]

[0190] In order to analyze the success probability of each secondary system link, the present invention selects a typical secondary user ST and its typical SR z 0′ Communication, the present invention will be typical SR z 0′ Place it at the origin. Typical ST z0 and its SR z 0′ The distance between In the original primary data transmission phase, the typical secondary system link success probability is as follows:

[0191]

[0192] During the primary data retransmission phase, the typical secondary system link success probability is as follows:

[0193]

[0194] in The Laplace transform of the interference is

[0195]

[0196] Therefore, the average success probability of data transmission in the subsystem can be obtained as:

[0197]

[0198] Through the above analysis, the average throughput of the subsystem is expressed as:

[0199]

[0200] The present invention considers analyzing the downlink regional throughput of the cellular network CN3 as a benchmark for performance comparison. There are two transmission situations depending on whether the original data is successfully transmitted. The cellular user receives the data correctly, or the cellular user receives the data incorrectly and the base station retransmits. The success probability of transmitting the original data is:

[0201]

[0202] in It is interference The Laplace transform of . If the original transmission fails, the probability of success of the retransmission is:

[0203]

[0204] Therefore, the present invention can obtain the average regional throughput of the cellular network CN3 as:

[0205]

[0206] The optimization problem of building a large-scale cognitive radio network is to maximize the secondary system throughput while meeting the throughput requirements of the primary system, and jointly optimize the cache probability, secondary system transmission power ratio and protection zone radius; is the cache probability set The function of the protection zone radius σ and the transmission power ratios β1 and β2; the optimization problem is constructed as follows:

[0207]

[0208]

[0209] β1,β2∈(0,1) (b)

[0210] 0<σ<R (C

[0211]

[0212] Among them, constraint (a) represents the storage space limitation of SHs, constraint (b) represents the possible value range of the transmission power ratio of STs and SHs relative to PBs, constraint (c) represents the protection zone radius control, and constraint (d) represents the main system area throughput of the large-scale cognitive radio network CRN1 compared with the cacheless cognitive radio network CRN2. The reduction ratio does not exceed ∈1; for ease of processing, the transmission power of the PB is considered to be predetermined. In the optimization problem, constraint (d) indicates that the main system area throughput of the network model proposed in the present invention is compared with the main system area throughput of the cacheless cognitive radio network CRN2. Satisfy no less than (1-∈1), where ∈1 has an uncertain positive or negative value. When ∈1 is set to a positive number, When ∈1 is set to a negative number,

[0213] The optimization problem of the cacheless cognitive radio network CRN2 is constructed. Under the premise of meeting the throughput requirements of the primary system area, the secondary system area throughput is maximized by jointly optimizing the secondary system transmission power ratio and the protection zone radius. The optimization problem of the cacheless cognitive radio network CRN2 is constructed as:

[0214]

[0215] stβ1∈(0,1) (e)

[0216] 0<σ≤R(f)

[0217]

[0218] Among them, constraint (e) represents the possible value range of the transmission power ratio of the secondary user to the primary base station, constraint (f) represents the protection zone radius control, and constraint (g) represents the throughput of the cellular network CN3. Compared with the non-cached cognitive radio network, the regional throughput reduction ratio of the main system of CRN2 does not exceed ∈2;

[0219] The present invention considers analyzing the downlink regional throughput of the cellular network CN3 as a benchmark for performance comparison. There are two transmission situations depending on whether the original data is successfully transmitted. The cellular user receives the data correctly, or the cellular user receives the data incorrectly and the base station retransmits; the success probability of transmitting the original data is:

[0220]

[0221] in, It is interference Laplace transform of; if the original transmission fails, the probability of success of the retransmission is:

[0222]

[0223] The average regional throughput of the cellular network CN3 is obtained as:

[0224]

[0225] Simulated Annealing (SA) can be used to approximate the global optimal solution of the original non-convex random problem P1. However, this method has very high complexity. The CVX-SA algorithm is as follows:

[0226]

[0227] Specifically, regarding the cache strategy, maximizing the subsystem throughput is equivalent to maximizing the cache hit rate. Therefore, the optimization problem P1 is solved by the CVX-SA algorithm; the original optimization problem P1 is decomposed into two sub-problems, namely P1(a) and P1(bc), including:

[0228] Given σ, β1, and β2, the optimization problem of constructing the cache probability set is as follows:

[0229]

[0230]

[0231] The goal of P1(a) is to maximize the secondary system area throughput by optimizing the caching strategy of SHs when PUs obtain the requested content from SHs through D2D communication;

[0232] For the obtained The optimization problem of power and protection zone radius is constructed as follows:

[0233]

[0234] stβ1,β2∈(0,1)

[0235] 0<σ<R.

[0236] Subproblem P1(bc) considers the interference caused by ST-SR communication, SH-PU communication and PB-PU communication, and maximizes the secondary system area throughput by optimizing parameters β1, β2 and σ;

[0237] We can confirm that the constraint in P1(a) is a convex set because it is a linear function. To prove that P1(a) is a convex optimization problem, we must prove that the function is concave. First, P i Derivation, get

[0238]

[0239] in K2=-πτ 2 λ h <0. Then, P i Taking the second-order derivative, we get:

[0240]

[0241] For p i , is a concave function. Therefore, P1(a) is a convex optimization problem. The convex optimization problem is solved by the CVX-SA algorithm to find the cache probability set The global optimal solution is the optimal cache probability set, which is used in P1(bc) and the improved simulated annealing method to determine the optimal settings of the transmission power ratio and the protection area radius. Figure 4 As shown, it includes: first, solving the convex optimization problem P1(a) to find the cache probability set The global optimal solution is the optimal cache probability set; then, the optimal cache probability set is brought into P1(bc), and the gradient descent algorithm is introduced in simulated annealing to determine the optimal settings of the transmission power ratio and the protection area radius through multiple loop iterations.

[0242] Figure 1 Schematic diagram of edge-assisted cognitive radio network. PUs are associated with the nearest primary base station. The black dashed line is the primary base station coverage boundary. The filled circular area is the PU protection area. The blue circular area is the cache transmission zone (CTZ). When the PU requests content from the PB, depending on whether there is a SH in the CTZ that caches the required file content and whether the data transmission is correct, the following will happen as shown in the main system transmission flow chart ( Figure 2 ) as shown in Figure 2. The STs outside the protected area and the receiving end SRs reuse the main system spectrum for D2D single-hop communication. During the transmission process, PBs, STs, and SHs interfere with each other.

[0243] Figure 3 The diagram is a schematic diagram of a non-buffered cognitive radio network. Secondary users in the protected area that correctly decode the primary data will help the primary base station to transmit. When the original transmission fails, an ST with the best channel status to the PU is selected from the secondary users in the protected area that correctly decode the primary data to retransmit the primary data. As a reward for assisting the transmission, the primary system will allow the secondary system to reuse the primary system spectrum.

[0244] The CVX-SA algorithm can approximate the global optimal solution of the original non-convex random problem P1 with lower complexity.

[0245] The present invention uses MATLAB platform for simulation analysis. The plane radius of the study is 3000m and the number of Monte Carlo analysis runs is 5×10 4 Unless otherwise specified, the system parameters in all simulations are set to λ b =3×10 -6 ,λ s =5×10 -5 ,λ h =1×10 -4 , p b =46dBm, τ=80m, σ=50m, β1=0.4, β2=0.8, α=3, v p =0.3bits / s / Hz, v s =0.2bits / s / Hz, ξ=0.8, M=30, C=10, γ=0.7, ∈1=-0.1, ∈2=0.3.

[0246] Based on the above calculation and analysis process, the regional throughput of the three networks is obtained. The present invention marks the primary system results with "Primary", the secondary system results with "Secondary", the theoretical results with "Theory", and the simulation results with "Sim". The theoretical analysis results coincide well with the simulation results, which verifies the correctness of the theoretical analysis.

[0247] Figure 4 The relationship between the CRN1 main system area throughput and the main link communication distance. Under different protection zone radii, the main system area throughput decreases as the main link communication distance increases, because the longer distance leads to higher path loss. The larger the protection zone radius, the weaker the interference from the secondary system, and the better the main system area throughput performance.

[0248] Figure 5 The relationship between the regional throughput of the CRN1 subsystem and the secondary link communication distance. Under different secondary user densities, the regional throughput of the subsystem decreases as the secondary link communication distance increases, which is also because the longer distance leads to higher path loss. When the communication distance is short, a larger secondary user density leads to a larger regional throughput, but as the distance increases, the strong interference effect caused by high-density secondary users will become more obvious.

[0249] Figure 6is the relationship between the throughput of the main system area of ​​CRN1 and the Zipf distribution parameter. It can be seen that in the caching scheme proposed in the present invention, as the popularity parameter γ increases, the secondary system area throughput performance becomes higher. The increase in γ makes the popularity more concentrated and the cache hit rate higher. The present invention recognizes that the content caching scheme helps to significantly improve performance. For example, in the case of the uniform content caching scheme UCP, there is no performance improvement, while the throughput of the most popular content caching scheme increases, and the throughput gain is the largest in the proposed scheme. In addition, when γ <0.4, the throughput of the most popular content caching scheme is lower than that of the uniform caching scheme. When the content is not very popular, that is, in a low skewness range, the secondary helpers in the most popular content caching scheme can choose not to store the content. Therefore, cache misses occur more frequently and the throughput is reduced. However, even in a low skewness range, the performance of the scheme proposed by the present invention is always better than the other two caching schemes.

[0250] Figure 7 The relationship between the CRN1 main system area throughput and the secondary helper density is shown in Figure 1. It can be seen that as the secondary helper density increases, the main system area throughput performance becomes higher. And the performance of the caching scheme proposed in the present invention is better than the uniform content caching scheme and the most popular content caching scheme.

[0251] Figure 8 The influence of the density of the primary base station on the regional throughput of the edge cache assisted cognitive radio network and the two benchmark networks is shown. It can be seen that while maximizing the regional throughput of this system, the network model proposed in the present invention has a smaller loss in the regional throughput of the primary system.

[0252] Fig. 9 The influence of the transmission power ratio between secondary users and primary users on the secondary system area throughput of cache-assisted and cache-free cognitive radio networks is shown. It can be seen that the secondary system area throughput increases first and then decreases with the power ratio β1. When β1>0.3, the secondary system area throughput gradually decreases. As the power ratio increases, the interference effect of secondary users will become more obvious. In addition, when the regional throughput maximum reduction parameter ∈1>-0.1 (that is, the CRN1 primary system area throughput is ten percent higher than the CRN2 primary system area throughput), the CRN1 secondary system area throughput is higher than the CRN2 secondary system area throughput.

[0253] The above numerical results show that, in comparison with the benchmark network and the benchmark solution, the solution proposed in the present invention can significantly improve the regional throughput.

Claims

1. An edge cache-assisted large-scale cognitive radio network spectrum sharing method, characterized in that: In the large-scale cognitive radio network CRN1, the main system includes the main base station PB and the main user PU, and the secondary system includes the secondary transmitter ST, the secondary receiver SR and the secondary helper SH; each ST corresponds to an SR and performs D2D single-hop communication; the SH actively caches the files required by the PU and actively assists the PB in transmitting the files to the PU; a protection zone is set around the PU, and the STs located in the protection zone are prohibited from occupying the spectrum, and only the STs located outside the protection zone opportunistically share the main system spectrum; a cache transmission zone CTZ is also set around the PU, and the SH located in the CTZ and caching the file content required by the PU will assist in transmitting the file content to the PU; including: Step 1: SH downloads and caches the main system file content from the Internet content library during idle time according to the cache mechanism; Step 2: PU requests content from PB. PB determines whether there is an SH caching the requested file in the CTZ around PU and transmits it according to the following four situations: The first transmission situation: when there is no SH for caching the requested file in the CTZ, the PB transmits the requested file content to the PU, the PU correctly receives the data packet from the PB and feeds back an ACK frame, and the PB continues to transmit new data packets; The second transmission situation: when there is no SH for caching the requested file in the CTZ, the PB transmits the requested file content to the PU. The PU receives the data packet from the PB incorrectly and feeds back a NACK frame. The PB retransmits the original data. The third transmission situation: when there is at least one SH in the CTZ that has the requested file required by the PU, an SH with the largest signal-to-interference ratio to the PU is selected to actively transmit the file content to the PU. At this time, the PB does not transmit and remains silent. The PU correctly receives the data packet from the SH and feeds back an ACK frame. The SH continues to transmit new data packets. The fourth transmission situation: if there is at least one SH in the CTZ that has the file content required by the PU cached, a SH with the largest signal-to-interference ratio to the PU is selected to actively transmit the file content to the PU. At this time, the PB does not transmit and remains silent. The PU receives the main data from the SH by mistake and releases a NACK frame. In this case, the SH retransmits the original data. Step 3: SH obtains the opportunity to share the spectrum for secondary user transmission. STs outside the PU protection zone randomly access the spectrum according to the ALOHA protocol and perform D2D single-hop communication with the corresponding SRs.

2. The edge cache-assisted large-scale cognitive radio network spectrum sharing method according to claim 1, characterized in that: In large-scale cognitive radio networks, PBs, STs, and SHs coexist on a two-dimensional plane; the location of PBs is modeled as a homogeneous Poisson point process Π b , the density is λ b ; In the subsystem, the distribution of ST and SH is modeled as two independent HPPPΠ s and h , the densities are λ s and λ h ; The transmission powers of PBs, STs and SHs are p b 、p s and p h , where p s =β1p b , p h =β2p b ; In the entire large-scale cognitive radio network, considering the full reuse of the frequency band, all PBs on the entire plane share the frequency band to transmit data to the PU they serve, and at the same time, the secondary system also shares the spectrum resources; the target transmission rates of the main link and the secondary link are set to υ p and s ,When the channel capacity is greater than the transmission rate, the data can be successfully transmitted; a protection zone with a radius of σ is set around each PU; STs located in the protected area are prohibited from occupying spectrum resources. STs outside the protected area randomly access the spectrum according to the ALOHA protocol, and the media access probability is ξ. When an ST successfully occupies the channel, a D2D single-hop communication link is established between the ST and its corresponding SR.

3. The edge cache-assisted large-scale cognitive radio network spectrum sharing method according to claim 1, characterized in that: It is assumed that all terminals operate in half-duplex mode and cannot transmit and receive data at the same time; during data transmission, the relative positions of the terminals remain unchanged; the entire transmission time is divided into equal-length periods; each period contains two time blocks, and each SH is equipped with an omnidirectional antenna and the same capacity of cache space.

4. The edge cache-assisted large-scale cognitive radio network spectrum sharing method according to claim 1, characterized in that: In an Internet content library containing M files, all files are arranged in descending order of popularity. In each time block, assuming that a PU requests at most one file from the content library, the popularity distribution vector of the file is Q = [q1, ..., q i , ..., q M ] indicates that, where q i is the request probability of the i-th file; Assume that all file sizes are equal and the cache capacities of all SHs are the same, both being C, where C << M. For scenarios with different file sizes, by splitting files into equal-sized chunks, when the large-scale cognitive radio network is in the off-peak period, SHs download and cache the main system file content based on the caching mechanism. is defined as the probability set for each file cached by SH, where 0 ≤ p i ≤ 1; for i = 1, 2,..., i,..., M, the SHs storing file i follow a PPP distribution with density p i λ h of.

5. The edge cache-assisted large-scale cognitive radio network spectrum sharing method according to claim 4, characterized in that: The popularity of a file follows the Zipf distribution, and the popularity of the i-th content is expressed as formula (1): where γ is the Zipf slope, reflecting the skewness of the popularity distribution, and γ ≥ 0.

6. The edge cache-assisted large-scale cognitive radio network spectrum sharing method according to claim 1, characterized in that: The cache hit rate refers to the probability that a primary user finds a SH that caches the requested file in its surrounding CTZ, denoted by H. i represents the cache hit probability of file i. The SHs distribution of cache file i follows the density p i λ h PPP, for the SH of file i in the CTZ with radius τ, its cache hit probability is expressed as H i =1-exp(-πp i λ h τ 2 ), the probability of selecting a suitable SH to transfer files to PU is When a typical PU obtains file i from the selected SH, the distance between the typical PU and the SH is d h , its probability density function is expressed as formula (2): The average number of SHs that cache content i in a CTZ is πτ 2 p i λ h , the probability that there are n SHs caching content i in the CTZ is expressed as 7. The edge cache-assisted large-scale cognitive radio network spectrum sharing method according to claim 1, characterized in that: In the first transmission case, there is no SH in the CTZ that caches the PU's requested file content. The requested file content must be provided by PB x0, which retrieves the requested file content through the backhaul link and transmits it to the PU through the wireless link. Given the distance between PBx0 and its typical PU is The signal-to-interference ratio of a typical PU is Then the success probability of the original data transmission is: in, The Laplace transform of is: Laplace transform of for: In the second transmission situation, there is no SH in the CTZ that caches the PU request file content, and PB fails to transmit the original data to PU, and PB retransmits; the conditional success probability is: In the third transmission case, there is at least one SH in the CTZ that caches the PU request file i. A SH with the largest signal-to-interference ratio to the PU is selected to transmit the main data to the typical PU. The signal-to-interference ratio of the typical PU is Where h∈Π y0 , Π y0 is the SH set of cached request contents in CTZ; the probability of successful transmission is: in, In the third transmission case, there is at least one SH in the CTZ area that caches the PU request file i. An SH with the largest signal-to-interference ratio to the PU is selected to transmit the main data to the typical PU. The PU receives the main data from the SH incorrectly, and the SH retransmits the original data. The conditional success probability is: in, The regional throughput is defined as the average number of bits successfully transmitted per unit area; the average throughput of CRN1 is:

8. The edge cache-assisted large-scale cognitive radio network spectrum sharing method according to claim 1, characterized in that: Select a typical secondary transmitter ST and its corresponding typical SR z 0′ Communication, the typical SR z 0′ Placed at the origin; typical ST z0 and its SR z 0′ The distance between z 0′ The signal-to-interference ratio at Interference caused by main system transmission Among them, P x =p b or P x =p s ; All simultaneous subsystem transmissions to z 0′ Cause interference The success probability of the subsystem transmission for: in, and They are and The Laplace transform of parameter function Therefore, the probability of success is for: The average throughput of the secondary system is obtained as:

9. The edge cache-assisted large-scale cognitive radio network spectrum sharing method according to claim 1, characterized in that: The optimization problem of building a large-scale cognitive radio network is to maximize the secondary system throughput while meeting the throughput requirements of the primary system, and jointly optimize the cache probability, secondary system transmission power ratio and protection zone radius; is the cache probability set The function of the protection zone radius σ and the transmission power ratios β1 and β2; the optimization problem is constructed as follows: β1,β2∈(0,1) (b) 0<σ <R (c) Among them, constraint (a) represents the storage space limitation of SHs, constraint (b) represents the possible value range of the transmission power ratio of STs and SHs relative to PBs, constraint (c) represents the protection zone radius control, and constraint (d) represents the main system area throughput of the large-scale cognitive radio network CRN1 compared with the cacheless cognitive radio network CRN2. The reduction ratio does not exceed ∈1; The optimization problem of cacheless cognitive radio network CRN2 is formulated as: stβ1∈(0,1) (e) 0<σ≤R (f) Among them, constraint (e) represents the possible value range of the transmission power ratio of the secondary user to the primary base station, constraint (f) represents the protection zone radius control, and constraint (g) represents the throughput of the cellular network CN3. Compared with the non-cached cognitive radio network, the regional throughput reduction ratio of the main system of CRN2 does not exceed ∈2; The cellular user receives the data correctly, or the cellular user receives the data incorrectly, and the base station retransmits; the success probability of transmitting the original data is: in, It is interference Laplace transform of; if the original transmission fails, the probability of success of the retransmission is: The average regional throughput of the cellular network CN3 is obtained as:

10. An edge cache-assisted large-scale cognitive radio network spectrum sharing method according to any one of claims 1-9, characterized in that: Solve the optimization problem P1 by using the CVX-SA algorithm; decompose the original optimization problem P1 into two sub-problems, namely P1(a) and P1(bc), including: Given σ, β1, and β2, the optimization problem of constructing the cache probability set is as follows: The goal of P1(a) is to maximize the secondary system area throughput by optimizing the caching strategy of SHs when PUs obtain the requested content from SHs through D2D communication; For the obtained The optimization problem of power and protection zone radius is constructed as follows: stβ1,β2∈(0,1) 0<σ<R Subproblem P1(bc) considers the interference caused by ST-SR communication, SH-PU communication and PB-PU communication, and maximizes the secondary system area throughput by optimizing parameters β1, β2 and σ; P1(a) is a convex optimization problem. We use the CVX-SA algorithm to solve the convex optimization problem and find the cache probability set The global optimal solution is the optimal cache probability set, which is used in P1(bc) and the improved simulated annealing method to determine the optimal settings of the transmission power ratio and the protection area radius.