• Journal of Digital Convergence
• /
• v.10 no.9
• /
• pp.375-381
• /
• 2012

If a mobile station requests a channel allocation in its mobile networks, the switching center assigns a channel to a mobile station that belongs to each base station. There are three kinds of channel allocation schemes; a fixed channel allocation, a dynamic channel allocation and a hybrid combination of these two forms. In assigning a good frequency, it is our intention to provide quality service to our customers as well as to use resources efficiently. This paper proposes methods of assigning frequencies that minimize interference between channels and that also minimize the amount of searching time involved. In this paper, we propose an algorithm to per specific equipment, regardless of the number of channels that can be used as a general-purpose system, such as base stations, control stations, central office model is proposed, the existing operators manner similar to the fixed channel allocation based statistics and assigned when the conventional method and the improved method is proposed. Different ways and compared via simulations to verify the effectiveness of the proposed approach.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.2
• /
• pp.62-68
• /
• 2000

The Dynamic Channel Assignment have a detect which satisfy lots of conditions. It makes system efficiency depreciate because the Dynamic Channel Assignment executes computation process of several steps that demands lots of time. In this paper, we have proposed a traffic control algorithm which makes simple computation process for improving the detect.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.11
• /
• pp.19-24
• /
• 2007

This paper presents a performance analysis of dynamic channel allocation (DCA) based on the greedy approach (GA) for orthogonal frequency division multiple access (OFDMA) systems over Rayleigh fading channels. The GA-based DCA achieves its performance improvement using multi-user diversity. We analyze the statistics of the number of allocable users (NAU), which represents the multi-user diversity order at each allocation process. The derived statistics are then used to analyze the performance of GA-based DCA. The analysis results show that the number of subcarriers allocated to each user must be equal to achieve the maximum system performance (i.e., based on outage probability and data throughput).

• 한국정보통신설비학회:학술대회논문집
• /
• 2004.08a
• /
• pp.302-307
• /
• 2004

이 논문은 제한된 대역폭을 가진 고정 채널 할당 문제를 유전알고리즘을 이용하여 최적화하는 방법을 제시한다. 또한 이 논문에서는 유전알고리즘의 미세조정 능력 향상을 위해 지역 최적화 방법을 고안하였다. 고정채널 할당 문제를 행렬로 표현하여 지역 최적화 알고리즘에서는 채널을 수평 또는 수직으로 움직임으로써 유전 알고리즘의 성능 향상을 꾀한다. 제안된 방법은 기존의 방법보다 뛰어난 성능 향상을 나타냄을 실험결과에서 보일 것이다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.149-151
• /
• 2014

DVB-S2/RCS (Digital Video Broadcasting - Satellite/Return Channel via Satellite)는 위성 방송 및 데이터 통신을 위한 표준으로서 높은 통신 품질 및 향상된 위성 자원 이용을 위해 수립되었다. DVB-RCS 의 MF-TDMA (Multi-Frequency Time Division Multiple Access)는 동적인 자원할당이 가능하며, 이에 따라 통신 요구 사항이 증가하는 군 위성 통신 체계로의 적용 연구가 활발하게 진행 중이다. 그러나 기존 MF-TDMA 위성 통신은 군 통신에 필수적인 항재밍에 대한 고려가 부족한 실정이다. 부분대역 재밍시, 다구의 RCST (Return Channel Satellite Terminal)에 통신 저하를 초래 할 수 있으며, 망 자원을 관리하는 제어 채널의 재밍으로 다수 RCST 의 채널 탈퇴를 초래할 가능성이 있다. 본 논문에서는 부분대역 재밍 시 RCST 의 통신 저하를 최소화하며, 제어 채널 재밍으로 인한 다구 RCST 의 채널 탈퇴를 예방하는 자원할당 알고리즘을 제안한다. 제안 기법은 다양한 대역폭을 지원하는 MF-TDMA 에 적용 가능함으로써 다양한 장비가 혼재하는 군사 환경에 매우 적합하다. 시뮬레이션을 통해 제어 채널의 재밍 확률과, RCST 의 자원할당 효율을 기존 자원할당 알고리즘과 비교하였으며, 제안한 알고리즘이 우수한 성능을 보임을 확인 하였다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.5
• /
• pp.577-582
• /
• 2012

If the mobile station requests the channel allocation in mobile networks, switching center is assigned a channel to mobile station that belong to each base station. Channel allocation schemes is a fixed channel allocation, dynamic channel allocation and a hybrid approach that combines the two forms. To assign a frequency well to use resources efficiently to provide quality service to our customers. In this paper, we proposed method to assign frequencies to minimize interference between channels and to minimizes the number of searching time. The proposed method by the genetic algorithm to improve accuracy and efficiency of the verification steps and reproduction stages were used. In addition, the proposed method by comparing with other methods showed that proposed method is better through the simulations.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.21-27
• /
• 2008

In this paper, we design and implement the upstream packet bandwidth allocation algorithm on OPNET-based DOCSIS 3.0 simulator including channel-bonding CM (Cable Modem)s. Previous DOCSIS CM could not support channel bonding, it has problem in upstream bandwidth allocation and determine the contention area. The proposed upstream bandwidth allocation algorithm has been improved the queuing time and success rate. For the simulation, we design the MAC frame structure with channel bonding supported CM and not. And then, this paper design and implement the CMTS node model, CM node model, CMTS process model, and CM process model.

• Journal of Korea Multimedia Society
• /
• v.13 no.11
• /
• pp.1667-1676
• /
• 2010

In this paper, we propose a packet scheduling algorithm that assigns different number of HS-PDSCH(High Speed Primary Downlink Shared Channel) to the service user according to the received signal to interference ratio of CPICH(Common Pilot Channel) and to the traffic characteristics. Assigned channel number is determined by the signal to interference ratio level from CPICH. The highest signal to interference ratio user gets the number of channels based on the signal to interference ratio table and the remained channels are assigned to the other level users. Therefore the proposed scheme can provide the similar maximum service throughput and higher fairness than existing scheduling algorithm. Simulation results show that our algorithm can provide the similar maximum service throughput and higher fairness than MAX C/I algorithm and can also support the higher service throughput than proportional fairness scheme.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.6
• /
• pp.487-493
• /
• 2013

As the spread of smart devices that service variety of content, limited mobile terminal channel assignment problem has intensified. In the channel assignment in mobile networks mobile switching center at the request belongs to each base station allocates the channel to the mobile station. This effectively allocate the limited channels of various methods have been proposed for, in this case a hybrid channel allocation using genetic algorithms UHGA (Universal Hybrid Channel Assignment using Genetic Algorithm) in rural areas or urban areas, such as universal network applied to a variety of environments that the efficiency is verified through simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.6
• /
• pp.37-45
• /
• 2013

In the absence of a single deterministic rule for the channel assignment problems, heuristic algorithms are predominantly employed to partly solve the problems. This paper thus proposes deterministic rules for the channel assignment problems. These deterministic rules have successfully yielded the optimal solution when applied to the Philadelphia's 9 case examples.