• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.172-174
• /
• 1998

이동 컴퓨터들은 다른 컴퓨터들과 통신하기 위하여 무선채널을 사용한다. 효율적인채널 할당은 이동 컴퓨터 시스템 설계의 핵심부분이다. 유한개의 채널들은 처리력을 최대로 하고 채널 간섭을 피하기 위하여 효율적으로 할당되어져야 한다. 채널 할당 알고리즘들은 크게 집중형 채널 할당 알로리즘과 분산형 채널 할당 알고리즘으로 나누어지며, 그것들은 상반관계에 있다. 본 논문에는 고정 채널 할당 정책에 기반한 분산 채널 할당 알고리즘에 집중형 채널 할당 알고리즘을 혼합한 하이브리드 채널 할당 알고리즘을 제안하고, 그것의 성능을 평가한다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.3
• /
• pp.1-7
• /
• 1989

A new algorithm for frequency channel assignment in high capacity cellular mobile communication systems is proposed. The algorithm is the advanced type of the fixed channel assignment scheme. It enables calls having all nominal channels busy to be served by adjacent cells have idle channels. Thus, it considerably reduces the blocking probability compared with the fixed channel assignment. Simulation has been performed for a 49-cell system having uniform traffic density hexagonal array as a representative system lay out. Results showed that new algorithm is better than the fixed channel assignment scheme in high capacity cellular mobile communication systems.

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

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

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1732-1743
• /
• 1998

In this paper, we have proposed a channel assignment shceme for the multiple traffic class environment where the traffic volume varies with time. Our basic idea is to assign radio channels considering the characteristics of each traffic class and mobile speed and change the number of allocated channels for each traffic class according to vaiation of traffic volume. To evalute the perfomance of our proposed algorithms, we conducted analyical and simulation studies. We derived new call blocking probability and hand-off failure probability of the proposed scheme analytically. The simulatioh results show that our proposed algorithms can grantee GOS of each traffic class and provide a fairness between the new call and the hand-off call.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.10
• /
• pp.1379-1385
• /
• 2018

In the conventional multi-user superposition transmission, the power allocation coefficients of data symbols and the received signal processing of users are determined by the condition of instantaneous channel powers. However, the use of instantaneous channel powers can increase the system complexity. Hence, we consider fixed multi-user superposition transmission using average channel powers. The fixed multi-user superposition transmission can reduce the system complexity because it uses the condition of average channel powers that slowly change over time in order to decide the power allocation coefficients and the received signal processing. In this paper, we analyze the average symbol error rate for the fixed multi-user superposition transmission. In particular, an expression for the average symbol error rate of M-ary Quadrature Amplitude Modulation is derived assuming Rayleigh fading channels. In addition, through the numerical results, we show that the conventional and fixed multi-user superposition transmissions achieve the similar average symbol error rate performances at the user in the severe channel condition.

• Information and Communications Magazine
• /
• v.14 no.7
• /
• pp.117-132
• /
• 1997

본 논문에서는 위성 통신 시스템에 있어서 제한된 채널을 다수의 사용자가 효율적으로 사용하기 위한 다중 접속 방식인 고정 할당 다중 접속, 랜덤 다중 접속, 요구할당 다중 접속, 혼합 랜덤/예약 다중 접속 방식등의 프로토콜에 관하여 고찰하였으며, 몇 가지의 프로토콜에 관한 성능을 비교 검토하였다. 고정 할당 다중 접속 방식의 경우 연속적인 트래픽에 효율적이므로 소수의 기관 통신에는 적합하나 다수의 사용자를 수용하기에는 부적합한 특성을 갖고 있으며, 랜덤 다중 접속 방식은 접속 방식이 간단하며, 버스트한 트래픽을 가진 다수의 사용자에 대하여 적은 지연 특성을 갖는 장점이 있으나 한정된 채널 효율과 사용자 수의 증가에 따른 지연의 증가가 심각하다. 따라서, 지상의 초고속 통신망의 위성 시스템을 적용하기 위해서는 지상 B-ISDN의 패킷화된 ATM 셀의 전송을 위해 접속 방식은 다소 복잡하지만 채널 효율 및 지연 특성이 비교적 우수한 요구 할당 다중 접속 또는 혼합 랜덤/예약 다중 접속 방식이 적합할 것으로 보인다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.1 no.1
• /
• pp.47-54
• /
• 1997

New algorithms for frequency channel assignment in small cellular mobile radio system are proposed. The algorithms are for a channel assignment method which control the transmitter power level based on the distance between the cell site and the mobile unit. These algorithms are such that any channel can be used by any cell site and mobile unit, as long as a required threshold level of carrier to interference ratio is maintained. As the cochannel reuse distance decreases, the proposed algorithms have given an increase in capacity in comparison to a fixed channel assignment.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.316-328
• /
• 2003

In this paper, we propose and analyze two adaptive channel allocation schemes for supporting multimedia traffics in hierarchical cellular systems. It is guaranteed to satisfy the required quality of service of multimedia traffics according to their characteristics such as a mobile velocity for voice calls and a delay tolerance for multimedia calls. In the scheme 1, only slow-speed voice calls are allowed to overflow from macrocell to microcell and only adaptive multimedia calls can overflow from microcell to macrocell after reducing its bandwidth to the minimum channel bandwidth. In the scheme II, in addition to the first scheme, non-adaptive multimedia calls can occupy the required channel bandwidth through reducing the channel bandwidth of adaptive multimedia calls. The proposed scheme I is analyzed using 2-dimensional Markov model. Through computer simulations, the analysis model and the proposed schemes are compared with the fixed system and two previous studies. In the simulation result, it is shown that the proposed schemes yield a significant improvement in terms of the forced termination probability of handoff calls and the efficiency of channel usage.

• The Journal of the Korea Contents Association
• /
• v.6 no.6
• /
• pp.9-15
• /
• 2006

To obtain realistic composite performance and availability measures, one should consider performance changes that are associated with failure recovery behavior. In this paper we address two modeling approaches, exact composite and approximate, and develop SRN models for these approaches. The former approach is to combine the performance and availability models and yields accurate results but generally faces largeness problem. To avoid the problem, the two level hierarchical model is developed. The upper level model describes the failure and repair behavior of the system and the lower level captures the pure performance aspect of the system, channel allocation and service. It models guard channel and preemptive handoff scheme. As numerical results, blocking and dropping probabilities are given for new call and handoff call, respectively.