• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.185-190
• /
• 2003

Bluetooth communication is based on piconet, which is composed by one master and maximum seven slaves. Several piconets can be interconnected via an inter-piconet Bluetooth unit called a bridge unit to form a Bluetooth scatternet. This bridge node can make its presence in each piconet by switching. This switching must be carefully scheduled so that slot wastage and, hence, packet delays are minimized. In this paper, we introduce an efficient inter-piconet scheduling scheme based on sniff mode. This scheme tries to minimize the wastage of slots by having the bridge unit sniff with its peering masters with time limits and communicate with its slaves in remaining slots. The sniff time limits are determined adaptively based on the amount of traffic in each piconet. Simulation results show this scheme outperforms round-robin scheme based on sniff intervals of equal lengths.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.4
• /
• pp.344-365
• /
• 2009

The performance of a tracking system is greatly increased if multiple types of sensors are combined to achieve the objective of the tracking instead of relying on single type of sensor. To conduct the multi-modal tracking, we have previously developed a multi-modal sensor-based tracking model where acoustic sensors mainly track the objects and visual sensors compensate the tracking errors [1]. In this paper, we find a network synchronization problem appearing in the developed tracking system. The problem is caused by the different location and traffic characteristics of multi-modal sensors and non-synchronized arrival of the captured sensor data at a processing server. To effectively deliver the sensor data, we propose a time-based packet aggregation algorithm where the acoustic sensor data are aggregated based on the sampling time and sent to the server. The delivered acoustic sensor data is then compensated by visual images to correct the tracking errors and such a compensation process improves the tracking accuracy in ideal case. However, in real situations, the tracking improvement from visual compensation can be severely degraded due to the aforementioned network synchronization problem, the impact of which is analyzed by simulations in this paper. To resolve the network synchronization problem, we differentiate the service level of sensor traffic based on Weight Round Robin (WRR) scheduling at the routers. The weighting factor allocated to each queue is calculated by a proposed Delay-based Weight Allocation (DWA) algorithm. From the simulations, we show the traffic differentiation model can mitigate the non-synchronization of sensor data. Finally, we analyze expected traffic behaviors of the tracking system in terms of acoustic sampling interval and visual image size.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.21 no.6
• /
• pp.607-611
• /
• 2001

Ultrasonic inspection system consist of the operator, equipment and procedure. The reliability of results in ultrasonic inspection is affected by its ability. Furthermore, the reliability of nondestructive testing is influenced by the inspection environment, materials and types of defect. Therefore, it is very difficult to estimate the reliability of NDT due to the various factors. In this study, the probability of detection by logistic probability model and Monte Carlo simulation is used for the reliability assessment of ultrasonic inspection. The utility of the NDT reliability assesment is verified by the analysis of the data from round robin test nth these models.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.19 no.4
• /
• pp.300-313
• /
• 1999

비파괴검사 기술의 레벨 향상과 안정화를 통한 시간적 재현성이 있는 비파괴검사 결과의 확보를 위해서는 비파괴검사 기술자의 자격 인정 및 인증(nondestructive testing qualification and certification of personnel)제도의 확립이 매우 중요하다. 비파괴검사 결과에 대한 유효성은 비파괴검사을 실시하는 사람의 능력이나 비파괴검사에 대한 책임을 지고 있는 사람의 능력에 크게 의존한다. 1974년부터 원자력 선진국들이 중심이 되어 수행된 PISC 프로그램(program for inspection of steel components) 및 EPRI 등에서는 순회시험 (piping inspection round-robin: PIRR trial) 결과 기존 비파괴검사 방법은 모의 시험편에 있는 상당히 큰 결함도 탐지하지 못하거나 정확한 결함크기를 측정하는데 실패한 경우가 있으며, 검사자의 기량 또는 신체조건에 상당한 차이가 있는 것으로 나타났다[1]. 국제표준화기구(ISO)의 비파괴검사 기술자의 기량인정 및 인증에 대한 국제규격안 DIS(draft international standard) 9712에서는 비파괴검사를 기획 실시 감독 감시 평가를 하기 위한 적절한 이론적 및 실무적 지식을 필요로 하는 기술자의 능력을 평가하고, 문서화하는 방법을 제공하는 절차를 제시하고 있다. 국제표준화기구에 의한 비파괴검사 기술자의 기량인정 및 인증에 대한 국제통합을 추진하는 동기는 제 3자에 의한 체계적인 인증시스템을 가지고 있지 않은 나라와 새로운 NDT 방법에 대해서 인증제도를 적용할 때 세계적인 공통성을 갖도록 유도하기 위함이다. 현재, 우리나라 비파괴검사 기술자의 기술자격 인증제도는 국가기술자격법에 의거하여 한국산업인력공단에서 주관하여 기술사, 기사, 산업기사, 기능사로 구분하여 실시하고 있다. 국제표준화기구의 비파괴검사 기술자의 자격과 인증에 대한 국제 통합화(안)[2]이 거의 마무리 단계에 있고 일본을 비롯한 많은 나라가 국제규격을 기초로 한 새로운 인증제도를 발족시켜 거의 시행 단계에 있다. 반면 국내에서는 한국비파괴검사학회(KSNT)에서 비파괴검사 기술자의 자격인정 및 인증제도의 개선방향이 제시된 바 있고 [3], 표준화위원회에서 나름대로 준비를 하고 있으나 아직 구체적인 실천단계에와 있지 못하다. 본 고에서는 최근 대폭수정 보완된 ISO/DIS 9712 국제규격(안)을 회원들에게 소개하고, 우리나라의 향후 대응방안에 관한 회원 여러분의 의견 수렴에 도움을 주고자 ISO/DIS 9712(1997)를 번역하여 제공한다.

