• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.8 no.3
• /
• pp.132-137
• /
• 2009

In this paper, a position recognition system is designed, implemented, and tested using IEEE 802.15.4a PHY (CSS) hardware and Tiny OS environment. The system is designed with extensibility and flexibility. The system consists of five kinds of nodes which have different functions from each other. Three communication channels are used for collision avoidance. In each cell, an arbiter node is used to minimize message collisions. The proposed arbitration protocol is designed to support mobility of arbitrary target nodes. Target nodes calculates their locations with communications to four location reference nodes which are placed on the comers of each cell.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.1
• /
• pp.19-25
• /
• 2012

In evaluating the performance of RFID systems, the tag anti-collision arbitration has been considered to be an important issue. For BT(Binary Tree) and ABS( Adaptive Binary Splitting) protocols, the so-called capture effect, which presumably happens frequently in the process of readers' receiving messages from multiple tags, can lead to some failures in detecting all tags in BT and ABS. In this paper, we propose a new anti-collision protocol, namely FTB (Feedback TagID with Binary splitting), which can solve the aforementioned problem and improve the performance.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.5
• /
• pp.285-293
• /
• 2013

The procedure of the arbitration which is the tag collision is essential because the multiple tags response simultaneously in the same frequency to the request of the Reader. This procedure is known as Anti-collision and it is a key technology in the RFID system. In this paper, we propose the Bit Pattern Prediction Algorithm(BPPA) for the efficient identification of the multiple tags. The BPPA is based on the tree algorithm using the time slot and identify the tag quickly and efficiently using accurate bit pattern prediction method. Through mathematical performance analysis, We proved that the BPPA is an O(n) algorithm by analyzing the worst-case time complexity and the BPPA's performance is improved compared to existing algorithms. Through MATLAB simulation experiments, we verified that the BPPA require the average 1.2 times query per one tag identification and the BPPA ensure stable performance regardless of the number of the tags.

• Journal of Digital Convergence
• /
• v.12 no.6
• /
• pp.1-11
• /
• 2014

With the drastic development of technology for almost eternally saving digital information, cases for giving sufferings to a person who deserves to enjoy privacy have increased. So I study the right to be forgotten focusing on the collision between that right and freedom of expression. I also study the concept of the right to be forgotten and its legal basis for the protection of that right. That right can be protected mainly by the self-decision making right under the Article 10, and secondly the privacy right under the Article 17 of the Constitutional Law. The Press Arbitration Law can be applied to protect the right to be forgotten, but that Law needs the revision of time-limit clause for complain, protection clause for the right to ask to delete factual past article, and the clause of staleness doctrine for the consent of giving personal information.

• The KIPS Transactions:PartA
• /
• v.15A no.5
• /
• pp.287-294
• /
• 2008

A tag collision arbitration algorithm for RFID passive tags is one of the important issues for fast tag identification, since reader and tag have a shared wireless channel in RFID system. This paper suggests Hyper-Hybrid Query Tree algorithm to prevent the tag-collisions. The suggested algorithms determine the specified point in time for tag to transfer ID to reader by using value 1 of the upper 3 bit based on Query Tree. Also, because the transferred upper 3 bits of tag is different depending on the time of transfer, it is possible to predict in the suggested Algorithm. In the performance evaluation through simulation, it shows the suggested algorithm has higher performance in the number of queries compared to other Tree-based protocols.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.483-492
• /
• 2007

In this paper, we propose a new hybrid approach based on query tree protocol to arbitrate tag collisions in RFID systems. The hybrid query tree protocol that combines a tree based query protocol with a slotted backoff mechanism. The proposed protocol decreases the average identification delay by reducing collisions and idle time. To reduce collisions, we use a 4-ary query tree instead of a binary query tree. To reduce idle time, we introduce a slotted backoff mechanism to reduce the number of unnecessary Query commands. Simulation and numerical analysis reveal that the proposed protocol achieves lower identification delay than existing tag collision arbitration protocols.

