Research on Anti-Collision Algorithm of Short Distance Data Communication Based on Binary-Tree Disassembly

Abstract:

This paper puts forward adaptive anti collision algorithm based on two fork tree decomposition. New search algorithm built on the basis of binary-tree algorithm, using the uniqueness of the label EPC, to estimate the distribution of label by slot allocation, the huge and complicated two fork tree is decomposed into several simple binary-tree by search the collision slots for binary-tree, so, it can simplifies the search process. The algorithm fully considers4 important performance parameters of the reader paging times, transmission delay, energy consumption and throughput label, the simulation results show that, the improved anti-collision algorithm is obviously improved performance than other two fork tree algorithm, it is more suitable for RFID anti-collision protocols.

• Periodical: Applied Mechanics and Materials (Volume 686)
• Pages: 354-358
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.686.354
• Online since: October 2014
• Authors: Zhong Yue Hu*
• Keywords: Anti-Collision, Binary-Tree Disassembly, RFID

References

[1] Wang Bisheng, Zhang Qishan. Study of anti-collision performance in parallelizable identification UHF RFID system [J]. Journal of communication, 2009, 30 (6): 108-113.

[2] Du Haitao, Xu Kunliang and so on. Anti collision algorithm based on tree search return type[J]. Journal of Yunnan University, 2006, 28 (Sl): 133-136.

[3] Yu Song-sen and Zhang Yi-ju, et al. An anti-collision algorithm based on binary-tree searching of regressive index and its practice. Computer Engineering and Application, 2004, 26(16): 26-28.

[4] Ding Zhi-guo, Guo Li. et. An Adaptive Anti-collision Algorithm Based on Binary-Tree Disassembly [J]. Journal of Electronics & Information Technology, Jun. 2009, Vol. 31No. 6.