scholarly journals Cooperative Spectrum Sensing for Cognitive Radio-Wireless Sensors Network Based on OR Rule Decision to Enhance Energy Consumption in Greenhouses

2019 ◽  
Vol 11 (01) ◽  
pp. 1-11 ◽  
Author(s):  
Haythem Alhumud ◽  
Mohammed Zohdy ◽  
Debatosh Debnath ◽  
Richard Olawoyin ◽  
Sayed Ali Arefifar
Author(s):  
Saud Althunibat ◽  
Sandeep Narayanan ◽  
Marco Di Renzo ◽  
Fabrizio Granelli

One of the main problems of Cooperative Spectrum Sensing (CSS) in cognitive radio networks is the high energy consumption. Energy is consumed while sensing the spectrum and reporting the results to the fusion centre. In this chapter, a novel partial CSS is proposed. The main concern is to reduce the energy consumption by limiting the number of participating users in CSS. Particularly, each user individually makes the participation decision. The energy consumption in a CSS round is expected by the user itself and compared to a predefined threshold. The corresponding user will participate only if the expected amount of energy consumed is less than the participation threshold. The chapter includes optimizing the participation threshold for energy efficiency maximization. The simulation results show a significant reduction in the energy consumed compared to the conventional CSS approach.


2021 ◽  
Author(s):  
Junhai Luo ◽  
Zhiyan Wang ◽  
Yuxin Tian ◽  
Yu Chen

Abstract In cooperative spectrum sensing (CSS), there are two ways for the secondary users (SU) to deliver their sensing data or local decisions to the information fusion center (FC): hard-decision (HD) and soft-decision (SD). In HD or SD, the number of bits transmitted by the SUs is always the same and static. However, considering the differences of different SUs in the environment, remaining energy, distances to the FC, and so on, the number of bits transmitted by different SUs should be different. Besides, the reliability of transmitted data by different SUs to the FC is also different. Therefore, this paper proposes an optimized bit allocation scheme based on the genetic algorithm (GA-BAS) for CSS in cognitive radio networks (CRNs). In the proposed scheme, the number of bits transmitted by each SU is different and would be allocated by the FC according to GA-BAS algorithm, and the FC would fuse the transmitted data by each SU with an allocated weight, which could represent the reliability of the SU. Firstly, a simple quantization scheme based on the sub-partitioning of the local decision space is designed to quantify the raw sensing data. Then, the objective function of the overall detection probability and the objective function of energy consumption about the number of allocated bits and the value of the allocated weight of each SU are derived. Finally, the number of allocated bits of each SU would be optimized by an improved genetic algorithm, and an overall decision rule would be given to obtain a global decision. Simulation results show that the proposed scheme (GA-BAS) gets a tradeoff between energy consumption and detection performance. In addition, the proposed algorithm achieves better detection performance, which is close to that of the equal gain combining scheme (EGC), but consumes less energy.


Author(s):  
Masoud Moradkhani ◽  
Zeynab Zalani

Cognitive radio is regarded as one of the transformational technologies that play a fundamental role in establishment and development of next generation wireless networks. Clustering based cognitive radio networks can reduce the energy consumption and increase the spectrum sensing accuracy. In this paper, we investigate the performance of a cognitive radio network with a clustering architecture for cooperative spectrum sensing. The network efficiency is evaluated in terms of throughput and energy consumption, under fading channel conditions. Simulation results show significant improvement of energy efficiency compared to the conventional non-clustering method by ensuring allowable interference with primary users.


2020 ◽  
Vol 2020 ◽  
pp. 1-9 ◽  
Author(s):  
S. Tephillah ◽  
J. Martin Leo Manickam

Security is a pending challenge in cooperative spectrum sensing (CSS) as it employs a common channel and a controller. Spectrum sensing data falsification (SSDF) attacks are challenging as different types of attackers use them. To address this issue, the sifting and evaluation trust management algorithm (SETM) is proposed. The necessity of computing the trust for all the secondary users (SUs) is eliminated based on the use of the first phase of the algorithm. The second phase is executed to differentiate the random attacker and the genuine SUs. This reduces the computation and overhead costs. Simulations and complexity analyses have been performed to prove the efficiency and appropriateness of the proposed algorithm for combating SSDF attacks.


Sign in / Sign up

Export Citation Format

Share Document