• The Journal of the Korea Contents Association
• /
• v.7 no.8
• /
• pp.50-58
• /
• 2007

We design a filtering management scheme with synchronization function under a realtime RFID middleware system for larger-scale data processing. The application interface(AI) is to support a various access protocol, HTTP, XML, JMS, and SOAP for the RFID applications. Generally, the synchronization problem is occurred in multiple accessing of clients for single filtering file. In this paper, we implement a filtering management scheme supporting the synchronization using the filter management process, and then demonstrate the RFID middleware filtering scheme.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.2 no.1
• /
• pp.66-75
• /
• 2007

In this paper, we have propose a preamble structure and synchronization/channel estimation method for UWB-MIMO which has 960Mbps transmit rate. The proposed structure is a compatible preamble structure for synchronization/channel estimation used by MIMO in MB-OFDM(Multi-Band OFDM) systems that are one of the standard systems of MBOA. The system is compatible with MB-OFDM using the proposed preamble structure. In this paper, we argue the problem in receiver part used by MIMO technique. And we simulate the proposed preamble for using synchronization/channel estimation. The simulation result shows the same performance compared with single receiver antenna.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.11 no.2
• /
• pp.89-95
• /
• 2003

We consider a problem of application of analytical redundancy to engine synchronization process of spark ignition engines, which is critical to timing for every ECU process including ignition and injection. The engine synchronization process we consider here is performed using the pulse signal obtained by the revolution of crankshaft trigger wheel (CTW) coupled to crank shaft. We propose a discrete-time linear model for the signal, for which we construct FDI (Fault Detection & Isolation) system consisting residual generator and threshold based on linear observer.

• Journal of Communications and Networks
• /
• v.7 no.1
• /
• pp.1-12
• /
• 2005

Ethernet is being deployed in metropolitan area networks (MANs) as a lower-cost alternative to SONET-based infrastructures. MANs are usually required to support common communication services, such as voice and frame relay, based on legacy synchronous TDM technology in addition to asynchronous packet data transport. This paper addresses the clock synchronization problem that arises when transporting synchronous services over an asynchronous packet infrastructure, such as Ethernet. A novel algorithm for clock synchronization is presented combining time-stamp methods used in the network time protocol (NTP) with signal processing techniques applied to measured packet interarrival times. The algorithm achieves the frequency accuracy, stability, low drift, holdover performance, and rapid convergence required for viable emulation of TDM circuit services over Ethernet.

• Journal of Korea Multimedia Society
• /
• v.22 no.8
• /
• pp.887-896
• /
• 2019

In this paper, we discuss an optimization approach for time-synchronizations in networked simulators. This method is a sub-technology that is required to combine heterogeneous simulators into a single simulation. In previous time-synchronization studies, they had built a network system among networked simulators. The network system collects network packets and adds time-stamps to the networked packets based on the time that occurs in events of simulation objects in the individual simulators. Then, it sorts them in chronological order. Finally, the network system applies time-synchronization to each simulator participating in interworking sequentially. However, the previous approaches have a limitation in that other participating simulators should wait for while processing an event in a simulator in a time stamp order. In this paper, we attempt to solve the problem by optimizing time-synchronizations in networked simulation environments. In order to prove the practicality of our approach, we have conducted an experiment. Finally, we discuss the contributions of this paper.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.4
• /
• pp.357-367
• /
• 2005

According to the recent advancement of mobile computing technology and the hardware technology, the mobile device has rapidly come into wide use.'rho data in the central management server needs to confirm to that in mobile devices in order for the mobile device users to access the needed data regardless of time and place. This is called Data Synchronization. Currently, major mobile device manufacturing companies provide the data synchronization solutions, but these solutions are not compatible with other mobile devices/other applied services. In order to solve this problem, OMA(Open Mobile Alliance), mainly composed of mobile telecommunication companies, has suggested using the SyncML(Synchronization Markup Language) data synchronization method. This is an attempt to make a public standard. In this paper, the data synchronization client that synchronizes the PIMS (Personal Information Management System) data in mobile devices like PDA is developed, complying with the SyncML standard requirements.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.183-186
• /
• 2008

In ubiquitous GIS system, the spatial information could be updated and utilied by mobile terminals. Spatial information stored in mobile terminals should be able to synchronize to the server. However, in mobile environment, there are some limitations in synchronization service due to the limited bandwidth. The ActMAP system, that was developed to consider of mobile environment, has suggested a partial update protocal for synchronization in order to solve the narrow bandwidth problem. But it is still has a problem that it does not consider two-way synchronization between a server and a mobile terminal. This paper suggests a two-way synchronization protocol between a server and mobile terminals. It, therefore, is inclined to supporting updated and utilization of spatial information using mobile terminals.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.7
• /
• pp.16-23
• /
• 2018

