• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.3
• /
• pp.19-26
• /
• 2012

To resist the relay attacks in RFID system, it is commonly used RFID distance bounding protocols using the round trip time measurement for 1 bit challenge and response between a reader and a tag. If the success probability of relay attacks for the 1 bit challenge and response can be reduced in these protocols, it is possible to make an efficient distance bounding protocol. In this paper, we propose an efficient RFID distance bounding protocol based on 2 bit challenge and response which is modified the RFID distance bounding protocol proposed by Hancke and Khun based on 1 bit challenge and response. The success probability of relay attack for the proposed protocol is (7/16)n for the n times of challenge and response, which is much lower than (3/4)n given by Hancke and Khun's protocol.

• IE interfaces
• /
• v.22 no.3
• /
• pp.278-286
• /
• 2009

The anti-collision algorithms to identify a number of tags in real-time in RFID systems are divided into the anti-collision algorithms based on the Framed slotted ALOHA that randomly select multiple slots to identify the tags, and the anti-collision algorithms based on the Tree-based algorithm that repeat the questions and answer process to identify the tags. In the hybrid algorithm which is combined the advantages of these algorithms, tags are distributed over the frames by selecting one frame among them and then identified by using the Query tree frame by frame. In this hybrid algorithm, however, the time of identifying all tags may increase if many tags are concentrated in a few frames. In this study, to improve the performance of the hybrid algorithm, we suggest an improved algorithm that the tags select a specific group of frames based on the earlier bits of the tag ID so that the tags are distribute equally over the frames. By using the simulation and mathematical analysis, we show that the suggested algorithm outperforms traditional hybrid algorithm from the viewpoint of the number of queries per frame and the time of identifying all tags.

• Journal of Digital Contents Society
• /
• v.6 no.2
• /
• pp.131-135
• /
• 2005

Nowadays, the demand for the wireless technology has gradually increased to support the services of high speed wired internet and also the interest of a mobile terminal convergence has increased. In the next generation, the mobile terminal could merge with the celluar phone, wireless LAN, portable internet, digital multimedia brodcasting, mobile game and sensor(smart-tag and biometrics) through the unified single user interface. Moreover, the system is supported to multi-mode at difference networks, which have variable functions and high performance for available service. Inthis paper, we investigate the minimum requirements and the core technologies of the next generation mobile terminals.

• Journal of Digital Convergence
• /
• v.15 no.11
• /
• pp.261-269
• /
• 2017

The purpose of this paper is to provide a search system using a method of accessing the web in real time without using a database server in order to guarantee the up-to-date information in a single network, rather than using a plurality of bots connected by a wide area network Design. The method of the research is to design and analyze the system which can search the person and keyword quickly and accurately in crepe system. In the crepe server, when the user registers information, the body tag matching conversion process stores all the information as it is, since various styles are applied to each user, such as a font, a font size, and a color. The crepe server does not cause a problem of body tag matching. However, when executing the crepe retrieval system, the style and characteristics of users can not be formalized. This problem can be solved by using the html_img_parser function and the Go language html parser package. By applying queues and multiple threads to a general-purpose web crawler, rather than a web crawler design that targets a specific site, it is possible to utilize a multiplier that quickly and efficiently searches and collects various web sites in various applications.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.1
• /
• pp.33-41
• /
• 2008

As RFID technology is developing and increasingly being used in many applications, the implementation is changing from single reader to multiple readers even dense readers. Since the number of readers is increasing, there are more collisions between readers and much interference between readers and tags. Therefore, to avoid interference or collision, many algorithms have being proposed, such as Gen2 dense mode, LBT(listen before talk), TDMA based method. In this paper, we propose a null frame algorithm, which calculates the collision probability in frame slotted aloha scheme and use this information to avoid the possible collisions. Comparing with conventional scheme, our proposed algorithm has some advantages in terms of reader collision number and required frame numbers.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.307-311
• /
• 2012

In this paper, a novel particle swarm optimization method based on IE3D is used to design a mobile communication Microstrip Patch Antenna. The aim of the thesis is to Design and fabricate an inset fed rectangular Microstrip Antenna and study the effect of antenna dimensions Length (L), Width (W) and substrate parameters relative Dielectric constant (${\varepsilon}r$), substrate thickness on Radiation parameters of Band width. When the antenna was designed, a dual-band, dual-polarized antenna was used to secure the bandwidth and improve performance, and a coaxial probe feeding method so that the phased array of antenna is easy.

• Journal of Satellite, Information and Communications
• /
• v.11 no.2
• /
• pp.60-64
• /
• 2016

