Queueing Models for Cognitive Radio Networks: A Survey

Palunčić, Filip; Alfa, Attahiru Sule; Maharaj, B. T.; Tsimba, Hilary M.

doi:10.1109/access.2018.2867034

Cited by 40 publications

(22 citation statements)

References 146 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first type is called (underground) network, where unlicensed users can use the primary channels simultaneously with the licensed users under certain predetermined conditions. The second type is referred to as (overlay) networks, in which the unlicensed users can use the primary service at any time as far as the primary unit is not occupied by licensed users, the authors of [13,15,19,21] have introduced further information. However, the present paper deals with an overlay CR technique by modelling a CRN system containing two finite source subsystems (primary and secondary).…”

Section: Introductionmentioning

confidence: 99%

“…From orbit, the postponed requests will retry to receive service after an exponentially distributed random interval. Further details are given in [6,13,17,21]. In this study, we assume that impatient customers in orbit whose total waiting time exceeds a random abandonment time which is generally distributed have to leave the system and the second service unit is unreliable which are the novelty of this work.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Simulation Analysis in Cognitive Radio Networks with Unreliability and Abandonment

Nemouchi

Zaghouani

Sztrik

2021

Information Technologies and Mathematical Modelling. Queueing Theory and Applications

View full text Add to dashboard Cite

The current paper presents a Cognitive Radio Network with impatient customers and unreliable servers by the help of a finite-source retrial queueing system. We consider two types of customers (primary and secondary) assigned to two interconnected frequency bands. A first frequency band with a priority queue and a second frequency band with an orbit are reserved for Primary Users (PUs) and Secondary Users (SUs), respectively. If the servers are busy, both customers (licensed and unlicensed) enter either the queue or orbit. Before they enter orbit, the secondary customers receive a random retrial time according to the exponential distribution, i.e. the waiting time before the next retry. Unlicensed users (impatient) are obliged to leave the system as soon as their total waiting time exceeds a random maximum waiting time. It should be noted, that the secondary service unit of our system is subject to random breakdowns and repairs. The novelty of this work consists in the investigation of the abandonment and secondary server unreliability impact on various performance measures of the system (Cognitive Radio Network), such as the mean response and waiting time of users, the probability of abandonment of SU, etc. Several figures illustrate the problem in question through simulation.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Simulation Analysis in Cognitive Radio Networks with Unreliability and Abandonment

Nemouchi

Zaghouani

Sztrik

2021

Information Technologies and Mathematical Modelling. Queueing Theory and Applications

View full text Add to dashboard Cite

show abstract

“…There are two types of CRN, the first is known as (underlay network) in which unlicensed users are entitled at the same time to use the primary channels with the PUs, depending on some predefined conditions. The second type is called (overlay networks) where the secondary customers are allowed to use the Primary Service Unit if this unit does not contain licensed customers, more explanation was introduced by the authors of [10,13,16]. Theoretically, the current paper treats the second mentioned type of CRN (overlay), by modeling a CRN that uses two finite-source subsystems with non-reliable servers (Primary and Secondary) exposed to breakdowns and repairs.…”

Section: Introductionmentioning

confidence: 99%

“…If not, they must join the orbit automatically. Canceled requests in the orbit retry to be served after an exponentially distributed random interval, more details can be found in [2,3,10,13,14,16]. The servers used in our network are subject to some random breakdowns the interrupted requests are sent to the queue or to the orbit, respectively.…”

Section: Introductionmentioning

confidence: 99%

Simulation of the performance of CognitiveRadio Networks with unreliable servers

Zaghouani¹,

Sztrik²,

Uka³

2020

AMI

View full text Add to dashboard Cite

This paper deals with a Cognitive Radio Network (CRN) which is modeled using a retrial queuing system with two finite-sources. This network includes two non-independent service units treating two types of users: Primary Users (PU) and Secondary Users (SU). The primary unit has priority queue (FIFO) and a second service unit contains an orbit both units are dedicated for the Primary Users and Secondary Users, respectively.The current work highlights the unreliability of the servers as we are assuming that both servers of this network are subject to random breakdowns and repairs. All the inter-event times in this CRN are either exponentially or non-exponentially distributed. The novelty of our investigation is to analyze the effect of several distributions (Gamma, Pareto, Log-normal, Hypo-Exponential and Hyper-Exponential) of the failure and repair times on the main performance measure of the system. By the help of simulation we show some interesting results concerning to sensitivity problems.

show abstract

“…Besides, some literature considered heterogenous SUs and analyzed their behavior, such as heterogenous delay cost [20]- [22], heterogenous reward [23]. Various queueing models applied in CR systems are reviewed and concluded in [24].…”

Section: Introductionmentioning

confidence: 99%

Optimal Joining Strategies in Cognitive Radio Networks Under Primary User Emulation Attacks

Wang

2019

IEEE Access

View full text Add to dashboard Cite

Cognitive radio (CR) networks allow secondary users (SUs) to access and use the spectrum opportunistically. However, some misbehavior users mislead SUs to evacuate the spectrum by launching a primary user emulation attack (PUEA), which is a denial of service (DoS) attack. During the service of an SU, the arrival of the malicious misbehavior users (MMUs) will force the SU under service to leave the system. Another type of attack, different from the MMU, refers to the selfish misbehavior users (SMUs) who launch PUEA to interrupt the serving SU and then take over the spectrum for their own use. In this paper, we consider two types of misbehavior users, i.e., MMU and SMU. We first investigate the noncooperative behavior of SUs that maximize their own benefit and obtain a unique individual Nash equilibrium joining strategy. Next, we present a socially optimal joining strategy from the perspective of social planners. To eliminate the gap between individual equilibrium and socially optimal strategies, a fee imposed on SUs is proposed. We carry out a sensitivity analysis of joining strategies of SUs and social welfare regarding some main parameters of the system. Interestingly, we observe that the individual equilibrium and socially optimal joining probabilities along with the social welfare increase when the MMUs invade the system more frequently.INDEX TERMS Cognitive radio system, noncooperative game, cooperative game, queueing system, primary user emulation attack.

show abstract

Queueing Models for Cognitive Radio Networks: A Survey

Cited by 40 publications

References 146 publications

Simulation Analysis in Cognitive Radio Networks with Unreliability and Abandonment

Simulation Analysis in Cognitive Radio Networks with Unreliability and Abandonment

Simulation of the performance of CognitiveRadio Networks with unreliable servers

Optimal Joining Strategies in Cognitive Radio Networks Under Primary User Emulation Attacks

Contact Info

Product

Resources

About