• Journal of Information Processing Systems
• /
• v.13 no.3
• /
• pp.630-642
• /
• 2017

In this paper, we propose the opportunistic non-orthogonal multiple access (NOMA)-based cooperative relaying system (CRS) with channel state information (CSI) available at the source, where CSI for the source-to-destination and source-to-relay links is used for opportunistic transmission. Using the CSI, for opportunistic transmission, the source instantaneously chooses between the direct transmission and the cooperative NOMA transmission. We provide an asymptotic expression for the average achievable rate of the opportunistic NOMA-based CRS under Rayleigh fading channels. We verify the asymptotic analysis through Monte Carlo simulations, and compare the average achievable rates of the opportunistic NOMA-based CRS and the conventional one for various channel powers and power allocation coefficients used for NOMA.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1295-1302
• /
• 2011

We present an analytic model of an unslotted opportunistic spectrum access (OSA) network and evaluate its performance such as interruption probability, service completion time, and throughput of secondary users. Numerical examples are given to show the performance of secondary users in cognitive networks. The developed modeling and analysis method can be used to evaluate the performance of various OSA networks.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.35 no.4
• /
• pp.162-170
• /
• 2012

We propose a new priority discipline called the strict T-preemptive priority discipline, and derive the waiting time distributions of each class in the strict T-preemptive priority M/G/1 queue. Using this queueing analysis, we evaluate the performance of an opportunistic spectrum access in cognitive radio networks, where a communication channel is divided into time slots, a licensed primary user is assigned to one channel, and multiple unlicensed secondary users may opportunistically exploit time slots unused by the primary user. We also present a numerical example of the analysis of the opportunistic spectrum access where the arrival rates and service times distributions of each users are identical.

• ETRI Journal
• /
• v.34 no.2
• /
• pp.276-279
• /
• 2012

In this letter, a modified 802.11-based opportunistic spectrum access is proposed for single-channel cognitive radio networks where primary users operate on a slot-by-slot basis. In our opportunistic spectrum access, control frames are used to reduce the slot-boundary impact and achieve channel reservation to improve throughput of secondary users. An absorbing Markov chain model is used to analyze the throughput of secondary users. Simulation results show that the analysis accurately predicts the saturation throughput.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.141-144
• /
• 2010

OSA(Opportunistic Spectrum Access) allows secondary users not having a license for spectrum usage to opportunistically occupy an idle spectrum owned by a licensee named primary users. We propose two OSA schemes for un-slotted secondary users exploiting spectrum opportunities in un-slotted primary networks. We provide mathematical analysis and simulation results to reveal the impact of various system parameters.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.6
• /
• pp.1318-1323
• /
• 2013

We consider the design of opportunistic spectrum access schemes where secondary users can opportunistically access unused spectrum in non-slotted primary systems. Two non-slotted spectrum sensing and access schemes for secondary users are considered. We present experimental results that demonstrate the performance of the considered schemes.

• East Asian mathematical journal
• /
• v.27 no.1
• /
• pp.23-33
• /
• 2011

Due to underutilization of spectrum under current inefficient and static spectrum management policy, various kinds of opportunistic spectrum access (OSA) strategies have appeared. Myopic policy is a simple and robust OSA strategy with reduced complexity that maximizes immediate throughput. In this paper, we propose mathematical models to evaluate the throughput and the MAC delay of a myopic policy under saturation tra c conditions. Using the MAC delay distribution, we evaluate the packet delay of secondary users under nonsaturation conditions. Numerical results are given to show the performance of the myopic policy in cognitive radio networks.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2675-2690
• /
• 2014

We study the problem of optimal opportunistic spectrum access with unknown and heterogeneous channel dynamics in cognitive radio networks. There is neither statistic information about the licensed channels nor information exchange among secondary users in the respective systems. We formulate the problem of maximizing network throughput. To achieve the desired optimization, we propose a win-shift lose-stay algorithm based only on rewards. The key point of the algorithm is to make secondary users tend to shift to another channel after receiving rewards from the current channel. The optimality and the convergence of the proposed algorithm are proved. The simulation results show that for both heterogeneous and homogenous systems the proposed win-shift lose-stay algorithm has better performance in terms of throughput and fairness than an existing algorithm.

• Journal of Communications and Networks
• /
• v.16 no.1
• /
• pp.56-66
• /
• 2014

We propose a novel opportunistic access scheme for cognitive radios in an interweave cognitive system, that considers the channel gain as well as the predicted idle channel probability (primary user occupancy: Busy/idle). In contrast to previous work where a cognitive user vacates a channel only when that channel becomes busy, the proposed scheme requires the cognitive user to switch to the channel with the next highest idle probability if the current channel's gain is below a certain threshold. We derive the threshold values that maximize the long term throughput for various primary user transition probabilities and cognitive user's relative movement.