• 제목/요약/키워드: dynamic spectrum

검색결과 659건 처리시간 0.03초

Dynamic Spectrum Load Balancing for Cognitive Radio in Frequency Domain and Time Domain

  • ;손성환;;김재명
    • 한국ITS학회 논문지
    • /
    • 제8권3호
    • /
    • pp.71-82
    • /
    • 2009
  • As a solution to spectrum under-utilization problem, Cognitive radio (CR) introduces a dynamic spectrum access technology. In the area, one of the most important problems is how secondary users (SUs) should choose between the available channels, which means how to achieve load balancing between channels. We consider spectrum load balancing problem for CR system in frequency domain and especially in time domain. Our objective is to balance the load among the channels and balance the occupied time length of slots for a fixed channel dynamically in order to obtain a user-optimal solution. In frequency domain, we refer to Dynamic Noncooperative Scheme with Communication (DNCOOPC) used in distributed system and a distributed Dynamic Spectrum Load Balancing algorithm (DSLB) is formed based on DNCOOPC. In time domain, Spectrum Load Balancing method with QoS support is proposed based on Dynamic Feed Back theory and Hash Table (SLBDH). The performance of DSLB and SLBDH are evaluated. In frequency domain, DSLB is more efficient compared with existing Compare_And_Balance (CAB) algorithm and gets more throughput compared with Spectrum Load Balancing (SLB) algorithm. Also, DSLB is a fair scheme for all devices. In time domain, SLBDH is an efficient and precise solution compared with Spectrum Load Smoothing (SLS) method.

  • PDF

A Proactive Dynamic Spectrum Access Method against both Erroneous Spectrum Sensing and Asynchronous Inter-Channel Spectrum Sensing

  • Gu, Junrong;Jang, Sung-Jeen;Kim, Jae-Moung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권1호
    • /
    • pp.361-378
    • /
    • 2012
  • Most of the current frequency hopping (FH) based dynamic spectrum access (DSA) methods concern a reactive channel access scheme with synchronous inter-channel spectrum sensing, i.e., FH is reactively triggered by the primary user (PU)'s return reported by spectrum sensing, and the PU channel to be switched to is assumed precisely just sensed or ready to be sensed, as if the inter-channel spectrum sensing moments are synchronous. However, the inter-channel spectrum sensing moments are more likely to be asynchronous, which risks PU suffering more interference. Moreover, the spectrum sensing is usually erroneous, which renders the problem more complex. To address this problem, we propose a proactive FH based DSA method against both erroneous spectrum sensing and asynchronous inter-channel spectrum sensing (moments). We term it as proactive DSA. The optimal FH sequence is obtained by dynamic programming. The complexity is also analyzed. Finally, the simulation results confirm the effectiveness of the proposed method.

IEEE 802.22 WRAN에서 Cognitive Radio를 위한 효율적인 Spectrum 할당 기법 (Efficient Spectrum Allocation Method for Cognitive Radio in IEEE 802.22 WRAN)

  • 김주석;김경석;박우구;김진업
    • 한국통신학회논문지
    • /
    • 제31권12B호
    • /
    • pp.1068-1075
    • /
    • 2006
  • 주파수 자원 가치는 무선통신의 발전과 함께 더욱 커지고 있다. 하지만 앞으로 정보화 사회에서는 주파수 자원의 수요가 공급에 비하여 매우 많기 때문에 주파수 부족 현상이 심각하게 대두된다. 따라서 사용되지 않고 있는 주파수 자원을 효율적으로 이용하기 위한 기술로서 최근 각광을 받고 있는 Cognitive Radio 기술이 필요한 시점이다. 본 논문에서는 CR 기반의IEEE 802.22 WRAN 환경에서 효율적인 Dynamic Spectrum Allocation 기법을 제안한다. Spectrum을 좀 더 효율적으로 공유하기 위해 Variable bandwidth, Mobility의 변수를 적용한 Dynamic Spectrum Allocation 기법을 제시하고 시뮬레이션 결과들을 통해 이를 검증하였다.

