• Journal of Korea Technology Innovation Society
• /
• v.4 no.3
• /
• pp.255-274
• /
• 2001

This study aims to provide information about the priority setting and budget coordination of government R&D spendings in Korea. Based on the result of "Survey, Analysis and Evaluation of National R&D Programs"in FY 2000. this paper reviews the government R&D expenditures by the concerned variables such as program objectives, sector of performance, character of work and technology fields. It is found that R&D spendings on the areas of industrial development, information technology, and development research are funded pretty high. Also, it turns out that, considering program objectives and character of work, there are some redundancies of R&D programs among government agencies. Policy implications are suggested.

• International Journal of Contents
• /
• v.3 no.2
• /
• pp.25-29
• /
• 2007

In this paper, we discuss the mesh segmentation problem which divides a given 3D mesh into several disjoint sets. To solve the problem, we propose a greedy method based on the merging priority metric defined for representing the geometric properties of meaningful parts. The proposed priority metric is a weighted function using five geometric parameters, those are, a distribution of Gaussian map, boundary path concavity, boundary path length, cardinality, and segmentation resolution. In special, we can control by setting up the weight values of the proposed geometric parameters to obtain visually better mesh segmentation. Finally, we carry out an experiment on several 3D mesh models using the proposed methods and visualize the results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.268-279
• /
• 1997

In this paper, we show the movable boundary (MB) method is the effective bandwidth allocation strategy for the ABR service among existing bandwidth allocation methods. The MB method can gurantee the QOS requirement according to the service priority and improve bandwidth utilization using the characteristics of the ABR service. The threshold values of the MB, which have an important effect upon connection blocking probability(CBP) performance of each service, are obtained by simulation. The MB method with the fixed thresholds, however, may not have good performance to variation of input traffic parameters. We suggest the dynamic MB method which changes the threshold values adaptively according to the required bandwidth of input traffic. We also show that the dynamic MB method can urantee the CBP performance according to the service priority regardless of variation of input traffic parameters.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.8 no.4
• /
• pp.195-200
• /
• 2009

In this paper, we propose a new priority Optical Burst Switching (OBS) protocol based on a hop count, which can provide an efficient utilization in optical wireless networks. Under several legacy schemes, a switch drops the burst with a shorter time among ones regardless of its traversed hop count. As a result, the dropped burst that have been traversed more hops might cause to waste bandwidth than the one traversed a few hops. Noting that this problem, we propose a Just Enough Time (JET) with a hop count scheme which can reduce the wasted bandwidth by prioritizing the burst traversed more hops over others. The simulation results shows that the proposed scheme has more advantages over the legacy schemes in terms of the burst blocking probability and the link utilization.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.130-131
• /
• 2007

Wireless Sensor Network typically incorporates diverse applications within the same network. A sensor node may have multiple sensors i.e. light, temperature, seismic etc with different transmission characteristics. Each application has different characteristics and requirements in terms of transmission rates, bandwidth, packet loss and delay demands may be initiated towards the sink. In this paper we propose Heterogeneous Traffic Oriented Rate Control Protocol (HTRCP) which ensures efficient rate control for diverse applications according to the priority specified by the sink. Moreover. HTRCP ensures the node priority based hop by hop dynamic rate adjustment for high link utilization.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06d
• /
• pp.262-265
• /
• 2010

멀티미디어 스트리밍은 인터넷에서 이미 가장 인기있는 서비스가 되었다. 멀티미디어 스트리밍 서비스를 제공하기 위해서는 충분한 대역폭과 딜레이가 유지되어야 한다. 기존의 무선 멀티홉 네트워크는 이러한 요구사항을 만족하기 어렵다. 본 논문에서는 멀티미디어 스트리밍을 보다 좋은 품질로 서비스하기 위해 802.11e를 사용한 Hop Based Priority 테크닉을 제안한다. HBP 테크닉은 패킷이 경로를 따라 이동할때 한홉이 지날때마다 우선순위를 증가시킨다. 그럼으로써 먼저 보낸 패킷과 나중에 보낸 패킷간의 경쟁을 최소화 시키고 먼저 보낸 패킷이 채널을 잡을수 있도록 한다. 이를 모델링을 통해 검증하여 약 43%의 성능 개선 효과가 있음을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.405-407
• /
• 1999

