An Adaptive Combination Query Tree Protocol for Tag Identification in RFID Systems

A reader must be able to identify tags as quickly as possible, so tag anti-collision is a significant issue for the RFID system. In this paper, we propose a novel tag anti-collision protocol (ACQT), which is suitable for a large mobile tags environment. Based on a 3-ary tree, it has the optimal capacity to identify for tree-based protocols. Using a combination query tree, it can solve the problem of not being able to generate a 3-ary tree when the length of a tag's ID is not a multiple of 3. The joining and leaving strategies can efficiently be applied for tag mobility. The simulation results show that the protocol we present can achieve better performance than previous protocols by decreasing identification delay, collision cycles and idle cycles.

[1]  R.A. Guerin,et al.  Channel occupancy time distribution in a cellular radio system , 1987, IEEE Transactions on Vehicular Technology.

[2]  Yanghee Choi,et al.  A Hybrid Query Tree Protocol for Tag Collision Arbitration in RFID systems , 2007, 2007 IEEE International Conference on Communications.

[3]  Ching-Nung Yang,et al.  A practical implementation of ternary query tree for RFID tag anti-collision , 2010, 2010 IEEE International Conference on Information Theory and Information Security.

[4]  Kai-Yeung Siu,et al.  Efficient memoryless protocol for tag identification (extended abstract) , 2000, DIALM '00.

[5]  Philippe Flajolet,et al.  Q -ary collision resolution algorithms in random-access systems with free or blocked channel access , 1985, IEEE Trans. Inf. Theory.