• East Asian mathematical journal
• /
• v.30 no.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.

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.5
• /
• pp.1101-1105
• /
• 2013

Due to underutilization of spectrum under the current static spectrum management policy, various kinds of dynamic spectrum access strategies have appeared. Myopic policy is a simple policy with reduced complexity that maximizes the immediate throughput. In this paper, the distribution of its medium access delay is evaluated under saturation traffic conditions. Using the distribution of the medium access delay, we also evaluate its system delay under non-saturated traffic conditions.

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

• Journal of Communications and Networks
• /
• v.15 no.2
• /
• pp.222-227
• /
• 2013

This paper presents an analytical framework for dynamic spectrum allocation in cognitive radio networks. We propose a distributed queuing based Markovian model each for single channel and multiple channels access for a contending user. Knowledge about spectrum mobility is one of the most challenging problems in both these setups. To solve this, we consider probabilistic channel availability in case of licensed channel detection for single channel allocation, while variable data rates are considered using channel aggregation technique in the multiple channel access model. These models are designed for a centralized architecture to enable dynamic spectrum allocation and are compared on the basis of access latency and service duration.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2547-2552
• /
• 2013

To achieve better performance in dynamic spectrum access networks, each secondary user tracks channels and chooses a good channel to transmit its packet. When all secondary users adopt the same dynamic spectrum access policy, they have similar channel information, which leads secondary users to choose the same channel and more collisions among them. To relieve this problem, we propose an access policy using belief vector tracking method for other competing secondary users. Simulation results are provided to show that the proposed policy yields better performance than the existing policies which do not take into account what other secondary users are doing.

• Information and Communications Magazine
• /
• v.30 no.1
• /
• pp.67-76
• /
• 2012

본고에서는 jamming 이나 은폐 등으로 인하여 통신 채널이 동적으로 변화하는 전장환경에서 dynamic spectrum access(DSA) 기술을 토대로 보다 안정된 통신을 하는 기술을 알아본다. DSA 통신의 핵심기술을 설명하고, 미국의 DARPA에서 수행한 neXt Generation(XG) 프로젝트와 Wireless Network after Next(WNaN) 국방통신 프로젝트를 소개한 후에 결론에서 시사점을 다룬다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.749-761
• /
• 2014

Improving spectrum utilization efficiency is a fundamental goal of dynamic spectrum access technology. The definition of spectrum holes determines how to detect and exploit them. Current definitions of spectrum holes are ineffective in exploiting spatial-temporal spectrum holes. In this paper, a novel definition of spectrum holes is proposed, in which throughput loss indicates the impact of secondary users on primary users. The definition specifies spectrum holes, unifies the impact of secondary users on primary users and is effective exploiting spatial-temporal spectrum holes. Theoretical analysis and numerical simulations show that the new definition proposed in this paper significantly improves the spectrum utilization efficiency.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.38-44
• /
• 2013

This paper proposes a new dynamic spectrum access (DSA) algorithm for cognitive radio networks. Once initialized, this algorithm works without the need of coordination overhead and hence can be used when no control channel is available. Secondary user (SU) lists and predetermined access control are used in this algorithm. We analyze the probability of no SU collision with primary user and the throughput of our proposed algorithm. Extensive simulations show that our algorithm outperforms the existing DSA algorithm in terms of both the aggregate throughput and the traffic distribution fairness. Furthermore, the validity of our analysis is confirmed by simulation results.