• 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 the Korea institute of electronic communication sciences
• /
• v.10 no.2
• /
• pp.165-176
• /
• 2015

Clock or time synchronization protocol is one of the crucial factors that could determine the quality of the communication. With the rapid development of the network technology, more robust clock synchronization algorithm is required. IEEE 1588 is one of the possible solutions for a robust clock synchronization algorithm; however, there are still some challenges that need to be concerned in IEEE 1588 in term of reducing and stabilizing the PDV value. This survey paper shows several solutions that could improve the performance of IEEE 1588, including modifying the PTP message transmission, optimizing PTP method, filtering techniques, and using the hardware timestamp instead of application layer timestamp, and so on. Despite the improvement that is created with these techniques, the clock synchronization algorithm is still an open issue in the network communication.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.339-350
• /
• 2004

A broadcast method in mobile computing environments which have very large client populations solves the problem of low bandwidth. But most of previous proposed concurrency control protocols are restricted to read-only transactions from mobile client. In this paper, we propose the UTSM-ARM method which uses caching and broadcast method, and allows update transactions in mobile client. The UTSM-ARM decides the validation of cache data consistency with the dynamic update pattern ratio of accessed cached data. Also, the timestamps of accessed cached data and transaction in mobile client guarantee the serializable execution of mobile transactions. As a result, UTSM-ARM makes efficiently use of the asymmetric bandwidth of broadcast environment and can Increase the transaction throughput.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.54-66
• /
• 2008

A spatio-temporal join is an expensive operation that is commonly used in spatio-temporal database systems. In order to generate an efficient query plan for the queries involving spatio-temporal join operations, it is crucial to estimate accurate selectivity for the join operations. Given two dataset $S_1,\;S_2$ of discrete data and a timestamp $t_q$, a spatio-temporal join retrieves all pairs of objects that are intersected each other at $t_q$. The selectivity of the join operation equals the number of retrieved pairs divided by the cardinality of the Cartesian product $S_1{\times}S_2$. In this paper, we propose aspatio-temporal histogram to estimate selectivity of spatio-temporal join by extending existing geometric histogram. By using a wide spectrum of both uniform dataset and skewed dataset, it is shown that our proposed method, called Spatio-Temporal Histogram, can accurately estimate the selectivity of spatio-temporal join. Our contributions can be summarized as follows: First, the selectivity estimation of spatio-temporal join for discrete data has been first attempted. Second, we propose an efficient maintenance method that reconstructs histograms using compression of spatial statistical information during the lifespan of discrete data.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.10
• /
• pp.2750-2759
• /
• 2009

In this paper, we analyze vulnerabilities in a remote authentication protocol using smartcards which was proposed by Bindu et al. and propose an improved scheme. The proposed scheme can prevent from restricted replay attack and denial of service attack by replacing time stamp with random number. In addition, this protocol can guarantee user anonymity by transmitting encrypted user's ID using AES cipher algorithm. The computational load in our protocol is decreased by removing heavy exponentiation operations and user efficiency is enhanced due to addition of password change phase in which a user can freely change his password. Furthermore, we really implement the proposed authentication protocol using a STM smartcard and authentication server. Then we prove the correctness and effectiveness of the proposed remote authentication system.

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