• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.357-368
• /
• 2007

This paper proposes the SAMD(Synchronization Algorithms based on Message Digest) algorithm based on message digest in order to data synchronization between a database server and a mobile database. The SAMD algorithm makes the images at the database server and the mobile database using message digest tables and compares two images in order to select the rows needed to synchronization. If two images are different, the synchronization is progressed according to synchronization policy. The SAMD algorithm does not use techniques which are dependent the some database vendor and also triggers, stored procedures and timestamps. The SAMD only uses the standard SQL functions for the synchronization. Therefore the SAMD algorithm is used in any combinations of the database server and the mobile database because the SAMD algorithm is not depended on some database venders. Also the SAMD algorithm shows better performance compared with existing synchronization products.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.251-260
• /
• 2011

In this paper, we proposed a scheme that it safely exchanges encrypted keys without Trust Third Party (TTP) and Pre-distributing keys in multi-hop clustering sensor networks. Existing research assume that it exists a TTP or already it was pre-distributed a encrypted key between nodes. However, existing methods are not sufficient for USN environment without infrastructure. Some existing studies using a random number Diffie-Hellman algorithm to solve the problem. but the method was vulnerable to Replay and Man-in-the-middle attack from the malicious nodes. Therefore, authentication problem between nodes is solved by adding a ��TESLA. In this paper, we propose a modified Diffie-Hellman algorithm that it is safe, lightweight, and robust pair-wise agreement algorithm by adding One Time Password (OTP) with timestamp. Lastly, authentication, confidentiality, integrity, non-impersonation, backward secrecy, and forward secrecy to verify that it is safe.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3A
• /
• pp.274-281
• /
• 2006

Sensor network applications need synchronized time extremely such as object tracking, consistent state updates, duplicate detection, and temporal order delivery. This paper describes reliable time synchronization protocol (RTSP) for wireless sensor networks. In the proposed method, synchronization error is decreased by creating hierarchical tree with lower depth and reliability is improved by maintaining and updating information of candidate parent nodes. The RTSP reduces recovery time and communication overheads comparing to TPSN when there are topology changes owing to moving of nodes, running out of energy and physical crashes. Simulation results show that RTSP has about 20% better performance than TPSN in synchronization accuracy. And the number of message in the RTSP is $20%{\sim}60%$ lower than that in the TPSN when nodes are failed in the network. In case of different transmission range of nodes, the communication overhead in the RTSP is reduced up to 40% than that in the TPSN at the maximum.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.10
• /
• pp.1004-1010
• /
• 2012

In this paper, we propose the algorithm which considers applying recently proposed clock synchronization techniques with quite high accuracy in a few wireless sensor networks researches to time synchronization algorithm for multi-static radar system and especially overcomes the limitation of previous theory, cannot be applied between nodes in non-line of sight (NLOS). Proposed scheme estimates clock skew and clock offset using recursive robust least M-estimator with information of time stamp observations. And we improve the performance of algorithm by tracking and suppressing the time delays difference caused by NLOS system. Futhermore, this paper derive the mean square error (MSE) to present the performance of the proposed estimator and comparative analysis with previous methods.

• Journal of Internet Computing and Services
• /
• v.10 no.6
• /
• pp.229-239
• /
• 2009

To solve user authentication problem, many remote user authentication schemes using password and smart card at the same time have been proposed. Due to the increasing of interest in personal privacy, there were some recent researches to provide user anonymity. In 2004, Das et al. firstly proposed an authentication scheme that guarantees user anonymity using a dynamic ID. In 2005, Chien et al. pointed out that Das et al.'s scheme has a vulnerability for guaranteing user anonymity and proposed an improved scheme. However their authentication scheme was found some weaknesses about insider attack, DoS attack, and restricted replay attack. In this paper, we propose an enhanced scheme which can remove vulnerabilities of Chien et al.'s scheme. The proposed authentication protocol prevented insider attack by using user's Nonce value and removed the restricted replay attack by replacing time stamp with random number. Furthermore, we improved computational efficiency by eliminating the exponentiation operation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.637-644
• /
• 2019

In recent years, many public safety systems in the smart city are developed. These systems are taking responsibility to make a safe and comfortable city. In this paper, we propose vehicle tracking systems include a public safety system that enables the policeman to track the stolen vehicles more efficiently by providing the vehicle information in real time. When a vehicle is stolen, the vehicle owner can send a user emergency request. Then, the public safety server which supported by a geospatial query technique will give information such as time, distance, and routes to a policeman who is closest to the location of the vehicle to catch the thief. 300 simulations were performed to evaluate the performance of the system. We found that the average of times required when vehicle owner send a user emergency message on user application until policeman obtain a vehicle tracking request on police application below 1.2 seconds.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.5
• /
• pp.743-754
• /
• 2022

