• The Transactions of the Korea Information Processing Society
• /
• 제4권10호
• /
• pp.2571-2580
• /
• 1997

In this paper, we deal with the resource constrain scheduling to execute behavior algorithm under resource limit. Expecially, we proposed a scheduling algorithm, called delayed scheduling, which finds the lower bound control step to assign operation under resource limit. We take in account the actual scheduling problems including multicycle operation and functional pipelining. Integer Linear Programing formulations are used to the scheduling problems in order to get optimal scheduling result. Experiment was done on the DFG model of fifth-order digital wave filter, to show it's effectiveness.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제18권7호
• /
• pp.1540-1546
• /
• 2014

In order to resolve coverage hole problems caused by indoor-BS (IBS) faults, we propose a new frame structure and practical algorithm based on optimization technique. Our main contributions can be described as follows: 1) a frame structure with healing channels for solving abnormal IBS faults; and 2) an efficient heuristic resource allocation algorithm with fixed IBS selection to reduce the complexity for the optimization problem. Through intensive simulations, we evaluate the performance excellency of our proposed algorithm with respect to average cell capacity and user fairness compared with conventional algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제34권2B호
• /
• pp.178-187
• /
• 2009

Cognitive radio (CR) technology is to maximize the spectrum utilization by allocating the unused spectrums to the unlicensed users. In CR environment, it is strictly required for the unlicensed users not to interference with the licensed users. Thus, it is essential to rely on the scheduling algorithm to avoid the interference when utilizing spectrum holes that are changing in time and frequency. However, the existing scheduling algorithms that are applied for the wireless communication environment considering the licensed users only is not appropriate for CR environment. In this paper, we propose downlink scheduling algorithm based on probability of incumbent user presence for cognitive radio networks. With computer simulations, it is shown that the proposed scheduling algorithm outperforms the conventional scheduling algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제20권7호
• /
• pp.1255-1261
• /
• 2016

Recently, the energy harvesting technology in which energy is collected from the wireless signal which is transmitted by mobile communication devices, has been considered as a novel way to improve the life time of wireless sensors by mitigating the lack of power supply problem. In this paper, we consider the optimal sensing time and power allocation problem for cognitive radio systems, where the energy efficiency of secondary user is maximized while the constraint are satisfied, using the optimization technique. Based on the derived optimal solutions, we also have proposed an iterative resource allocation algorithm in which the optimal power and sensing time allocation can be found without excessive computations. The simulation results confirm that the proposed scheme achieves the optimal performance and it outperforms the conventional resource allocation schemes in terms of energy efficiency while the constraints are guaranteed to be satisfied.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 한국방송공학회 2011년도 하계학술대회
• /
• pp.565-566
• /
• 2011

본 논문은 H.264/AVC에서 사용하는 기존의 SVC 알고리즘에 추가적으로 인간의 시각적 중요도 정보를 활용하는 기법을 제안한다. 이 접근방식에서 기존의 SVC 알고리즘을 수정하기 위해 사람의 시각 체계가 균일하지 않게 표본화를 하는 정보가 이용된다. 우리는 각각의 화질계층에서 가장 중요한 지역의 크기를 조절함으로써 효율성과 공정성 모두 강조하는 새로운 자원 할당 알고리즘을 제안하였다. 효율성은 제안하는 SVC의 낮은 화질계층에서, 공정성은 중요한 지역의 크기를 크게 하는 높은 화질계층에서 강조된다. 실험결과는 제안하는 SVC 알고리즘이 압축된 비디오의 주관적인 시각적 화질을 개선하는 것을 보여준다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 한국정보처리학회 2002년도 춘계학술발표논문집 (하)
• /
• pp.1377-1380
• /
• 2002