WFQ(Weighted Fair Queuing)은 지연이나 공평성의 특성에 있어서 이상적인 트래픽 스케줄링 알고리즘으로 간주되었다. N세션에 서비스를 제공하는 WFQ 스케줄러의 스케줄링 연산은 각 패킷 전송 시간당 O(n)의 계산 복잡도를 가지며, 구현 또한 복잡하다. Self-Clocked Fair Queuing과 같은 WFQ 알고리즘의 구현을 간단히 하고자 하는 노력은 지연범위나 특성에 영향을 주게 되어 다양한 트래픽이 제공되는 경우 각 트래픽의 공평성을 지원해주지 못한다. 그러므로 지연이나 지연 변이 측면에서 공평성을 지원하고 구현상의 계산 복잡도를 줄인 스케줄링 알고리즘이 필요하게 되었다. ATM 다중화기의 셀 스케줄링 알고리즘 역시, ATM의 특성상 다양한 특성의 서비스를 제공하기 위해서, 다양한 특성의 트래픽에 대한 공평성을 제공하는 새로운 알고리즘의 연구가 필요하다. 이 논문에서는 ATM 스위치 내의 다중화기에서 사용되는 새로운 셀 스케줄링 알고리즘을 제안하고 실험을 통해 이 알고리즘의 성능을 검증하고자 한다. 이 알고리즘은 여러 개의 우선 순위 큐를 갖고, 각 우선순위 큐마다 스케줄링 연산이 O(1)의 계산 복잡도를 갖는 Parallel Priority Queuing 알고리즘이다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.1
• /
• pp.151-161
• /
• 1997

In this paper we designed a high speed wireless multiple access protocol, which is suitable for future multimedia wireless LAN systems which support high quality video teleconferencing, telephony and graphic databases. In the proposed protocol, Slotted-ALOHA protocol is used for transmitting random data packets and the packet reservation multiple access(PRMA) protocol for transmitting periodic data packets. The use of minislot is introduced for the reservation scheme. In order to measure the performance characteristic of the proposed protocol, a simulator is designed using an object oriented programming language, C++, and an exhaustive simulation study is carried out. From the simulation results, it is observed that the proposed protocol and the existing PRMA protocol have almost the same delay characteristic when network traffic is low. However, the proposed protocol is superior to the PRMA protocol when traffic becomes higher. The proposed protocol and the results can be utilized for the design of the wireless access systems and future broadband wireless LANs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1661-1678
• /
• 2016

Clustering is one of the key technologies in vehicular networks. Constructing and maintaining stable clusters is a challenging task in high mobility environments. DWCM (Distributed and Weighted Clustering based on Mobility Metrics) is proposed in this paper based on the d-hop dominating set of the network. Each vehicle is assigned a priority that describes the cluster relationship. The cluster structure is determined according to the d-hop dominating set, where the vehicles in the d-hop dominating set act as the cluster head nodes. In addition, cluster maintenance handles the cluster structure changes caused by node mobility. The rationality of the proposed algorithm is proven. Simulation results in the NS-2 and VanetMobiSim integrated environment demonstrate the performance advantages.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.07a
• /
• pp.19-22
• /
• 2018

현재 자동차 산업계에서 AUTOSAR는 효율적인 차량용 소프트웨어 개발을 위해 필수로 적용되고 있으며 자동차의 실시간 요구사항을 만족시키기 위해 실시간 운영체제를 사용한다. 하지만 AUTOSAR에서 제공하는 코어 간 클라이언트-서버 통신은 클라이언트 태스크에서 보낸 서비스 요청을 FIFO 순서로 처리하기 때문에 우선순위가 높은 태스크의 서비스가 낮은 태스크의 서비스 때문에 늦게 처리될 수 있다. 이는 우선순위 역전 현상이며 서비스의 처리 결과를 기다리느라 우선순위가 높은 태스크의 응답시간이 지연되므로, 이 태스크가 차량 안전에 있어 중요하다면 치명적일 수 있다. 이 논문에서는 서비스의 처리 순서가 결과에 무관한 경우에 한해 우선순위 큐를 도입함으로써 이 문제를 해결하였다. 제안된 기법은 Infineon 사의 TC297 MCU와 ETAS 사의 AUTOSAR 소프트웨어에서 실험했으며 우선순위가 높은 태스크의 응답시간이 1.42%의 오버헤드를 통해 1.26배 감소하였다.