<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>The Impact of Servers Reliability on the Characteristics of Cognitive Radio Systems∗</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Hamza Nemouchi</string-name>
          <email>nemouchi.hamza@inf.unideb.hu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Mohamed Hedi Zaghouani</string-name>
          <email>zaghouani.hedi@inf.unideb.hu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>János Sztrik</string-name>
          <email>sztrik.janos@inf.unideb.hu</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Doctoral School of Informatics, Faculty of Informatics, University of Debrecen</institution>
          ,
          <addr-line>Debrecen</addr-line>
          ,
          <country country="HU">Hungary</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Proceedings of the 1</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <fpage>151</fpage>
      <lpage>167</lpage>
      <abstract>
        <p>The current paper presents a finite-source retrial queuing system that models a Cognitive Radio Network (CRN) dealing with two types of requests (primary and secondary) attached to two interconnected, non-independent frequency bands. An orbit and a First In First Out queue are assigned to the second and first service units, respectively. The first server is meant to handle requests coming from Primary Users (PUs), the second one is built for the requests of Secondary Users (SUs). The newly generated primary requests are directed to the Primary Service Unit. In case of an idle status, the service process of these jobs can start immediately. If it is busy with a licensed request, the last generated packet is routed to the FIFO queue. However, if the channel is busy with an unlicensed request, its service is discontinued and the latter request must be returned to the Secondary Service Unit. Depending on the status of the units, the suspended jobs are added to either the server or the orbit. If an SU request discovers an idle status in the Secondary Channel Service (SCS), the service can be resumed right</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>away, however, If the SCS is busy, the new request might attempt joining the
Primary Channel Service (PCS). Assuming the PCS is idle, the low priority
packet can opportunistically be hosted by the high-priority server, otherwise,
it needs to join the orbit. From orbit, the deferred requests retry to be served
after a random time. It should be noted that the secondary service unit is
non-reliable, which means that the server is subject to random failures
depending on whether it is busy or idle. We decided to assume that only the
secondary server of our system is unreliable, since having both servers
unreliable is another case study and due to the limitation of pages we have focus
our analysis on the secondary part of the system to demonstrate the positive
efect of sharing the channels cognitively. The novelty of this work is to
investigate the impact of the failure time distribution of the SCS, distinguishing
its state (idle or busy). Our approach is based on simulation to study the
efects of the mentioned two scenarios on diferent performance measures of
the system, using several distributions (Pareto, gamma, log-normal,
hyperexponential and hypo-exponential). Multiple figures illustrate the problem
in the question.</p>
    </sec>
    <sec id="sec-2">
      <title>1. Introduction</title>
      <p>
        The main objective of our model “Cognitive Radio Network” is to utilize the free
portions of the licensed frequency bands for the benefit of secondary customers.
Further details are given in [
        <xref ref-type="bibr" rid="ref1 ref10 ref13 ref16 ref17 ref5 ref7 ref9">1, 5, 7, 9, 10, 13, 16, 17, 19</xref>
        ]. In this queuing system,
