• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.918-929
• /
• 1999

동기식 스트림 암호통신 방식을 사용하는 암호통신에서는 암/복호화 과정 수행시 암호통신 과정에서 발생하는 사이클슬립으로 인해 키수열의 동기이탈 현상이 발생되고 이로 인해 오복호된 데이타를 얻게된다. 이러한 위험성을 감소하기 위한 방안으로 현재까지 암호문에 동기신호와 세션키를 주기적으로 삽입하여 동기를 이루는 주기적인 동기암호 통신방식을 사용하여 왔다. 본 논문에서는 CDMA(Cellular Division Multiple Access) 이동망에서 데이타서비스를 제공할 때 사용되는 점대점 프로토콜의 주소영역의 특성을 이용하여 단위 측정시간 동안 측정된 주소비트 정보와 플래그 패턴의 수신률을 이용하여 문턱 값보다 작은경우 동기신호와 세션키를 전송하는 비주기적인 동기방식을 사용하므로써 종래의 주기적인 동기방식으로 인한 전송효율성 저하와 주기적인 상이한 세션키 발생 및 다음 주기까지의 동기이탈 상태의 지속으로 인한 오류확산 등의 단점을 해결하였다. 제안된 알고리즘을 링크계층의 점대점 프로토콜(Point to Point Protocol)을 사용하는 CDMA 이동망에서 동기식 스트림 암호 통신방식에 적용시 동기이탈율 10-7의 환경에서 주기가 1sec인 주기적인 동기방식에서 요구되는 6.45x107비트에 비해 3.84x105비트가 소요됨으로써 전송율측면에서의 성능향상과 오복호율과 오복호 데이타 비트측면에서 성능향상을 얻었다. Abstract In the cipher system using the synchronous stream cipher system, encryption / decryption cause the synchronization loss (of key arrangement) by cycle slip, then it makes incorrect decrypted data. To lessen the risk, we have used a periodic synchronous cipher system which achieve synchronization at fixed timesteps by inserting synchronization signal and session key. In this paper, we solved the problem(fault) like the transfer efficiency drops by a periodic synchronous method, the periodic generations of different session key, and the incorrectness increases by continuing synchronization loss in next time step. They are achieved by the transfer of a non-periodic synchronous signal which carries synchronous signal and session key when it is less than the threshold value, analyzing the address field of point-to-point protocol, using the receiving rate of address bits information and flag patterns in the decision duration, in providing data services by CDMA mobile network. When the proposed algorithm is applied to the synchronous stream cipher system using point-to-point protocol, which is used data link level in CDMA mobile network, it has advanced the result in Rerror and Derror and in transmission rate, by the use of 3.84$\times$105bits, not 6.45$\times$107bits required in periodic synchronous method, having lsec time step, in slip rate 10-7.

• Korean Journal of Remote Sensing
• /
• v.33 no.2
• /
• pp.213-230
• /
• 2017

The satellite-based red tide detection algorithms have been developed for specific occurrence waters and red tide species. However, it is essential to study the whole occurrence waters and various red tide species for quick and accurate surveillance of red tide around the Korean coastal waters. In thisstudy, the comprehensive analysesinvolve the spectral features of red tide areas and the suitability of the satellite-based red tide detection algorithms used with GOCI in the Korean coastal waters. As a result, the spectral characteristics were changed according to the chlorophyll content of red tide species and the turbidity of the waters where the red tide appeared. In addition, the previous red tide detection algorithm is applied to GOCI, and it is found that there is a limitation to the red tide area extraction as the existing threshold value. To overcome these limitations, red tide species were divided into two groups according to the difference of chlorophyll content and a system for red tide surveillance wassuggested. It is possible to distinguish between red tide and non-red tide area through five steps. As a result of applying to GOCI, the red tide was appropriately extracted from the previous algorithm based on red tide breaking news. If such a red tide surveillance system is used, it will be possible to efficiently monitor red tide by quick and accurate surveillance of the whole occurrence waters around the Korean and various red tide species.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.3 s.357
• /
• pp.33-40
• /
• 2007

