• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.1976-1996
• /
• 2011

Cognitive radio (CR) MAC protocol provides access control of unused spectrum resources without causing interference to primary users. To achieve this goal, in this paper a TDMA based cooperative multi-channel cognitive radio MAC (MCR-MAC) protocol is proposed for wireless ad hoc networks to provide reliable protection for primary users by achieving cooperative detection of incumbent system signals around the communication pair. Each CR node maintains transmission opportunity schedules and a list of available channels that is employed in the neighbor discovery period. To avoid possible signal collision between incumbent systems and cognitive radio ad hoc users, we propose a simple but efficient emergency notification message exchanging mechanism between neighbor CR nodes with little overhead. Our simulation results show that the proposed MCR-MAC can greatly reduce interference with primary users and remarkably improve the network throughput.

• Journal of Communications and Networks
• /
• v.17 no.4
• /
• pp.394-405
• /
• 2015

This paper considers a wideband cognitive radio network which can simultaneously sense multiple narrowband channels and thus aggregate the detected available channels for transmission and proposes a novel cognitive radio system that exhibits improved sensing throughput and can save power consumption of secondary user (SU) compared to the conventional cognitive radio system studied so far. More specifically, under the proposed cognitive radio system, we study the problem of designing the optimal sensing time and power allocation strategy, in order to maximize the ergodic throughput of the proposed cognitive radio system under two different schemes, namely the wideband sensing-based spectrum sharing scheme and the wideband opportunistic spectrum access scheme. In our analysis, besides the average interference power constraint at primary user, the average transmit power constraint of SU is also considered for the two schemes and then a subgradient algorithm is developed to obtain the optimal sensing time and the corresponding power allocation strategy. Finally, numerical simulations are presented to verify the performance of the two proposed schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7B
• /
• pp.538-549
• /
• 2008

Recently IEEE 802.22 WG has considered Cognitive Radio (CR) technology to overcome shortage of communication channels. For using CR technology, accurate and rapid sensing method selection is extremely important. According to the channel sensing method, it is of the utmost importance because it can affect the incumbent system protection. So, optimum selection of channel sensing method is very important. IEEE 802.22 gives the solution, name of fine sensing, but the solution can not adapt to various networks. So in this paper we propose Policy-based Channel Sensing Architecture and Algorithms for Cognitive Radio Networks. The proposed channel sensing architecture and algorithms can reduce both primary system detection time and quiet time in our simulation. Among the proposed sensing algorithm, channel division round robin sensing reduce average detection time up to 70% compare to fine sensing method in IEEE 802.22.

• Journal of Advanced Navigation Technology
• /
• v.13 no.2
• /
• pp.201-207
• /
• 2009

Recently effective spectrum resource technologies have been studied using a game theorectical approach for cognitive radio networks. Radio resource management is required an effective scheme because the performance of a radio communication system much depends on it's effectiveness. In this paper, we suggest a game theoretical algorithm for adaptive power control which is required an effect scheme in cognitive radio networks. It will be a distributed network. In the network distributed cognitive radio secondary users require an adaptive power control. There are many results which are suggested some possibility of game theoretical approaches for communication resource sharing. However, we suggest a practical game algorithm to achieve Nash equilibrium of all secondary users using a Nash equilibrium theorem in this paper. Particularly, a game model was analyzed for adaptive power control of a cognitive radio network, which is involved in DSSS (Direct Sequence Spread Spectrum) techniques. In case of K=63 and N=12 in the DSSS network, the number of iteration was less than maximum 200 using the suggested algorithm.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.4
• /
• pp.629-631
• /
• 2012

In Cognitive Radio network, spectrum selection scheme is one of a important part to manage idle spectrums efficiently. However, in CR networks, they have to adopt time-varying channel availability to minimize the interference to primary users (PU), and be able to manage spectrum resources efficiently. In this paper, we proposed a modified PF scheduler which can be appropriate to schedule downlink CR users and channels, by considering the fairness and the throughput as well as the primary user characteristics of each channel.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.344-347
• /
• 2011

In this paper, we propose the power control problem for cognitive radio networks (CRNs) that maximizes the total utility of the secondary users (SUs). We use the interference temperature constraints to protect the primary users (PUs). The utility functions of SUs can be any increasing functions. We formulate the power control problem as monotonic optimization that can be solved in centralization to achieve the global optimum.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.252-256
• /
• 2012

We consider resource allocation in femto-cell networks to maximize the throughput while minimizing interference to macro-users nearby. This can be achieved by allocating spectrum resource in a cognitive radio way. The proposed resource allocation is performed in two steps; spectrum sensing and resource scheduling. The femto base station detects idle frequency assignments (FAs) free from the occupation by macro-users and then allocates sub-channels in an idle FA to femto-users, effectively managing the interference problem. Finally, the effectiveness of the proposed scheme is verified by computer simulations.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.9 no.6
• /
• pp.353-360
• /
• 2014

In cognitive radio networks (CRNs), SU (secondary user)'s transmissions are frequently disrupted by PU (primary user)'s transmission. Therefore SU expereiences consecutive retransmission timeout and its exponential backoff, and subsequently, the TCP of SU does not proceed with the transmission even after the disruption is over or the SU succeeds to hold an idle channel. In order to solve this problem, we propose a cross-layer approach called TCP-Freeze-CR. Moreover we consider a practical scenario where either secondary transmitter (ST) or secondary receiver (SR) detects PU's transmission, which results in the need of spectrum synchronization mechanism. All of our proposals are implemented and verified with a real CRN testbed consisting of 6 software radios called USRP. The experimental results illustrate that standard TCP suffers from significant performance degradation and show that TCP-Freeze-CR greatly mitigates the degradation.

• Korean Management Science Review
• /
• v.29 no.2
• /
• pp.65-77
• /
• 2012

With the explosivley increasing demand in wireless telecommunication service, the shortage of radio spectrum has been worsen. The traditional approach of the current fixed spectrum allocation leads to spectrum underutilization. Recently, CR (Cognitive Radio) technologies are proposed to enhance the spectrum utilization by allocating dynamically radio resources to CR Networks. In this study, we consider a radio resource(power, subcarrier) allocation problem for OFDMA-based CRN in which a base station supports a variety of CUs (CRN Users) while avoiding the radio interference to PRN (Primary Radio Network). The problem is mathematically formulated as a general 0-1 IP problem. The optimal solution method for the IP problem requires an unrealistic execution time due to its complexity. Therefore, we propose an heuristic that gives an approximate solution within a reasonable execution time.

• Convergence Security Journal
• /
• v.21 no.1
• /
• pp.209-219
• /
• 2021

The problem of congestion in the licensed radio channels spectrum can be solved by Cognitive Radio Networks (CRN). Several algorithms exist to ensure the rendezvous between Secondary Users (SUs), they are increasingly efficient, allowing faster rendezvous under multiple scenarios. In parallel, several jamming algorithms are developed to counter rendezvous which are also improving. The goal in CRN is to ensure the rendezvous by warding such jammers with robust algorithms. In this paper, we classify various jamming techniques and analyze the performance of various well-known rendezvous algorithms under jamming attacks.