• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.9
• /
• pp.2022-2028
• /
• 2015

SpaceWire is a standard for high-speed links and networks between spacecraft components, which was invented for better, cheaper and faster on-board data handling in spacecraft. The standard defines timecode and its distribution which can be used for time synchronization among the nodes in a SpaceWire network. A timecode output from the time master which provides standard time over a SpaceWire network travels through links and routers to reach every nodes. While traveling, a timecode suffers from transmission delay and jitter which cause some difference in time synchronization among nodes. In this work, a simulator was developed using OMNeT++ to simulate the operation of a SpaceWire network and some analyses were performed on the transmission delay and jitter accompanied with a transmission of a timecode. The result will be used in the near future for the research of a precise time synchronization technique over a SpaceWire network.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.5
• /
• pp.409-416
• /
• 2000

In the shared-memory mutiprocessor systems, shared processing techniques such as time-sharing, space¬sharing, and gang-scheduling are used to improve the overall system utilization for the parallel operations. Recently, LLPC(Loop-Level Process Control) allocation technique was proposed. It dynamically adjusts the needed number of processors for the execution of the parallel code portions based on the current system load in the given job. This method allocates as many available processors as possible, and does not save any processors for the parallel sections of other later-arriving applications. To solve this problem, in this paper, we propose a new processor allocation technique called FPA(Fuzzy Processor Allocation) that dynamically adjusts the number of processors by fuzzifYing the amounts ofueeded number of processors, loads, and estimated execution times of job. The proposed method provides the maximum possibility of the parallism of each job without system overload. We compare the performances of our approaches with the conventional results. The experiments show that the proposed method provides a better performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.4
• /
• pp.750-760
• /
• 1994

In this paper we proposed a multiplexing scheme of real time and non-real traffics in which a congestion control is embedded. Real time traffics are assumed to be nonqueuable and have preemptive priority over non-real time traffics in seizing the common output link, whereas the non-real time traffics wait in the common buffer if the output link is not available for transmission. Real time traffics are encoded according to the bandwidth reduction strategy, paticularly when congestion occurs among non-real time traffics. This scheme provides us an efficient way for utilizing the costly bandwidth resources, by accommodation as many real time traffics as possible with gauranteeing its mimimum bandwidth requirements, and also resloving the congestion encountered among non-real time traffics. We describe the system as a Markov queueing system, provide the analysis by exploiting the matrix geometric method, and present the performance for various performance measures of interest. Some numerical results are also provided.

• Analytical Science and Technology
• /
• v.18 no.6
• /
• pp.483-490
• /
• 2005

Mass resolution of the time of flight aerosol mass spectrometer for an aerosol component analysis depends on the initial direction and the initial energy of the ions. We have found that the shape of the optimum post focusing electric field is not linear. The maximum electric potential should be applied to the ions whose initial direction is 90 degree. To check on the post focusing effects, we have installed a laser ablation mass spectrometer. By using this LA-MS, we have found that the average energy distribution of the laser ablated ions is 8 eV. To establish the optimum mass resolution, a time delay and a high voltage are needed, and the results of the study show that 1500 nsec, and 3.7 kV are the optimum parameters for our system respectively. The isotope mass signals of copper show a good resolution.

• Journal of KIISE:Databases
• /
• v.37 no.6
• /
• pp.324-332
• /
• 2010

The majority of event detection in real-time embedded sensor network systems is based on data fusion that uses noisy sensor data collected from complicated real-world environments. Current research has produced several excellent low-level mechanisms to collect sensor data and perform aggregation. However, solutions that enable these systems to provide real-time data processing using readings from heterogeneous sensors and subsequently detect complex events of interest in real-time fashion need further research. We are developing real-time event detection approaches which allow light-weight data fusion and do not require significant computing resources. Underlying the event detection framework is a collection of real-time monitoring and fusion mechanisms that are invoked upon the arrival of sensor data. The combination of these mechanisms and the framework has the potential to significantly improve the timeliness and reduce the resource requirements of embedded sensor networks. In addition to that, we discuss about a privacy that is foundation technique for trusted embedded sensor network system and explain anonymization technique to ensure privacy.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.4
• /
• pp.239-246
• /
• 2009

