• Title/Summary/Keyword: cognitive radio ad hoc networks

Search Result 48, Processing Time 0.025 seconds

A Periodic Sensing Policy for Multi-channel Multi-user in Distributed Cognitive Radio Ad-Hoc Networks (다중 채널 다중 사용자를 위한 분산 인지 무선 애드 혹 네트워크에서의 주기적 감지 정책)

  • Kim, Bo-Sung;Tuan, Nguyen Manh;Roh, Byeong-Hee;Kim, Dae-Young;Park, Soo-Bum
    • 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) 처리량 측면에서 성능 검증하였다.

Survey of Cognitive Radio VANET

  • He, Xinxin;Shi, Weisen;Luo, Tao
    • 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.

Multi-Channel Allocation Scheme for Multi-Hop Transmission in Ad-hoc Cognitive Radio Networks (애드혹 인지 무선네트워크에서 멀티 홉 전송을 위한 멀티채널할당기법)

  • Kwon, Young-Min;Park, Hyung-Kun
    • 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.

An Efficient Routing Algorithm Considering Packet Collisions in Cognitive Radio Ad-hoc Network (CR Ad-hoc Network에서 패킷 충돌을 고려한 효율적인 경로탐색 알고리즘)

  • Kim, Jin-Su;Choi, Jun-Ho;Shin, Myeong-Jin;Lee, Ji-Seon;Yoo, Sang-Jo
    • 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.

Performance of Detection Probability with Adaptive Threshold Algorithm for CR Based on Ad-Hoc Network (인지 무선 기반 애드 혹 네트워크에서 적응적 임계치 알고리즘을 이용한 센싱 성능)

  • Lee, Kyung-Sun;Kim, Yoon-Hyun;Kim, Jin-Young
    • 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.

A MAC Protocol for Link Maintenance in Multichannel Cognitive Radio Ad Hoc Networks

  • Li, Jingye;Luo, Tao;Gao, Jing;Yue, Guangxin
    • Journal of Communications and Networks
    • /
    • v.17 no.2
    • /
    • pp.172-183
    • /
    • 2015
  • To provide an efficient link maintenance approach, we propose a cross layer medium access control (LM-MAC) protocol for multichannel cognitive radio ad hoc networks. Link establishment and reliable transmission are two key problems for a perfect link maintenance mechanism. Since the cognitive user (CU) pairs have to reestablish their links each frame, in the proposed MAC protocol, three different access modes are designed to guarantee transmission efficiency in continuous frames. To enhance the transmission reliability, each CU will create a father spectrum list (FSL) after joining in the network. FSL is divided into three groups of sub-channels with different functions to compensate the packet loss caused by the primary users' appearance and the deep fading. Meanwhile, since the transmitter and the receiver will share the same FSL, periodical cooperative sensing is adopted to further optimize the former problem. Finally, compared with the existing opportunistic multichannel (OMC)-MAC protocol, the proposed LM-MAC protocol achieves better system performance in terms of saturation throughput, continuity and access delay.

Cognitive Routing for Multi-hop Mobile Cognitive Radio Ad Hoc Networks

  • Lee, Jae-Joon;Lim, Jaesung
    • Journal of Communications and Networks
    • /
    • v.16 no.2
    • /
    • pp.155-161
    • /
    • 2014
  • Mobility can lead to continual loss of data and service interruptions during communications in multi-hop cognitive radio networks. Mobility of primary users (PUs) or cognitive users (CUs) requires adjustment of multi-hop communications among CUs to avoid any interference to PUs. To provide durable and reliable data routing that ensures continuous network service, we propose mobility-aware cognitive routing (MCR) for multi-hop cognitive radio networks. MCR examines the risk level of each node against interference regions and selects the most reliable path for data delivery using a Markov predictor. Through simulation, we verify that the proposed scheme can avoid route destruction preemptively and achieve reliable data delivery.

Rendezvous Issues in AD Hoc Cognitive Radio Networks

  • Joshi, Gyanendra Prasad;Nam, Seung Yeob;Kim, Sung Won
    • 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.

Initial Rendezvous Protocol using Multicarrier Operation for Cognitive Radio Ad-hoc Networks

  • Choi, Ik-Soo;Yoo, Sang-Jo;Seo, Myunghwan;Han, Chul-Hee;Roh, Bongsoo
    • 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.

A Multi-Node Channel Rendezvous Algorithm in Cognitive Radio Ad-hoc Networks (인지 무선 애드혹 네트워크에서의 멀티노드 채널 랑데부 알고리즘)

  • Seong, Jin-uk;Lee, Bong-Hwan;Yang, Dongmin
    • 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.