Performance evaluation of a multi-branch tree algorithm in RFID

Reading efficiency is one of the key factors to evaluate Radio Frequency Identification (RFID) systems. For the system using multi-branch protocols, the performance would be better if the tags are properly divided into multiple groups. This paper firstly gives the closed-form of system efficiency for binary tree algorithm. Based on the theoretical analysis, the optimal branches number is derived. An efficient multi-branch tree (EMBT) algorithm is proposed subsequently, along with a tag number estimation algorithm and performance evaluation. Both theoretical analysis and simulation results indicate that multi-branch tree algorithm has better performance than the conventional binary tree algorithm. System identification efficiency of the proposed method can achieve above 45%, while that of the binary tree algorithm is only 34.8%.