• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.12
• /
• pp.1027-1033
• /
• 2016

There is an increasing need for manufacturing systems to produce batches in small quantities. Such manufacturing systems are significantly difficult to develop with conventional automation equipment. Recently, several research groups have applied industrial dual-arm robots to cell production lines. A synchronization method for robots is necessary for the cell production process when robots work in a shared workspace. Conventional automation factories do not need this method because the main control system operates all of the machines or robots. However, our intended application for the developed robot is in small manufacturing environments that cannot install an expensive main control system. We propose an inexpensive and high-performance method with a simple digital in/out channel using a real-time communication protocol. The developed method was validated in a pilot production line for cellular phone packing.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.3
• /
• pp.405-415
• /
• 2012

In many applications a reader needs to determine whether a particular tag exists within a group of tags without a server. This is referred to as serverless RFID tag searching. A few protocols for the serverless RFID searching are proposed but they are the single tag search protocol which can search a tag at one time. In this paper, we propose a multi-tag search protocol based on a hash function and a random number generator which can search some tags at one time. For this study, we introduce a protocol which can resolve the problem of synchronization of seeds when communication error occurs in the S3PR protocol[1], and propose a multi-tag search protocol which can reduce the communication overhead. The proposed protocol is secure against tracking attack, impersonation attack, replay attack and denial-of-service attack. This study will be the basis of research for multi-tag serach protocol.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.12
• /
• pp.1099-1105
• /
• 2000

The interactive bicycle simulator presented in this paper consists of a Stewart platform manipulator, magneto-rheological steering and braking devices, and a visual simulator. To provide a rider with reality, these devices should be controlled in real-time and motions of the devices and the visual should be also synchronized. If any of the devices and the visual gets unsynchronized due to significant blocking of control signals, the reality of the simulator is no longer secured. This paper presents communication protocols that minimize the blocked time of the control processes to guarantee the synchronization. The protocols are designed based on IPC (InterProcess Communications) of QNX, TCP/IP, and serial communication. The performance of the designed communication protocols is evaluated with the implemented bicycle simulator, and found satisfactory.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.1722-1723
• /
• 2007

This paper describes a simple method to reduce rotation angle error of mobile robot using omni-wheel[3](omni-bot). This method can be applied to not only omni-bot, but also other robot with a large number of servo motor. Robot using many servo motor as omni-bot is complicated for hardware and software, each servo motor has difficulty in synchronizing. Three servo motor, three omni-wheel and three serial servo motor controller is used, PC or Micro Processor interface with the serial servo controller through "SSC100" protocol. In order to check the improvement of the proposed serial servo synchronization compared to existing sequential communication method. comparing object is rotation angle error of omni-bot. The results of this make building of omni-bot system easy and decrease rotation angle error.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2226-2231
• /
• 2008

As the mobile devices and the wireless networks have high-performance capabilities, it is possible to synchronize the spatio-temporal data of a server with the spatio-temporal data of a mobile device which are collected at a field. However, since the server process the synchronization which the model device requests, the whole synchronizations of mass mobile devices take long time. In this paper, we propose the scheme to process concurrently the synchronizations of mobile devices to use multi-queue which does not conflict.

• KIPS Transactions on Computer and Communication Systems
• /
• v.11 no.10
• /
• pp.373-380
• /
• 2022

This paper presents a deep learning based group synchronization that supports networked immersive interactions between remote users. The goal of group synchronization is to enable all participants to synchronously interact with others for increasing user presence Most previous methods focus on NTP-based clock synchronization to enhance time accuracy. Moving average filters are used to control media playout time on the synchronization server. As an example, the exponentially weighted moving average(EWMA) would be able to track and estimate accurate playout time if the changes in input data are not significant. However it needs more time to be stable for any given change over time due to codec and system loads or fluctuations in network status. To tackle this problem, this work proposes the Deep Group Synchronization(DeepGroupSync), a group synchronization based on deep learning that models important features from the data. This model consists of two Gated Recurrent Unit(GRU) layers and one fully-connected layer, which predicts an optimal playout time by utilizing the sequential playout delays. The experiments are conducted with an existing method that uses the EWMA and the proposed method that uses the DeepGroupSync. The results show that the proposed method are more robust against unpredictable or rapid network condition changes than the existing method.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.5
• /
• pp.79-91
• /
• 2011

