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

• Smart Media Journal
• /
• v.1 no.1
• /
• pp.17-26
• /
• 2012

In cognitive radio networks (CRNs), unlicensed users sense the licensed spectrum bands and opportunistically access them without interfering operations of licensed users. Especially, in ad hoc networks, the MAC layer plays an important role in coordinating unlicensed users access to the spectrum and, thus, a number of MAC protocols have been studied recently. In this paper, we comparatively examine MAC protocols in cognitive radio ad hoc networks (CRAHNs). First, we categorize the protocols on the basis of common control channel (CCC) requirements and further review major implementations for each category. Then, we make a qualitative comparison of the protocols in terms of inherent characteristics and performance.

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

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.6
• /
• pp.113-119
• /
• 2010

Wireless ad hoc network composed of low power devices has been operated in ISM bands. However, with the growing proliferation of wireless services, these bands are increasingly getting congested. In order to relieve the spectrum scarcity and inefficient spectrum utilization, ad ho cognitive radio was proposed. In this paper we propose the efficient spectrum sensing method to reduce power consumption and detect white space in ad hoc cognitive radio system. The wireless channel between a licensed user and CR systems is modeled as Gaussian channel, the distance between a licensed user and CR systems is assumed differently. Also, the wireless channel among CR systems is assumed as the perfect channel and the distance among CR systems is assumed close distance. CR systems sense the spectrum of the licensed user by using a energy detection method. From the simulation results, spectrum sensing performance of combining sensing result of CR systems with high received energy shows higher than combining sensing result of all CR systems and we can refer to the proposed sensing method in order to perform effective spectrum sensing with low power consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.123-145
• /
• 2017

Due to the increasing demand for spectrum resources, cognitive radio networks and dynamic spectrum access draw a lot of research into efficiently utilizing limited spectrum resources. To set up cluster-based CR ad-hoc common channels, conventional methods require a relatively long time to successfully exchange the initialization messages. In this paper, we propose a fast and reliable common channel initialization protocol for CR ad-hoc networks. In the proposed method, the cluster head sequentially broadcasts a system activation signal through its available channels with a predetermined correlation pattern. To detect the cluster head's broadcasting channels and to join the cluster, each member node implements fast Fourier transform (FFT) and computes autocorrelation of an FFT bin sequence for each available channel of the member node. This is compared to the predetermined reference pattern. The join request and channel decision procedures are also presented in this paper. In a simulation study, the performance of the proposed method is evaluated.

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

In cognitive radio ad hoc networks, secondary users need to exchange control information before data transmission. This task is not trivial in cognitive radio networks due to the dynamic nature of environment. This problem is sometime called rendezvous problem of cognitive radio network. The rendezvous problem is normally tackled by using two famous approaches: the use of common control channel (CCC) and using channel hopping (a.k.a sequence-based protocols). However, these two famous solutions form a vicious cycle while solving the rendezvous problem. The main purpose of this paper is to point out how and why this vicious cycle is formed.

• 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.7 no.12
• /
• pp.2957-2986
• /
• 2013

The traditional approach of fixed spectrum allocation to licensed networks has resulted in spectrum underutilisation. Cognitive radio technology is envisioned as a promising solution that can be used to resolve the ineffectiveness of the fixed spectrum allocation policy by accessing the underutilised spectrum of existing technologies opportunistically. The implementation of cognitive radio networks (CRNs) faces distinct challenges due to the fact that two systems (i.e., cognitive radio (CR) and primary users (PUs)) with conflicting interests interact with each other. Specially, in self-organised systems such as ad-hoc CRNs (AHCRNs), the coordination of spectrum access introduces challenges to researchers due to rapid utilisation changes in the available spectrum, as well as the multi-hop nature of ad-hoc networks, which creates additional challenges in the analysis of resource allocation (e.g., power control, channel and rate allocation). Instead, game theory has been adopted as a powerful mathematical tool in analysing and modelling the interaction processes of AHCRNs. In this survey, we first review the most fundamental concepts and architectures of CRNs and AHCRNs. We then introduce the concepts of game theory, utility function, Nash equilibrium and pricing techniques. Finally, we survey the recent literature on the game theoretic analysis of AHCRNs, highlighting its applicability to the physical layer PHY, the MAC layer and the network layer.

• 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 the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.39-45
• /
• 2011

In this paper, we propose an efficient multichannel MAC protocol with idle nodes assistance to avoid the multi-channel hidden terminal problem in cognitive radio ad hoc network and further to improve the performance of the network. The proposed MAC protocol can be applied to the cognitive radio adhoc network where every node is equipped with the single transceiver and one common control channel exists for control message negotiation. In the proposed protocol, the idle nodes available in the neighbour of communication nodes are utilized because the idle nodes have the information about the channels being utilized in their transmission range. Whenever the nodes are negotiating for the channel, idle nodes can help the transmitting and receiving nodes to select the free data channel for data transfer. With the proposed scheme, we can minimize the hidden terminal problem and decrease the collision between the secondary users when selecting the channel for data transfer. As a result, the performance of the network is increased.