Goodness-of-fit based secure cooperative spectrum sensing for cognitive radio network.
Ontology highlight
ABSTRACT:
SUBMITTER: Vu-Van H
PROVIDER: S-EPMC4052467 | biostudies-other | 2014
REPOSITORIES: biostudies-other
Similar Datasets
Project description:In cognitive radio communication, spectrum sensing plays a vital role in sensing the existence of the primary user (PU). The sensing performance is badly affected by fading and shadowing in case of single secondary user(SU). To overcome this issue, cooperative spectrum sensing (CSS) is proposed. Although the reliability of the system is improved with cooperation but existence of malicious user (MU) in the CSS deteriorates the performance. In this work, we consider the Kullback-Leibler (KL) divergence method for minimizing spectrum sensing data falsification (SSDF) attack. In the proposed CSS scheme, each SU reports the fusion center(FC) about the availability of PU and also keeps the same evidence in its local database. Based on the KL divergence value, if the FC acknowledges the user as normal, then the user will send unified energy information to the FC based on its current and previous sensed results. This method keeps the probability of detection high and energy optimum, thus providing an improvement in performance of the system. Simulation results show that the proposed KL divergence method has performed better than the existing equal gain combination (EGC), maximum gain combination (MGC) and simple KL divergence schemes in the presence of MUs.
| S-EPMC5562327 | biostudies-other
Project description:Cognitive radio networks (CRN) enable wireless devices to sense the radio spectrum, determine the frequency state channels, and reconfigure the communication variables to satisfy Quality of Service (QoS) needs by reducing energy utilization. In CRN, spectrum sensing is an essential process that is highly challenging and can be addressed by several traditional techniques, such as energy detection, match filtering, etc. For now, the current models' performance is impacted by the comparatively low Signal to Noise Ratio (SNR) of recognized signals and the insignificant quantity of traditional signal samples. This research proposals a new spectral sensing technique for cognitive radio networks (SST-CRN) that addresses the drawbacks of predictable energy detection models. With the use of a deep belief network (DBN), the suggested model contributes to accomplish a nonlinear threshold based on the chicken swarm algorithm (CSA). The proposed DBN enabled SST-CRN technique goes through two phases in a organized process: offline and online. Throughout the offline phase, the DBN model is methodically trained on pre-gathered data, developing the aptitude to identify problematic patterns and examples from the spectral features of the radio environment. This stage involves extensive feature extraction, validation, and model development to ensure that the DBN can professionally represent complicated spectral dynamics. Additionally, online spectrum sensing is conducted during the real communication phase to enable real-time adaptation to dynamic changes in the spectrum environment. Offline spectrum sensing is typically performed during a devoted sensing period before actual communication begins. When combined with DBN's deep learning capabilities and CSO's innate nature-inspired algorithms, a synergistic framework is created that enables CRNs to explore and allocate incidences on their own with astonishing accuracy. The proposed solution considerably improves the spectrum efficiency and resilience of CRNs by harnessing the power of DBN, which leads to more effective resource utilization and less interference. The Simulation results show that our proposed strategy produces more accurate spectrum occupancy assessments. The result parameters such as probability of detection, SNR of -24dB, the SST-CRN perfect has increased a developed Pd of 0.810, whereas the existing methods RMLSSCRN-100 and RMLSSCRN-300 have accomplished a lower Pd of 0.577 and 0.736, respectively. Our deep learning methodology uses convolutional neural networks to automatically learn and adapt to dynamic and complicated radio environments, improving accuracy and flexibility over classic spectrum sensing approaches. Future research might focus on improving CSO algorithms to better optimize the spectrum sensing process, enhancing the reliability of DBN-enabled sensing techniques.
| S-EPMC11309510 | biostudies-literature
Project description:Implementation of dynamic spectrum access (DSA) in cognitive radio (CR) systems requires the unlicensed secondary users (SU) to implement spectrum sensing to monitor the activity of the licensed primary users (PU). Energy detection (ED) is one of the most widely used methods for spectrum sensing in CR systems, and in this paper we present a novel ED algorithm with an adaptive sensing threshold. The three-event ED (3EED) algorithm for spectrum sensing is considered for which an accurate approximation of the optimal decision threshold that minimizes the decision error probability (DEP) is found using Newton's method with forced convergence in one iteration. The proposed algorithm is analyzed and illustrated with numerical results obtained from simulations that closely match the theoretical results and show that it outperforms the conventional ED (CED) algorithm for spectrum sensing.
| S-EPMC7374382 | biostudies-literature
Project description:Spectrum sensing plays a vital role in cognitive radio networks (CRNs) for identifying the spectrum hole. However, an individual cognitive radio user in a CRN does not obtain sufficient sensing performance and sum rate of the primary and secondary links to support the future Internet of Things (IoT) using conventional detection techniques such as the energy detection (ED) technique in a noise-uncertain environment. In an environment comprising noise uncertainty, the performance of conventional energy detection techniques is significantly degraded owing to the noise fluctuation caused by the noise temperature, interference, and filtering. To mitigate this problem, we present a cooperative spectrum sensing technique that comprises the use of the Kullback-Leibler divergence (KLD) in cognitive radio-based IoT (CR-IoT). In the proposed method, each unlicensed IoT device that is capable of spectrum sensing, which is called a CR-IoT user, makes a local decision using the KLD technique. The spectrum sensing performed with the KLD requires a smaller number of samples than other conventional approaches, e.g., energy detection, for reliable sensing even in a noise uncertain environment. After the local decision is made, each CR-IoT user sends its own local decision result to the corresponding fusion center, which makes a global decision using the soft fusion rule. The results obtained through simulations show that the proposed KLD scheme achieves a better sensing performance, i.e., higher detection and lower false-alarm probabilities, enhances the sum rate, and reduces the total time as compared to the conventional ED scheme under various fading channels.
| S-EPMC7249193 | biostudies-literature
Project description:Compressive Sensing (CS) based data collection schemes are found to be effective in enhancing the data collection performance and lifetime of IoT based WSNs. However, they face major challenges related to key distribution and adversary attacks in hostile and complex network deployments. As a result, such schemes cannot effectively ensure the security of data. Towards the goal of providing high security and efficiency in data collection performance of IoT based WSNs, we propose a new security scheme that amalgamates the advantages of CS and Elliptic Curve Cryptography (ECC). We present an efficient algorithms to enhance the security and efficiency of CS based data collection in IoT-based WSNs. The proposed scheme operates in five main phases, namely Key Generation, CS-Key Exchange, Data Compression with CS Encryption, Data Aggregation and Encryption with ECC algorithm, and CS Key Re-generation. It considers the benefits of ECC as public key algorithm and CS as encryption and compression method to provide security as well as energy efficiency for cluster based WSNs. Also, it solves the CS- Encryption key distribution problem by introducing a new key sharing method that enables secure exchange of pseudo-random key between the BS and the nodes in a simple way. In addition, a new method is introduced to safeguard the CS scheme from potential security attacks. The efficiency of our proposed technique in terms of security, energy consumption and network lifetime is proved through simulation analysis.
| S-EPMC8675701 | biostudies-literature
Project description:Information-theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to exchange a secret key with a new receiver at a random location, in the presence of passive eavesdroppers at unknown locations. Two spatial point processes, homogeneous Poisson process and independent uniformly distributed points, are used for the spatial distributions of transmitters and eavesdroppers. We analyse the impact of the number of cooperating transmitters and the number of eavesdroppers on the area fraction where secure communication is possible. Upper bounds on the probability of existence of positive secrecy between the cooperating transmitters and the receiver are derived. The closeness of the upper bounds to the real value is then estimated by means of numerical simulations. Simulations also indicate that a deterministic spatial distribution for the transmitters, for example, hexagonal and square lattices, increases the probability of existence of positive secrecy capacity compared to the random spatial distributions. For the same number of friendly nodes, cooperative transmitting provides a dramatically larger secrecy region than cooperative jamming and cooperative relaying.
| S-EPMC3953532 | biostudies-other
Project description:Cooperative spectrum sensing (CSS) is envisaged as a powerful approach to improve the utilization of scarce radio spectrum resources, but it is threatened by Byzantine attack. Byzantine attack has been becoming a popular research topic in both academia and industry due to the demanding requirements of security. Extensive research mainly aims at mitigating the negative effect of Byzantine attack on CSS, but with some strong assumptions, such as attackers are in minority or trusted node(s) exist for data fusion, while paying little attention to a mobile scenario. This paper focuses on the issue of designing a general and reliable reference for CSS in a mobile network. Instead of the previously simplified attack, we develop a generic Byzantine attack model from sophisticated behaviors to conduct various attack strategies and derive the condition of which Byzantine attack makes the fusion center (FC) blind. Specifically, we propose a robust sequential CSS (SCSS) against dynamic Byzantine attack. Our proposed method solves the unreliability of the FC by means of delivery-based assessment to check consistency of individual sensing report, and innovatively reuses the sensing information from Byzantines via a novel weight allocation mechanism. Furthermore, trust value (TrV) ranking is exploited to proceed with a sequential test which generates a more accurate decision about the presence of phenomenon with fewer samples. Lastly, we carry out simulations on comparison of existing data fusion technologies and SCSS under dynamic Byzantine attack, and results verify the theoretical analysis and effectiveness of our proposed approach. We also conduct numerical analyses to demonstrate explicit impacts of secondary user (SU) density and mobility on the performance of SCSS.
| S-EPMC6033420 | biostudies-literature
Project description:The wireless networks face challenges in efficient utilization of bandwidth due to paucity of resources and lack of central management, which may result in undesired congestion. The cognitive radio (CR) paradigm can bring efficiency, better utilization of bandwidth, and appropriate management of limited resources. While the CR paradigm is an attractive choice, the CRs selfishly compete to acquire and utilize available bandwidth that may ultimately result in inappropriate power levels, causing degradation in network's Quality of Service (QoS). A cooperative game theoretic approach can ease the problem of spectrum sharing and power utilization in a hostile and selfish environment. We focus on the challenge of congestion control that results in inadequate and uncontrolled access of channels and utilization of resources. The Nash equilibrium (NE) of a cooperative congestion game is examined by considering the cost basis, which is embedded in the utility function. The proposed algorithm inhibits the utility, which leads to the decrease in aggregate cost and global function maximization. The cost dominance is a pivotal agent for cooperation in CRs that results in efficient power allocation. Simulation results show reduction in power utilization due to improved management in cognitive radio resource allocation.
| S-EPMC8293924 | biostudies-literature
Project description:Considering the limited resources and the dynamic spectrum distribution in the cognitive radio sensor networks (CRSN), a half-duplex Multichannel broadcast protocol for CRSN is presented based on the home channel. This protocol maintains the networks topology only through the home channel, so there is no need for the public channel to transmit the control information and no need for the synchronization. After network initialization, node broadcasts data via home channel in half-duplex transmission way. The simulation results show that, compared with complete broadcast, the proposed protocol effectively reduces broadcast delay and overhead.
| S-EPMC4000671 | biostudies-other
Project description:The rapid development in the area of cognitive radio technology leads the society to higher standards of spectrum sensing performance, particularly in low signal-to-noise ratio (SNR) environment. This article proposes an adaptive double-threshold energy sensing method based on Markov model (ADEMM). When using the double-threshold energy sensing method, the modified Markov model that accounts for the time varying characteristic of the channel occupancy was presented to resolve the 'confused' channel state. Furthermore, in order to overcome the effect of noise uncertainty, the findings of this article introduce an adaptive double-threshold spectrum sensing method that adjusts its thresholds according to the achievable maximal detection probability. Numerical simulations show that the proposed ADEMM achieves better detection performance than the conventional double-threshold energy sensing schemes, especially in very low SNR region.
| S-EPMC5433748 | biostudies-literature