• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.129-136
• /
• 2014

One of the fundamental issues in the design of dynamic spectrum access policy is the modeling of the dynamic behavior of channel occupancy by primary users. Under a Markovian modeling of channel occupancy, a periodic sensing and greedy access policy is known as one of the simple and practical dynamic spectrum access policies in cognitive radio networks. In this paper, the primary occupancy of each channel is modeled as a discrete-time alternating renewal process with generally distributed on- and off-periods. A periodic sensing and greedy access policy is constructed based on the general channel occupancy model. Simulation results show that the proposed policy has better throughput than the policies using channel models with exponentially distributed on- or off-periods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5820-5834
• /
• 2017

This paper investigates the channel selection problem with dynamic users and the asymmetric interference relation in distributed opportunistic spectrum access systems. Since users transmitting data are based on their traffic demands, they dynamically compete for the channel occupation. Moreover, the heterogeneous interference range leads to asymmetric interference relation. The dynamic users and asymmetric interference relation bring about new challenges such as dynamic random systems and poor fairness. In this article, we will focus on maximizing the tradeoff between the achievable utility and access cost of each user, formulate the channel selection problem as a directional graphical game and prove it as an exact potential game presenting at least one pure Nash equilibrium point. We show that the best NE point maximizes both the personal and system utility, and employ the stochastic learning approach algorithm for achieving the best NE point. Simulation results show that the algorithm converges, presents near-optimal performance and good fairness, and the directional graphical model improves the systems throughput performance in different asymmetric level systems.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.211-217
• /
• 2015

A dynamic spectrum access scheme with channel partitioning for secondary handover calls in cognitive radio networks is proposed to reduce forced termination probability due to spectrum handover failure. A continuous-time Markov chain method for evaluating its performance such as blocking probability, forced termination probability, and throughput is presented. Numerical and simulation results are provided to demonstrate the effectiveness of the proposed scheme with channel partitioning.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.11
• /
• pp.938-943
• /
• 2013

In this paper, we propose a transmission parameter optimization scheme based on genetic algorithm for dynamic spectrum access systems. Specifically, we represent a multiple objective fitness function as a weighted sum of single objective fitness functions to optimize transmission parameters, and then, obtain optimized transmission parameters based on genetic algorithm for given transmission scenarios. From numerical results, we confirm that the transmission parameters are well optimized by using the proposed optimization scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1489-1503
• /
• 2018

Spectrum reuse has attracted much concern of researchers and scientists, however, the dynamic spectrum access is challenging, since an individual secondary user usually just has limited sensing abilities. One key insight is that spectrum usage forecasting among secondary users, this inspiration enables users to obtain more informed spectrum opportunities. Therefore, spectrum usage forecasting is vital to cognitive radio networks (CRNs). With this insight, a spectrum usage forecasting model for the occurrence of primary users prediction is derived in this paper. The proposed model is based on auto regressive enhanced primary user emergence reasoning (AR-PUER), which combines linear prediction and primary user emergence reasoning. Historical samples are selected to train the spectrum usage forecasting model in order to capture the current distinction pattern of primary users. The proposed scheme does not require the knowledge of signal or of noise power. To verify the performance of proposed spectrum usage forecasting model, we apply it to the data during the past two months, and then compare it with some other sensing techniques. The simulation results demonstrate that the spectrum usage forecasting model is effective and generates the most accurate prediction of primary users occasion in several cases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3867-3886
• /
• 2015

This article investigates the problem of opportunistic spectrum access in dynamic environment, in which the signal-to-noise ratio (SNR) is time-varying. Different from existing work on continuous feedback, we consider more practical scenarios in which the transmitter receives an Acknowledgment (ACK) if the received SNR is larger than the required threshold, and otherwise a Non-Acknowledgment (NACK). That is, the feedback is discrete. Several applications with different threshold values are also considered in this work. The channel selection problem is formulated as a non-cooperative game, and subsequently it is proved to be a potential game, which has at least one pure strategy Nash equilibrium. Following this, a multi-agent Q-learning algorithm is proposed to converge to Nash equilibria of the game. Furthermore, opportunistic spectrum access with multiple discrete feedbacks is also investigated. Finally, the simulation results verify that the proposed multi-agent Q-learning algorithm is applicable to both situations with binary feedback and multiple discrete feedbacks.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.8
• /
• pp.853-860
• /
• 2012

In this paper, We shed light on radio spectrum policy and strategic planning of the United States of America and draw some conclusions. First of all, as the radio technology evolves with time, paradigm shift from command & control to market-based approach and spectrum commons is reviewed. Strategic spectrum planning of USA is also analyzed and some suggestions are drawn. In particular, USA plan for developing dynamic spectrum access(DSA) technologies and implementation of the test-bed for the DSA spectrum sharing is discussed, which improves the spectral utilization. Finally We deal with spectrum re-farming issue for mobile broadband and implicative points based on the National Broadband Plan.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.9
• /
• pp.2036-2040
• /
• 2013

In this paper, we consider two dynamic spectrum access schemes in cognitive network with two independent and identically distributed channels. Under the first scheme, secondary users switch channel only after transmission failure. On the other hand, under the second one, they switch channel only after successful transmission. We develop a mathematical model to investigate the performance of the second one and analyze the model using 3-dimensional embedded Markov chain. Numerical results and simulations are presented to compare between the two schemes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.59-68
• /
• 2010

In this paper, we present a new method to complete Dynamic Spectrum Access by modifying the reward function. Partially Observable Markov Decision Process (POMDP) is an eligible algorithm to predict the upcoming spectrum opportunity. In POMDP, Reward function is the last portion and very important for prediction. However, the Reward function has only two states (Busy and Idle). When collision happens in the channel, reward function indicates busy state which is responsible for the throughput decreasing of secondary user. In this paper, we focus the difference between busy and collision state. We have proposed a new algorithm for reward function that indicates an additional state of collision which brings better communication opportunity for secondary users. Secondary users properly utilize opportunities to access Primary User channels for efficient data transmission with the help of the new reward function. We have derived mathematical belief vector of the new algorithm as well. Simulation results have corroborated the superior performance of improved reward function. The new algorithm has increased the throughput for secondary user in cognitive radio network.

• Journal of Communications and Networks
• /
• v.17 no.4
• /
• pp.406-418
• /
• 2015

Cognitive radio networks (CRNs) have emerged as a promising solution to the problem of spectrum under utilization and artificial radio spectrum scarcity. The paradigm of dynamic spectrum access allows a secondary network comprising of secondary users (SUs) to coexist with a primary network comprising of licensed primary users (PUs) subject to the condition that SUs do not cause any interference to the primary network. Since it is necessary for SUs to avoid any interference to the primary network, PU activity precludes attempts of SUs to access the licensed spectrum and forces frequent channel switching for SUs. This dynamic nature of CRNs, coupled with the possibility that an SU may not share a common channel with all its neighbors, makes the task of multicast routing especially challenging. In this work, we have proposed a novel multipath on-demand multicast routing protocol for CRNs. The approach of multipath routing, although commonly used in unicast routing, has not been explored for multicasting earlier. Motivated by the fact that CRNs have highly dynamic conditions, whose parameters are often unknown, the multicast routing problem is modeled in the reinforcement learning based framework of learning automata. Simulation results demonstrate that the approach of multipath multicasting is feasible, with our proposed protocol showing a superior performance to a baseline state-of-the-art CRN multicasting protocol.