• The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.3 s.59
• /
• pp.17-25
• /
• 2006

석유, 철강 등과 함께 주파수 자원은 정보화 사회에서 소중한 자산으로 사용이 한정되어 있는 유한자원이다. 새로운 서비스를 위해 새로 할당할 대역이 더 이상 남아 있지 않는 지금, 주파수 부족 현상은 광대역 멀티미디어 통신 서비스를 제공해야 하는 차세대 무선 통신 서비스를 실현함에 있어서 큰 걸림돌이 될 것으로 예상된다. 하지만 FCC의 보고에 따르면 할당된 주파수 대역이 효율적으로 사용되고 있지 않음을 확인할 수 있다 이러한 관찰은 주파수 부족 현상이 주파수 자원이 가지고 있는 유한성의 문제보다는 비효율적으로 운영되고 있는 주파수 관리 방식에 원인이 있다는 것을 말해준다. Cognitive Radio 기술은 이렇게 비효율적으로 사용되고 있는 지금의 상황을 해결해줄 수 있는 기술로 주목받고 있다. Cognitive Radio에 대한 많은 연구가 지금까지 진행되어 왔지만 아직까지 단일화된 정의나 구체적인 시나리오가 제시되지 않은 상태이다. 이에 따라 본 고에서는 Cognitive Radio 기술이 적용될 수 있는 구체적 시나리오를 파악하고자 주요 관점 별로 구체적인 시나리오를 제시하고 각 시나리오에 따라서 Cognitive Radio 기술이 어떠한 방식으로 주파수 사용 효율을 높일 수 있는 지와 이때 요구되는 핵심 기술들에 대해 논의한다.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.146-154
• /
• 2014

This paper proposes a bandwidth-aware localized-routing algorithm that is capable of sensing the available spectrum bands within a two-hop neighboring for choosing the highly opportunistic routes. A mixed-integer linear programming (MILP) is utilized to formulate the optimization problem. Then, the proposed algorithm is used to determine the maximum bandwidth possible of link pairs via a bandwidth approximation process of relaxed variables. Thereby, the proposed algorithm can allow selected routes corresponding to maximum bandwidth possible between cognitive radio (CR) users through link pairs in cognitive radio networks. By comparing the solution values to previous works, simulation results demonstrate that the proposed algorithm can offer a closed-optimal solution for routing performance in cognitive radio networks. The contribution of this paper is achieved through approximately 50% throughput utilized in the network.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.475-490
• /
• 2010

Cognitive Radio is an advanced enabling technology for the efficient utilization of vacant spectrum due to its ability to sense the spectrum environment. It is important to determine accurate spectrum utilization of the primary system in a cognitive radio environment. In order to define the spectrum utilization state, many CR systems use what is known as the quiet period (QP) method. However, even when using a QP, interference can occur. This causes reduced system throughput and contrary to the basic condition of cognitive radio. In order to reduce the interference time, a frequency-hopping algorithm is proposed here. Additionally, to complement the loss of throughput in the FH, a HMM-based channel prediction algorithm and a channel allocation algorithm is proposed. Simulations were conducted while varying several parameters. The findings show that the proposed algorithm outperforms conventional channel allocation algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.3655-3673
• /
• 2014

Rendezvous is a process of two or more cognitive radio nodes gathering on the same channel at the same time for a negotiation to establish data communications. This paper discusses rendezvous issues in cognitive radio networks. It details why rendezvous is an issue in cognitive radio networks and how rendezvous works. It classifies channel access methods, and details sequence-based channel-hopping methods. It surveys existing works on blind rendezvous and compares the proposed algorithms in terms of the maximum time to rendezvous. This paper discusses the properties that an efficient channel-hopping rendezvous algorithm should have and illustrates common issues in the existing rendezvous methods. It also explains open research issues in the rendezvous area.

• Journal of Communications and Networks
• /
• v.14 no.6
• /
• pp.710-718
• /
• 2012

The implementation of a common control channel is one of the most challenging issues in cognitive radio networks, since a fully reliable control channel cannot be created without reserving bandwidth specifically for this purpose. In this paper, we investigate a promising solution that exploits the ultra wide band (UWB) technology to let cognitive radio nodes discover each other and exchange control information for establishing a communication link. The contribution of this paper is threefold: (i) We define the communication protocol needed to let cognitive radio nodes discover each other and exchange control information for link set up, (ii) we overcome the gap in coverage, which typically exists between UWB and long-medium range technologies, by using multi-hop communication, (iii) we evaluate the performance of our approach by adopting an accurate channel model and show its benefits with respect to an in-band signaling solution.

• Journal of Information Processing Systems
• /
• v.10 no.1
• /
• pp.119-131
• /
• 2014

In recent literature on traffic scheduling, the combination of the two-dimensional discrete-time Markov chain (DTMC) and the Markov modulated Poisson process (MMPP) is used to analyze the capacity of VoIP traffic in the cognitive radio system. The performance of the cognitive radio system solely depends on the accuracy of spectrum sensing techniques, the minimization of false alarms, and the scheduling of traffic channels. In this paper, we only emphasize the scheduling of traffic channels (i.e., traffic handling techniques for the primary user [PU] and the secondary user [SU]). We consider the following three different traffic models: the cross-layer analytical model, M/G/1(m) traffic, and the IEEE 802.16e/m scheduling approach to evaluate the performance of the VoIP services of the cognitive radio system from the context of blocking probability and throughput.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.911-923
• /
• 2014

Ad hoc cognitive radio wireless sensor networks allow secondary wireless sensor nodes to recognize spectrum opportunities and transmit data. Most existing protocols proposed for ad hoc cognitive radio wireless sensor networks require a dedicated common control channel. Allocating one channel just for control packet exchange is a waste of resources for channel-constrained networks. There are very few protocols that do not rely on a common control channel and that exchange channel-negotiation control packets during a pre-allocated time on the data channels. This, however, can require a substantial amount of time to access the channel when an incumbent is present on the channel, where the nodes are intended to negotiate for the data channel. This study examined channel access delay on cognitive radio wireless sensor networks that have no dedicated common control channel.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.6
• /
• pp.1379-1397
• /
• 2013

We consider a system where a licensed radio spectrum is shared by multiple primary users(PUs) and secondary users(SUs). As the spectrum of interest is licensed to primary network, power and channel allocation must be carried out within the cognitive radio network so that no excessive interference is caused to PUs. For this system, we study the joint beamforming and power allocation problem via game theory in this paper. The problem is formulated as a non-cooperative beamforming and power allocation game, subject to the interference constraints of PUs as well as the peak transmission power constraints of SUs. We design a joint beamforming and power allocation algorithm for maximizing the total throughput of SUs, which is implemented by alternating iteration of minimum mean square error based decision feedback beamforming and a best response based iterative power allocation algorithm. Simulation results show that the algorithm has better performance than an existing algorithm and can converge to a locally optimal sum utility.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.123-127
• /
• 2009

Cognitive Radio rules provide that the user outside service region should not utilize communication system in Cognitive Radio environment. The reason why main user should use service without any loss and interference. If this rule is guaranteed, CR users are able to be offered enough services outside service region. In this paper, we target the issue which can operate practical cognitive systems even without causing excessive interference to legacy users. Also, we focus use on non-interference to the primary system rather than realizable benefits for the secondary systems, and using the proposed device. In this paper, we present the possible scheme using Bi-directional Beamforming Antenna.