{'fraction_non_alphanumeric': 0.014729950900163666, 'fraction_numerical': 0.0016366612111292963, 'mean_word_length': 4.941747572815534, '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}}
An Improved Anti-Collision Algorithm in RFID System

Tag collision problem is the key issue that affects the reading efficiency of the RFID system. This paper presents an improved binary tree anti-collision algorithm based on the jump dynamic tree.We used stack technology, backward strategy to avoid the reader identifying the tag from the tree roots. We used thinking of reducing bit to avoid the reader sending the highest collision bit set 0, which effectively reduce the data transmission bits. The simulation results and analysis show that that the efficiency of the algorithm has been obviously improved.