American Journal of Signal Processing
p-ISSN: 2165-9354 e-ISSN: 2165-9362
2011; 1(1): 12-16
doi: 10.5923/j.ajsp.20110101.03
D. T. Do
Department of Communications Engineering, School of Electrical and Electronics Engineering, Ton Duc Thang University, Ho Chi Minh City, Vietnam
Correspondence to: D. T. Do , Department of Communications Engineering, School of Electrical and Electronics Engineering, Ton Duc Thang University, Ho Chi Minh City, Vietnam.
| Email: | ![]() |
Copyright © 2012 Scientific & Academic Publishing. All Rights Reserved.
Recently, both optimal and suboptimal spectrum sensing approaches have attracted extensive attention in wireless communications field. Thanks to opportunistic spectrum access schemes, different cognitive users can cooperatively search for and exploit instantaneous spectrum availability. In this paper, we address the analysis of spectrum sensing in opportunistic spectrum access models and then determine throughput of the cognitive radio system. Our goal in all designs is reach optimal access policy for each channel with the high cooperative sensing performances.
Keywords: Cognitive Radio, Spectrum Sensing
Cite this paper: D. T. Do , "Performance Analysis of Suboptimal Spectrum Sensing Algorithm in Cognitive Networks", American Journal of Signal Processing, Vol. 1 No. 1, 2011, pp. 12-16. doi: 10.5923/j.ajsp.20110101.03.
. These N channels are licensed to a primary network whose users operate following the synchronous slot structure. The traffic of all of the PUs are such that the occupancy of these N channels obeys a discrete-time Markov chain with
states. The network state in the slot is given by
where
is a set of
. Assuming that the spectrum usage statistics of the PUs’ network remain unchanged during T slots. In fact, this spectrum is licensed to a primary network, whose users are operated in a synchronous time-slotted fashion. Since the primary network does not use the whole spectrum all the time, it is assumed that the probability of channel being occupied by the primary network in one time slot is
. These values are affected by the channel allocation schemes and traffic statistics of the primary network. Besides, our duties focus on maximizing SU’s total channel utilization while limiting its interference to the PUs. We also model the interference between PU and SU via the average temporal overlap. The formulation describes the interference
between SU and PUi is ![]() | (1) |
is the indicator function of the event enclosed in the brackets;
and
denote the event that PUi and SU access channel
at time
, respectively.The channel utilization is defined as the SU’s temporal utilization ratio (i.e., the transmission time divided by the total time). These SU’s channel utilization
on channel
is![]() | (2) |
where
is the probability that channel
is available at the beginning of a slot. As a result, the dimension of the sufficient statistic reduces from
to N. This result points to the possibility of significantly reducing the computational complexity of the optimal Opportunistic Spectrum Access issues. Through the sufficient statistic, we apply the suboptimal scheme based on a greedy approach that maximizes per slot throughput. The analyzed systems have independently channels. ![]() | Figure 1. The Markov chain diagram |
transits from the state 0 to state 1 with the probability
and stays in the state 1 with the probability of
. We gain the expected reward in the slot
if channel c is selected as follow![]() | (3) |
is the probability that channel
will be available in the slot
. Applying the greedy approach, the action in slot
is chosen aiming to maximize the immediate reward below![]() | (4) |
![]() | (5) |
and the observation at the end of the slot
;
function represents the updated knowledge of the network state after incorporating the action and observation obtained in selected slot[13-18].Note that when the channel is not sensed, the probability of its availability is updated according to the Markov chain. But channel is sensed will be lead to the belief vector records the channel state prior to the state transition at the beginning of each slot.
and transition probabilities
.In the first experiment, we set up 4 independent channel for determining the throughput. If we increase the alpha probability parameter then its throughput degraded seriously.Next, we present the different number of the sensed channels in Figure 3. We can see the more channel based spectrum sensing method has better performance compared to another. Consequently, through this illustration we gain optimal performance together with design of the communication links between the source nodes and destination nodes properly. This result confirms the chosen suboptimal spectrum sensing methodology will be reduced the complexity in computational functions.![]() | Figure 2. Throughput analysis of the Greedy approach |
![]() | Figure 3. The performance comparison with different schemes |
![]() | Figure 4. The optimal and Greedy schemes |