# Flexible Queuing Model for Number of Active Users in Cognitive Radio Network Environment

Authors: Ahsan Tanveer; Z. U. Khan; A. N. Malik; I. M. Qureshi
Journal: Wireless Communications and Mobile Computing
 (2018)

---

## Abstract

This work presents a Soft Queuing Model (SQM) for number of active users present in a cognitive radio network (CRN) at some given instant. Starting with the existing cellular network where the upper limit for the number of channels and active users is well defined. The idea is then extended to the complicated scenario of CRNs where the upper limit is not deterministic for both the number of channels and the active users. Accordingly a probabilistic SQM is proposed under the condition that the number of channels and active cognitive users are both random variables. The proposed model will be useful to offer the level of reliability to the clients connected with CRN and hence to offer secure communication even on a cooperative CRN. The proposed model has been verified theoretically and simulations have been carried out in diversified set ups to evaluate the performance.


---

## Body

## 1. Introduction

Cognitive Radios (CR) seems to be the prominent area of research in future communication systems including 5G which is based on Massive MIMO and heterogeneous networks [1, 2]. A reliable communication model for cognitive radio is the requirement of the time. With the development of the idea, its implication in almost all the existing communication setups, including 4G and mobile communication, and the momentum it has gained, it is definite to continue its research importance in future as well [3, 4]. Recent works on smart grid for future energy requirements also incorporate the idea of cognitive radio for communication in different layers of networks; i.e., the network of home appliances, the community, and then the mega scale networks up to metropolitan level are supposed to be exploiting the idea of cognitive radio for communications [5, 6].Surprisingly, a reliable channel model is still missing for cognitive radio. Specifically if we get the idea of cooperative users with a fusion centre operating in community in parallel with the primary networks and service providers, then, how much resources will be available to cognitive radio network is a basic question. This will also link with the level of reliability that a cognitive radio network may offer to its clients.There have been lot of research in CR, however, that focus on three major areas. The first one is the channel sensing [7, 8] while second one is the access of spectrum holes or channels [9] and the third one is optimization of resources to utilize the available channels for maximum throughout [10].Now in case of the reliable communication on cognitive radio network, the question will be how many users are present at some given instant [11] and how many channels are available to accommodate these users [12]? Answer to the questions lie in probability theory. The available channels to cognitive radio network will be based on the parameters such as the overall available/free channels in a primary base station operating in the region and of course on the sensing capability of the cognitive radio network under consideration.The second question related to the above discussed three major areas of CRN will have certain channels available and will be offering service to its clients; then, how many clients can be accommodated at a given instant is a question whose answer lies in queuing theory.A queuing model for number of channels occupied by the users in primary radio network is relatively less complicated and has been derived similar as in [13]. However, that is for infinite resources, which has been modified for the limited available resources; i.e., maximum available channels are assumed to be finite. That seems logical and is being employed in existing primary radio networks.In third phase the idea has been extended to the cognitive radio networks with flexible upper bound. Since the upper limit for available channels in cognitive radio networks is flexible hence, accordingly, a Flexible Queuing Model is being proposed in this paper. The model has been implemented in simulations and the results for diversified scenarios have been presented.Rest of the paper has been organized as follows: Section2 presents mathematical framework and proposed model for existing networks with fixed upper limit for number of users. In Section 3 proposed Flexible Queuing Model for cognitive radio networks is discussed. Section 4 presents the whole system model. Simulation results are given in Section 5 and the conclusion is included in Section 6.In the documentpj represents probability of j number of active users, while n and k are random variables representing, respectively, the available number of channels and number of active users for cognitive radio network.


## 2. Mathematical Framework and Proposed Model for Existing Networks

