• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.173-175
• /
• 2005

In this paper, we propose a data encoding algorithm for two-dimensional barcode system. In general, one-dimensional barcode is just a key which can access detailed information to the host computer database. But the two-dimensional barcode is a new technology which can obtain high density information without access to the host computer database. We implemented encoding algorithm for Data Matrix Barcode which is the most widely used among the many kind of two-dimensional barcodes. And we marked to a real object using Digital Signal Processor(DSP) Marking System. The performance of proposed algorithm is verified through the result of marking work.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.2223-2242
• /
• 2019

Distance Vector-Hop (DV-Hop) algorithm is widely used in node localization. It often suffers the wormhole attack. The current researches focus on Double-Wormhole-Node-Link (DWNL) and have limited attention to Multi-Wormhole-Node-Link (MWNL). In this paper, we propose a security DV-Hop algorithm (AMLDV-Hop) to resist MWNL. Firstly, the algorithm establishes the Neighbor List (NL) in initialization phase. It uses the NL to find the suspect beacon nodes and then find the actually attacked beacon nodes by calculating the distances to other beacon nodes. The attacked beacon nodes generate and broadcast the conflict sets to distinguish the different wormhole areas. The unknown nodes take the marked beacon nodes as references and mark themselves with different numbers in the first-round marking. If the unknown nodes fail to mark themselves, they will take the marked unknown nodes as references to mark themselves in the second-round marking. The unknown nodes that still fail to be marked are semi-isolated. The results indicate that the localization error of proposed AMLDV-Hop algorithm has 112.3%, 10.2%, 41.7%, 6.9% reduction compared to the attacked DV-Hop algorithm, the Label-based DV-Hop (LBDV-Hop), the Secure Neighbor Discovery Based DV-Hop (NDDV-Hop), and the Against Wormhole DV-Hop (AWDV-Hop) algorithm.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1855-1858
• /
• 2002

A number of MPLS ATM systems have been proposed to increase the access speed of current routers, which only support the best-effort service. However, the MPLS ATM systems have to support the so-called differential service, which discriminates the applications according to the service class because they do not be satisfied the Internet users who use diverse applications. In this paper, to support this differential service a detailed forwarding procedure based on a LSP control method and an application-based marking algorithm is suggested. The LSP control method establishes several different LSPs for each FEC according to the service class and the application-based marking algorithm chooses a proper differential service depending on the application category. Also, a design scheme of forwarding engine, which can be easily implemented with a minimum modification of existing MPLS ATM systems is proposed. And, the best simulation result of high priority application category is gained when the proposed forwarding algorithm is comparedwithexistingalgorithms.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.9
• /
• pp.2323-2333
• /
• 1998

Software engineers generally analyze the program behavior under the test case that revealed the error, not under any teneric est case. In this paper we discuss the dynamic slice consisting of all statements that actually affect the value of a variable occurrence for a given program input. We propose an efficient algorithm to make dynamic program slices. The eficiency of this algorithm is evaluated on some developed program. results are shown by a marking table of execution history. Dynamic Dependence Graph, and Reduced Dynamic Dependence Graph, Consequently, the efficiency of the proosed algorithm is also presented by the compariso with algorithm that was announced previously.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.977-980
• /
• 2005

The motivation of IP traceback is to identify the true source of an IP datagram in internet. These techniques now emerging as effective deterrent for current cyber threats, especially (D)DoS. Deterministic Packet Marking (DPM) is one of the algorithm used for IP traceback. This paper elucidates the implementation of deterministic packet marking scheme on IPv6 networks. The proposed scheme is capable of single packet traceback. We also examined the issues regarding IPv6 header and show that this scheme is practical, scalable, efficient and can be implemented on existing IPv6 networks easily.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.6
• /
• pp.521-525
• /
• 2011

Lane marking detection is one of important issues in the field of autonomous mobile robot. Especially, in urban environment, like pavement roads of downtown or tour tracks of Science Park, which have continuous patterns on the surface of the road, the lane marking detection becomes more important ability. Although there were many researches about lane detection and lane tracing, many of them used vision sensors mainly to detect lane marking. In this paper, we obtain 2 dimensional library data of 'Intensity' and 'Distance' using one laser rangefinder only. We design a simple classifier and filtering algorithm for the lane detection which uses only one LRF (Laser Range Finder). Allowing extended usage of LRF, this research provides more functionality not only in range finding but also in lane detecting to mobile robots. This work will be technically helpful for robot developers to design more simple and efficient autonomous driving system using LRF.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.1
• /
• pp.19-26
• /
• 2003

Recently, the number of internet service companies is increasing and so is the number of malicious attackers. Damage such as distrust about credit and instability of the service by these attacks may influence us fatally as it makes companies image failing down. One of the frequent and fatal attacks is DoS(Denial-of-Service). Because the attacker performs IP spoofing for hiding his location in DoS attack it is hard to get an exact location of the attacker from source IP address only. and even if the system recovers from the attack successfully, if attack origin has not been identified, we have to consider the possibility that there may be another attack again in near future by the same attacker. This study suggests to find the attack origin through MAC address marking of the attack origin. It is based on an IP trace algorithm, called Marking Algorithm. It modifies the Martins Algorithm so that we can convey the MAC address of the intervening routers, and as a result it can trace the exact IP address of the original attacker. To improve the detection time, our algorithm also contains a technique to improve the packet arrival rate. By adjusting marking probability according to the distance from the packet origin we were able to decrease the number of needed packets to traceback the IP address.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.814-816
• /
• 2002

최근 급증하고 있는 인터넷 사용자들을 위한 인터 서비스 업체들의 증가와 더불어 악의적인 공격자의공격 또한 증가하고 있다. 이러한 공격으로 인한 인터넷 업체들에게 치명적일 수 있는 신용에 대한 불신임과 서비스의 불안정이라는 피해는 기업의 이미지를 실추시키는 등 막대한 영향을 끼칠 수도 있다. 이러한 악의적인 공격 형태 중 가장 최근 가장 빈번하게 그리고 큰 피해를 주는 공격형태가 DoS(Denial-of-Service)[1]공격이다. 그러나 DoS공격에 대한 적당한 대응방법이 아직까지 미비한 상태이고, 공격에 대응하여 방어한다고 해도 그 진원지를 찾아내지 못한다면 추후 동일한 공격자(attack)에 의해 재차 공격을 받을 가능성을 배제할 수 없는 실정이다. 이에 본 논문은 DoS공격에 대한 적당한 대응하는 하나의 방법으로 공격 경로(attack path)를 찾아내고 더 나아가 공격 진원지(attack origin)의 MAC address를 알아냄으로써 공격의 진원지를 찾아내는 방법을 제안한다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.07a
• /
• pp.356-356
• /
• 2004

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.5
• /
• pp.224-230
• /
• 2013

Lane boundary detection plays a key role in the driver assistance system. This study proposes a robust method for detecting lane boundary in severe environment. First, a horizontal line detects form the original image using improved Vertical Mean Distribution Method (iVMD) and the sub-region image which is under the horizontal line, is determined. Second, we extract the lane marking from the sub-region image using Canny edge detector. Finally, K-means clustering algorithm classifi left and right lane cluster under variant illumination, cracked road, complex lane marking and passing traffic. Experimental results show that the proposed method satisfie the real-time and efficient requirement of the intelligent transportation system.