{'fraction_non_alphanumeric': 0.025816249050873197, 'fraction_numerical': 0.0, 'mean_word_length': 5.367149758454106, '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}}
Randomized Multi-Channel Interrogation Algorithm for Large-Scale RFID Systems

A radio frequency identification (RFID) system consists of a set of readers and several objects, equipped with small computer chips, called tags. In a dense RFID system, where several readers are placed together to improve the read rate and correctness, readers and tags can frequently experience packet collision. A common approach to avoid collision is to use a distinct frequency channel for interrogation for each reader. Various multi-channel anti-collision protocols have been proposed for RFID readers. However, due to their heuristic nature, most algorithms may not fully utilize the achievable system performance. In this paper, we develop an optimization-based distributed randomized multi-channel interrogation algorithm, called FDFA, for large-scale RFID systems. For this purpose, we develop elaborate models for reader-to-tag and reader-to-reader collision problems. FDFA algorithm is guaranteed to find a local optimum of a max-min fair resource allocation problem to balance the processing load among readers. Simulation results show that FDFA has a significantly better performance than the existing heuristic algorithms in terms of the number of successful interrogations. It also better utilizes the frequency spectrum.