we consider two elements; a first subsystem is intended for the jobs of Primary Users
(PU) with a finite number of sources. In this subsystem, each source generates a
primary call for the PUs after an exponentially distributed time; the latter requests
are forwarded to a single server Primary Channel Service (PCS) with a preemptive
discipline (FIFO queue) to start the service, assuming that the service time is
also exponentially distributed. The second component of the system is set up
for Secondary Users (SU) requests coming from a finite source and forwarded to
Secondary Channel Service (SCS), presuming that the arrival and service times of
the secondary users are exponentially distributed. In order to test the usability, the
generated licensed tasks are targeting the PCS. If this service unit is unoccupied,
the service starts immediately. However, if the PCS is busy with another primary
task, this last task joins a First In First Out (FIFO) queue. In case of having
a second job is being handled in the primary unit, it disconnects immediately
and will be routed back to the Secondary Channel Service. Depending on the
status of the secondary channel, the aborted job either restarts the service on
its original server “SCS” or is added to the retrial queue (Orbit). Besides, the
secondary channel also receives low priority requests. If the aimed unit is idle, the
service may start immediately. Otherwise, these secondary requests will attempt
to join opportunistically the primary unit. If the last unit is idle, the secondary
requests will have the opportunity to start. If not, they will automatically enter
the orbit. From the orbit, the postponed requests retry to receive service after an
exponentially distributed random interval. Numerous studies have examined the
CRN based on diferent scenarios. Using the example of paper [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], the authors have
used some theoretical queuing approaches on a finite source cognitive radio network
with two channels (primary and secondary) to investigate the main performance
measures of this system using a tool-based approach. However, a similar study [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]
analyzed a single server network that was subject to failures and repairs. With
this type of network, some dificulties could arise during periods of high utilization,
as the failure of a single server could afect the entire system. Using primary and
secondary service channels and a retrial queue, the authors of [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] assumed that
both channels of the presented system were subject to random failures and repairs.
In this paper, the authors aimed to illustrate the influence of diferent distributions
(exponential, hypo-, and hyper-exponential) on such a system’s main performance
measures. As an extended work, the authors of [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] added the gamma distribution
to the above-mentioned distributions. In [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] and [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] the hypo-, hyper-exponential
distributions were implemented, assuming that the secondary queries of the CRN
are subject to collisions and that the two services of such a system are unreliable.
      </p>
      <p>However, in this investigation, we are assuming that only the secondary unit is
unreliable and diferentiating the failures (idle or busy state).</p>
      <p>After a deep immersion in many similar investigations and studies, we did not
ifnd any papers that dealt with the unreliability in such model, distinguishing the
failures in a busy and idle state. Consequently, several figures will illustrate the
impact of the various distributions on the performance measures of the second part
of the system, using stochastic simulation.</p>
    </sec>
    <sec id="sec-3">
      <title>2. System</title>
    </sec>
    <sec id="sec-4">
      <title>Model</title>
      <p>Figure 1 shows a queueing cognitive radio system with the following assumptions.
Consider two interconnected subsystems, where the licensed requests are generated
by a finite number of sources  1. These sources generate primary calls
corresponding to an exponentially distributed time with an average value of  1 which are sent
to the primary service unit. If the server is idle, the service starts immediately. If
the server is busy, the call joins a preemptive priority queue. The primary service
time is supposed to be exponentially distributed random variable with a mean  1.</p>
      <p>For the secondary part, the number of sources is denoted by  2. Each source
generates low priority calls according to an exponentially distributed time with
a mean value of  2/ 2. The secondary service time is exponentially distributed
with a parameter  2. We assume that the secondary service unit is non-reliable,
which means that the server is subject to random failures depending on whether
it is in a busy or idle state. The secondary service unit may fail after a time,
which is generally distributed with a rate  2 during idle state and  2 during a
busy state. The operating time (or inter-failure time) during the busy or idle state
is supposed to be hyper-exponential, hypo-exponential, gamma, lognormal and
Pareto distributed random variables. Similarly, for repair time, the rate is  2. The
retrial time of the secondary customers is supposed to be exponentially distributed
random variable with a parameter /</p>
      <p>2.</p>
      <p>
        Assuming that all random variables included in the system are exponentially
distributed except the failure and repair times which are generally distributed
random variables, we created a stochastic simulation program written in C coding
language with SimPack [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] libraries. All the numerical results were collected by the
validation of the simulation outputs. The input parameters are displayed in
Table 1. It should be noted that the batch-mean approach was used in our simulation
for the estimations of the characteristic of the system. This approach is a popular
technique of confidence interval that is used for the analysis of the performance of
the steady-state simulation. For instance, see [
        <xref ref-type="bibr" rid="ref15 ref3 ref4 ref8">3, 4, 8, 15</xref>
        ].
      </p>
    </sec>
    <sec id="sec-5">
      <title>3. Simulation Results</title>
      <p>
        Performance modelling and analysis of systems with non-reliability has been