In case of existing mobile network models, the BS dedicates a fraction of available communication channels to accommodate the smooth hand over (HO). The HO is predictable based on the physical location of Mobile user; i.e., the handover probability will be on higher side near the cell boundaries. Yet there could be other causes for handover such as Quality of Service (QoS) and Conjunction; however, they are secondary reasons in comparison.In case of cognitive radios the available number of channels and hence the active users are random, depending on the sensing capabilities and occupying the available free spots for the spectrum. Hence the Flexible Queuing Model was the ultimate requirement to address this issue. Since the model was not available in the existing literature, therefore this model has been proposed to deal with two different scenarios which may be considered as an extension of M/M/1.Scenario-I. This case is considered in current Section 2 where the length of queue has been taken as finite. Yet this length is kept fixed. Accordingly the mathematical model has been developed and results have been derived for finite number of users (K in the manuscript).Scenario-II. The major contribution in our work is the environment in which the finite number K is taken as a random. Accordingly the phrase “Flexible Queuing Model” has been introduced in the title. All the derivations have been carried out and results have been generated for a stochastic upper limit as in Section 3.In case of existing cellular networks, the number of available channels for a BS is considered to be deterministic and fixed. Let this number be N. Moreover let the maximum allowable number of active users be K. Therefore, the extra channels, i.e.,hextra=N-K, will be reserved for handovers. The ratio of maximum allowable active users to the available channels reflects the worst situation that appears in peak hours when the entire K allowable channels will be occupied. As a matter of routine the number of active users will be random occupying a value from the set 0,1,...K. Assuming k number of active users at an instant when another user appears, the number will move to k+1 state and conversely; if an active user leaves the network, the system will move to k-1 state. Ultimately the number of active users will follow a queuing system model as illustrated in the Figure 1.Figure 1
Channel occupation and channel release model for active users in existing networks.In the figureα is the rate at which a new user appears and the process moves forward from state k to k+1 and 0≤k≤K-1 and β is the rate at which process moves backward from state k to k-1 when an active user leaves the system with the condition 1≤k≤K.Accordingly the probability of finding the process in statek at some given instant will be(1)pk=ςkp0,0≤k≤Kwhere ς=α/β and pk is the probability of finding the process in state k at some given instant. The detailed derivation may follow through the queuing model presented in [13].In order to computep0, i.e., the probability of finding the process in state-o at some given instant, we may apply the normalization i.e.∑k=0Kpk=1That is,1+ς+ς2+…+ςKp0=1.Now the series,1+ς+ς2+…+ςK=1+ς+ς2+…-ςK+1+ςK+2+…, which is the difference of two infinite series hence will be given as(2)p0∑k=1Kςk=p0∑k=0∞ςk-p0ςK+1∑k=0∞ςkp0∑k=0∞ςk-p0ςK+1∑k=0∞ςk=p01-ςK+1∑k=0∞ςk=1It will converge provided ς<1 and hence(3)p01-ςK+111-ς=1This gives(4)p0=1-ς1-ςK+1Thus(5)pj=ςj1-ς1-ςK+1with the condition that ς<1 and hence α<β. Therefore in this case the forward transition rate α which is the rate at which some new channel is needed must be less than the reverse transition rate β, which is the rate at which the channel is released by the user and is added back in the queue of available resources, which will be the ultimate condition for global balance.These transition probabilities and queuing model are valid for the existing cellular networks. Below is a little bit complicated model for cognitive radio network. This model will be applicable to the cognitive radio networks committed to provide specific level of reliability to the users.


## 3. Proposed Flexible Queuing Model for Cognitive Radio Networks

In above section we have proposed a queuing model for cellular networks. In this case a state is an indicator of the active number of users at some given instant. The advantage in case of above derivation was that the maximum allowable active users and number of channels, i.e.,K and N, were known to us and HO occurs with relatively less probability that was only pj. However, in case of CRN the situation will be little bit more complicated; i.e., the available number of channels in this case will be a random variable n which may take a value from the set {0,1,2,…,N} with respective probabilities changing with outcome. Evaluation of these probabilities may not be simple, specifically when there is the existence of multiple CRNs operating in parallel on cooperative basis. Yet having n available channels the CRN will be in position to accommodate k users which will be decided based on the level of reliability, i.e.,(6)hratio=hextrahactive=n-kk⇒k=nhratio+1Ratio in (6) is decided by the CRN fusion centre. Accordingly for k active users, m=hratio.k, where m=k≤n will be upper bounded, where n is the total number of channels available to CRN after sensing and it will be random as well.(7)k+m=n⇒k+khratio=n⇒k=n1+hratioThis k represents the maximum allowable users. Obviously k will also be a random variable in this case. Depending on this set up, the queuing system, as developed in case of above cellular model, will need to be flexible. The updated Figure 2 is given below.Figure 2
State model for channel occupation and release by active users in cognitive radio network.The transition ratesαc and βc in this scenario will be greater than their corresponding counterparts in previous section, i.e., αc>α and βc>β, which indicates more vibrant environment in this case.Theorem 1.
In given scenario, the state probabilitiespj and condition for convergence are derived as below.Proof.
Given fixedk, i.e., k=K, the state probabilities pj will become(8)pj=λj1-λ1-λK+1,0≤j≤KThe scenario of expression (8) is similar to that discussed in equation (5). However present scenario is flexible and λ=αc/βc. Similarly the condition for convergence will be βc>αc. Since k is random, the above probability in this case will become(9)pj=∑k=1Kλj1-λ1-λk+1Pk=kwhere Pk=k will be derived from Pn available channels for CRN which is based on the sensing strategies, the environment temperature, and number of active CRNs in given area. The expression in (9) is proposed with the help of probability theory and specifically total probability theorem.
Rearranging expression (9) we get(10)pj=λj1-λ∑k=0KPk=k1-λk+1=λj1-λPk=01-λ+Pk=11-λ2+…+Pk=K1-λK+1