Chaos is one of the most significant topics in nonlinear science, and has been intensively studied since the Lorenz system was introduced. One characteristic of a chaotic system is that the signals produced by it do not synchronize with any other system. It therefore seems impossible for two chaotic systems to synchronize with each other, but if the two systems exchange information in just the right way, they can synchronize. This paper addresses the problem of synchronization in a modified Lorenz chaotic system based on active control, sliding mode control, and the Lyapunov stability theory. The considered synchronization scheme consists of identical drive and response generalized systems coupled with linear state error variables. For this, a brief overview of the modified Lorenz chaotic system is given. Then, control rules are derived for chaos synchronization via active control and slide mode control theory, with a strategy for solving the chattering problem. The asymptotic stability of the overall feedback system is established using the Lyapunov stability theory. A set of computer simulation works is presented graphically to confirm the validity of the proposed method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1264-1274
• /
• 1999

본 논문에서는 분산된 클록들을 주기적으로 동기화 시키는 분산 실시간 시스템에서 시간적 제약을 만족시키기 위한 정적/동적 시간 제약(timing constraint) 변환 기법을 제안한다. 전형적인 이산클록동기화(discrete clock synchronization) 알고리즘은 클록의 값을 순간적으로 조정하여 클록의 시간이 불연속적으로 진행한다. 이러한 시간상의 불연속성은 시간적 이벤트를 잃어버리거나 다시 발생시키는 오류를 범하게 한다.클록 시간의 불연속성을 피하기 위해 일반적으로 연속클록동기화(continuous clock synchronization) 기법이 제안되고 있지만 소프트웨어적으로 구현되면 많은 오버헤드를 유발시키는 문제점이 있다. 본 논문에서는 시간적 제약을 동적으로 변환시키는 DCT (Dynamic Constraint Transformation) 기법을 제안하였으며, 이를 통해 기존의 이산클록동기화 알고리즘을 수정하지 않고서도 클록 시간의 불연속성에 의한 문제점들을 해결할 수 있도록 하였다. 아울러 DCT에 의해 이산클록동기화 하에서 생성된 태스크 스케쥴이 연속클록동기화에 의해 생성된 스케쥴과 동일함을 증명하여 DCT의 동작이 이론적으로 정확함을 증명하였다.또한 분산 실시간 시스템에서 지역 클록(local clock)이 기준 클록과 완벽하게 일치하지 않아서 발생하는 스케쥴링상의 문제점을 다루었다. 이를 위해 먼저 두 가지의 스케쥴링 가능성, 지역적 스케쥴링 가능성(local schedulability)과 전역적 스케쥴링 가능성(global schedulability)을 정의하고, 이를 위해 시간적 제약을 정적으로 변환시키는 SCT (Static Constraint Transformation) 기법을 제안하였다. SCT를 통해 지역적으로 스케쥴링 가능한 태스크는 전역적으로 스케쥴링이 가능하므로, 단지 지역적 스케쥴링 가능성만을 검사하면 스케쥴링 문제를 해결할 수 있도록 하였고 이를 수학적으로 증명하였다.Abstract In this paper, we present static and dynamic constraint transformation techniques for ensuring timing requirements in a distributed real-time system possessing periodically synchronized distributed local clocks. Traditional discrete clock synchronization algorithms that adjust local clocks instantaneously yield time discontinuities. Such time discontinuities lead to the loss or the gain of events, thus raising serious run-time faults.While continuous clock synchronization is generally suggested to avoid the time discontinuity problem, it incurs too much run-time overhead to be implemented in software. We propose a dynamic constraint transformation (DCT) technique which can solve the problem without modifying discrete clock synchronization algorithms. We formally prove the correctness of the DCT by showing that the DCT with discrete clock synchronization generates the same task schedule as the continuous clock synchronization.We also investigate schedulability problems that arise when imperfect local clocks are used in distributed real-time systems. We first define two notions of schedulability, global schedulability and local schedulability, and then present a static constraint transformation (SCT) technique. The SCT ensures that it is sufficient to check the schedulability of a task locally in a node with a local clock, since the global schedulability of the task is derived from its local schedulability through SCT. We formally prove the correctness of SCT.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.783-798
• /
• 2004

An e-business client application in ubiquitous mobile computing environment may become disconnected from the enterprise server due to broken communication connections caused by the limitation of mobile computing environments(limited battery life of the mobile device, low bandwidth communication, incomplete wireless communication infrastructure, etc). It Is even Possible that mobile client application Intentionally operates in disconnected mode to reduce communication cost and the power consumption of the mobile device. We use “data hoarding” as a means of providing local autonomy to allow transactions to be processed and committed on the mobile host despite of disconnection. The key problem to this approach is the synchronization problem that serialize potentially conflicting updates from disconnected clients on master objects of the server database. In this paper, we present a new transaction synchronizing method that splits a transaction into a set of independent component transactions and give the synchronization priority on each component taking the possibility of use and conflicts in the server into consideration. Synchronization is performed component by component based un synchronization priority. After the Preferred component of a no bile transaction succeeds in synchronization with the server, the mobile transaction can pre-commit at server. A pre-committed transaction's updated value is made visible at server before the final commit of the transaction. The synchronization of the component with low synchronization priority can be delayed in adaption to wireless bandwidth and computing resources. As a result, the availability of important data updated by mobile client is increased and it can maximize the utilization of the limited wireless bandwidth and computing resources.