• The Journal of the Korea Contents Association
• /
• v.6 no.7
• /
• pp.58-68
• /
• 2006

There are two traditional scheduling methods known as PQ and WRR in the DiffServ network, however, these two scheduling methods have some drawbacks. In this paper, we propose an algorithm that can be adopted in WRR scheduler with making up for weak points of PQ and WRR. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assign the weight of WRR scheduler with checking the Queue status of each class. To evaluate the performance of the proposed algorithm, We accomplished a computer simulation using NS-2. From simulation results, the proposed algorithm improves the packet loss rate of the EF class traffic to 6.5% by comparison with WRR scheduling method and that of the AF4 class traffic to 45% by comparison with PQ scheduling method.

• Journal of Korea Multimedia Society
• /
• v.9 no.7
• /
• pp.827-834
• /
• 2006

In distributed virtual environment, system response time to users' interactions is an importance factor to determine the degree of contentment with the system. Generally, response time is affected by the efficiency of event message processing algorithm, and most of previous systems use FCFS algorithm, which processes message traffic sequentially based only on the event occurrence time. Since this method totally depends on the order of occurrence without considering the priorities of events, it has a problem that might drop the degree of system response time by causing to delay processing message traffic when a bottleneck phenomenon happens in the server side. To overcome this limitation of FCFS algorithm, this paper proposes a concurrent event scheduling algorithm, which is able to process event messages concurrently by assigning the priorities to the events. It is also able to satisfy the two goals of system together, consistency and responsiveness through the combination of occurrence time with priority concept of events.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.567-574
• /
• 2006

VG-AnyLAN is a local area network standard developed by the IEEE 802.12 project. While preserving the frame format of IEEE 802.3, VG-AnyLAN adopts a new medium access control called Demand Priority where transmission requests of stations are arbitrated by a control hub in a round-robin manner. Unlike CSMA/CD which is the medium access control of IEEE 802.3, the Demand Priority, while providing the maximum bound on the packet delay, does not put the limit on the network segment size. In this paper, we analyze the delay and the channel utilization performances of the medium access control of IEEE 802.12 VG-AnyLAN. We develope an analytic model of the system under assumptions that each station generates traffic of the equal priority and that the packets are of fixed length. Using the analytic model, we obtain the recursive expression of the average channel utilization and the average access delay The numerical results obtained via analysis are compared to the simulation results of the system for a partial validation of our analysis.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.2
• /
• pp.183-194
• /
• 2002

The clustering environment with heterogeneous workstations provides the cost effectiveness and usability for executing applications in parallel. Load balancing is considered a necessary feature for a cluster of heterogeneous workstations to minimize the turnaround time. Previously, static load balancing that assigns a predetermined weight for the processing capability of each workstation, or dynamic approaches which execute a benchmark program to get relative processing capability of each workstation were proposed. The execution of the benchmark program, which has nothing to do with the application being executed, consumes the computation time and the overall turnaround time is delayed. In this paper, we present efficient methods for task distribution and task migration, based on the relative load index. We designed and implemented a load balancing system for the clustering environment with heterogeneous workstations. Turnaround times of our methods and the round-robin approach, as well as the load balancing method using a benchmark program, were compared. The experimental results show that our methods outperform all the other methods that we compared.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.128-131
• /
• 2006

There are two traditional scheduling methods known as PQ and WRR in the DiffServ network, however, these two scheduling methods have some drawbacks. In this paper, we propose an algorithm that can be adopted in WRR scheduler with making up for weak points of PQ and WRR. The proposed algorithm produces the control discipline by the fuzzy theory to dynamically assigns the weight of WRR scheduler with checking the Queue status of each class. To evaluate the performance of the proposed algorithm, We accomplished a computer simulation using NS-2. In result, the proposed algorithm enhances the packet discard rate at the EF class than WRR scheduling method and the AF4 class than PQ scheduling method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.508-516
• /
• 2006

The explosive growth of wireless network users and the existence of various wireless services have demanded high rate throughput as well as user's QoS guarantees. Towards this, this paper proposes QoS-oriented subcarrier allocation scheme considering the QoS provisioning of multiple users, which is major requirement for wireless network design point of view. This paper introduces joint RR/K&H combined with M-LWDF(Modified Largest Weighted Delay First) scheme throughout observing statistical channel behavior and real time queuing analysis for appropriate resource allocation tightly connected to multiuser scheduling. Accordingly, the system throughput can be enhanced, and the QoS demanded for delay sensitive services can be satisfied. Furthermore, the proposed scheme is applied for OFDMA(Orthogonal Frequency Division Multiple Access) systems to allocate sub-carriers in optimal way. The simulation results verify plausible performances of proposed resource allocation scheme via showing superior effective capacity under time-varying physical-layer channel behaviors.