• 융합보안논문지
• /
• 제21권1호
• /
• pp.209-219
• /
• 2021

허가 된 무선 채널 스펙트럼의 혼잡 문제를 해결하는 방법으로 인지무선네트워크(CRN, Cognitive Radio Networks)가 많은 주목을 받고 있다. 보조 사용자 (SU) 간의 랑데뷰를 보장하기 위해 여러 알고리즘들이 존재하며 점점 더 효율적인 알고리즘들이 개발되어 다양한 시나리오에서 빠른 랑데뷰가 가능해지고 있다. 동시에 개선되고 있는 랑데뷰 알고리즘을 공격하기 위해 여러 재밍 알고리즘들이 개발되고 있다. CRN의 목표는 강력한 알고리즘으로 이러한 재밍 공격을 최소화 하여 랑데뷰를 보장하는 것입니다. 이 논문에서는 다양한 재밍 기술들을 분류하고 잘 알려진 여러 랑데뷰 알고리즘들의 재밍공격 상황하에서의 성능을 분석하였다.

• 한국통신학회논문지
• /
• 제39B권11호
• /
• pp.803-809
• /
• 2014

본 논문에서는 면허 사용자와 감청 사용자가 존재하는 인지무선 네트워크에서 릴레이 선택 기능을 이용한 물리 계층 보안 시스템을 제안하고 성능을 분석한다. 먼저 감청에 대한 보안성 확보를 위해 수신기 측에서의 채널 정보를 이용하는 기회적 최적 릴레이 선택 방법과 다중 안테나 다이버지시티를 이용하는 시스템을 제안한다. 이러한 시스템에서 인지무선 네트워크의 보안 outage 확률을 정의하고 수학적으로 정확한 확률 식을 유도한다. 아울러 송신전력에 제한이 없는 경우에 대한 점근적 outage 확률을 구한다. 수치 해석 결과를 제시함으로써 유도한 확률식의 정확성을 검증한다.

• 경영과학
• /
• 제29권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.

• Journal of Communications and Networks
• /
• 제18권1호
• /
• pp.112-122
• /
• 2016

Cognitive radio (CR) is considered an attractive technology to deal with the spectrum scarcity problem. Multi-radio access technology (multi-RAT) can improve network capacity because data are transmitted by multiple RANs (radio access networks) concurrently. Thus, multi-RAT embedded in a cognitive radio network (CRN) is a promising paradigm for developing spectrum efficiency and network capacity in future wireless networks. In this study, we consider a new CRN model in which the primary user networks consist of heterogeneous primary users (PUs). Specifically, we focus on the energy-efficient resource allocation (EERA) problem for CR users with a special location coverage overlapping region in which heterogeneous PUs operate simultaneously via multi-RAT. We propose a two-tier crossover genetic algorithm-based search scheme to obtain an optimal solution in terms of the power and bandwidth. In addition, we introduce a radio environment map to manage the resource allocation and network synchronization. The simulation results show the proposed algorithm is stable and has faster convergence. Our proposal can significantly increase the energy efficiency.

• ETRI Journal
• /
• 제38권3호
• /
• pp.444-454
• /
• 2016

Voice service is very demanding in cognitive radio networks (CRNs). The available spectrum in a CRN for CR users varies owing to the presence of licensed users. On the other hand, voice packets are delay sensitive and can tolerate a limited amount of delay. This makes the support of voice traffic in a CRN a complicated task that can be achieved by devising necessary considerations regarding the various network functionalities. In this paper, the support of secondary voice users in a CRN is investigated. First, a novel packet scheduling scheme that can provide the required quality of service (QoS) to voice users is proposed. The proposed scheme utilizes the maximum packet transmission rate for secondary voice users by assigning each secondary user the channel with the best level of quality. Furthermore, an analytical framework developed for a performance analysis of the system, is described in which the effect of erroneous spectrum sensing on the performance of secondary voice users is also taken into account. The QoS parameters of secondary voice users, which were obtained analytically, are also detailed. The analytical results were verified through the simulation, and will provide helpful insight in supporting voice services in a CRN.

