Grouped Dynamic Frame Slotted ALOHA Tag Anti-collision Algorithm Based on Parallelizable Identification
Academic Article
Overview
Research
Identity
Additional Document Info
View All
Overview
abstract
2018, Science Press. All right reserved. In order to solve the problem of low throughput rate and efficiency of the current dynamic frame slot ALOHA collision algorithms, a grouped dynamic frame slotted ALOHA tag anti-collision algorithm based on Parallelizable identification (PIGDFSA) is proposed. Based on the experiments, the method and strategy of increasing the system throughput rate and lowering the tag collision rate are presented by exploring effects of the number of the tags and its groups, the frame length on the system throughout and tag collision rate. Combining the multi-antenna of the RFID system and FastICA technology, the collision slot can be redefined, and the number of the unrecognized tags can be used to set the number of groups and frame length adaptively. The simulation results show that the PIGDFSA algorithm can stabilize the throughput rate more than 92% when the number of tags reaches 2000, and it has higher throughput rate, lesser idle slot and higher algorithm efficiency compared with the FSA-256, GDFSA, and BSDBG algorithm.
