RFID anti-collision algorithm based on binary tree

Abstract

The invention discloses an RFID anti-collision algorithm based on a binary tree. A locking position paging instruction is added on the basis of a binary tree algorithm, a reader judges the bit position where a collision happens according to a decoding result, the locking position paging instruction is sent to lock the bit position where the collision happens, and the anti-collision operation is conducted on the locked collision position. The four important performance indexes of the reader paging frequency, the transmission time delay, the label energy consumption and the handling capacity are fully taken into consideration, compared with other binary tree algorithms, the performance of the BLBO anti-collision algorithm is obviously improved, and the RFID anti-collision algorithm is better suitable for an RFID anti-collision protocol.

Description

technical field [0001] The invention relates to the technical field of radio frequency identification, in particular to a lock back anti-collision (BLBO) algorithm proposed on the basis of a binary tree algorithm. Background technique [0002] One of the main advantages of radio frequency identification technology is multi-target identification. When the system is working, there may be multiple tags around the reader at the same time. When multiple tags transmit data to the reader at the same time, a conflict problem occurs. There are currently two types of RFID anti-collision algorithms: one is an uncertain algorithm based on ALOHA, and the other is a deterministic algorithm based on a binary tree (BT, binary tree). A fatal shortcoming of the uncertain algorithm based on ALOHA is that the label is prone to "starvation" (that is, the label may not be recognized). Although the deterministic algorithm based on the binary tree solves this "starvation" situation, but There are...

AI Technical Summary

Problems solved by technology

[0003] The technical problem to be solved by the present invention is: Aiming at the problems of long recognition period and high energy consumption of tags in the current binary tree algorithm, the present invention proposes the concept of lock position, and uses the lock position paging command to lock the bit position where the collision occurs. Anti-collision operation is performed on the collision position of the collision node, and all labels in the next branch of the collision node are identified by using the back-off strategy

Images