• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.807-812
• /
• 2015

In RFID system, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred as anti-collision algorithm. In 13.56MHz RFID system of Auto-ID center, STAC protocol is defined as an anti-collision algorithm for multiple tag reading. The PS algorithm divides the tags within the identification range of reader into smaller groups by increasing the transmission power incrementally and identifies them. In this paper, we propose a STAC/PS algorithm that the PS algorithm is applied in the STAC protocol. Through simulations, it is demonstrated that the collision rate for the proposed algorithm is about 50% lower than STAC protocol. Therefore, the STAC/PS algorithm can achieve faster tag identification speed compared with STAC protocol due to the low collision rate.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.34-39
• /
• 2012

Collisions between tags greatly reduce the identification speed in radio frequency identification (RFID) systems and increase communication overhead. In particular for an active RFID system, tags are powered by small batteries, and a large number of re-transmissions caused by collisions can deteriorate and exhaust the tag energy which may result in missing tags. An efficient collision-free arbitration protocol for active RFID systems is proposed in this paper. In this protocol, a new mechanism involving collision detection, collision avoidance, and fast tag access is introduced. Specifically, the pulse burst duration and busy-tone-detection delay are introduced between the preamble and data portion of a tag-to-reader (T-R) frame. The reader identifies tag collision by detecting pulses and transmits a busy tone to avoid unnecessary transmission when collision occurs. A polling process is then designed to quickly access the collided tags. It is shown that the use of the proposed protocol results in a system throughput of 0.612, which is an obvious improvement when compared to the framed-slotted ALOHA (FSA) arbitration protocol for ISO/IEC 18000-7 standard. Furthermore, the proposed protocol greatly reduces communication overhead, which leads to energy conservation.

• Journal of information and communication convergence engineering
• /
• v.9 no.3
• /
• pp.260-265
• /
• 2011

In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. In 13.56MHz RFID system, STAC protocol is defined as an anti-collision algorithm for multiple tag reading. In STAC protocol, there is no differentiation between the collided tags and others in the identification process. Therefore, tags may never be successfully identified because its responses may always collide with others. This situation may cause the tag starvation problem. This paper proposes a fair identification scheme for STAC protocol. In the proposed scheme, if the number of collided slots is large during a query round, the reader broadcasts a CollisionRound command to begin a collision round. During the collision round, the reader identifies only tags that are experienced collision during the previous query round.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10C
• /
• pp.946-954
• /
• 2009

General RFID system has assumed that the communication channel between reader and back-end database is secure channel. However, the reader can be communicated with the database through insecure channel like the communication channel between the reader and the tag according to application environment. In this paper, we propose a new secure RFID mutual authentication protocol based on open network channel which assumed that all communication channels between the database, the reader and the tag are insecure communication channels. The proposed protocol uses a secure one-way hash function to provide authentication and integrity against all communication messages which exchanged on the open channels. In addition, we designed that the proposed protocol can provide forward secrecy by performing the database and the tag update their old secret key with a new secret key after finished mutual authentication.

• The Journal of Society for e-Business Studies
• /
• v.13 no.1
• /
• pp.21-32
• /
• 2008

RFID systems provide technologies of automatic object identification through wireless communications in invisible ranges and adaptability against various circumstances. These advantages make RFID systems to be applied in various fields of industries and individual life. However, it is difficult to use tags with distinction as tags are increasingly used in life because a tag usually stores only one object identifier in common RFID applications. In addition, RFID systems often make serious violation of privacy caused by various attacks because of their weakness of radio frequency communication. Therefore, information sharing methods among applications are necessary for expansive development of RFID systems. In this paper, we propose efficient RFID scheme. At first, we design a new RFID tag structure which supports many object identifiers of different applications in a tag and allows those applications to access them simultaneously. Secondly, we propose an authentication protocol to support the proposed tag structure. The proposed protocol is designed by considering of robustness against various attacks in low cost RFID systems. Especially, the proposed protocol is focused on efficiency of authentication procedure by considering security levels of applications. In the proposed protocol, each application goes through one of different authentication procedures according to their security levels. Finally, we prove efficiency of th proposed scheme compared with the other schemes through experiments and evaluation.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.3
• /
• pp.19-26
• /
• 2010

The most critical element in the real-time operation of RFID application programs that are suitable for the mobile environment is the RFID middleware, made exclusively for mobile handsets, which processes collected data on a real-time basis and sends only the useful information to the application client. In this paper, we intend to design and implement the Pet management system for optimized mobile RFID middleware that supports real-time data processing. The proposed Pet management system consists of registration module, retrieval module, communication module, and display module in order to display retrieval result from server. Also, the captured data in the PDA is transmitted to the server and another client system using the mobile application interface that supports the SOAP application access protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.2C
• /
• pp.132-139
• /
• 2012

In 2011, Woosik Bae proposed a NLMAP(New Low-cost Mutual Authentication Protocol) in RFID based on hash function. They argued that minimize computation such as random number generation. In addition, NLMAP is safe against replay attack, spoofing attack, traffic analysis and eavesdropping attack due to using mutual authentication. So, when applied to RFID system has advantage such as providing a high level of security at a lower manufacturing cost. However, unlike their argue, attacker can obtain Tag's hash computed unique identification information. This paper proves possible the location tracking and spoofing attack using H(IDt) by attacker. In addition, we propose the improved a mutual authentication protocol in RFID based on hash function and CRC code. Also, our protocol is secure against various attacks and suitable for efficient RFID systems better than NLMAP.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.3
• /
• pp.737-744
• /
• 2010

The use of RFID recently tends to increase and is expected to expand all over the industry and life. However, RFID is much vulnerable to the malign threats such as eavesdropping, replay attack, spoofing attack, location tracking in the process of authentication. In particular, it is difficult to apply authentication protocol used in the other previous system to low-priced RFID tag. After all, this paper suggests the scheme of efficient authentication protocol for RFID privacy protection. Compared to the previous scheme, suggested scheme reinforces the checking process of transmission data and is secure from eavesdropping and spoofing attack. It minimizes the operation work of the tag and is very useful to apply to the low-priced tag. It also has the merit to confirm the efficiency of communication by reducing the communication rounds.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.3
• /
• pp.430-436
• /
• 2006

In this paper, a QT_rev protocol is proposed for identifying all the tags within the identification range. The proposed QT_rev protocol revises the QT protocol, which has a memoryless property. In the QT_rev protocol, the tag will send the remaining bits of their identification codes when the query string matches the first bits of their identification codes. After the reader receives all the responses of the tags, it knows which bit is collided. If the collision occurs in the last bit, the reader can identify two tags simultaneously without further query. According to the simulation results, the QT_rev protocol outperforms the QT protocol in terms of the number of queries and the number of response bits.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.4
• /
• pp.638-644
• /
• 2006

In this paper, a QT_ss protocol is proposed for identifying all the tags within the identification range. The proposed QT_ss protocol revises the QT protocol, which has a memoryless property. In the QT_ss protocol, the tag will send all the bits of their identification codes when the query string matches the first bits of their identification codes. While the tags are sending their identification codes, if the reader detects a collision bit, it will send a signal to the tags to stop sending. According to the simulation results, the QT_ss protocol outperforms the QT protocol in terms of the number of response bits.