{'fraction_non_alphanumeric': 0.022113022113022112, 'fraction_numerical': 0.0, 'mean_word_length': 5.52, '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}}
A Collision-Tolerant-Based Anti-Collision Algorithm for Large Scale RFID System

Tag identification is an important issue in an RFID system. Most existing anti-collision algorithms solely focus on reducing collision probability while suffering from vast idle slots. This letter proposes a collision-tolerant dynamic-framed slotted Aloha (CE-DFSA) algorithm, which attempts to identify multiple tags in a slot to reduce the total identification time in the process of identification. In CE-DFSA, tags are allocated with orthogonal Walsh sequence so that multiple tags can be identified in a time slot without spreading the spectrum. Simulation results show that the proposed algorithm considerably accelerates the tag identification process with improved efficiency compared with existing anti-collision algorithms.