ELECTRICA
RESEARCH ARTICLE

Performance Analysis of Tree-Based Tag Anti-Collision Protocols for RFID Systems

1.

Department of Computer Engineering, Mehmet Akif Ersoy University, Burdur, Turkey

2.

Department of Industrial Engineering, Mehmet Akif Ersoy University, Burdur, Turkey

ELECTRICA 2019; 19: 182-192
DOI: 10.26650/electrica.2019.19030
Read: 1546 Downloads: 709 Published: 01 July 2019

In today’s fast-changing competitive environment, companies and organizations need to develop their services, applications, and business processescontinuously in order to benefit more from time and resources. Radio Frequency Identification (RFID), as one of the technological innovations, is an autoid technology that enables many new application domains in diverse scientific fields and provides important opportunities to build efficient industrialsystems. It is capable of identifying, locating, tracking and monitoring objects, and offers companies and organizations important advantages to developefficient and successful business applications. In RFID systems, tag identification is a critical process. However, tag collisions occur when multiple tagstransmit their IDs to a reader simultaneously, and thus affect the stability of the RFID system. Therefore, a powerful tag anti-collision mechanism isrequired to accelerate the tag identification process while minimizing the collision effects. In this paper, we presented a performance analysis of someof the tree-based tag anti-collision protocols (binary tree, query tree, adaptive binary tree, and adaptive query tree) to evaluate the tag identificationprocess for the RFID system in an IoT environment. In our experiments, we observed that adaptive tree-based tag anti-collision protocols have betterperformance than the binary tree protcol and the query tree protocol.

Cite this article as: Yüksel ME, Fidan H. Performance Analysis of Tree-Based Tag Anti-Collision Protocols for RFID Systems. Electrica, 2019; 19(2): 182-192.

Files
EISSN 2619-9831