• 한국ITS학회:학술대회논문집
• /
• 2010.05a
• /
• pp.48-52
• /
• 2010

• Journal of information and communication convergence engineering
• /
• v.12 no.2
• /
• pp.97-103
• /
• 2014

In spectrum sensing, there is a tradeoff between the probability of missed detection and the probability of a false alarm according to the value of the sensing threshold. Therefore, it is important to determine the sensing threshold suitable to the environment of cognitive radio networks. In this study, we consider a cognitive radio-based ad hoc network where secondary users directly communicate by using the same frequency band as the primary system and control their transmit power on the basis of the distance between them. First, we investigate a condition in which the primary and the secondary users can share the same frequency band without harmful interference from each other, and then, propose an algorithm that controls the sensing threshold dynamically on the basis of the transmit power of the secondary user. The analysis and simulation results show that the proposed sensing threshold control algorithm has low probabilities of both missed detection and a false alarm and thus, enables optimized spectrum sharing between the primary and the secondary systems.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.5
• /
• pp.632-639
• /
• 2012

Ad-hoc networks can be used various environment, which it is difficult to construct infrastructures, such as shadowing areas, disaster areas, war area, and so on. In order to support to considerable and various wireless services, more spectrum resources are needed. However, efficient utilization of the frequency resource is difficult because of spectrum scarcity and the conventional frequency regulation. Ad-hoc networks employing cognitive radio(CR) system that guarantee high spectrum utilization provide effective way to increase the network capacity. In conventional CR based ad-hoc network, it uses constant threshold value to detect primary user signal, so the results become not reliable. In this paper, to solve this problem, we apply adaptive threshold value to the CR based ad-hoc network, and adaptive threshold is immediately changed by SNR(Signal to Noise Ratio). From the simulation results, we confirmed that proposed algorithm has the greatly better detection probabilities than conventional CR based ad-hoc network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.9
• /
• pp.751-764
• /
• 2013

In cognitive radio ad-hoc networks, common control channel overload and packet collisions are occured due to indiscriminate broadcasting of control packets. So that the path reliability is reduced and control channel is easily saturated. In this paper, we propose a new routing algorithm considering the probability of appearance of primary user and channel status of neighbor nodes. When the source node needs to transmit a data packet to the destination, it performs route discovery process by exchanging control messages using a control channel in ADOV CR Ad-hoc networks. If any intermediate node doesn't have common data channel with previous node to transmit data, it doesn't rebroadcast control packet. And if it has common data channels with previous node, each node determines channel contribution factor with the number of common channels. Based on the channel contribution factor, each node performs different back-off broadcasting. In addition, each node controls control packet flooding by applying to proposed advanced mode using such as number of available channels and channel stability. With the proposed method, the number of control packets to find the data transmission path and the probability of collision among control packets can be decreased. While the path reliability can be increased. Through simulation, we show that our proposed algorithm reduces packet collisions in comparison with the traditional algorithm.

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

In this paper, we investigate the differential game theoretic approach for distributed dynamic cooperative power control in cognitive radio ad hoc networks (CRANETs). First, a payoff function is defined by taking into consideration the tradeoff between the stock of accumulated power interference to the primary networks and the dynamic regulation of the transmit power of secondary users (SUs). Specifically, the payoff function not only reflects the tradeoff between the requirement for quickly finding the stable available spectrum opportunities and the need for better channel conditions, but also reveals the impact of the differentiated types of data traffic on the demand of transmission quality. Then the dynamic power control problem is modeled as a differential game model. Moreover, we convert the differential game model into a dynamic programming problem to obtain a set of optimal strategies of SUs under the condition of the grand coalition. A distributed dynamic cooperative power control algorithm is developed to dynamically adjust the transmit power of SUs under grand coalition. Finally, numerical results are presented to demonstrate the effectiveness of the proposed algorithm for efficient power control in CRANETs.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.243-245
• /
• 2012

스펙트럼 자원이 비효율적으로 사용되는 무선 네트워크에서의 대안으로 여겨지는 CR (Cognitive Radio) 네트워크는 아키텍처에 따라 인프라 기반 네트워크와 CRAHNs (Cognitive Radio Ad Hoc Networks)으로 나눌 수 있다. CCC (Common Control Channel)조차 운영이 어려운 분산 CRAHNs에서 이를 해결하기 위해 제안된 기술들의 문제점을 제시하고 이를 개선하기 위한 주기적 스펙트럼 감지 정책을 제안해 OPNET을 사용해 SU (Secondary User) 처리량 측면에서 성능 검증하였다.

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

Vehicular Ad hoc Networks (VANET) becomes more popular in industry, academia and government. However, Typical VANET is challenged by high speed mobility and insufficient spectrum resources over congested scenarios. To address those serious problems, some articles have introduced Cognitive Radio (CR) technology into VANET and formed CR-VANET. In this article, we propose an overview of CR-VANET by exploring different architectures and features. Moreover, we provide taxonomy of state-of-the-art papers in this emerging field and the key articles are well analyzed respectively. In addition, we illustrate both research and application frameworks of CR-VANET based on our works, and propose some open research issues for inspiring future work.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.1
• /
• pp.35-41
• /
• 2017

To solve the shortage of radio spectrum and utilize spectrum resource more efficiently, cognitive radio technologies are proposed, and many studies on cognitive radio have been conducted. Multi-hop routing is one of the important technologies to enable the nodes to transmit data further with lower power in ad-hoc cognitive radio networks. In a multi-channel cognitive radio networks, each channel should be allocated to minimize interference to primary users. In the multi-hop routing, channel allocation should consider the inter-channel interference to maximize network throughput. In this paper, we propose multi-channel scheduling scheme which minimizes inter-channel interferences and avoids collision with primary users for the multi-hop multi-channel cognitive radio networks. The proposed scheduling is designed to determine both of routing path and channel selection. The performance of proposed channel allocation scheme is evaluated by the computer simulation in the aspect of capacity and collision rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.4
• /
• pp.453-461
• /
• 2019

In this paper, we focus on the study of multi-node rendezvous on one common channel among multiple channels before transmitting in CRAHNs (Cognitive Radio Ad-hoc Networks) for the efficient use of inefficient frequency resources. Most existing researches have dealt with the channel rendezvous between two nodes. But, it can be time-consuming to apply them to three or more nodes. In addition, it cab be impossible to communicate with each other. Therefore, in this paper, we propose a Multi-Node Sequence (MNSEQ), which allows three or more nodes to rendezvous on a single common channel in a short period of time. And, CSMA/CA was applied for data exchange after rendezvous. By performance evaluation through very extensive simulations, we have demonstrated that the proposed MNSEQ outperforms the existing scheme in terms of communication completion time and transmission efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2513-2533
• /
• 2018

In cognitive radio technology, the overall efficiency of communications systems can be improved without allocating additional bands by allowing a secondary system to utilize the licensed band when the primary system, which has the right to use the band, does not use it. In this paper, we propose a fast and reliable common channel initialization protocol without any exchange of initialization messages between the cluster head and the member nodes in cognitive ad-hoc networks. In the proposed method, the cluster and member nodes perform channel-based spectrum sensing. After sensing, the cluster head transmits a system activation signal through its available channels with a predetermined angle difference pattern. To detect the cluster head's transmission channels and to join the cluster, each member node implements fast Fourier transform (FFT) and computes autocorrelation for the angle difference sequence of the received signal patterns. This is compared to the predetermined reference angle difference pattern. The join-request and channel-decision procedures are presented in this paper. Performance evaluation of the proposed method is presented in the simulation results.