KR20170090805A - A Soft-Hard Combination-Based Cooperative Spectrum Sensing Scheme for Cognitive Radio Networks - Google Patents
A Soft-Hard Combination-Based Cooperative Spectrum Sensing Scheme for Cognitive Radio Networks Download PDFInfo
- Publication number
- KR20170090805A KR20170090805A KR1020160011608A KR20160011608A KR20170090805A KR 20170090805 A KR20170090805 A KR 20170090805A KR 1020160011608 A KR1020160011608 A KR 1020160011608A KR 20160011608 A KR20160011608 A KR 20160011608A KR 20170090805 A KR20170090805 A KR 20170090805A
- Authority
- KR
- South Korea
- Prior art keywords
- cluster
- spectrum sensing
- header
- fusion
- hard
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01R—MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
- G01R23/00—Arrangements for measuring frequencies; Arrangements for analysing frequency spectra
- G01R23/16—Spectrum analysis; Fourier analysis
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01R—MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES
- G01R23/00—Arrangements for measuring frequencies; Arrangements for analysing frequency spectra
- G01R23/02—Arrangements for measuring frequency, e.g. pulse repetition rate; Arrangements for measuring period of current or voltage
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
- H04W16/10—Dynamic resource partitioning
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/14—Spectrum sharing arrangements between different networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/08—Testing, supervising or monitoring using real traffic
Abstract
The present invention relates to a cooperative spectrum sensing method based on soft-hard convergence for a cognitive radio network.
A cooperative spectrum sensing method according to the present invention is a spectrum sensing method in a cognitive radio network, wherein in a cognitive radio network composed of a plurality of clusters, a Likelihood Ratio Test (LRT) Performing a cluster decision based on the appearance of a primary user (PU) using a soft combination based on a cluster of the cluster headers (CHs) And performing a full decision using a hard combination based on a weighted decision fusion rule, the decision being made by using a soft-hard fusion method in a cognitive radio network And is provided to improve cooperative spectrum sensing performance.
Description
The present invention relates to a spectral sensing method in a cognitive radio network, and more particularly to a soft-hard convergence based cooperative spectrum sensing method for cognitive radio networks.
Cognitive Radio means an intelligent wireless communication technology that intelligently detects and communicates with available frequencies by recognizing a spectrum environment and uses it to perform communication without interfering with existing services. This cognitive radio is a technology that can support spectrum sensing and is emerging as a way to solve the spectrum problem that is lacking in many countries. Therefore, cognitive radio is one of the most promising technologies for future wireless communication.
Spectrum sensing is a key function of cognitive radio to prevent harmful interference with authorized users and to improve spectrum utilization. In general, cooperative spectrum sensing using spatial diversity of secondary users (SUs) is used to further improve sensing performance. By using cooperation, SUs can share their local sensing information to make more accurate decisions than individual decisions can do.
Cooperative Spectrum Sensing is divided into three types as centralized, distributed, and relay-assisted depending on how the SUs share the sensing data in the network. First, in the first centralized cooperative sensing, FC (fusion center) controls cooperative sensing. On the other hand, the second distributed cooperative sensing does not depend on FC. SUs, on the other hand, exchange local spectral decisions between them, and report decisions about the emergence and disappearance of PUs (Primary users). A third cooperative spectral sensing is relay-assisted cooperative sensing. According to these methods, some SU having a weak sensing channel and a strong reporting channel, and some SU having a strong sensing channel and a weak reporting channel can cooperate with each other to improve the performance of the cooperative spectrum.
In this cognitive radio network, a soft combination method based on LRT (Likelihood Ratio Test) is generally applied for cooperative spectrum sensing. This LRT-based soft fusion method has a problem that the cooperative detection process is complicated and the detection probability is low There is a problem.
The present invention has been made in order to solve the problems occurring in the cooperative spectrum sensing method in the conventional cognitive radio network, and it is an object of the present invention to provide cooperative spectrum sensing in cognitive radio networks, And to provide a method for sensing a cooperative spectrum based on a soft-hard fusion, which has a high sensing performance.
According to another aspect of the present invention, there is provided a method for sensing spectrum in a cognitive radio network, the method comprising the steps of: Performing a cluster determination based on the appearance of a primary user using an LRT-based soft fusion; and receiving cluster decision from each cluster header in an FU constituting the cluster, and using a hard fusion based on a weight determination fusion rule, And performing a determination.
The step of performing the cluster determination includes receiving a signal transmitted by a primary user during a sample sensing time in SUs existing in each cluster, generating an experimental statistical value indicating energy of the received signal, and transmitting the generated experimental statistic value to a cluster header Wow; The LRT is performed by adding the experimental statistic values of all the SUs existing in the cluster header in the cluster header, and the cluster decision is made one-bit hard decision (Dc = 1 or Dc = 0) based on the appearance of the primary user .
Here, the cluster header calculates a cluster experimental statistic value by adding experimental statistic values of all SUs, calculates an average SNR of a primary user signal of the cluster head, calculates a distribution of cluster experimental statistical values through the calculation, LRT for the cluster experimental statistical value is performed to perform cluster determination for appearance or non-appearance of PU.
The FC selects one of a plurality of SUs as a cluster header in each cluster, periodically performs a spectrum sensing process, and broadcasts the entire decision to all SUs present in the network.
Also, FC collects all cluster crystals and performs a full determination according to a weight determination fusion rule, and the weight determination fusion ratio is expressed by the following equation.
(Here, c is the cluster sequence (c-th cluster) by 1, 2, ..., has a K value, D c is the clustered crystals (Dc = 1 or Dc = 0) transmitted by each cluster header, P 0 = P r (H 0) and P 1 = P r (H 1 ) is a priori probability for each of the primary user (PU) appearance (H1) and the non-appearance (H0) of the signal is, ω c is the weight element (weighted factors.
Here, the weight factor? C is selected through the following equation.
(Where P f, c is the false alarm probability of each cluster header, and P d and c are the detection probabilities)
In order to obtain an optimal cluster boundary value for cluster headers, the FC develops a probability density function (pdf) of an LRT value for the cluster experimental statistical value, The notification probability and the detection probability are determined, and the optimal cluster boundary value is determined.
The false notification probability and detection probability of each cluster header are determined by the following equation.
(Here, Λ c shows the LRT value, λ c is a cluster boundary value performed by the cluster header)
Also, the boundary value of the optimal cluster is determined by the following equation according to the minimum error probability criterion.
According to the present invention, cooperative spectrum sensing performance can be improved by using a soft-hard convergence method in a cognitive radio network. That is, the soft-hard convergence method according to the present invention constitutes a cluster-based network, in which soft convergence based on LRT is applied in a cluster, and weight convergence based fusion rules are used in a fusion center, It is possible to reduce the complexity of the cooperative detection.
In addition, LRT can be used to detect primary signals at low SNR (about 15 dB). The use of closed-form for the probability density function of the LRT value reduces the complexity of the LRT computation. As described above, the use of the LRT in comparison with the existing soft fusion methods can reduce the sensing overhead in terms of the reporting time.
1 is a soft-hard fusion concept diagram for cooperative spectrum sensing in a cognitive radio network according to the present invention;
2 is a conceptual diagram showing a reporting mechanism of the SHC method according to the present invention.
Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings
1 illustrates a soft-hard convergence concept for cooperative spectrum sensing in a cognitive radio network according to an embodiment of the present invention.
In FIG. 1, the Cognitive Radio Network is composed of K clusters, and each cluster has the same number of SUs (secondary users). In a cognitive radio network, a Fusion Center (FC) configures clusters, selects a cluster header (CHc), and cooperates with all SUs in the network. The secondary system operates within the radio range of the primary user P (PU). Here, the primary user P may appear or disappear, but the state does not change during one sensing interval time. All SUs in each cluster have the same average signal-to-noise ratio (SNR) as the received primary signal. This assumption is reasonable because the clusters are grouped into neighboring SUs that are equally small. However, each cluster has different link channel conditions with the primary user P. Therefore, each cluster is independent of the primary signal and has a different average SNR.
As shown in FIG. 1, the cooperative spectrum sensing process of the soft-hard combination (SHC) method proposed in the present invention is composed of two steps as follows.
[ Stage 1 ]
Cluster headers perform some cluster decision based on the first activity using a soft combination as follows. First, at the beginning of the sensing process, SU ci (i-th SU in the c-th cluster) hears the primary signal and produces a regional test statistic ρ ci that represents the energy of the received signal. Each SU uses M primary signal samples to generate local experimental statistics. And the regional experimental statistical data ρ ci is transmitted to the cluster header.
Each cluster has one cluster header, and the cluster header can cooperate with all the SUs in the cluster. The cluster header of the c- th cluster is shown as follows. CH c ( c = 1, 2, ..., K ,) represents the cluster header of the c- th cluster. Cluster header selection is done as follows.
First, a cognitive radio (CR) system performs a spectrum sensing process periodically to detect the appearance of a primary user (PU) P. In general, the structure of CR system is composed of one sensing slot and one data transmission slot. The cooperative spectrum sensing process is performed periodically by FC (Fusion Center) in the sensing slot. The cooperative spectrum sensing period is achieved by the system designer by adjusting the spectrum sensing and spectral division according to application requirements. The FC selects an SU (secondary user) as one cluster header in each cluster. The cluster headers perform Likelihood Ratio Test (LRT) based on experimental statistical data of all SUs existing in the cluster, and determine one-bit hard decision ). D c ( c = 1, 2, ..., K) represents the cluster decision of the c- th cluster (ie, D c = 1 or D c = 0, respectively.
[ Step 2 ]
All cluster headers send their cluster determination information D c to FC via error-free reporting channels. FC aggregates all cluster decisions and makes the entire decision using a weighted decision fusion rule. As mentioned earlier, clusters use a different average SNR than the received primary signal, so the contribution to the overall decision is different. However, existing fusion rules ( k-out-of-N , eg, OR rule, AND rule or MAJORITY rule) do not consider this aspect. Therefore, the existing k-out-of-N rule can not be applied to the SHC method of the present invention. On the other hand, the weighted decision fusion rule according to the present invention assigns other weighted factors to cluster determination according to sensing reliability.
2 is a conceptual diagram showing a reporting mechanism of the SHC method according to an embodiment of the present invention.
As shown in FIG. 2, in a conventional soft combination scheme, SUs sequentially transmit sensing data to the FC. Here, t s represents the transmission time required for one SU to transmit the sensing data to the FC.
On the other hand, in the SHC method of the present invention, SUs existing in the same cluster transmit sensing data to the cluster header. For a reasonable comparison with the existing methods, let us denote the time required for an SU to transmit the sensing data to the cluster header as t s . The cluster header makes a cluster decision with one bit, and sequentially transmits it to the FC. The time required for the cluster header to send the decision to the FC is denoted by t h . The more data the SU has to report in the cluster header at a given bandwidth and transmission rate of the control channel, the more time it takes. Let ε (ε <0) be the correlation coefficient between the transmission time of the soft sensing data collected by the SU and the transmission time of the one bit decision made by the cluster header. That is, t s = 竜 t h .
Finally, the entire decision is made by FC. The total crystal made during each sensing period is denoted by D g . That is, D g = 1 or D g = 0 indicates the occurrence and disappearance of the primary user, respectively. At the end of the spectrum sensing process, the FC broadcasts the entire decision to all SUs present in the network. In the present invention, P r (A) represents the probability of an arbitrary event A. Likelihood Ratio Test is used for LRT and Log-Likelihood Ratio Test is used for L-LRT.
Hereinafter, in the SHC method of the present invention, the process of soft fusion in the cluster header of each cluster will be described.
First, the cluster SU ci (i-th secondary user of c-th cluster) measures the received signal r ci during the M sample sensing period. The signal transmitted by the primary user is S ci . This signal propagates to SU ci through a flat fading channel. The m-th sample r ci (m) of the discrete signal received in the secondary user SU ci is expressed as Equation (1) below.
Where H 0 and H 1 represent the absent and present of PU near SUs, respectively. Also, r ci represents the primary received signal in the c-th cluster. The noise
The local test statistics ρ ci (estimation of received primary signal power of the SU ci ) is expressed by the following equation (2).
Where M = 2 TW, which represents the number of samples collected in each SU during a sensing period. T and W represent the detection time and the bandwidth of the signal, respectively. In the SHC method proposed in the present invention, one channel is sensed at a time.
The test statistics (TS) of SUs are combined in the cluster headers using Equal Gain Combining (EGC). The cluster test statistic ρ c (the estimation of received primary signal power at the cluster head of the c-th cluster) is expressed by the following equation (3).
The experimental statistical value ρ c is an independent variable under the assumption of H 0 , and the probability density function has a Chi-square distribution with degrees (L = L) degrees of freedom. Under H 1 assumption, ρ c is an independent non-central chi-square random variable with L degrees of freedom and a non-central parameter γ cL .
The average SNR of the primary user signal measured in the cluster header CH c is expressed by Equation (4) below. Here, it is assumed that all SUs in the same cluster have the same SNR.
As mentioned earlier, the SNR is obtained using the SU location information. Distribution for ease of analysis noise test statistics by assumed that the unit variance, and using the Central Limit Theorem (CLT) ρ c is a Gaussian distribution under H 0 or H 1 two conditions (H 0 or H 1) As shown in FIG. Therefore, the distribution of ρ c can be expressed by the following equation (5).
Where L = NM is the number of samples of the primary signal received, and these samples are collected using soft fusion in the cluster header. The cluster headers of each cluster use ρ c as a cluster observing means for making a cluster decision. The cluster header performs the LRT to determine the clusters for the appearance or non-occurrence of the primary user. The log-likelihood ratio test (L-LRT) for the binary hypothesis experiment given in Equation (1) can be expressed as Equation (6).
Here, f p (ρ c │H 1 ) and f p (ρ c │H 0 ) are the probability density functions of the cluster experimental statistical data ρ c under the assumption of H 1 and H 0 , respectively, and log means natural logarithm. Because equal a 1 SNRs of the difference signal received within a cluster, A c (conducted at a certain secondary user i-th in c-th cluster SUci and also at a cluster head) distribution as is f Λ (Λ c) . ≪ / RTI > Therefore, the cluster decision D c (0, 1) can be expressed by Equation (7) based on L-LRT.
Hereinafter, the process of hard fusion at the FU (Fusion Center) will be described.
As shown in FIG. 1, the network is composed of K clusters, and N SUs exists in each cluster.
The fusion center (FC) receives and aggregates the cluster decisions to determine the state of the primary user (PU). Here, a weighted decision fusion rule (WDFR) is used as a fusion rule. D = [D 1 , D 2 . , D K ] denote the set of cluster decisions received at the FC. FC uses the LRT to make the overall decision as shown in equation (8).
Where P 0 = P r ( H 0 ) and P 1 = P r ( H 1 ) are prior probabilities for the appearance and non-occurrence of PU signals, respectively. The determination of the cluster headers is performed independently, and the L-LRT is developed as shown in the following Equation (9).
Therefore, the weighted decision fusion rule can be expressed by Equation (10). &Quot; (10) "
Here, the weighted factors are selected using the following equation (11).
Here, P f, c denotes a false alarm probability of each cluster header, and P d, c denotes a detection probability. (10) is an optimal decision fusion rule, and finally FC broadcasts the entire decision to all SUs in the network.
Hereinafter, a method for calculating an optimal cluster boundary value for cluster headers in the FC will be described. First, an energy detector (ED), which is the most common conventional sensing method, is introduced, and a method for obtaining an optimal cluster boundary value for cluster headers in the SHC method according to the present invention will be described.
[ED (Energy Detector)]
In order to explain the operation of ED, which is an existing sensing method, it is assumed that ED is used in some cluster headers. In this case, CH c performs the determination according to the following equation (12) based on the energy boundary value? ED, c .
Here,? C is an experimental statistic value described in Equation (3). D ED, c = 1 or D ED, c = 0 means that H 1 or H 0 estimation is done in CH c using ED. Local false alarm probability (LFP)
Where γ c is the average SNR in CH c . L is the number of primary samples collected and received at each CH c . Also,
[Optimal cluster Boundary value Calculation ]
In the SHC method of the present invention, the pdf (Probability Density Function) of the LRT value Λ c is developed to calculate an optimal cluster boundary value for the cluster headers.
ρ = [ρ 1 , ρ 2 , ... , ρ c , ... , ρ K ], μ c, j (j = 0 or j = 1) means the variance of Equation (5). ρ c is a random variable representing the test statistic for the LRT in the cluster header CH c . From Equations (5) and (6), the LRT value is developed as shown in the following Equation (15).
The mean value and the variance value in Equation (5) are substituted into Equation (15), and the pdf of the LRT is developed as Equation (16) by applying the opportunistic theory.
here,
And,
here,
Therefore, the false alarm probability P f, c and the detection probability P d, c of each cluster header are expressed by the following equations (20) and (21).
The values of the above equations 20 and 21 can be conveniently obtained using MATLAB. It can be seen from the foregoing description that the false alarm probability (P f, c ) and the detection probability (P d, c ) of each cluster are determined by the channel conditions, that is, the average SNR and the cluster boundary value Able to know. It is very meaningful to find an optimal local sensing boundary value that minimizes the overall sensing error under fixed channel conditions.
In the present invention, a minimum error probability criterion is used to determine the cluster boundary value λ opt, c of the c-th cluster, which can be expressed by the following equation (22).
As can be seen from the above equations (20) to (22), it can be seen that the optimal cluster boundary value? Opt, c can be obtained based on the pdf of the LRT value. Therefore, by using pdf in Equation 16, the cluster header CHc can obtain the optimal cluster boundary value [lambda] opt, c , which is used for comparison in Equation (7).
As described above, the soft-hard fused cooperative spectrum sensing method according to the present invention can enhance the sensing performance by sensing the spectrum using the soft fusion and the hard fusion together.
That is, in the SHC method of the present invention, cluster headers CHc in each cluster fuse experimental statistical values of other SUs and perform LRT with optimal cluster boundary values determined by a minimum error probability criterion. The optimal cluster boundary value is developed using a closed-form representation of the pdf of the LRT value. This simulation result shows that the LRT performs better in comparison with the existing ED, especially in the low SNR system. In addition, the Weighted Decision Fusion Rule (WDFR) can be used by the FC to distinguish the contribution of the other cluster headers. The SHC method can be applied to existing hard fusion methods such as "AND Rule, OR Rule, MAJORITY Rule, LRT" It is possible to obtain a better sensing performance for each case as compared with the case of using each of them. On the other hand, the reporting mechanism of the SHC method can reduce the reporting time compared to the existing soft fusion method.
It is to be understood that the present invention is not limited to the above-described embodiment, and that various modifications and changes may be made by those skilled in the art without departing from the spirit and scope of the appended claims. Of course, can be achieved.
CH: Cluster header
PU: Primary User
SU: Secondary user
FC: Fusion Center
Claims (9)
(a) In a cognitive radio network composed of a plurality of clusters, a soft combination based on a Likelihood Ratio Test (LRT) based on each cluster header (CHs) is used for the appearance of a primary user (PU) Based cluster determination;
(b) a cluster decision is received from each cluster header (CHs) in a fusion center (FU) constituting the cluster, and a cluster determination is performed using a hard combination based on a weighted decision fusion rule And performing a soft-hard fusion-based cooperative spectrum sensing method for a cognitive radio network.
The step (a) of performing the cluster determination
(a-1) to receive signals (S ci) by the sample sensing time the primary user (PU) for a transmission from the SUs (Secondary Users) present in each cluster, the experiment representing the energy of the received signal (r ci) Generating test statistics (? Ci ) and transmitting them to the cluster header;
(LRT) is performed by adding the experimental statistical values (ρ ci ) of all the SUs present in the cluster in the cluster header (a-2), and one-bit hard decision hard decision (Dc = 1 or Dc = 0) for the soft-hard convergence-based cooperative spectrum sensing method.
The cluster header
Calculating a cluster test statistic value (ρ c) the sum of the test statistic value (ρ ci) of the all SUs and
Calculating an average signal-to-noise ratio (SNR) (γ c ) of the primary user signal (S ci ) of the cluster head, calculating a distribution of the cluster experimental statistical value (ρ c )
Characterized in that the LRT for the cluster test statistic (r c ) is performed to perform a cluster decision on the appearance of the PU (Dc = 1) or the non-appearance (Dc = 0) HARD Fusion - based Cooperative Spectrum Sensing Method.
Wherein the FC selects one of a plurality of SUs as a cluster header in each cluster, periodically performs a spectrum sensing process, and broadcasts the entire decision to all SUs present in the network. Soft - Hard Fusion - based Cooperative Spectrum Sensing Method for Networks.
Wherein the FC performs a full determination according to a weight determination fusion rule by collecting all cluster decisions, and the weight determination fusion ratio is expressed by the following equation: < EMI ID = Way.
(Here, c is the cluster sequence (c-th cluster) by 1, 2, ..., has a K value, D c is the clustered crystals (Dc = 1 or Dc = 0) transmitted by each cluster header, P 0 = P r (H 0) and P 1 = P r (H 1 ) is a priori probability for each of the primary user (PU) appearance (H1) and the non-appearance (H0) of the signal is, ω c is the weight element (weighted factors)
Wherein the weight factor? C is selected through the following equation:? C ?
(Where P f, c is the false alarm probability of each cluster header, and P d and c are the detection probabilities)
In order to obtain an optimal cluster boundary value for cluster headers,
The probability density function pdf of the LRT value Λ c with respect to the cluster experimental statistical value ρ c is developed (f Λ (Λ c )), and the false notification probability of each cluster header (P f, c ) and a detection probability (P d, c ) to determine an optimal cluster boundary value. Cooperative Spectrum Sensing Method.
Wherein a false alarm probability (P f, c ) and a detection probability (P d, c ) of each cluster header are determined by the following equation: - HARD Fusion - based Cooperative Spectrum Sensing Method.
(Here, Λ c shows the LRT value, λ c is a cluster boundary value performed by the cluster header)
Wherein the boundary value of the optimal cluster is determined by the following equation according to a minimum error probability criterion. ≪ RTI ID = 0.0 > 11. < / RTI >
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| KR1020160011608A KR20170090805A (en) | 2016-01-29 | 2016-01-29 | A Soft-Hard Combination-Based Cooperative Spectrum Sensing Scheme for Cognitive Radio Networks |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| KR1020160011608A KR20170090805A (en) | 2016-01-29 | 2016-01-29 | A Soft-Hard Combination-Based Cooperative Spectrum Sensing Scheme for Cognitive Radio Networks |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| KR20170090805A true KR20170090805A (en) | 2017-08-08 |
Family
ID=59652956
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| KR1020160011608A KR20170090805A (en) | 2016-01-29 | 2016-01-29 | A Soft-Hard Combination-Based Cooperative Spectrum Sensing Scheme for Cognitive Radio Networks |
Country Status (1)
| Country | Link |
|---|---|
| KR (1) | KR20170090805A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108494510A (en) * | 2018-03-16 | 2018-09-04 | 西安电子科技大学 | Decision fusion method under non-ideal report channel based on optimal weighting coefficients |
| CN109150623A (en) * | 2018-09-13 | 2019-01-04 | 重庆大学 | Malicious user SSDF attack method and system are resisted based on repeating query credit value |
| KR102032518B1 (en) * | 2018-09-18 | 2019-10-15 | 국방과학연구소 | Secondary user coordinator included in cognitive radio networks |
| CN111800229A (en) * | 2020-07-21 | 2020-10-20 | 浙江大学 | Cooperative receiving method and system based on air interface information fusion |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101277816B1 (en) * | 2007-04-23 | 2013-06-21 | 링나 홀딩스 피티이., 엘엘씨 | Cluster-based cooperative spectrum sensing in cognitive radio systems |
| KR101535251B1 (en) * | 2013-06-26 | 2015-07-24 | 성균관대학교산학협력단 | Cooperative spectrum sensing apparatus and cooperative spectrum sensing method |
-
2016
- 2016-01-29 KR KR1020160011608A patent/KR20170090805A/en not_active Application Discontinuation
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101277816B1 (en) * | 2007-04-23 | 2013-06-21 | 링나 홀딩스 피티이., 엘엘씨 | Cluster-based cooperative spectrum sensing in cognitive radio systems |
| KR101535251B1 (en) * | 2013-06-26 | 2015-07-24 | 성균관대학교산학협력단 | Cooperative spectrum sensing apparatus and cooperative spectrum sensing method |
Non-Patent Citations (2)
| Title |
|---|
| A cluster-based selective cooperative spectrum sensing scheme in cognitive radio * |
| A cluster-based selective cooperative spectrum sensing scheme in cognitive radio(EURASIP 저널, 2013.6.공개) * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108494510A (en) * | 2018-03-16 | 2018-09-04 | 西安电子科技大学 | Decision fusion method under non-ideal report channel based on optimal weighting coefficients |
| CN109150623A (en) * | 2018-09-13 | 2019-01-04 | 重庆大学 | Malicious user SSDF attack method and system are resisted based on repeating query credit value |
| CN109150623B (en) * | 2018-09-13 | 2020-08-21 | 重庆大学 | Method for resisting SSDF attack of malicious user based on round robin reputation value |
| KR102032518B1 (en) * | 2018-09-18 | 2019-10-15 | 국방과학연구소 | Secondary user coordinator included in cognitive radio networks |
| CN111800229A (en) * | 2020-07-21 | 2020-10-20 | 浙江大学 | Cooperative receiving method and system based on air interface information fusion |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Liu et al. | Cooperative spectrum sensing optimization in energy-harvesting cognitive radio networks | |
| Visser et al. | Multinode spectrum sensing based on energy detection for dynamic spectrum access | |
| Zou et al. | Outage probability analysis of cognitive transmissions: Impact of spectrum sensing overhead | |
| KR20170090805A (en) | A Soft-Hard Combination-Based Cooperative Spectrum Sensing Scheme for Cognitive Radio Networks | |
| Wan et al. | Energy-efficient cooperative spectrum sensing scheme based on spatial correlation for cognitive internet of things | |
| Arora et al. | Cooperative spectrum sensing using hard decision fusion scheme | |
| Rai et al. | Spectrum sensing and allocation schemes for cognitive radio | |
| CN103763043A (en) | Efficient radio spectrum sensing method based on collaborative cognitive network | |
| Zhao et al. | Scheduling of collaborative sequential compressed sensing over wide spectrum band | |
| Khanikar et al. | Incorporating primary user interference for enhanced spectrum sensing | |
| Zhao et al. | Cooperative sequential compressed spectrum sensing over wide spectrum band | |
| Nallagonda et al. | Performance of Generalized $\alpha-\mu $ Fading for Energy Detection Based Spectrum Sensing in Presence of Channel Errors | |
| Perez et al. | Adaptive EM-based algorithm for cooperative spectrum sensing in mobile environments | |
| Sharma et al. | Performance comparison of hard and soft fusion techniques for energy efficient CSS in cognitive radio | |
| Wang et al. | Interference management for smart grid communication under cognitive wireless network | |
| Rop et al. | Spectrum Sensing on High Density Cognitive Radio Vehicular Ad Hoc Network. | |
| Cardoso et al. | Spectrum sensing in cognitive radio networks | |
| Pratas et al. | Capacity limits introduced by data fusion on cooperative spectrum sensing under correlated environments | |
| Sreedharan et al. | Spectrum sensing using distributed sequential detection via noisy reporting mac | |
| Wang et al. | Cooperative spectrum sensing based on matrix rank minimization | |
| Karami et al. | Cluster size optimization in cooperative spectrum sensing | |
| Li et al. | A Resource-Efficient Green Paradigm For Crowdsensing Based Spectrum Detection In Internet of Things Networks | |
| Lai et al. | Cooperative sensing with detection threshold optimization in cognitive radio networks | |
| Kumar et al. | Comprehensive analysis of cyclo-stationary feature detection technique for efficient spectrum usage: Future research and recent advantages | |
| Perez et al. | Adaptive clustering algorithm for cooperative spectrum sensing in mobile environments |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| A201 | Request for examination | ||
| E902 | Notification of reason for refusal | ||
| E601 | Decision to refuse application |