Efficient RFID Anti-Collision Scheme with Multi-Collision Reflected Frame Request

To reduce the searching time of the whole transponders in the interrogator´s operation range, this paper uses a tree-based searching scheme with multicollision reflected frame request and multiresponding tag scheduling scheme. This scheme enables efficient burst UID receptions of the transponders, and eliminates unnecessary frame overhead. To show the feasibility of this scheme, total searching time is simulated as a parameter of UID length and tag density. The results are compared with that of the basic tree-based anticollision scheme, and the better performance is reported. Especially for the same UID length, the proposed scheme can reduces the searching time up to 50%.