차세대 인터넷 백본망에서 DWDM(Dense Wavelength Division Multiplex) 기술은 네트워크의 증가하는 사용자 수와 요구 대역폭을 수용하기 위한 방법으로 빠르게 수용되고 있다. RWA(Routing and Wavelength Assignment) 문제는 DWDM 네트워크에서 효율적인 자원 활용 측면에서 최적의 경로 선택과 파장 할당을 위해 중요하다. 하지만 제안된 RWA 알고리즘은 네트워크의 혼잡 상황에 대한 고려가 미비하여 네트워크의 혼잡 시 성능이 제한적이다. 이를 위해 본 논문에서는 미래의 잠재적인 연결 요구에 가장 영향을 줄이는 경로를 설정하는 MIPR(Minimuim Interference Path Routing) 알고리즘을 제안한다. 또, 제안된 알고리즘을 이용하여 IP 차등화 서비스에서 QoS(Quality of Service) 제공을 위해 서비스 타입별로 차등화 된 라우팅 방법을 제공한다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• 제29권1호
• /
• pp.68-76
• /
• 2018

Target prioritization is necessary for a multifunction radar(MFR) to track an important target and manage the resources of the radar platform efficiently. In this paper, we consider an artificial neural network(ANN) model that calculates the priority of the target. Furthermore, we propose a neural network learning algorithm based on the steepest descent method, which is more suitable for target prioritization by combining the conventional gradient descent method. Several simulation results show that the proposed scheme is much more superior to the traditional neural network model from analyzing the training data accuracy and the output priority relevance of the test scenarios.

• The KIPS Transactions:PartA
• /
• 제19A권3호
• /
• pp.161-168
• /
• 2012

The study of Cloud based system is emerging to become the core technology in IT field due to the tremendous growth of Cloud Computing. Researches to deliver applications to Thin-Client based mobile virtual machine and Desktop as a Service(DaaS) using Cloud Computing are conducted actively. In this paper, we propose a Cloud system to run the mobile application in the mobile Thin-Client device and resource allocation mechanism Dynamic Resource Allocation Manager for Mobile Application(DRAMMA). Thus, through performance check, we show DRAMMA has improved the utilization of Cloud system, less migration of virtual machines and decreased the error rate of resource allocation. Also our proposed system delivers service more efficiently than the previous resource allocation algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제35권1B호
• /
• pp.20-26
• /
• 2010

The downlink scheduling algorithm has a great impact on the performance of mobile telecommunication system. In proportional fairness (PF) scheduling algorithm, the resource is allocated proportionally to the quality of wireless channel. Thus, PF has difficulty in servicing the users having more downlink traffic. One can allocate the resource proportionally to the accumulated queue length. However, this leads to system throughput degradation since the users having low channel quality get more and more resource allocated due to accumulation property of queue. In this paper, we propose a new downlink scheduling algorithm, which extends PF algorithm by incorporating downlink traffic arrival rate. The proposed algorithm can effectively cope with users having more downlink traffic, and maintain high system throughput by eliminating accumulation effect in the algorithm. With computer simulations, it is verified that the proposed algorithm performs better than existing algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제30권10A호
• /
• pp.912-921
• /
• 2005

Optical burst switching(OBS) is a promising solution for building terabit optical routers and realizing If over WDM. Channel scheduling Algorithm for reduce contention is one of the major challenges in OBS. We address the issue of how to provide basic burst channel scheduling in optical burst switched WDM networks with fiber delay lines(FDLs). In OBS networks the control and payload components or a burst are sent separately with a time gap. If CHP arrives to burst switch node, because using scheduling algorithm for data burst, reservation resources such as wavelength and transmit data burst without O/E/O conversion, because contention and void between burst are happened at channel scheduling process for data burst that happened the link utilization and bust drop probability Existent proposed methods are become much research to solve these problems. Propose channel scheduling algorithm that use Release Time of bust to emphasize clearance between data and data dissipation that is happened in data assignment in this treatise and maximize bust drop probability and the resources use rate (RTUC : Release Time Unscheduled Channel). As simulation results, Confirmed that is more superior in terms of data drop and link utilization than scheduling algorithm that is proposed existing. As simulation results, confirmed improved performance than scheduling algorithm that is proposed existing in terms of survival of burst, efficiency resource and delay. However, In case load were less, degradation confirmed than existent scheduling algorithm relatively, and confirmed that is superior in data drop aspect in case of load increased.