• 전자공학회논문지
• /
• 제52권1호
• /
• pp.79-86
• /
• 2015

인지무선네트워크(Cognitive Radio Networks, CRNs)는 네트워크 환경을 인지하고 적응적으로 운용할 수 있는 지능형 무선 네트워킹을 제공하기 위한 기술로 인지되고 있다. CRN은 FCC(Federal Communications Commission)의 최근 정책으로 인해 비인가된 사용자가 네트워크의 주사용자를 방해하지 않는 한 유휴 스펙트럼을 활용할 수 있도록 허락하는 기술이다. 그러므로 CRNs의 보안 특성은 다른 네트워크와 달라야만 한다. 본 논문의 목적은 Tsai등의 위임기반 인증 프로토콜(TDAP)로부터 CRN상의 비인가된 사용자를 위한 보안의 특성을 추출함으로서 새로운 위임기반 인증 프로토콜(NDAP)을 제안하는데 있다. 먼저 TDAP에 대한 보안분석을 제시하고 비인가 사용자 인증을 위한 프로토콜 설계 목표를 설정한다. 그런 후 TDAP에 대한 보안 해결책과 CRNs를 위한 새로운 프로토콜로서 NDAP을 제안한다. 본 논문에서 제안한 NDAP은 CRNs과 다양한 융합응용의 보안 기반 구조로 활용될 수 있을 것이다.

• Journal of Communications and Networks
• /
• 제18권5호
• /
• pp.744-761
• /
• 2016

For about the past decade and a half research efforts into cognitive radio networks (CRNs) have increased dramatically. This is because CRN is recognized as a technology that has the potential to squeeze the most out of the existing spectrum and hence virtually increase the effective capacity of a wireless communication system. The resulting increased capacity is still a limited resource and its optimal allocation is a critical requirement in order to realize its full benefits. Allocating these additional resources to the secondary users (SUs) in a CRN is an extremely challenging task and integer programming based optimization tools have to be employed to achieve the goals which include, among several aspects, increasing SUs throughput without interfering with the activities of primary users. The theory of the optimization tools that can be used for resource allocations (RA) in CRN have been well established in the literature; convex programming is one of them, in fact the major one. However when it comes to application and implementation, it is noticed that the practical problems do not fit exactly into the format of well established tools and researchers have to apply approximations of different forms to assist in the process. In this survey paper, the optimization tools that have been applied to RA in CRNs are reviewed. In some instances the limitations of techniques used are pointed out and creative tools developed by researchers to solve the problems are identified. Some ideas of tools to be considered by researchers are suggested, and direction for future research in this area in order to improve on the existing tools are presented.

• Journal of Communications and Networks
• /
• 제17권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.

• 대한임베디드공학회논문지
• /
• 제9권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.

• ETRI Journal
• /
• 제44권3호
• /
• pp.400-412
• /
• 2022

In cognitive radio networks (CRNs), the computational complexity of resource allocation algorithms is a significant problem that must be addressed. However, the high computational complexity of the optimal solution for tackling resource allocation in CRNs makes it inappropriate for use in practical applications. Therefore, this study proposes a power-based pricing algorithm (PPA) primarily to reduce the computational complexity in downlink CRN scenarios while restricting the interference to primary users to permissible levels. A two-stage approach reduces the computational complexity of the proposed mathematical model. Stage 1 assigns subcarriers to the CRN's users, while the utility function in Stage 2 incorporates a pricing method to provide a power algorithm with enhanced reliability. The PPA's performance is simulated and tested for orthogonal frequency-division multiplexing-based CRNs. The results confirm that the proposed algorithm's performance is close to that of the optimal algorithm, albeit with lower computational complexity of O(M log(M)).