investigated using asymptotic methods in [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Since the authors have supposed that
the inter-event times were exponentially distributed, the stationary state has been
reached by the construction of a continuous Markov chain.
      </p>
      <p>This paper deals with a more general situation allowing non-exponential
distributions. Therefore, the simulation approach is the most eficient method which
helps us in performance modelling and analysis when the steady-state equations
are not solvable.</p>
      <p>For a better understanding of numerical results, we presume that in our system
the disrupted secondary service from the PCS due to the arrival of PUs or from
the SCS due to server failure will be repeated from the beginning (non-intelligent).
Furthermore, the failure of the service unit will not obstruct the system and free
sources will continue to create new jobs.</p>
      <p>In this paper, we have performed several simulations runs in order to investigate
the impact of the operating and the repair times distribution on the behaviour of
the system. Mainly, we have investigated separately the cases when the server fails
during idle or busy state. Many scenarios might be treated using our introduced
model, however, due to the limitation of pages, we have assumed only the following
three scenarios:
Scenario 1: SCS repair time is generally distributed, assuming that the operating
time is Exponentially distributed.</p>
      <p>Scenario 2: SCS operating time is generally distributed when server fails during
idle state, assuming that the repair time is Exponentially distributed.
Scenario 3: SCS operating time is generally distributed when server fails during
busy state, assuming that the repair time is Exponentially distributed.</p>
      <p>
        All the numerical values of parameters for the statistical methods are defined
in Table 2 and were collected based on some previous works dealing with the same
model, such as [
        <xref ref-type="bibr" rid="ref1 ref12 ref9">1, 9, 12</xref>
        ]. Furthermore, diferent set of parameters were used,
however the output result from these input parameters has the most significant
impact.
      </p>
      <sec id="sec-5-1">
        <title>3.1. Repair Time is Generally Distributed</title>
        <p>Firstly, our aim is to investigate how the various distributions of repair times, where
the mean and variance are equal, efect the performance analysis. Depending on
the square coeficient of variation, the investigation is split into two parts.</p>
        <p>Table 3 represents the input parameters for the distributions of the repair times.
These parameters are chosen according to the squared coeficient of variation.</p>
        <sec id="sec-5-1-1">
          <title>Squared coeficient of variation is greater than one</title>
          <p>Figure 2, Figure 3 and Figure 4 illustrate the impact of the server’s repair time
distribution on the mean sojourn time of secondary customers, total utilization
of secondary server and mean service time of secondary customers, respectively.
These measures are displayed in function of the arrival intensity of the secondary
customers. Figures show an important impact of the repair times distribution on
these features. In Figure 2, the log-normal distribution gives a higher value of the
mean response time while the gamma distribution provides the smallest value of
the mean. However, since the gamma distribution generates small values using the
mentioned input parameters, the server is recovered faster, thus, the greater value
of the utilization is shown in Figure 3. Similarly, in Figure 4 the highest value of
the mean service time is provided by the gamma distribution since the system is
most of the time in operational mode.</p>
          <p>The explanation of the results might depend on the observed random variable.
For instance, the behaviour of mean total of primary and secondary service time
will change in case of changing the distributions mean and variance. The analysis of
the performance measures of such a system using simulation allows us to investigate
the characteristics that are almost impossible to analyse analytically. However, our
explanation of the results is as follows:</p>
          <p>In Figure 2 the repair time is generally distributed. If we see the graph of
the Probability Density Function of the lognormal and gamma distribution, the
relative likelihood of the random variable x (repair time) is clearly greater in the
case of the lognormal distribution than in the case of the gamma which means
that the repair time will take more likely greater values in case it is lognormally
distributed. Thus, it involves greater response time of the customers considering
that the server takes longer time to be repaired. On the other side, Figure 3 shows
that the utilization of the server while the repair time is lognormally distributed
has smaller values than when it is gamma distributed because the server is most
of the time down and not occupied by a customer.</p>
        </sec>
        <sec id="sec-5-1-2">
          <title>Squared coeficient of variation is less than one</title>
          <p>In this part, let us investigate and compare the efect of the repair time
distribution on the same features shown above, but in this situation, we replace the
hyper-exponential distribution by the hypo-exponential distribution and set new
parameters that their coeficient of variation is less than one.</p>
          <p>Similarly, Figure 5, Figure 6 and Figure 7 show the efect of the repair time
distribution on the mean response/service time of secondary calls and utilization of</p>
          <p>SCS versus secondary request generation rate. In this case where the distribution
have their  2 &lt; 1, the diference in the values of the performance measures is
between two groups of distributions. Pareto and hypo-exponential give similar
values of the estimations. These values are greater than the one resulted from the
log-normal and gamma distribution. The explanation of the illustrated impact of
the distributions is similar as the case of squared coeficient of variation greater
than 1.</p>
          <p>In this scenario, the expected phenomenon was obtained such the property of
having a maximum value of the mean. Also, increasing the arrival intensity involves
higher utilization of the server and lower mean service time.</p>
        </sec>
      </sec>
      <sec id="sec-5-2">
        <title>3.2. Operating Time is Generally Distributed</title>
        <p>In this scenario, we analyze the distributions of operating times depending on the
square coeficient of variation, this part is divided into two subsections.</p>
        <p>Table 4 represents the input parameters for the distributions of the inter-failure
times.
Figure 11,12,13,17,18,19
Figure 8,9,10,14,15,16</p>
        <p>Hyper
N/A
N/A</p>
        <p>N/A
Mean
Variance
Parameters
Let’s consider the inter-failure time of the server during an idle state generally
distributed and all the other involved random variables are exponentially distributed.</p>
        <p>Figure 8, Figure 9 and Figure 10 illustrate the impact of the failure time
distribution during idle state on the mean response time, utilization of the SCS and
PCS respectively while the running parameter is  2/ 2. The distributions on the
ifgures have their  2 &gt; 1. Despite the gamma distribution, which involves a big
diference in the estimation of the mean sojourn time and the utilization, the other
distributions have no efect on the performance. An impact of the gamma
distribution as well on the utilization of the primary channel can be seen in Figure 10.
The generated inter-failure times from gamma distribution make the server more
often non-operational and the impact can be seen even on the utilization of the
primary service channel.</p>
        <p>Figure 11, Figure 12 and Figure 13 illustrate the same features as the figures
above in this section, but in this time, we replaced the hyper-exponential
distribution by the hypo-exponential distribution in order to investigate the case of
distinguished distributions with  2 &lt; 1. With this set of parameters, the
relative diference between gamma and the other distributions is very small comparing
with the corresponding figures above. Still a small impact can be seen on the mean
residence time and utilization of the SCS but there no efect on the PCS.</p>
        <sec id="sec-5-2-1">
          <title>Server fails during busy state</title>
          <p>In the last scenario of our investigation, we suppose the failure time of the server
during a busy state generally distributed and all the other involved random
variables exponentially distributed. Similarly, as the above investigation, we will start
with the hyper-exponential distribution and set the gamma, Pareto and log-normal
with  2 &gt; 1.</p>
          <p>Figure 14, Figure 15 and Figure 16 display the efect of the inter-failure time
distribution during busy state on the mean sojourn time, utilization of the SCS
and PCS respectively versus  2/ 2. Figure 14 shows the impact of the distribution
where the gamma gives a higher value of the mean response but the log-normal
gives the smallest value. In Figure 15, the gamma distribution provides the lowest
utilization of the server as expected.</p>
          <p>In Figure 17, Figure 18 and Figure 19. The hypo-exponential distribution takes
place instead of the hyper-exponential. The figures illustrate the same estimation as
Figure 14, Figure 15, and Figure 16, respectively. In this case, we notice an opposite
behaviour of scenario 2 where the inter-failure time during idle state was generally
distributed. In this later, the relative diference of the estimations caused by the
gamma distribution was smaller in the case of the hypo-exponential distribution.
However, in this scenario, we see the figures that the relative diference between the
estimations is greater in the case of the hypo-exponential distribution and smaller
in the case of the hyper-exponential distribution.</p>
          <p>We notice from Figure 16 and Figure 19 that whether the squared coeficient
of variation is greater or less than one, the distribution of the inter-failure time
during busy state has no efect on the primary service channel.</p>
          <p>However, our explanation regarding the significant diference is shown in the
ifgures is the following: let us consider the sample examples illustrated by Figure 8
and Figure 14 that show respectively the efect of the operating time distribution
on the SU mean response time while the server breaks down during idle and busy
state. The diference is significant when the arrival rate  2/ 2 ∈ [0.1, 1]. At this
low arrival intensity, the server breaks down more likely during idle state, and the
arrival customers during the repair time cannot join the service unit (Continues
case study) which it involves greater response time. The diference can be seen
while the operating time is gamma distributed because of the smallest values of
that gamma distribution generates (Short operation time).</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>4. Conclusion</title>
      <p>In this paper, we presented a finite-source retrial queueing system with two
nonindependent sub- systems to model cognitive radio network with primary and
secondary service units subject to random break-downs and repairs. With the help
of simulation, a detailed analysis has been performed in order to investigate the
impact of the inter-failure time distribution separately during idle and busy state
on the main performance measures of the system. In this paper, we have shown
that the performance of the system depends on the state of the server at a random
breakdown.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>I. F.</given-names>
            <surname>Akyildiz</surname>
          </string-name>
          , W.-
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. C.</given-names>
            <surname>Vuran</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          <article-title>Mohanty: NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey</article-title>
          ,
          <source>Computer networks 50.13</source>
          (
          <year>2006</year>
          ), pp.
          <fpage>2127</fpage>
          -
          <lpage>2159</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>B.</given-names>
            <surname>Almási</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Bérczes</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kuki</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sztrik</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          <article-title>Wang: Performance modeling of finitesource cognitive radio networks</article-title>
          ,
          <source>Acta Cybernetica 22.3</source>
          (
          <issue>2016</issue>
          ), pp.
          <fpage>617</fpage>
          -
          <lpage>631</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>E.</given-names>
            <surname>Carlstein</surname>
          </string-name>
          et al.:
          <article-title>The use of subseries values for estimating the variance of a general statistic from a stationary sequence</article-title>
          ,
          <source>The annals of statistics 14.3</source>
          (
          <issue>1986</issue>
          ), pp.
          <fpage>1171</fpage>
          -
          <lpage>1179</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>E. J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. D.</given-names>
            <surname>Kelton</surname>
          </string-name>
          :
          <article-title>A procedure for generating batch-means confidence intervals for simulation: Checking independence and normality</article-title>
          ,
          <source>Simulation</source>
          <volume>83</volume>
          .10 (
          <year>2007</year>
          ), pp.
          <fpage>683</fpage>
          -
          <lpage>694</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>N.</given-names>
            <surname>Devroye</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Vu</surname>
          </string-name>
          ,
          <string-name>
            <surname>V.</surname>
          </string-name>
          <article-title>Tarokh: Cognitive radio networks</article-title>
          ,
          <source>IEEE Signal Processing Magazine 25.6</source>
          (
          <issue>2008</issue>
          ), pp.
          <fpage>12</fpage>
          -
          <lpage>23</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>P. A.</given-names>
            <surname>Fishwick</surname>
          </string-name>
          <article-title>: SimPack: getting started with simulation programming in C and C++</article-title>
          ,
          <source>in: Proceedings of the 24th conference on Winter simulation</source>
          ,
          <year>1992</year>
          , pp.
          <fpage>154</fpage>
          -
          <lpage>162</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S.</given-names>
            <surname>Gunawardena</surname>
          </string-name>
          , W. Zhuang:
          <article-title>Modeling and Analysis of Voice and Data in Cognitive Radio Networks</article-title>
          , Springer,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>A. M.</given-names>
            <surname>Law</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W. D.</given-names>
            <surname>Kelton</surname>
          </string-name>
          , W. D. Kelton:
          <article-title>Simulation modeling and analysis</article-title>
          , vol.
          <volume>3</volume>
          ,
          <string-name>
            <surname>McGraw-Hill</surname>
          </string-name>
          New York,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Mitola</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. Q.</given-names>
            <surname>Maguire</surname>
          </string-name>
          :
          <article-title>Cognitive radio: making software radios more personal</article-title>
          ,
          <source>IEEE personal communications 6.4</source>
          (
          <issue>1999</issue>
          ), pp.
          <fpage>13</fpage>
          -
          <lpage>18</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>H.</given-names>
            <surname>Nemouchi</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          <article-title>Sztrik: Performance Simulation of Finite-Source Cognitive Radio Networks with Servers Subjects to Breakdowns and Repairs</article-title>
          ,
          <source>Journal of Mathematical Sciences 237.5</source>
          (
          <issue>2019</issue>
          ), pp.
          <fpage>702</fpage>
          -
          <lpage>711</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>H.</given-names>
            <surname>Nemouchi</surname>
          </string-name>
          , J. Sztrik:
          <article-title>Performance evaluation of finite-source cognitive radio networks with collision using simulation</article-title>
          ,
          <source>in: 2017 8th IEEE International Conference on Cognitive Infocommunications (CogInfoCom)</source>
          , IEEE,
          <year>2017</year>
          , pp.
          <fpage>000127</fpage>
          -
          <lpage>000131</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>H.</given-names>
            <surname>Nemouchi</surname>
          </string-name>
          , J. Sztrik:
          <article-title>Performance evaluation of finite-source cognitive radio networks with non-reliable services using simulation</article-title>
          ,
          <source>in: Annales Mathematicae et Informaticae</source>
          , vol.
          <volume>49</volume>
          , Eszterházy Károly University Institute of Mathematics and Informatics,
          <year>2018</year>
          , pp.
          <fpage>109</fpage>
          -
          <lpage>122</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>F.</given-names>
            <surname>Palunčić</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Alfa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. T.</given-names>
            <surname>Maharaj</surname>
          </string-name>
          ,
          <string-name>
            <surname>H. M.</surname>
          </string-name>
          <article-title>Tsimba: Queueing models for cognitive radio networks: A survey</article-title>
          ,
          <source>IEEE Access 6</source>
          (
          <year>2018</year>
          ), pp.
          <fpage>50801</fpage>
          -
          <lpage>50823</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Sztrik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Almási</surname>
          </string-name>
          , J. Roszik:
          <article-title>Heterogeneous finite-source retrial queues with server subject to breakdowns and repairs</article-title>
          ,
          <source>Journal of Mathematical Sciences 132.5</source>
          (
          <issue>2006</issue>
          ), pp.
          <fpage>677</fpage>
          -
          <lpage>685</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <surname>H. C.</surname>
          </string-name>
          <article-title>Tijms: A first course in stochastic models</article-title>
          , John Wiley and sons,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <surname>T. Van Do</surname>
            ,
            <given-names>N. H.</given-names>
          </string-name>
          <string-name>
            <surname>Do</surname>
            , Á. Horváth,
            <given-names>J.</given-names>
          </string-name>
          <article-title>Wang: Modelling opportunistic spectrum renting in mobile cellular networks</article-title>
          ,
          <source>Journal of Network and Computer Applications</source>
          <volume>52</volume>
          (
          <year>2015</year>
          ), pp.
          <fpage>129</fpage>
          -
          <lpage>138</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>L.-C.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.-W.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          <article-title>Adachi: Load-balancing spectrum decision for cognitive radio networks</article-title>
          ,
          <source>IEEE Journal on Selected Areas in Communications 29.4</source>
          (
          <issue>2011</issue>
          ), pp.
          <fpage>757</fpage>
          -
          <lpage>769</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>M. H.</given-names>
            <surname>Zaghouani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Sztrik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. Z.</given-names>
            <surname>Melikov</surname>
          </string-name>
          :
          <article-title>Reliability Analysis of Cognitive Radio Networks</article-title>
          ,
          <source>in: 2019 International Conference on Information and Digital Technologies (IDT)</source>
          , IEEE,
          <year>2019</year>
          , pp.
          <fpage>557</fpage>
          -
          <lpage>562</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>