A Packet Dropping Mechanism in Multi-channel Cognitive Radio Networks with Classified Secondary Users

2020 ◽  
Author(s):  
Yuan Zhao ◽  
Chaozhi Zhou ◽  
Jiemin Liu
Keyword(s):  
Cognitive Radio ◽  
Cognitive Radio Networks ◽  
Radio Networks ◽  
Secondary Users ◽  
Packet Dropping

Operating point selection for primary and secondary users in cognitive radio networks

2009 ◽  
Vol 53 (8) ◽  
pp. 1158-1170 ◽  
Author(s):  
Xavier Gelabert ◽  
Ian F. Akyildiz ◽  
Oriol Sallent ◽  
Ramon Agustí
Keyword(s):  
Cognitive Radio ◽  
Cognitive Radio Networks ◽  
Radio Networks ◽  
Operating Point ◽  
Point Selection ◽  
Secondary Users ◽  
Selection For ◽  
Primary And Secondary Users

Asynchronous Channel Allocation in Opportunistic Cognitive Radio Networks

2015 ◽  
pp. 388-426
Author(s):  
Sylwia Romaszko ◽  
Petri Mähönen
Keyword(s):  
Cognitive Radio ◽  
Cognitive Radio Networks ◽  
Channel Allocation ◽  
Optimal Solution ◽  
Radio Networks ◽  
Traffic Patterns ◽  
Spectrum Access ◽  
Secondary Users ◽  
Channel Parameters ◽  
Channel Service

In the case of Opportunistic Spectrum Access (OSA), unlicensed secondary users have only limited knowledge of channel parameters or other users' information. Spectral opportunities are asymmetric due to time and space varying channels. Owing to this inherent asymmetry and uncertainty of traffic patterns, secondary users can have trouble detecting properly the real usability of unoccupied channels and as a consequence visiting channels in such a way that they can communicate with each other in a bounded period of time. Therefore, the channel service quality, and the neighborhood discovery (NB) phase are fundamental and challenging due to the dynamics of cognitive radio networks. The authors provide an analysis of these challenges, controversies, and problems, and review the state-of-the-art literature. They show that, although recently there has been a proliferation of NB protocols, there is no optimal solution meeting all required expectations of CR users. In this chapter, the reader also finds possible solutions focusing on an asynchronous channel allocation covering a channel ranking.

Security for Cognitive Radio Networks

2012 ◽  
pp. 238-256 ◽  
Author(s):  
Rajni Dubey ◽  
Sanjeev Sharma ◽  
Lokesh Chouhan
Keyword(s):  
Cognitive Radio ◽  
Wireless Network ◽  
Cognitive Radio Networks ◽  
Reference Model ◽  
Development Stage ◽  
Radio Networks ◽  
Full Duplex ◽  
Secondary Users ◽  
Wireless Communication Network ◽  
Open Systems Interconnection

Most of the frequency spectrum bands have already been licensed, and the licensed spectrum is not being utilized efficiently. Cognitive Radio Networks (CRNs) are the kind of full duplex radio that automatically altered its transmission or reception parameters, in such a way that the entire wireless communication network of which it is a node communicates efficiently, while avoiding interference with primary or secondary users. In this chapter, the authors introduce the concept of security threats that may pose a serious attack in CRN. Due to the unique characteristics of CRN, such network is highly vulnerable to security attacks compared to wireless network or infrastructure-based wireless network. The main objective of this chapter is to assist CR designers and the CR application engineers to consider the security factors in the early development stage of CR techniques. Challenges and various security issues are explored with respect to OSI (Open Systems Interconnection) reference model. Various possible and attacks are discussed broadly and respective solutions are also proposed by this chapter. Different architectures and models are also explained, and compared with the existing models.

On the Use of Particle Swarm Optimization Techniques for Channel Assignments in Cognitive Radio Networks

2012 ◽  
pp. 202-214 ◽  
Author(s):  
Hisham M. Abdelsalam ◽  
Haitham S. Hamza ◽  
Abdoulraham M. Al-Shaar ◽  
Abdelbaset S. Hamza
Keyword(s):  
Cognitive Radio ◽  
Cognitive Radio Networks ◽  
Channel Assignment ◽  
Assignment Problem ◽  
Pso Algorithm ◽  
Radio Networks ◽  
Optimization Techniques ◽  
Secondary Users ◽  
Swarm Optimization ◽  
Channel Assignment Problem

Efficient utilization of open spectrum in cognitive radio networks requires appropriate allocation of idle spectrum frequency bands (not used by licensed users) among coexisting cognitive radios (secondary users) while minimizing interference among all users. This problem is referred to as the spectrum allocation or the channel assignment problem in cognitive radio networks, and is shown to be NP-hard. Accordingly, different optimization techniques based on evolutionary algorithms were needed in order to solve the channel assignment problem. This chapter investigates the use of particular swarm optimization (PSO) techniques to solve the channel assignment problem in cognitive radio networks. In particular, the authors study the definitiveness of using the native PSO algorithm and the Improved Binary PSO (IBPSO) algorithm to solve the assignment problem. In addition, the performance of these algorithms is compared to that of a fine-tuned genetic algorithm (GA) for this particular problem. Three utilization functions, namely, Mean-Reward, Max-Min-Reward, and Max-Proportional-Fair, are used to evaluate the effectiveness of three optimization algorithms. Extensive simulation results show that PSO and IBPSO algorithms outperform that fine-tuned GA. More interestingly, the native PSO algorithm outperforms both the GA and the IBPSO algorithms in terms of solution speed and quality.

