A multi-tag anti-collision protocol based on 8-ary adaptive pruning query tree

Ming Chu,Xue Wang,Zhihong Qian

doi:10.1177/1550147718811823

Abstract

In order to solve the problem of multi-tag anti-collision in radio frequency identification systems, a multi-tag anti-collision protocol based on 8-ary adaptive pruning query tree is proposed in this article. According to Manchester code, the highest collision bit can be detected. In the process of tag identification, the protocol only locks the target on the three consecutive bits which start from the highest collision bit. The protocol has two tag identification mechanisms, and which one is chosen is determined by the value of collision coefficient. Using the collision information characteristics of the three bits, idle timeslots are evitable, and some collision timeslots are eliminated at the same time. The 8-ary adaptive pruning query tree protocol fully takes into account several important performance indicators such as the number of query timeslots, communication complexity, transmission delay, and throughput. Both theoretical analysis and simulation results show that this protocol performs better than other tree-based anti-collision protocols. The throughput of 8-ary adaptive pruning query tree protocol remains approximately 0.625.

Highlights

Radio frequency identification (RFID)[1] is one of the most crucial technologies for the Internet of Things (IoT)
We propose a multi-tag anti-collision protocol based on EAPT through analyzing the shortcomings of other tree-based anti-collision protocols
Both theoretical analysis and simulation experiments show that EAPT protocol significantly improves the identification efficiency of RFID systems

Summary

Introduction

Radio frequency identification (RFID)[1] is one of the most crucial technologies for the Internet of Things (IoT). The Aloha-based anti-collision protocols exist the problem of tag starvation,[23] and the deterministic protocols can identify tags one by one according to a certain rule which avoids the occurrence of tag starvation In another aspect, the deterministic protocols increase the total number of tag identification timeslots to a certain extent. In this regard, many scholars in related fields proposed many excellent tree-based anti-collision protocols. CT protocol only focuses on collision bits and group tags according to the highest collision bit in each query This protocol improves the identification efficiency of RFID systems and reduces some unnecessary idle timeslots. Aiming at the shortcomings of the existing treebased protocols, a multi-tag anti-collision protocol based on 8-ary adaptive pruning query tree (EAPT) is proposed in this article. Section ‘‘Conclusion’’ draws a conclusion for this article and puts forward the prospect

Related work

Findings

Conclusion