In this paper, we propose a scheme for MIMO beamforming for the backscatter communication using a multi-tag to improve the efficiency of energy harvesting and the BER of received signals. We obtain a normal channel information through a communication between the H-AP and multi-tag. The H-AP sets parameters for the transmission scenario of the spatial channel model (SCM) using the obtained channel information and generates a SCM channel information. Then, the H-AP transmits signals that have optimal transmission power to increase the signal-to-interference-plus-noise ratio (SINR) to each of tags. Tags perform a backscatter communication with signals. The receiver performs a time switching technique of energy harvesting using backscatter signals from the multi-tag. Simulation results demonstrate effectiveness of the proposed scheme, and the harvesting efficiency and BER at the receiver is greatly improved.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.197-199
• /
• 2000

연속음성인식을 수행하기 위해서는 발음사전과 언어모델이 필요하다. 이 둘 사이에는 디코딩 단위가 일치하여야 하므로 발음사전 구축시 디코딩 단위로 표제어 단위를 선정하며 표제어 사이의 음운변화 현상을 반영한 발음사전을 구축하여야 한다. 한국어에 부합하는 음운변화현상을 분석하여 학습용 자동 발음열을 생성하고, 이를 통하여 발음사전을 구축한다. 전처리 단계로 기호, 단위, 숫자 등 전처리 과정 및 형태소 분석 과정을 수행하며, 디코딩 단위인 의사 형태소 단위를 생성하기 위해 규칙을 이용한 태깅 과정을 거친다. 이를 통해 나온 결과를 발음열 생성기 입력으로 하며, 결과는 학습용 발음열 또는 발음사전 구성을 위한 형태로 출력한다. 표제어간 음운변화 현상이 반영된 상태의 표제어 단위이므로 실제 음운변화가 반영되지 않은 상태의 표제어와는 그 형태가 상이하다. 이는 연속 발음시 생기는 현상으로 실제 인식에는 이 음운변화 현상이 반영된 사전이 필요하게 된다. 생성된 발음사전의 효용성을 확인하기 위해 다음과 같은 실험을 통해 성능을 평가하였다. 음향학습을 위하여 PBS(Phonetically Balanced Sentence) 낭독체 17200문장을 녹음하고 그 전사파일을 사용하여 학습을 수행하였고, 발음사전의 평가를 위하여 이 중 각각 3100문장을 사용하여 다음과 같은 실험을 수행하였다. 형태소 태그정보를 이용하여 표제어간 음운변화 현상을 반영한 최적의 발음사전과 다중 발음사전, 언어학적 기준에 의한 수작업으로 생성한 표준 발음사전, 그리고 표제어간의 음운변화 현상을 고려하지 않고 독립된 단어로 생성한 발음사전과의 비교 실험을 수행하였다. 실험결과 표제어간 음운변화 현상을 반영하지 않은 경우 단어 인식률이 43.21%인 반면 표제어간 음운변화 현상을 반영한 1-Best 사전의 경우 48.99%, Multi 사전의 경우 50.19%로 인식률이 5~6%정도 향상되었음을 볼 수 있었고, 수작업에 의한 표준발음사전의 단어 인식률 45.90% 보다도 약 3~4% 좋은 성능을 보였다.

• Journal of KIISE:Software and Applications
• /
• v.32 no.6
• /
• pp.554-569
• /
• 2005

In the semistructured distributed documents, it is very difficult to formalize and implement the query processing system due to the lack of structure and rule of the data. In order to precisely retrieve and process the heterogeneous semistructured documents, it is required to handle multiple mappings such as 1:1, 1:W and W:1 on an element simultaneously and to generate the schema from the distributed documents. In this paper, we have proposed an query processing algorithm for querying and answering on the heterogeneous semistructured data or documents over distributed systems and implemented with a metadata interface. The algorithm for generating local queries from the global query consists of mapping between g1oba1 and local nodes, data transformation according to the mapping types, path substitution, and resolving the heterogeneity among nodes on a global input query with metadata information. The mapping, transformation, and path substitution algorithms between the global schema and the local schemas have been implemented the metadata interface called DBXMI (for Distributed Documents XML Metadata Interface). The nodes with the same node name and different mapping or meanings is resolved by automatically extracting node identification information from the local schema automatically. The system uses Quilt as its XML query language. An experiment testing is reported over 3 different OEM model semistructured restaurant documents. The prototype system is developed under Windows system with Java and JavaCC compiler.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.11
• /
• pp.99-106
• /
• 2013

In Instant message service, the server should process instant messages and request messages which include many presence resources for users. And it also precesses massive notification messages generating from the subscribed presence resources. In this paper a new architecture of instant message service with multiple servers which can distribute loads efficiently as the number of users increases has been suggested. It also provides various functions to users using extended call processing language. The user subscribes presence information and call processing language script which describes user's functions. The server processes instant messages, presence services and call processing language scripts. New extended presence information data structure has been suggested and new call processing language operation tags have been added. Therefore extendability of the system can be increased and various services which combine presence service and call processing can be provided in this system. Furthermore instant message processing module has been integrated in the server to decrease the amount of SIP(Session Initiation Protocol) messages, and it also improves system efficiency, The performance of our proposed system has been analysed by experiments.