Game Theoretic Study of Cooperative Spectrum Leasing in Cognitive Radio Networks

2014 ◽  
Vol 5 (2) ◽  
pp. 61-74 ◽  
Author(s):  
Fatemeh Afghah ◽  
Abolfazl Razi
Keyword(s):  
Cognitive Radio ◽  
Cognitive Radio Networks ◽  
Stackelberg Game ◽  
Cooperative Behavior ◽  
Search Space ◽  
Radio Networks ◽  
Cooperative Relaying ◽  
Stackelberg Games ◽  
Secondary Users ◽  
Spectrum Leasing

In this paper, a novel property-right spectrum leasing solution based on Stackelberg game is proposed for Cognitive Radio Networks (CRN), where part of the secondary users present probabilistic dishonest behavior. In this model, the Primary User (PU) as the spectrum owner allows the Secondary User (SU) to access the shared spectrum for a fraction of time in exchange for providing cooperative relaying service by the SU. A reputation based mechanism is proposed that enables the PU to monitor the cooperative behavior of the SUs and restrict its search space at each time slot to the secondary users that do not present dishonest behavior in the proceeding time slots. The proposed reputation-based solution outperforms the classical Stackelberg games from both primary and reliable secondary users' perspectives. This novel method of filtering out unreliable users increases the PU's expected utility over consecutive time slots and also encourages the SUs to follow the game rule.

Interference Modeling and Analysis in Cognitive Radio Networks

2013 ◽  
Vol 4 (4) ◽  
pp. 1-15
Author(s):  
Yanxiao Zhao ◽  
Bighnaraj Panigrahi ◽  
Kazem Sohraby ◽  
Wei Wang
Keyword(s):  
Cognitive Radio ◽  
Spectrum Sensing ◽  
Cognitive Radio Networks ◽  
Critical Role ◽  
Radio Networks ◽  
Secondary Users ◽  
Idle State ◽  
Modeling And Analysis ◽  
Interference Modeling ◽  
Primary Users

Cognitive radio networks (CRNs) have received considerable attention and viewed as a promising paradigm for future wireless networking. Its major difference from the traditional wireless networks is that secondary users are allowed to access the channel if they pose no harmful interference to primary users. This distinct feature of CRNs has raised an essential and challenging question, i.e., how to accurately estimate interference to the primary users from the secondary users? In addition, spectrum sensing plays a critical role in CRNs. Secondary users have to sense the channel before they transmit. A two-state sensing model is commonly used, which classifies a channel into either busy or idle state. Secondary users can only utilize a channel when it is detected to be in idle state. In this paper, we tackle the estimation of interference at the primary receiver due to concurrently active secondary users. With the spectrum sensing, secondary users are refrained from transmitting once an active user falls into their sensing range. As a result, the maximum number of simultaneously interfering secondary users is bounded, typically ranging from 1 to 4. This significant conclusion considerably simplifies interference modeling in CRNs. The authors present all the cases with possible simultaneously interfering secondary users. Moreover, the authors derive the probability for each case. Extensive simulations are conducted and results validate the effectiveness and accuracy of the proposed approach.

QoS Maintenance in Cognitive Radio Networks with Priority-Supporting Novel Channel Allocation Method

2019 ◽  
Vol 15 (1) ◽  
pp. 1-16
Author(s):  
K. Annapurna ◽  
B. Seetha Ramanjaneyulu
Keyword(s):  
Cognitive Radio ◽  
Cognitive Radio Networks ◽  
Channel Allocation ◽  
Radio Networks ◽  
Secondary Users ◽  
Primary Users ◽  
Maximum Value ◽  
Blocking Probabilities ◽  
Bid Price

Satisfying the Quality of Service (QoS) is often a challenge in cognitive radio networks, because they depend on opportunistic channel accessing. In this context, appropriate pricing of vacant channels that is linked to the preference in their allocation, is found to be useful. However, ambiguity on the possible price at which the channel would be allotted is still a concern. In this work, an auction mechanism in which maximum value of the bid is predefined is proposed. With this, users quote their bid values as per their needs of getting the channels, up to the predefined maximum allowed bid price. However, final price of allocation is decided based on the sum total demand from all the users and the availability of vacant channels. Performance of the system is found in terms of blocking probabilities of secondary users and revenues to primary users. The proposed system is found to yield similar quantum of revenues as that of the Generalized Second Price (GSP) auction, while offering much lesser blocking probabilities to high-priority users to satisfy their QoS requirements.

Sign in / Sign up

Export Citation Format

Share Document