This paper contains the results of the development and performance evaluation of the environmental data monitoring system for the fish farm. For the hardware development, the analogue sensor is used to collect dissolved oxygen, pH, salinity, and temperature of the fish farm water, and the digital sensor is used for collecting ambient temperature, humidity, and location information via a GPS module to be sent to cloud-based Firebase DB. A set of LoRa transmitters and receivers is used as a communication module to upload the collected data. The data stored in Firebase is retrieved as a graph on a web and mobile application to monitor the environmental data changes in real-time. A notification will be delivered if the collected data is outside the determined optimal value. To evaluate the performance of the developed system, a response time from hardware modules to web and mobile applications is ranging from 6.2 to 6.85 seconds, which indicates satisfactory results.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.2
• /
• pp.295-304
• /
• 1996

Toprovide economical BISDN service, with which integration process of many types of media is possible, it is necessary to construct a system with ground network and satellite network combined. The method for this type of transmission using satellite is TDMA that can provide services to many users in various area. However, the most difficult task to connect TDMA which uses synchronous method to ATM which used asynchronous transfer mode is the deterioration n of ATM transmission quality such as cell delay variation. Therefore, it is necessary to develop delay variation compensation method which can confront to the ATM. Efficient ways to use satellite links under the conditions such that maximum efficiency of the delay variation is limited under the required value, and the burst characteristic of transmission cell does not increase are being researched for translation between in ATM and TDMA. This paper points out the problems when time stamp method, reviewd in ground network, is applied to the satellite links to compensate the delay variation .To solve the problem, discrete cell count method is introduced along with the calculation of transmission capacity and error rate.Also, from the observation of stab-ility of the system and verification of reliability even when singal error occurred in the cell transmission timing information, the proposed compensation method appeared to be excellent.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.11
• /
• pp.113-123
• /
• 2023

This paper introduces the Cherry system, a user-independent blockchain donation system. This is a procedure that is delivered to the beneficiary's bank account through a virtual account when a donor makes a donation, so there is no difference from the existing donation delivery method from the user's point of view However, within the blockchain, Cherry Points, a virtual currency based on the user ID, are issued and delivered to the beneficiary, while all transactions and the beneficiary's usage history are managed on the blockchain. By adopting this method, there was an improvement in blockchain performance, with transaction processing exceeding 1,000 TPS in typical transaction condition and service completion within 21.3 seconds. By applying the automatic influence control algorithm to this system, the influence according to stake, which is an individual donation, is greatly reduced to 0.3 after 2 months, thereby concentrating influence could be controlled automatically. In addition, it was designed to enable micro tracking by adding a tracking function by timestamp to the donation ledger for each individual ID, which greatly improved the transparency in the use of donations. From a service perspective, existing blockchain donation systems were handled as limited donation delivery methods. Since it is a direct service in a user-independent method, convenience has been greatly improved by delivering donations in various forms.

• Journal of KIISE:Databases
• /
• v.31 no.5
• /
• pp.468-478
• /
• 2004

It is essential in various application areas of data mining and bioinformatics to effectively retrieve the occurrences of interesting patterns from sequence databases. For example, let's consider a network event management system that records the types and timestamp values of events occurred in a specific network component(ex. router). The typical query to find out the temporal casual relationships among the network events is as fellows: 'Find all occurrences of CiscoDCDLinkUp that are fellowed by MLMStatusUP that are subsequently followed by TCPConnectionClose, under the constraint that the interval between the first two events is not larger than 20 seconds, and the interval between the first and third events is not larger than 40 secondsTCPConnectionClose. This paper proposes an indexing method that enables to efficiently answer such a query. Unlike the previous methods that rely on inefficient sequential scan methods or data structures not easily supported by DBMSs, the proposed method uses a multi-dimensional spatial index, which is proven to be efficient both in storage and search, to find the answers quickly without false dismissals. Given a sliding window W, the input to a multi-dimensional spatial index is a n-dimensional vector whose i-th element is the interval between the first event of W and the first occurrence of the event type Ei in W. Here, n is the number of event types that can be occurred in the system of interest. The problem of‘dimensionality curse’may happen when n is large. Therefore, we use the dimension selection or event type grouping to avoid this problem. The experimental results reveal that our proposed technique can be a few orders of magnitude faster than the sequential scan and ISO-Depth index methods.hods.