In this paper, low-rate TCP attack as one of shrew attacks is considered and the scaling based dynamic time warping (S-DTW) algorithm is introduced. The low-rate TCP attack can not be detected by the detection method for the previous flooding DoS/DDoS (Denial of Service/Distirbuted Denial of Service) attacks due to its low average traffic rate. It, however, is a periodic short burst that exploits the homogeneity of the minimum retransmission timeout (RTO) of TCP flows and then some pattern matching mechanisms have been proposed to detect it among legitimate input flows. A DTW mechanism as one of detection approaches has proposed to detect attack input stream consisting of many legitimate or attack flows, and shown a depending method as well. This approach, however, has a problem that legitimate input stream may be caught as an attack one. In addition, it is difficult to decide a threshold for separation between the legitimate and the malicious. Thus, the causes of this problem are analyzed through simulation and the scaling by maximum auto-correlation value is executed before computing the DTW. We also discuss the results on applying various scaling approaches and using standard deviation of input streams monitored.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.5
• /
• pp.76-87
• /
• 2014

Today the energy consumption of ICT networks is about 10% of the worldwide power consumption and is predicted to increase remarkably in the near future. For this reason, this paper studies energy saving strategies assuring the network-level QoS. In the strategies, the energy consumption of NIC(network interface card) on both endpoint of links decreases by selecting links and making them sleep when the total traffic volume of the IP network is lower than a threshold. In this paper, we propose a heuristic routing algorithm based on so-called delegating/delegated routers, and evaluate its characteristics using computer simulation considering network-level QoS. The selection of sleep links is determined in terms of the number of traffic paths (called min_used path) or the amount of traffics(called min_used traffic) through those kinks. To our experiment, the min_used traffic method shows a little better energy saving but the increased path length compared to the min_used path method. Those two methods have better energy saving characteristics than the random method. This paper confirms that the delegating/delegated router-based routing algorithm results in energy saving effects and sustains network-level QoS in IP networks.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.95-103
• /
• 2009

An efficient symbol time synchronization scheme for IEEE 802.11n MIMO-OFDM based WLAN systems using cyclic shift diversity (CSD) preamble is proposed. CSD is used to prevent unintentional beamforming when the same preamble signal is transmitted through transmit antennas. However, it is difficult to find a proper starting-point of the OFDM symbol with the conventional algorithms because of time offset by multi-peaks which are result from cross-correlation of received CSD preamble with a known short training symbol. In addition, the performance of symbol time sync. is affected by AGC and packet detection position. In this paper, an optimal symbol time synch. algorithm which is composed of the boundary detection scheme between LTS and OFDM symbols, the verification scheme for enhancement of boundary detection accuracy, and the SNR-varying threshold estimation scheme is proposed. Simulation result show that the proposed algorithm has performance gains of 4.3dB in SNR compared to the conventional algorithms at the rate of 1% sync. failure probability for $2{\times}2$ MIMO-OFDM system and 18dB at 0.1% when maximum frequency offset exists. It also can be applied to $4{\times}4$ MIMO-OFDM system without any modification. Hence, it is very suitable for MIMO-OFDM WLAN systems using CSD preamble.

• Journal of the Korean Institute of Telematics and Electronics D
• /
• v.35D no.10
• /
• pp.39-50
• /
• 1998

Wide-band sharp-transition filters are widely used in applications such as wireless CODEC design or medical systems. Since these filters suffer from large sensitivity and roundoff noise, large word-length is required for the VLSI implementation, which increases the hardware size and the power consumption of the chip. In this paper, a low-power implementation technique for digital filters with wide-band sharp-transition characteristics is proposed using CPL (Complementary Pass-Transistor Logic), LWDF (Lattice Wave Digital Filter) and a modified DIFIR (Decomposed & Interpolated FIR) algorithm. To reduce the short-circuit current component in CPL circuits due to threshold voltage reduction through the pass transistor, three different approaches can be used: cross-coupled PMOS latch, PMOS body biasing and weak PMOS latch. Of the three, the cross-coupled PMOS latch approach is the most realistic solution when the noise margin as well as the energy-delay product is considered. To optimize CPL transistor size with insight, the empirical formulas for the delay and energy consumption in the basic structure of CPL circuits were derived from the simulation results. In addition, the filter coefficients are encoded using CSD (Canonic Signed Digit) format and optimized by a coefficient quantization program. The hardware cost is minimized further by a modified DIFIR algorithm. Simulation result shows that the proposed method can achieve about 38% reductions in power consumption compared with the conventional method.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.1
• /
• pp.133-142
• /
• 2011

