• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.153-155
• /
• 2000

MCNS의 DOCSIS 규격은 국내외에서 케이블 TV 망을 이용한 HFC 시스템과 무선 링크를 사용하는 BWLL 시스템에서 공유 매체를 통한 데이터 전송 동작 규격으로 사용되고 있다. 기존의 MCNS MAC 프로토콜은 IP 데이터 전송을 위한 Best Effort 서비스 지원하기 위해 설계되었기 때문에 기존 방식으로는 멀티미디어 서비스들을 지원하는데 많은 어려움이 있었다. 이를 해결하기 위해 MCNS에서는 DOCSIS1.1부터 QoS를 지원하기 위한 동작을 추가하였다. 본 논문에서는 새로 규격에 추가된 QoS 관련 서비스 동작 절차와 상향 채널 할달 스케쥴링 방식에 대해 설명하고, 규격에서 정의된 스케쥴링 서비스를 기반으로 각 서비스의 QoS를 지원하기 위한 새로운 할당 알고리즘을 제안하였다. 제안한 알고리즘의 성능을 분석하기 위해 기존의 FCFS 방식의 상향 채널할당 방식과 QoS 지원 상향채널 할당방식의 성능을 시뮬레이션을 통해 비교하였다.

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.97-104
• /
• 2001

In this paper, we present a new hierarchical model for performance analysis of channel allocation and packet service protocol in wireless n network. The proposed hierarchical model consists of two parts : upper and lower layer models. The upper layer model is the structure state model representing the state of the channel allocation and call service. The lower layer model, which captures the performance of the system within a given structure state, is the wireless packet retransmission protocol model. These models are developed using SRN which is an modeling tool. SRN, an extension of stochastic Petri net, provides compact modeling facilities for system analysis. To get the performance index, appropriate reward rates are assigned to its SRN. Fixed point iteration is used to determine the model parameters that are not available directly as input. That is, the call service time of the upper model can be obtained by packet delay in the lower model, and the packet generation rates of the lower model come from call generation rates of the upper model.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.11a
• /
• pp.225-228
• /
• 2010

본 논문은 CoMP 기법이 적용된 다중 사용자 MIMO-OFDMA 시스템을 위한 자원할당 알고리즘을 제안한다. 제안된 알고리즘에서는 eNode B가 RRE와 UE간의 채널 정보를 이용하여 전체 송신 전력 제한을 가지면서 전체 데이터 레이트가 최대가 되도록 자원을 할당한다. 자원할당 알고리즘을 통해 얻어진 결과를 이용하여 부반송파에 다수의 UE들이 할당된다. 할당된 UE들은 각각 MIMO 채널을 통해 다수의 공간경로를 갖고 각 공간경로에서는 할당된 전력에 따라 QPSK, 16QAM, 64QAM 중 하나를 선택하여 전송한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.98-100
• /
• 2010

본 논문에서는 주파수 선택적 페이딩(frequency selective fading) 채널에서 다중 사용자 MIMO-OFDM 시스템을 위한 자원 할당(resource allocation)을 연구한다. 다중 사용자의 신호를 검출하기 위해 기지국은 MMSE-SIC 수신기를 사용하고 이러한 조건에서 다중 사용자 MIMO-OFDM 시스템을 위한 최적화 문제를 도출하며 이를 위한 자원 할당 기법을 제안한다. 평균 채널 이득이 사용자마다 다른 환경에서의 컴퓨터 모의실험을 통해 제안된 자원 할당 기법의 성능을 알아본다. 모의 실험 결과 제안된 자원 할당 기법은 기존의 자원 할당 기법보다 더 높은 데이터 전송률(data rate)을 달성함을 보이고 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1113-1119
• /
• 2006

For a multi-user OFDM system in mobile channels which requires low-complexity in adaptive resource allocations, resource allocation algorithm using multi-threshold is proposed. The allocation scheme, which is performed by the multi-threshold values in descending order, considers only subcarriers over each threshold level. Moreover, some subcarriers with the lowest channel gain can be· removed in the present threshold level within the constraint of satisfaction of the required data rate, in order to allocate them to the other users when the allocation process of next threshold is executed. As a result, the proposed bandwidth and subcarrier algorithm has better system performances than the conventional allocation schemes in terms of required power and processing time, which is expected as a technique that improves the spectral efficiency of OFDM systems in a mobile environment.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.251-254
• /
• 2002

본 연구에서는 G.983.1 표준에 WDM (Wavelength Division Multiolexing) 기술을 이용하여 WDM-PON 구조를 제시하고, PON상에서의 주된 지연은 upstream 상에서 발생하므로 IEEE 802.Ip를 토대로 각각의 클래스별로 패킷을 분류하여 제안한 알고리즘을 통해 상향 링크상에서의 동적 채널 할당을 실험 하였다. 이를 토대로 WDM-PON에서 각 클래스별 다중 버퍼 방식의 효율성과 채널 할당 알고리즘의 타당성을 확인해 보고자 한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.5
• /
• pp.832-842
• /
• 2006

Wireless Personal Area Networks(WAPANs) are designed for short-range ad hoc connectivity among portable devices. They have gained much attention in the industry recently. One of them, High-rate WPAN, is designed to support multimedia traffic that requires high data rates. But, High-rate WPAN standards don't specify the time slot assignment scheduling method of CAT(Channel Time Allocation). So, there has been many studies regarding time slot assignment scheduling of CAT. However, present studies involve demerits about not applying various types of errors in air interlace or having a starvation of a specific DEV(data device). In this paper, we propose algorithms about supplying the intermediate channel assignment in order to avoid these demerits. This method will help other methods that use time slot assignment scheduling of CTA.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.8
• /
• pp.1981-1986
• /
• 2014

The problem studied in this paper is the channel routing problem to assign points with p colors on the upper row of the channel to points on the lower row in order to minimize its density. The case that the points on the upper row has an identical color or only two colors is studied in [1, 2]. This paper generalizes that to the points with p colors. First, we consider the problem to determine whether there is an assignment with density less than or equal to d, when an arbitrary d is given. We show that the problem is solved in O(p(n+m)log(n+m)) time. Using this result, we resolve the problem to fine an assignment with a minimum density.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1050-1057
• /
• 2008

Wireless Mesh Networks (WMNs) have recently become a hot issue to support high link capacity in wireless access networks. The IEEE 802. I 1 standard which is mainly used for the network interface technology in WMNs supports up to 3 or 12 multiple channels according to the IEEE 802.11 specification. However, two important problems must be addressed when we design a channel assigmnent algorithm: channel dependency problem and channel scanning delay. The former occurs when the dynamic channel switching of an interface leads to the channel switching of other interfaces to maintain node connectivity. The latter happens per channel switching of the interface, and affects the network performance. Therefore, in this paper, we propose the Distance-Based Channel Assigmnent (DB-CA) scheme for multi-channel WMNs to solve such problems. In DB-CA, nodes just perform channel switching without channel scanning to communicate with neighboring nodes that operate on different channels. Furthermore, DB-CA minimizes the interference of channels being used by nodes near the gateway in WMNs. Our simulation results show that DB-CA achieves improved performance in WMNs.

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