Performance Analysis of Slotted Secondary Transmission with Adaptive Modulation under Interweave Cognitive Radio Implementation
Abstract
In cognitive radio communication, unlicensed secondary user (SU) can access underutilized spectrum of the licensed primary user (PU) opportunistically for emerging wireless applications. With interweave implementation, SU has to perform spectrum sensing on the target frequency band and waits for transmission if PU occupies the channel. This waiting time results in extra delay for secondary transmission. In this paper, the delay and throughput performance of secondary packet transmission is evaluated with slotted transmission protocol. We propose a discretetime Markov model to characterize secondary slotted transmission process. Closeform solution of collision probability is obtained. We then carry out the queuing delay and throughput analysis based on a twodimensionalfinitestate Markov chain for smallsize packet transmission. For largesize packets, the distribution function of extended delivery time for secondary packet transmission is also derived. Selected numerical results are presented to illustrate the mathematical formulas and to validate our research results.
1 Introduction
Cognitive radio system is a promising solution to solve radio spectrum scarcity problem. Secondary user (SU) can explore the underutilized licensed frequency bands of primary system with opportunistic spectrum access (OSA) strategies. On the other hand, interference caused by secondary system has to be properly controlled so that the primary user’s (PU) communication is not significantly affected by opportunistic channel access. Various implementation strategies can apply to achieving opportunistic spectrum sharing [1, 2, 3]. With underlay cognitive strategy, SU and PU can transmit simultaneously subject to a SUtoPU interference constrain. As such, SU transmitter has to acquire SUtoPU channel information, which can be very challenging in practice. With interweave implementation, SU can transmit only when PU is off and must vacate the spectrum when PU starts transmission. Hence, SU transmitter has to monitor PU activity on the target frequency band and perform spectrum handoff adaptively for relinquishing or reaccessing the channel. Typically, multiple spectrum handoff are involved to complete the secondary transmission of a given amount of data, resulting in extra delay. The total service time consists an interleaved sequence of transmission slots and waiting slots.
With interweave implementation, SU performs spectrum sensing
The delay and throughput analysis for secondary transmission is of considerable current research interest in cognitive radio. [10] investigates the average waiting time and average service time of SU in one transmission slot with general primary model. [11] derives the distribution function of service time to SU within a fixed period of time. So as to evaluate the delay performance for secondary users, [12] proposes a priority virtual queue model. In cooperative wireless communication, [13] investigates the probability of successful transmission with the hard delay constraints. [14] analyzes the endtoend performance of an interweave cognitive radio network in terms of the throughput and delay. In [15], a queueing performance analysis is carried out for dynamic spectrum accessing of secondary users. A dynamic spectrum selection method is proposed in [16] to minimize the delay for secondary transmission in a preemptive resume M/G/1 queueing network. SU delay and throughput evaluation with slotted transmission is barely investigated to the best of our knowledge.
The concept of EDT was first introduced to derive the throughput bounds and delay performance of SU in cognitive radio transmission system [17]. Generally, EDT consists of an interleaved sequence of transmission slots and waiting slots. By taking into account of the waiting time during secondary packet transmission, EDT is a significant performance metric for cognitive systems. [18] investigates EDT considering the spectrum sensing error.[19] studies EDT for cognitive radio system with multiple available channels and multiple SUs. The statistical characteristic of EDT depends on both spectrum sharing strategy and packet transmission policy. SU can adopt either workpreserving strategy [18, 19], where SU restarts transmission from the breaking point without wasting previous transmission, or nonworkpreserving strategy, where the SU retransmits the whole packet after reaccessing to the channel. Workpreserving strategy is achievable with the help of rateless codes [20, 21, 22], and also applies to the transmission of individuallycoded small packets. In [5], the exact PDF of EDT for secondary packet transmission is derived for workpreserving strategy. Corresponding queuing delay is also evaluated with the help of firstorder and secondorder moments of EDT. Here, we focus on workpreserving strategy.
Previous works on throughput and EDT investigation concentrate on waiting time analysis while assuming the transmission time is constant. Transmission time was evaluated as the ratio of packet size over instantaneous channel capacity for slow fading case or as the ratio of packet size over ergodic channel capacity for fast fading case. However, with adaptive modulation (AM), which can guarantee reliability, the information rate during transmission may be adjusted as packet transmission experiences various channel realization, leading to varying transmission time for fixedlength packet. AM can take advantage of better channel conditions to improve data throughput, with a guaranteed bit error rate (BER) [23]. SU can only access the channel when PU is off, throughput improvement is critical in secondary system design. The queuing performance with adaptive modulation and coding technique in conventional communication system is studied in [24]. However, with cognitive implementation, the analytical approach is different since SU has to wait for transmission.
In this paper, we extend previous work on performance evaluation of secondary transmission by considering AM and practical sensing strategy. Specifically, we investigate the queuing performance for shortpacket transmission and obtain the probability mass function (PMF) of EDT for longpacket transmission. The major contribution of this work can be summarized as:

