An improved dynamic adaptive multi-tree search anti-collision algorithm based on RFID

In this letter, we present a dynamic adaptive multi-tree search (DAMS) algorithm which is an improvement of a multi-tree search algorithm (AMS). In order to reduce collisions, the multi-tree search algorithm adjusts the search tree through collision factor (CF). The proposed algorithm puts forward a new CF critical value and stipulates that the length of EPC which tags replied dynamically. The simulation results show that the DAMS search timeslots decrease about 20% than AMS, meanwhile DAMS reduces 70% transmission data than AMS.

[1]  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.

[2]  Wang Suo-ping.  One Anti-Collision Algorithm Based on Improved Adaptive Multi-Tree Search , 2012 .

[3]  Byeongchan Jeon,et al.  Multiple RFID Tags Identification with M-ary Query Tree Scheme , 2013, IEEE Communications Letters.

[5]  Yejun He,et al.  An ALOHA-based improved anti-collision algorithm for RFID systems , 2013, IEEE Wireless Communications.

[6]  Fan Zhipeng,et al.  A RFID anti-collision algorithm based on multithread regressive-style binary system , 2012 .

[7]  Ding Zhi.  An Adaptive Anti-collision Algorithm Based on Multi-tree Search , 2010 .

[8]  Xi Yang,et al.  Capture-Aware Estimation for the Number of RFID Tags with Lower Complexity , 2013, IEEE Communications Letters.

[9]  Jae-Hyun Kim,et al.  Novel Anti-collision Algorithms for Fast Object Identification in RFID System , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[10]  Yu Bai,et al.  A Novel Multidimensional Q-Selection with Random Tree for an Anti-collision Algorithm in RFID Systems , 2013, 2013 Ninth International Conference on Intelligent Information Hiding and Multimedia Signal Processing.