Performance Analysis of Dynamic Spectrum Allocation in Heterogeneous Wireless Networks

  • Ha, Jeoung-Lak;Kim, Jin-Up;Kim, Sang-Ha
    • ETRI Journal
    • /
    • 제32권2호
    • /
    • pp.292-301
    • /
    • 2010
  • Increasing convergence among heterogeneous radio networks is expected to be a key feature of future ubiquitous services. The convergence of radio networks in combination with dynamic spectrum allocation (DSA) could be a beneficial means to solve the growing demand for radio spectrum. DSA might enhance the spectrum utilization of involved radio networks to comply with user requirements for high-quality multimedia services. This paper proposes a simple spectrum allocation algorithm and presents an analytical model of dynamic spectrum resource allocation between two networks using a 4-D Markov chain. We argue that there may exist a break-even point for choosing whether or not to adopt DSA in a system. We point out certain circumstances where DSA is not a viable alternative. We also discuss the performance of DSA against the degree of resource sharing using the proposed analytical model and simulations. The presented analytical model is not restricted to DSA, and can be applied to a general resource sharing study.

PERFORMANCE OF MYOPIC POLICY FOR MULTI-CHANNEL DYNAMIC SPECTRUM ACCESS NETWORKS

  • Lee, Yutae
    • East Asian mathematical journal
    • /
    • 제30권1호
    • /
    • pp.23-29
    • /
    • 2014
  • To solve inefficient spectrum usage problem under current static spectrum management policy, various kinds of dynamic spectrum access strategies have appeared. Myopic policy, which maximizes immediate throughput, is a simple and robust strategy with reduced complexity. In this paper, we present a simple mathematical model to evaluate the saturation throughput and medium access delay of a myopic policy in the presence of multiple channels.

해상무선통신환경에서 스펙트럼 공유와 우선순위를 적용한 동적스펙트럼할당 알고리즘 기술연구 (Dynamic Spectrum Allocation Algorithm for Maritime Communications using Spectrum Sharing and Priority)

  • 임무성;김경성;이연우;이성로
    • 한국통신학회논문지
    • /
    • 제35권7B호
    • /
    • pp.1001-1008
    • /
    • 2010
  • 본 논문에서는 해상무선통신환경에서 선박의 위치에 따라 속해있는 네크워크 운영자들 간의 장기간(long-term)의 우선순위(priority) 및 서비스 클래스간의 우선순위 등을 고려한 동적스펙트럼할당(DSA: Dynamic Spectrum Allocation) 알고리즘을 제안한다. 제안한 DSA 알고리즘은 네트워크 운영자간의 각기 다른 서비스 클래스의 트래픽 패턴에 대해서 동적으로 스펙트럼을 공유하고 할당하여, 기존의 고정 스펙트럼 할당방식에 비해 사용자들에게 요구하는 스펙트럼 대역폭을 충분히 제공할 수 있어 서비스 만족율을 향상시킴을 보였다. 따라서 제안한 알고리즘은 해상무선통신환경에서도 스펙트럼 공유와 동적 할당을 통한 운영이 가능함을 보여 육상의 유휴 스펙트럼 자원을 활용할 수 있음을 제시하였다.

Bidding, Pricing, and User Subscription Dynamics in Asymmetric-Valued Korean LTE Spectrum Auction: A Hierarchical Dynamic Game Approach

  • Jung, Sang Yeob;Kim, Seong-Lyun
    • Journal of Communications and Networks
    • /
    • 제18권4호
    • /
    • pp.658-669
    • /
    • 2016
  • The tremendous increase in mobile data traffic coupled with fierce competition in wireless industry brings about spectrum scarcity and bandwidth fragmentation. This inevitably results in asymmetric-valued long term evolution (LTE) spectrum allocation that stems from different timing for twice improvement in capacity between competing operators, given spectrum allocations today. This motivates us to study the economic effects of asymmetric-valued LTE spectrum allocation. In this paper, we formulate the interactions between operators and users as a hierarchical dynamic game framework, where two spiteful operators simultaneously make spectrum acquisition decisions in the upper-level first-price sealed-bid auction game, and dynamic pricing decisions in the lower-level differential game, taking into account user subscription dynamics. Using backward induction, we derive the equilibrium of the entire game under mild conditions. Through analytical and numerical results, we verify our studies by comparing the latest result of LTE spectrum auction in South Korea, which serves as the benchmark of asymmetric-valued LTE spectrum auction designs.

