{'fraction_non_alphanumeric': 0.016421780466724288, 'fraction_numerical': 0.0, 'mean_word_length': 4.878172588832487, '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 on the RFID Anticollision Strategy Based on Decision Tree

RFID can automatically read the information stored on the tag. When multiple tags send data to the reader and writer at the same time, multiple tag collision will occur, resulting in the reader and writer being unable to successfully identify the tag. To solve this problem, an RFID multitag identification method based on decision tree is proposed. The Manchester code is used to represent different level states of voltage. The reader extracts the collision bits in the tag ID by using the Manchester code, and these collision bits form the new tag ID. In the process of decision tree search, the “XOR” command operation is added, and the query prefix is selectively sent to the tag to mark all collision bits. The process will continue until one tag is identified; then, reset the remaining unrecognized tags and continue to participate in a new round of identification. The simulation results show that the RFID multitag identification method based on decision tree can reduce the time complexity and communication overhead and improve the throughput, so it has high search efficiency.