When TCP operates in multi-hop wireless networks, it suffers from severe performance degradation due to the different characteristics of wireless networks and wired networks. This is because TCP reacts to wireless packet losses by unnecessarily decreasing its sending rate assuming the losses as congestion losses. Although several loss differentiation algorithms (LDAs) have been proposed to avoid such performance degradation, their detection accuracies are not high as much as we expect. In addition the schemes have a tendency to sacrifice the detection accuracy of congestion losses while they improve the detection accuracy of wireless losses. In this paper, we suggest a new sender-based loss differentiation scheme which enhances the detection accuracy of wireless losses while minimizing the sacrifice of the detection accuracy of congestion losses. Our scheme estimates the rate of queue usage which is highly correlated with the congestion in the network path between a TCP sender and a receiver, and it distinguishes congestion losses from wireless losses by comparing the estimated queue usage with a certain threshold. In the extensive experiments based on a network simulator, QualNet, we measure and compare each detection accuracy of wireless losses and congestion losses, and evaluate the performance enhancement in each scheme. The results show that our scheme has the highest accuracy among the LDAs and it improves the most highly TCP performance in multi-hop wireless networks.

• Journal of Internet Computing and Services
• /
• v.15 no.6
• /
• pp.125-132
• /
• 2014

Since frequent pattern mining was proposed in order to search for hidden, useful pattern information from large-scale databases, various types of mining approaches and applications have been researched. Especially, frequent graph pattern mining was suggested to effectively deal with recent data that have been complicated continually, and a variety of efficient graph mining algorithms have been studied. Graph patterns obtained from graph databases have their own importance and characteristics different from one another according to the elements composing them and their lengths. However, traditional frequent graph pattern mining approaches have the limitations that do not consider such problems. That is, the existing methods consider only one minimum support threshold regardless of the lengths of graph patterns extracted from their mining operations and do not use any of the patterns' weight factors; therefore, a large number of actually useless graph patterns may be generated. Small graph patterns with a few vertices and edges tend to be interesting when their weighted supports are relatively high, while large ones with many elements can be useful even if their weighted supports are relatively low. For this reason, we propose a weight-based frequent graph pattern mining algorithm considering length-decreasing support constraints. Comprehensive experimental results provided in this paper show that the proposed method guarantees more outstanding performance compared to a state-of-the-art graph mining algorithm in terms of pattern generation, runtime, and memory usage.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1171-1176
• /
• 2003

In this paper, we propose an effective bar code detection algorithm using the feature analysis and the labeling. After computing the direction of pixels using four line operators, we obtain the histogram about the direction of pixels by a block unit. We calculate the difference between the maximum value and the minimum value of the histogram and consider the block that have the largest difference value as the block of the bar code region. We get the line passing by the bar code region with the selected block but detect blocks of interest to get the more accurate line. The largest difference value is used to decide the threshold value to obtain the binary image. After obtaining a binary image, we do the labeling about the binary image. Therefore, we find blocks of interest in the bar code region. We calculate the gradient and the center of the bar code with blocks of interest, and then get the line passing by the bar code and detect the bar code. As we obtain the gray level of the line passing by the bar code, we grasp the information of the bar code.

• Korean Journal of Remote Sensing
• /
• v.32 no.5
• /
• pp.471-482
• /
• 2016

This paper presents an extraction method for water body which uses block-based image partitioning and extension of water body boundaries to improve the performance of supervised classification for water body extraction. The Mahalanobis distance image is created by computing the spectral information of Normalized Difference Water Index (NDWI) and Near Infrared (NIR) band images over a training site within the water body in order to extract an initial water body area. To reduce the effect of noise contained in the Mahalanobis distance image, we apply mean curvature diffusion to the image, which controls diffusion coefficients based on connectivity strength between adjacent pixels and then extract the initial water body area. After partitioning the extracted water body image into the non-overlapping blocks of same size, we update the water body area using the information of water body belonging to water body boundaries. The update is performed repeatedly under the condition that the statistical distance between water body area belonging to water body boundaries and the training site is not greater than a threshold value. The accuracy assessment of the proposed algorithm was tested using KOMPSAT-2 images for the various block sizes between $11{\times}11$ and $19{\times}19$. The overall accuracy and Kappa coefficient of the algorithm varied from 99.47% to 99.53% and from 95.07% to 95.80%, respectively.