• Journal of Internet Computing and Services
• /
• v.14 no.4
• /
• pp.25-33
• /
• 2013

The procedure of the arbitration which is the tag collision is essential because the multiple tags response simultaneously in the same frequency to the request of the Reader. This procedure is known as Anti-collision and it is a key technology in the RFID system. In this paper, we propose the 4-Bit Pattern Slot Allocation(4-BPSA) algorithm for the high-speed identification of the multiple tags. The proposed algorithm is based on the tree algorithm using the time slot and identify the tag quickly and efficiently through accurate prediction using the a slot as a 4-bit pattern according to the slot allocation scheme. Through mathematical performance analysis, We proved that the 4-BPSA is an O(n) algorithm by analyzing the worst-case time complexity and the performance of the 4-BPSA is improved compared to existing algorithms. In addition, we verified that the 4-BPSA is performed the average 0.7 times the query per the Tag through MATLAB simulation experiments with performance evaluation of the algorithm and the 4-BPSA ensure stable performance regardless of the number of the tags.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.6
• /
• pp.435-445
• /
• 2013

One of the most challenging issues in radio frequency identification (RFID) and near field communications (NFC) is to correctly and quickly recognize a number of tag IDs in the reader's field. Unlike the probabilistic anti-collision schemes, a query tree based protocol guarantees to identify all the tags, where the distribution of tag IDs is assumed to be uniform. However, in real implements, the prefix of tag ID is uniquely assigned by the EPCglobal and the remaining part is sequentially given by a company or manufacturer. In this paper, we propose an enhanced M-ary query tree protocol (EMQT), which effectively reduces unnecessary query-response cycles between similar tag IDs using m-bit arbitration and tag expectation. The theoretical analysis and simulation results show that the EMQT significantly outperforms other schemes in terms of identification time, identification efficiency and communications overhead.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.657-659
• /
• 2004

CAN is a serial communication bus for real-time controls and automations in distributed control systems. In distributed control systems, occasionally a sensor module and a controller are not in the same node and physically separated. In order for the signal from a sensor node to reach the controller node, the signal must travel through network. CAN has a certain capabilities to deal with real-time data. However, when many nodes on the networks try to send data on the same network, the arbitration mechanism to solve the data collision problem is necessary. This situation causes the time delay which has detrimental effects on the performance of the control systems. This paper proposes a method to solve the problem due to the time delay in distributed control system using CAN. Time delay is approximated to an element with a rational transfer function using Pade approximation and Mu~synthesis method is applied. Since time delay in the network is not constant, the time delay element is considered to be an uncertainty block with a bound. The proposed method is applied to the experimental system with CAN and proved to be effective.

• The Journal of the Korea Contents Association
• /
• v.17 no.7
• /
• pp.487-497
• /
• 2017

South Korea needs reorganization of dispute resolution system due to the frequent occurrence of a case that trade secret or technique are leaked. First, the distributed various laws are established and enforced by enacting and enforcing individual laws. Therefore, the redundancy problems, the collision of individual laws, the decline in diversity, integrity, and connectivity are issues. An independent legal system is needed by Act on the Prevention and Protection of Technology Leakage. Thereby, The support system of technological protection that is sprayed in government departments such as the Small and Medium Business Administration, the Ministry of Trade, Industry and Energy, the Patent Office, the Fair Trade Commission, the Trade Committee, the National Police Agency, and the Spy Agency integrates and unifies institutionally, and it is necessary to advance a policy with functional division. Second, the Patent Tribunal, the Invention Promotion Act, the Industrial Property Right Dispute Mediation Committee by the patent law, the Industrial Technical Dispute Mediation Committee on the Industrial Technology Outflow Prevention and Protection Law and the Medium and Small Firm Dispute Mediation and Arbitration Committee on Small Business Technology Protection Support Law are installed. However, since it established the integrated law on the Act on the Prevention and Protection of Technology Leakage, it is desirable to set the merged operation of establishment on the Technical Dispute Mediation Committee under the Small and Medium Business Administration or the Ministry of Trade, Industry and Energy.