In this study, we analyze the mean waiting time on the nested open queueing network, where the population within each subnetwork is controlled by a semaphore queue. The queueing network can be transformed into a simpler queueing network in terms of customers waiting time. A major characteristic of this model is that the lower layer flow is halted by the state of higher layer. Since this type of queueing network does not have exact solutions for performance measure, the lower bound and upper bound on the mean waiting time are checked by comparing them with the mean waiting time in the transformed nested queueing network. Simulation estimates are obtained assuming Poisson arrivals and other phase-type arrival process, i.e., Erlang and hyper-exponential distributions. The bounds obtained can be applied to get more close approximation using the suitable approach.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.1 no.3
• /
• pp.33-40
• /
• 2008

The TMO may contain two types of methods, time-triggered methods(also called the spontaneous methods of SpMs) which are clearly separated from the conventional service methods (SvMs). The SpM executions are triggered upon design time whereas the SvM executions are triggered by service request message from clients. In this paper, we describes the application environment as the patient monitor telemedicine system with TMO structure. Vital sign information web viewer systems is also the standard protocol for medical image and transfer. In order to embrace new technologies as telemedicine service, it is important to develope the standard protocol between different systems in the hospital, as well as the communication with external hospital systems. It is able to apply to remote medical examination and treatment. Through the proper data exchange and management of patient vital sign information, real time vital sign information management will offer better workflow to all hospital employee.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.5
• /
• pp.377-388
• /
• 2020

In this paper, the autonomous mobile robot whit only LRF sensors proposes an algorithm for avoiding moving obstacles in an environment where a global map containing fixed obstacles. First of all, in oder to avoid moving obstacles, moving obstacles are extracted using LRF distance sensor data and a global map. An ellipse-shaped safety radius is created using the sum of relative vector components between the extracted moving obstacles and of the autonomuos mobile robot. Considering the created safety radius, the autonomous mobile robot can avoid moving obstacles and reach the destination. To verify the proposed algorithm, use quantitative analysis methods to compare and analyze with existing algorithms. The analysis method compares the length and run time of the proposed algorithm with the length of the path of the existing algorithm based on the absence of a moving obstacle. The proposed algorithm can be avoided by taking into account the relative speed and direction of the moving obstacle, so both the route and the driving time show higher performance than the existing algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.12
• /
• pp.2853-2858
• /
• 2013

This paper proposes the ITMS(Intelligent Transport Monitoring System) which manages the route and state of freight by using the Meteorological Office, the Transportation Management Center, GPS and Sensors, etc. The ITMS consists of the CIMS(Container Inner Monitoring System) transmitting the inner temperature and humidity of a container, the TMM(Transport Management Module) computing an estimated time of arrival with Freight Vehicle location information and transmits the result to the CIMS, the FMM(Freight Management Module) checking and managing the freight freshness by using the temperature and humidity of the collected containers, and the SMM(Stevedoring Management Module) selecting the container loading and unloading places with the information transmitted from the CIMS, the TMM, and the FMM and attaching the freight formation to containers using an RFID label. The ITMS not only checks the freight condition at intervals but also acquires and manages the freight information with RFID labels rapidly and accurately.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.117-126
• /
• 2013

A ship is intended to reach a specified target point in the minimum-time when it travels with a constant speed through a region of strong currents and its heading angle is the control variable. This is called the Zermelo's navigation problem. Its approximate solution for the minimum-time control may be found using the calculus of variation. However, the accuracy of its approximate solution is not high since the solution is based on a table form of inverse relations for some complicated nonlinear equations. To enhance the accuracy, this paper employs the neural network to represent the inverse relation of the complicated nonlinear equations. The accurate minimum-time control is possible with the interpolation property of the neural network. Through the computer simulation study we have found that the proposed method is superior to the conventional ones.