• 한국위성정보통신학회논문지
• /
• 제6권1호
• /
• pp.75-79
• /
• 2011

이동 Ad hoc 네트워크 (MANET: Mobile Ad-hoc Network)는 기존의 통신 인프라의 구축 여부와 무관하게 무선 단말기간의 통신이 가능한 네트워크이다. Ad hoc 네트워크는 음영지역, 재난지역, 전쟁 시와 같은 통신 인프라가 구축되기 어려운 상황에서 유용하게 사용 될 수 있다. 그러나 음성 및 데이터 서비스 등과 같은 무선 서비스의 제공을 위해 많은 양의 네트워크 용량이 필요하게 되지만 기존의 제한된 주파수 자원에 따른 주파수 부족 상황 및 주파수 자원정책의 규제에 따라 원활한 주파수 사용이 어려운 상황이다. 이에 따라 높은 주파수 활용을 제공하는 무선 인지 시스템이 Ad-hoc네트워크에 적용하여 보다 다양하고 확장된 네트워크 서비스를 제공할 수 있다. 따라서, 본 논문에서는 AWGN 과 Rayleigh 채널 환경에서, 기존의 단일 스펙트럼 센싱 및 협력 스펙트럼 센싱과 비교하여 Ad-hoc 네트워크가 적용된 무선인지 시스템에서의 스펙트럼 센싱의 성능이 향상됨을 모의실험 및 성능 분석을 통하여 나타내었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권11호
• /
• pp.3775-3788
• /
• 2014

With the increasing number of the wireless and mobile networks, the way that people use the Internet has changed substantively. Wireless multimedia services, such as wireless video streaming, mobile video game, and mobile voice over IP, will become the main applications of the future wireless Internet. To accommodate the growing volume of wireless data traffic and multimedia services, cognitive radio (CR) and Information-Centric Network (ICN) have been proposed to maximize the utilization of wireless spectrum and improve the network performance. Although CR and ICN have high potential significance for the future wireless Internet, few studies have been conducted on collaborative operations of CR and ICN. Due to the lack of infrastructure support in multi-hop ad hoc CR networks, the problem is more challenging for video streaming services. In this paper, we propose a Cross-layer Video Streaming Mechanism (CLISM) for Cognitive Radio Ad Hoc Information Centric Networks (CRAH-ICNs). The CLISM included two distributed schemes which are designed for the forwarding nodes and receiving nodes in CRAH-ICNs. With the cross-layer approach, the CLISM is able to self-adapt the variation of the link conditions without the central network controller. Experimental results demonstrate that the proposed CLISM efficiently adjust video transmission policy under various network conditions.

• Journal of Computing Science and Engineering
• /
• 제7권2호
• /
• pp.81-88
• /
• 2013

In cognitive radio or dynamic spectrum access networks, a rendezvous represents meeting two or more users on a common channel, and negotiating to establish data communication. The rendezvous problem is one of the most challenging tasks in cognitive radio ad hoc networks. Generally, this problem is simplified by using two well-known mechanisms: the first uses a predefined common control channel, while the second employs a channel hopping procedure. Yet, these two mechanisms form a life cycle, when they simplify the rendezvous problem in cognitive radio networks. The main purpose of this paper is to point out how and why this cycle forms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권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.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(D)
• /
• 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.

• 한국정보통신학회논문지
• /
• 제26권7호
• /
• pp.1026-1031
• /
• 2022

인지무선 에드혹 네트워크 (CRAHN : Cognitive Radio Ad-Hoc Networks)는 무선 서비스의 증가에 따른 주파수 자원부족을 극복할 수 있는 네트워크 기술이다. CRANH에서 주 사용자에 대한 간섭을 회피하기 위해 유휴채널을 확인하는 채널센싱이 필요하며, 주 사용자 출현시 빠른 유휴 채널선택을 통해 핸드오버로 인한 시간지연을 최소화 해야한다. 본 연구에서는 강화학습을 이용하여 CRANH에서 부 사용자의 채널 센싱의 대상을 축소하고 유휴채널의 가능성이 높은 채널을 우선적으로 센싱하도록함으로써 전송효율을 개선하였다. 또한 주기적인 센싱을 수행하지 않고 데이터의 전송시점에 채널을 센싱함으로써 센싱시점과 데이터 전송시점간의 차이로 인한 주 사용자와의 충돌가능성을 최소화할 수 있는 멀티채널 매체접근제어(MAC: Medium Access Control) 프로토콜을 제안하고 시뮬레이션을 통해 그 성능을 분석하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권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.

• 한국전자파학회논문지
• /
• 제23권8호
• /
• pp.976-984
• /
• 2012

Ad-hoc 네트워크는 음영지역, 재난지역, 전쟁 시와 같은 통신 인프라가 구축되기 어려운 상황에서 유용하게 사용될 수 있다. 그러나 음성 및 데이터 서비스 등과 같은 무선 서비스의 제공을 위해 많은 양의 네트워크 용량이 필요하게 되지만, 기존의 제한된 주파수 자원에 따른 주파수 부족 상황 및 주파수 자원 정책의 규제에 따라 원활한 주파수 사용이 어려운 상황이다. 이에 따라 높은 주파수 활용을 제공하는 인지 무선 시스템을 ad-hoc 네트워크에 적용하여 보다 다양하고 확장된 네트워크 서비스를 제공할 수 있다. 하지만 인지 무선 시스템을 통해 센싱한 1차 사용자의 유휴 대역을 모든 CR 사용자들이 공평하게 사용할 수 없다는 문제점이 있다. 이러한 문제점을 해결하고자 본 논문에서는 CDMA 방식의 다중 orthogonal sequence를 이용하여, 하나의 주파수 대역 내에서도 여러 명의 CR user가 간섭 없이 효율적인 주파수 대역을 활용할 수 있는 기법을 제안하였으며, 이를 통해 인지 무선 시스템에서의 성능 향상을 보여 준다.

• Journal of information and communication convergence engineering
• /
• 제12권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.