{'fraction_non_alphanumeric': 0.021164021164021163, 'fraction_numerical': 0.0, 'mean_word_length': 5.204918032786885, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Research of Matrix-based Grouping Method on Anti-collision Algorithm for RFID Tag Identification

Abstract Currently, the Binary Search Tree (BST) algorithm is mainly used for continuous identification signal processing on active RFID tags. However, tag population is unlimited increasing. With using the BST, the number of identified tags is limited at an average period of time. In this paper, we propose the BST algorithm of the matrix-based grouping to accelerate the recognition speed of tags. It is shown that the optimization algorithm is effective and practical by the theoretical research and simulation experiment. Compared with the BST algorithm, this method can effectively reduce the recognition time and improve the recognition speed of tags.