• Journal of applied mathematics & informatics
• /
• v.35 no.3_4
• /
• pp.387-397
• /
• 2017

In order to react the dynamic behavior of the system more actually, it is necessary to solve the first problem of synchronization for Markovian jump complex network system in practical engineering problem. In this paper, the problem of local stochastic synchronization for Markovian nonlinear coupled neural network system is investigated, including nonlinear coupling terms and mode-dependent delays, that is less restriction to other system. By designing the Lyapunov-Krasovskii functional and applying less conservative inequality, we get a new criterion to ensure local synchronization in mean square for Markovian nonlinear coupled neural network system. The criterion introduced some free matrix variables, which are less conservative. The simulation confirmed the validity of the conclusion.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.10
• /
• pp.33-38
• /
• 2011

A novel low-power synchronization technique is presented for the local synchronization. Since the proposed technique transmits an enable signal instead of a clock signal which consumes large power, it can considerably reduce the power consumption. The source-synchronization scheme which is widely adopted for the local synchronization is compared with the proposed technique. It is shown that the proposed low-power synchronization technique provides approximately 50% power saving.

• 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.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.13 no.6
• /
• pp.329-335
• /
• 2018

Offline-first strategy is that it allows data to be saved while offline, and when connected online, data is synchronized to ensure that all devices have the same data. Multi-device is a term that shares data through synchronization on various platforms on Android, ios, etc. First, all of the data is stored in the local repository like SQLite and then on the server via HTTP communication. Then, the synchronization is completed by receiving the changed data from the server and storing it in the local repository at the time of the synchronization, and sending the changes to the server from the client. We proposed and implemented a database structure, APIs, and a illustrative application running on PC and Android phone.

• Journal of electromagnetic engineering and science
• /
• v.5 no.1
• /
• pp.26-30
• /
• 2005

It is important to know phase offsets of PN(Pseudo Noise) sequences in spread spectrum communications since the acquisition is equivalent to making a phase offset between a receiving PN sequence and a PN sequence of local PN generator be identical. In this paper, a phase offset enumeration method for PN sequences with error detection, and its application to the synchronization are proposed. The phase offset enumeration for an n-tuple PN sequence and its error detection are performed when one period of the sequence is received. Once the phase offset of the receiving sequence is calculated, we can easily accomplish the synchronization by initializing shift registers of a local PN generator according to the phase offset value. The mean acquisition time performance of the proposed scheme was derived analytically. Since this synchronization scheme can be realized by using simple circuit and acquires very rapid acquisition in high SNR but shows performance degradation in low SNR, it can be especially useful in indoor and office environments.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.2
• /
• pp.194-201
• /
• 2010

This paper discuss a performance evaluation of the synchronization algorithm for hybrid networks in industrial environments. The proposed algorithms minimizes synchronization errors which were caused from channel, Propagation, and frequency delays. The modified RBS and offset synchronization methods can be operated by adjustment parameters. The differential BP (Back-off Period) adjustment can synchronize the local time of each node with master node's time in hybrid networks. For the performance analysis, the data transmission time between the wired and wireless devices are investigated. The experimental results show the performance evaluations in terms of the polling service time and an average end-to-end delay.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.2 no.3
• /
• pp.138-144
• /
• 2007

Wireless Sensor Network(WSN) consists of a lot of light-weight sensor nodes with the capability of wireless communication. Studies have been done to improve stability and fault-tolerancy of WSN because the sensor nodes are basically vulnerable to the harsh environment. Specially, the time synchronization among sensor nodes becomes a challenging issue in WSN. All the local times should always keep the same with each other in the sensor field to perform data aggregation and energy-aware communication in WSN. In this paper, a new time synchronization technique is proposed to operate efficiently irrespective of the number of sensor nodes and the number of hops needed to cover all sensor nodes for synchronization. Simulation results show that the proposed technique has the lowest amount of packet traffic among the several time synchronization techniques.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2A
• /
• pp.157-165
• /
• 2004

The synchronization algorithm of IEEE 802.11a WLAN(Wireless Local Area Network) has three consecutive processes, which use a short code training symbol, a long code training symbol and a pilot symbol respectively. But in using this synchronization processes, the actual embodiment has two problems. First, the synchronization process has the complex structure using a long code training symbol and a pilot symbol. Second, since the long training symbol is only compensated with the offset correction coefficient, it can not be trusted perfectly. If the equalizer coefficient is obtained in this unstable period, the system performance is degraded. In particular, the system performance becomes worst in case of the 54 Mbps transmission system using the maximum length of data. In this paper, the new algorithm is proposed which can resolve the embodiment complexity of synchronization processes and structural defect, and also it is confirmed by simulation.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.42 no.1
• /
• pp.13-21
• /
• 2005

This paper presents a fuzzy model-based approach for synchronization of time-delay chaotic system with input saturation. Time-delay chaotic drive and response system is respectively represented by Takagi-Sugeno (T-S) fuzzy model. Specially, the response system contains input saturation. Using the unidirectional linear error feedback and the parallel distributed compensation (PDC) scheme, we design fuzzy chaotic synchronization system and analyze local stability for synchronization error dynamics. Since time-delay in the transmission channel always exists, we also take it into consideration. The sufficient condition for the local stability of the fuzzy synchronization system with input saturation and time-delay is derived by applying Lyapunov-Krasovskii theory and solving linear matrix inequalities (LMI's) problem. A numerical example is given to demonstrate the validity of the proposed approach.

• Journal of Communications and Networks
• /
• v.6 no.3
• /
• pp.197-202
• /
• 2004

This work presents a stability analysis of the synchronous state for one-way master-slave time distribution networks with single star topology. Using bifurcation theory, the dynamical behavior of second-order phase-locked loops employed to extract the synchronous state in each node is analyzed in function of the constitutive parameters. Two usual inputs, the step and the ramp phase perturbations, are supposed to appear in the master node and, in each case, the existence and the stability of the synchronous state are studied. For parameter combinations resulting in non-hyperbolic synchronous states the linear approximation does not provide any information, even about the local behavior of the system. In this case, the center manifold theorem permits the construction of an equivalent vector field representing the asymptotic behavior of the original system in a local neighborhood of these points. Thus, the local stability can be determined.