We propose a threestate discretetime Markov chain to model the secondary transmission with slotted communication protocol. With practical spectrum sensing strategy, secondary transmission may cause interference to primary communication. Thus, the steadystate probability is calculated to evaluate the collision probability.

We propose a twodimensional Markov model, characterizing SU transmission process, secondary channel realization and queue dynamics, to evaluate the queuing delay, throughput and packet drop probability of shortpacket transmission with AM.

For largesize packet, multiple slots are required to complete transmission. The analytical expression of PMF for EDT is also derived considering both fixedrate transmission and AM. Selected numerical results are presented to illustrate and validate our analysis.
The rest of this paper is organized as follows. In Section II, we illustrate the system model, channel model, and problem formulation. In Section III, we introduce a threestate Markov chain to model slotted secondary transmission. In section IV, we study the secondary queuing performance with the help of a twodimensional Markov model. The PMF of EDT for large packet transmission over secondary link is derived in Section V. The paper is concluded in Section VI.
2 System and channel Model
We assume that SU opportunistically accesses a PU channel in an interweave fashion. The PU behaviour on the channel is modeled by a twostate homogeneous continuoustime Markov chain, where state represents that PU is transmitting (i.e. channel unavailable for secondary transmission) and state corresponds that PU is not transmitting. Researches on IEEE 802.11 Wireless LAN (WLAN) support a semiMarkov model for various traffic types. As such, Markov model serves as a reasonable alternative [25, 26, 27]. The sojourn time in states and follow independent nonidentical (i.n.d) exponential distribution with average and , respectively.
SU employs a slotted transmission strategy, as illustrated in Fig. 1. SU periodically senses the PU channel with a fixed sensing interval . SU transmission decision is based on sensing results. If PU channel is sensed busy, SU will wait for another duration and sense again. If the channel is sensed free, SU starts or continues its transmission immediately. Here, we assume that is sufficiently small, and the chance that PU activity changes twice in one is negligible. As such, if the channel is sensed free at two consecutive sensing instants, secondary transmission after the first sensing instant will not collide with PU transmission. However, if the channel is sensed busy after being sensed free, the secondary transmission will interfere primary transmission. We also assume that sensing duration is negligible compared to . Hence, is approximately equal to the time duration that SU transmits or waits.
Secondary transmission adopts channel adaptive transmission over each transmission interval . To implement adaptive modulation, SU transmitter sends a pilot signal once the spectrum sensed free. The receiver estimates the received SNR from the pilot signal and determines which SNR region it falls into. Then, the receiver feeds back the index of the selected modulation scheme to the transmitter via an errorfree feedback channel. After that, the transmitter and the receiver will be configured to use identical modulation scheme. Specifically, the transmission rate measured in bits/symbol is chosen based on the secondary channel quality in each . The value range of received signaltonoise ratio (SNR) of secondary channel, denoted by , is divided into regions, . If falls in region over a transmission interval , rate will be used. The transmission rate remains constant over one and may change to a different value independently for next transmission interval.
The boundaries for SNR regions, ’s, are selected to maintain a target instantaneous bit error probability . For example, if we adopt ary square QAM modulation schemes, whose approximate BER is given by
(1) 
then, the boundary SNR can be calculated for as [28]
(2) 
The probability that transmission rate is used, denoted by , equals to the probability that falls into region , which can be calculated as
(3) 
where represents the probability density function of received SNR.
3 Markov model for secondary transmission
We form a threestate discretetime Markov chain to characterize SU activity, where state represents that SU is waiting for transmission over a , state that SU transmits without collision during a and state that SU transmission collides with PU transmission, as illustrated in Fig. 2. Let denote the sensing result at the start of th . Specifically, implies that the channel is sensed busy at the start of th , and PU is on with the perfectsensing assumption. corresponds that channel is sensed free and PU is off the start of th . The transition probability from state to state is calculated as
(4) 
where is the probability that PU is sensed on at current sensing instant given PU is also on at previous sensing instant, and represents the probability that PU is sensed off given previous sensing result is also off. can be calculated as the probability that PU busy/idle duration is larger than and given by [29]
(5) 
respectively. Similarly, the transition probability from state to state is calculated as
(6) 
Other transition probabilities can be similarly obtained. Thus, the transition probability matrix of the threestate Markov chain is given by
(7) 
(11) 
The stationary distribution of the Markov chain can be calculated by normalizing the eigenvector of corresponding to eigenvalue one as
(8) 
An immediate application of the Markov chain modeling is to evaluate the collision probability with slotted secondary transmission strategy. Fig. 3 plots the collision probability as a function of sensing interval for different primary transmission parameters. Larger or larger results in smaller collision probability. Note that collision only occurs when PU restarts transmission. We also observe that collision probability increases for a longer sensing period as expected by intuition.
4 Queueing Analysis of Secondary Packet Transmission
(15) 
In this section, we apply the threestate Markov chain developed in previous section to evaluate the queueing performance of secondary packet transmission. We assume that SU information data is fragmented into equalsize small packets. The packet size is chosen such that packets can be transmitted over one when the primary channel is available and secondary link can support transmission rate , where corresponds to the case that SU decides not to transmit due to unacceptable secondary link quality. The newly arrived packet will be put into a firstinfirstout (FIFO) buffer with waiting positions before being delivered over the next available transmission slot, as illustrated in Fig. 4. New arrival will be dropped if the queue is full. Only those packets that are successfully received will be removed from the buffer. During each , at most one packet may arrive at the SU transmitter with probability . Let represent the number of packet arrives during the th . We have
(9) 
The service process is independent of the arrival process. We denote the service state of the th as , where . When , SU waits for channel availability. When , collision occurs and no packet was successfully transmitted. When and rate is used, packets are transmitted successfully.
Let denote the instantaneous queue length at the beginning of th , where . As such, depends on , and , as illustrated in Fig. 5. Specifically, the queue length will be updated as
(10) 
To investigate secondary queuing performance, we construct a twodimensional Markov chain with state being the pair, as illustrated in Fig. 6. Let denote the transition probability from state to state . Accordingly, the state transition probability matrix, denoted by , is organized in Eq. (11), at the top of next page. The transition probabilities can be further simplified, while noting that current service state is only dependent on previous service state, as
(12) 
can be calculated by the transition probabilities given in Eq. (7) in Section III. As such, Eq. (11) is rewritten in a block form as
(13) 
where represents zero matrix, , and are of the form
(14) 
with . As derived in Appendix A, submatrices , and are given by Eq. (15) and Eq. (16), respectively.
(16) 
The steady state probabilities of the twodimensional Markov chain, denoted by
(17) 
is the left eigenvector of corresponding to eigenvalue one, which can be calculated from the forward equations and the normalization equation. The stationary distribution of queue length can be found as .
Fig. 7 compares the analytical results of stationary distribution of the queue length against corresponding Monte Carlo simulations, where a fourstate AM system with transmission rates bits/symbol is used. We also assume that channel gain of secondary link follows Rayleigh distribution. The perfect match here validates our analytical approaches. As average received SNR, denoted by , gets larger, higherorder modulation schemes are used more frequently. Hence, is larger for smaller . For larger , SU transmits less packets while PU is idle, which results in higher for larger . for larger decreases with decreasing since SU has more chances to acquire the channel.
We evaluate the queuing performance in term of packet drop probability, throughput, and queuing delay. Packet drop occurs when arriving packet finds that the queue is full, the probability of which is calculated as
(18) 
The average throughput of secondary system, denoted by , can be calculated as
(19) 
where is the stationary probability that SU transmits without collision, given by Eq. (8), and is the average number of packets been successfully transmitted per given packets waiting in the queue, which can be calculated as
(20) 
The average queuelength, denoted by , can be calculated as . Applying Little’s law, the average queuing delay can be calculated as
(21) 
In Fig. 8, we plot the average queuing delay as a function of arriving probability. The average delay saturates as input traffic intensity grows because packets are dropped when queue is full. For smaller or larger , SU has less chances to employ the channel leading to a larger saturate value. As increases, SU transmits with higher rate more frequently, which helps reduce the queuing delay. Fig. 9 shows the average throughput versus arriving probability for various PU parameter and secondary link quality. For larger , smaller or lager , SU can transmit for longer period or more packets on average. As such, average throughput saturates to a larger value at a lager arriving probability. When average throughput approaches its maximum, packet drop probability increases sharply as expected by intuition (see Fig. 10).
(24) 
5 EDT analysis for Largesize packet transmission
For largesize packet, multiple ’s are required to complete single packet transmission. As such, packet service time consists of waiting time and transmission time. We derive the statistics of EDT assuming fixedrate transmission and variablerate transmission in the following subsections.
5.1 FixedRate Transmission
Firstly, we derive the PMF of EDT () for a fixedsize packet transmission with a fixed data rate. should include all the waiting intervals, collision intervals and transmission intervals before transmission completed. Suppose that transmission is accomplished over transmission intervals, which can be approximated by
(22) 
where represents the entropy of the packet, and is the data rate. Specifically, the PMF of depends on the state of the first at the instant of packet arrival. Conditioning on that the first is in state , and . The PMF of can be calculated as
(23) 
where , and denote the conditional PMF of given that the first is in state , and , respectively, which are derived in Appendix B. The PMF of for secondary slotted transmission with fixed data rate can be calculated by Eq. (24) revealed at the bottom of nest page. Fig. 11 compares the analytical result of and corresponding Monte Carlo simulation. The plot shows that the analytical result conform to the simulation result. Fig. 12 shows the PMF envelope of EDT with periodic sensing for various values of packet size and PU parameters. Both average value and variance of increases with . Larger size packet requires more transmission intervals (i.e. a larger is estimated by Eq. (22)), which leads to even more waiting intervals and collision intervals before transmission completed. When SU has more chance to acquire the channel because of the larger or smaller , both average and variance of decreases. This is mainly because, in a sequence, the number of waiting intervals reduces with increasing or decreasing .
5.2 VariableRate Transmission
When AM is used, transmission intervals required to complete transmission is no longer constant but a random variable depending on secondary channel realization. transmission intervals are needed only if data transmitted over transmission intervals is less than packet size , whereas data transmitted over transmission intervals is greater than the packet size. The probability that transmission time, denoted by , is equal to ’s can be formulated as
(25) 
where denotes the data rate used in the last transmission interval. As such, is a random variable (i.e. with probability ). denotes the data transmitted over the first transmission intervals. If secondary user received SNR falls into region at the th interval, is used (i.e. ). By conditioning on the channel realization of the th transmission interval, we have
(26) 
Suppose that, during the first transmission intervals, SU received SNR falls into region in total times, , where ’s satisfy . Let represent one certain channel realization over the first transmission intervals. Applying the result of multinomial distribution, we arrive at
(27) 
Note the independence between different channel realizations, we have
(28)  
The inner sum in Eq. (28) is carried out over all ’s satisfying that falls into region . Substituting Eq. (28) into Eq. (26), the probability of transmission slots required is given by [30]
(29) 
The distribution of can be obtained by conditioning on as
(30) 
where is the distribution of EDT given intervals required, shown in Eq. (24). In practical, the value of can not be infinity, since the packet size is fixed. Fig. 13 compares the envelope of PMF of versus various secondary channel quality. As channel quality gets better, both average and variance of decreases since less intervals are required to complete transmission. Note that, when channel quality is poor, more time is required to accomplish transmission even with AM, compared to fixedrate transmission. This is because that lower rates are frequently used, or SU decides not to transmit mostly.
6 Conclusion
In this paper, we studied packet transmission performance of slotted secondary transmission. We firstly proposed a threestate discretetime Markov chain to model secondary slotted transmission with periodic spectrum sensing. The stationary probabilities that SU waits/transmits/collides with PU transmission are calculated. The Markov model is then applied to analyze the delay performance of secondary packet transmission. For short packet transmission, a two dimensional Markov chain is formed to evaluate the queuing delay, average throughput and packet drop probability assuming SU adopts adaptive modulation. When packet size is large, we derive the PMF of EDT considering both fixedrate and variablerate transmission, respectively. Ongoing effort is being carried out to multiplePUmultipleSU cognitive radio network and imperfect sensing scenarios.
Appendix A Derivation of transition probability for twodimensional Markov chain
In this appendix, we derive the transition probabilities in , and , respectively. We firstly derive each entry in matrix , denoted by . Note that packets are successfully transmitted when rate is used, which is selected with probability . For , given and , the queue can not be emptied even the highest rate is used if . If , only when the secondary link can support rate or higher as well as no packet arrives in the th . Hence, the entries in first row in can be calculated by
(31) 
If , based on the queue recursion, when one packet arrives in the th . If , only when departures and no arrival, or at least packets departed and one packet arrives. If , only when highest rate, , is used and no packet arrives. For , can not be one. Then, the entries in second row can be calculated as
(32) 
Following similar analytical step, when , the entries can be calculated by
(33) 
The special case can be calculated by
(34) 
Substituting all the entries in Eq. (14), is given by Eq. (15).
If or , the queue length would remain unchanged or add up one, depending absolutely on the arrival process. Hence,
(35) 
As such, the corresponding transition matrix given SU waits or collides with PU transmission at current is given by Eq. (16).
Appendix B Derivation of PMF of EDT for large packet transmission
In this appendix, we derive the conditional PMF of EDT of packet transmission given the first interval is in state , and respectively, as illustrated in Fig. 14. Let denote the amount of intervals given that the previous interval is in state . Note that, once collision occurs, the following interval would be a waiting interval, we have . And when the number of transmission intervals is estimated by Eq. (22), .
Suppose that, during SU packet transmission, PU switches from busy to idle times in total, . Conditioning on starting with a slot, we have , and . And . The conditional PMF of can be further simplified as
(36) 
Applying binomial distribution, we have
(37) 
Conditioning on , it takes sensing instants to find out secondary transmission can start or restart times. Suppose , applying negativemultinomial distribution, we have
(38) 
Substituting Eq. (37) and Eq. (38) into Eq. (36), we have