An anti-collision algorithm for RFID-based robots based on dynamic grouping binary trees. (October 2017)

• Record Type: Journal Article
• Authors: Zhang, Yin; Yang, Fan; Wang, Qian; He, Qianlin; Li, JiaCheng; Yang, Yue
• Is Part Of: Computers & electrical engineering. Volume 63(2017)
• Page Start: 91
• Page End: 98
• Publication Date: 2017-10
• Subjects: RFID-based robots -- Anti-collision -- Query tree -- Dynamic grouping mechanism; Computer engineering -- Periodicals; Electrical engineering -- Periodicals; Electrical engineering -- Data processing -- Periodicals; Ordinateurs -- Conception et construction -- Périodiques; Électrotechnique -- Périodiques; Électrotechnique -- Informatique -- Périodiques; Computer engineering; Electrical engineering; Electrical engineering -- Data processing; Periodicals; Electronic journals; 621.302854
• DOI: 10.1016/j.compeleceng.2017.03.003
• Languages: English
• ISSNs: 0045-7906

Abstract

Graphical abstract: Abstract: This paper investigates the conventional algorithms for addressing the issue of tag collision in radio-frequency identification (RFID) systems. To improve the efficiency of RFID reader inquiry, this paper proposes an approach based on dynamic grouping binary trees, named DGBT, for RFID-based robots. Through DGBT, the collision probability and query times of RFID readers are lowered by adaptive anti-collision prefixes, the efficiency of RFID identification is improved via the group-based approach, and the binary-tree-based queries within groups are ensured to be stable, flexible, effective and practicable. Analysis and simulation verify that the query times and throughput rate are significantly improved by DGBT.