동적 기하 환경의 문제 해결 과정에서 연속 스펙트럼 활용에 대한 소고 (A study on the use of continuous spectrum in problem solving in a dynamic geometry environment)

  • 허남구
    • 한국수학교육학회지시리즈A:수학교육
    • /
    • 제60권4호
    • /
    • pp.543-554
    • /
    • 2021
  • 동적 기하 환경은 학생들의 기하 문제 해결에 긍정적인 역할을 한다. 학생들은 드래깅을 통해 변화 속에서 불변성을 추측할 수 있으며, 분석법은 기하 문제를 해결하는 데 도움을 준다. 하지만 드래깅 활동과 분석법을 활용한 문제 해결은 제한점이 있으며, 연속 스펙트럼은 대안이 될 수 있다. 학생들은 코딩이 결합된 동적 기하 환경에서 프로그래밍을 통해 연속 스펙트럼을 구현할 수 있다. 이에 본 연구에서는 동적 기하 환경의 문제 해결에서 연속 스펙트럼을 활용하는 방안을 제시하였다. 학생들은 문제 해결의 이해 단계에서 시각적으로 표현된 문제 상황을 통해 즉각적으로 이해하고, 계획 단계에서 해결 전략을 수립하고, 반성 단계에서 결과의 점검 및 일반화하는 데 도움을 줄 수 있다.

광대역 스펙트럼 인지 무선망에서 동적 스펙트럼홀 그룹핑에 의한 자원이용률 향상 (Improvement of Resource Utilization by Dynamic Spectrum Hole Grouping in Wideband Spectrum Cognitive Wireless Networks)

  • 이진이
    • 한국항행학회논문지
    • /
    • 제24권2호
    • /
    • pp.121-127
    • /
    • 2020
  • 본 논문에서는 광대역 스펙트럼 인지 무선망에서 인지사용자의 요구자원의 크기에 따라 스펙트럼 홀의 그룹핑 범위를 변화시키는 동적 스펙트럼 홀 그룹핑 방식을 제안하고, 광대역 인지사용자의 서비스를 위한 채널할당에 적용한다. 제안한 동적 스펙트럼 홀 그룹핑 방식은 인지사용자의 요구자원의 크기를 예측하여 필요한 양 만큼 주사용자의 스펙트럼 홀을 그룹핑함으로써 기존의 정적 스펙트럼 홀 그룹핑에 의해 발생 할 수 있는 스펙트럼 자원의 낭비를 개선 할 수 있다. 시뮬레이션을 통하여 동적 스펙트럼 홀 그룹핑 방식과 기존의 정적 스펙트럼 홀 그룹핑 방식에 의한 채널할당의 자원사용률을 비교하여, 허용할 수 있는 인지사용자의 서비스 성능에서 자원이용률을 크게 향상시킬 수 있음을 보인다.

A Generalized Markovian Based Framework for Dynamic Spectrum Access in Cognitive Radios

  • Muthumeenakshi, K.;Radha, S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권5호
    • /
    • pp.1532-1553
    • /
    • 2014
  • Radio spectrum is a precious resource and characterized by fixed allocation policy. However, a large portion of the allocated radio spectrum is underutilized. Conversely, the rapid development of ubiquitous wireless technologies increases the demand for radio spectrum. Cognitive Radio (CR) methodologies have been introduced as a promising approach in detecting the white spaces, allowing the unlicensed users to use the licensed spectrum thus realizing Dynamic Spectrum Access (DSA) in an effective manner. This paper proposes a generalized framework for DSA between the licensed (primary) and unlicensed (secondary) users based on Continuous Time Markov Chain (CTMC) model. We present a spectrum access scheme in the presence of sensing errors based on CTMC which aims to attain optimum spectrum access probabilities for the secondary users. The primary user occupancy is identified by spectrum sensing algorithms and the sensing errors are captured in the form of false alarm and mis-detection. Simulation results show the effectiveness of the proposed spectrum access scheme in terms of the throughput attained by the secondary users, throughput optimization using optimum access probabilities, probability of interference with increasing number of secondary users. The efficacy of the algorithm is analyzed for both imperfect spectrum sensing and perfect spectrum sensing.