## 4. Whole System Model

Following flowchart in Figure3 describes the whole system model including the architecture of primary and cognitive radio user environment.Figure 3
Model for channel occupation and release by active users in existing and CR networks.


## 5. Simulations

In order to verify the performance of proposed models, simulations are carried out in MATLAB. For this purpose different cases, under different situations, are considered.Case 1.
In Case1, the probability of number of active users for existing cellular networks is determined. For this purpose, the number of available channels and maximum number of active users for base station are taken as 20 and 15, respectively N=20,K=15. Random variable k representing number of active users will occupy values from the set 0,1,…,15. Required probabilities are determined using expression (5) for different values of ς, i.e., 0.75, 0.85, and 0.95. The corresponding probabilities are shown in Figure 4.Figure 4
Probabilities of different number of active users forς=0.75,0.85 and 0.95.Case 2.
This case deals with probability of active users for cognitive radio network. For this purpose letN= number of active users for primary BS=100.N′= number of vacant channels for cognitive users =N/2=50MCRN= number of cognitive networks = 5α= average number of channels per cognitive network =N′/MCRN=10Supposen= variance of σ=3.
The probability of active users for CRN is evaluated using Poisson random variable distribution in expression (10) and the resulting expression becomes(11)pj=λj1-λeα∑k=α-nα+n11-λk+1αkk!The resultant probabilities for λ=0.75,0.85,0.95 are shown in Figure 5.Figure 5
Probabilities of active cognitive users for Case2 when variance of σ=3.Case 3.
For Case3 simulations are performed under the same condition as Case 2 except the variance of σ which is taken to be as 5 and the simulation results are shown in Figure 6.Figure 6
Probabilities of active cognitive users for Case3 when variance of σ=5.Case 4.
Case4 is same as Case 2 except that the probability of active users for CRN is evaluated using uniform random variable distribution in expression (10) and the resulting expression becomes(12)pj=λj1-λ1N+1∑k=α-nα+n11-λk+1The resultant probabilities for λ=0.75,0.85,0.95 are shown in Figure 7.Figure 7
Probabilities of active cognitive users for Case4 when variance of σ=3.Case 5.
Case5 presents simulation for the comparison between numerical results for Uniform and Poisson distributions using different values of λ. These results are shown in Figure 8.Figure 8
Comparison of Uniform and Poisson distributions forλ=0.55,0.65,0.75.Above simulation results show that an exponential-like decay in probabilities is observed in almost all the plots by increasing the number of users. This is quite in line with the expectation, i.e., considering the expression (9), and λ is kept constant which is less than 1. Hence λK+1 will be negligible in comparison with 1 and(13)pj≈λj1-λ∑k=0KPk=k1-λk+1≈λj1-λ=λjwhere ∑k=0KPk=k≈1.Hence by increasingj, pj decreases exponentially as is evident from plots.In case we take the value ofλ closer to unity, the PDF becomes almost linear i.e., a straight line. It may be observed that the area under the curve which can be easily computed in case of straight line is approximately unity that is the normalization of PDF.


## 6. Conclusion

Methods of finding probabilities of number of active users for existing cellular networks and for cognitive radio networks are presented. For existing cellular networks, the number of channels for base station and maximum allowable number of active users are considered to be fixed. The state of the system at any time is defined by the number of active users at that time. The probability of the system to be in a particular state is evaluated on the basis of the rateα at which a new user appears in the system and the rate β at which an active user leaves the system. Then flexible queuing state model addresses the complicated scenario for cognitive radio networks where the available channels are actually the spare channels of primary BS. Hence both the number of channels for cognitive network and the maximum number of active cognitive users are not deterministic. The probability of the cognitive network system to be in a particular state is evaluated on the basis of the rate αc at which a new cognitive user may appear in the system, the rate βc at which an active cognitive user may leave the system and pmf of number of available channels.The work is important to deal with handover problem for number of active users in existing cellular networks and in cognitive radio networks on the basis of their probabilities.



---

*Source: 8349486-2018-12-19.xml*