In this paper, a DS (Data Synchronization) server for mobile communication environments is constructed and the suitability and the performance of its operations are validated. The DS server provides a way to update the newest data and keep data consistency for clients (mobile devices). In addition, the DS server constructed in this paper supports various synchronization types, and detects all changes and conflicts. In case of data conflicts, the DS server resolves the conflicts according to the several policies implemented in this work. The DS server conforms to the OMA(Open Mobile Alliance) DS standard protocol for interoperability with other mobile devices and servers. In addition to the transmission-by record scheme proposed by the OMA DS standard protocol, the DS server constructed in this paper also provides the transmission-by field scheme for the enhancement transmission performance between the server and clients. In order to validate its operations, data synchronization between the DS server and the SCTS (SyncML Conformance Test Suit), the suitability validation tool provided by the OMA, is performed. The validation results show that the DS server constructed in this paper satisfies all of the test cases except the Large Object function. The Large Object function will be implemented later because the function is not needed for the personal information synchronization process which this paper aims for. Also, synchronization times of the DS server are measured while increasing the number of data and clients. The results of the performance evaluations demonstrate that the DS server is scalable, in the sense that it has not suffered from any serious bottlenecks with respect to the number of data and clients. We expect that this work will provide a framework for various studies in the future for improving mobile DS operations.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.6
• /
• pp.1-9
• /
• 2012

Low-cost RFID tags are used in many applications. However, since it has very limited power of computation and storage, it's not easy to make a RFID mutual authentication protocol which can resist from the various security attacks. Quite recently, Tian et al. proposed a new ultralightweight authentication protocol (RAPP) for low-cost RFID tags using the low computation cost operations; XOR, rotation, and permutation operations, which is able to resist from the various security attacks. In this paper, we show that RAPP is vulnerable to the de-synchronization attack and present an improved RAPP which overcomes the vulnerability of RAPP.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.4
• /
• pp.331-339
• /
• 2018

The IEEE 1588, commonly known as a precision time protocol (PTP), is a standard for precise clock synchronization that maintains networked measurements and control systems. The best master clock (BMC) algorithm is currently used to establish the master-slave hierarchy for PTP. The BMC allows a slave clock to automatically take over the duties of the master when the slave is disconnected due to a link failure and loses its synchronization; the slave clock depends on a timer to compensate for the failure of the master. However, the BMC algorithm does not provide a fast recovery mechanism in the case of a master failure. In this paper, we propose a technique that combines the IEEE 1588 with network bonding to provide a faster recovery mechanism in the case of a master failure. This technique is implemented by utilizing a pre-existing library PTP daemon (Ptpd) in Linux system, with a specific profile of the IEEE 1588 and it's controlled through bonding modes. Network bonding is a process of combining or joining two or more network interfaces together into a single interface. Network bonding offers performance improvements and redundancy. If one link fails, the other link will work immediately. It can be used in situations where fault tolerance, redundancy, or load balancing networks are needed. The results show combining IEEE 1588 with network bonding enables an incredible shorter recovery time than simply just relying on the IEEE 1588 recovery method alone.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.1916-1932
• /
• 1997

The synchronous stream cipher which require absoulte clock synchronization has the problem of synchronization loss by cycle slip. Synchronization loss makes the state which sender and receiver can't communicate with each other and it may break the receiving system. To lessen the risk, we usually use a continuous resynchronization method which achieve resynchronization at fixed timesteps by inserting synchronization pattern and session key. While we can get resynchronization effectively by continuous resynchroniation, there are some problems. In this paper, we proposed an adaptive resynchronization algorithm for cipher system using HDLC protocol. It is able to solve the problem of the continuous resynchronization. The proposed adaptive algorithm make resynchronization only in the case that the resynchronization is occurred by analyzing the address field of HDLC. It measures the receiving rate of theaddress field in the decision duration. Because it make resynchronization only when the receiving rate is greateer than the threshold value, it is able to solve the problems of continuous resynchronization method. When the proposed adaptive algorithm is applied to the synchronous stream cipher system in packet netork, it has addvance the result in R_e and D_e.