Binary search algorithms with interference cancellation RFID systems

Abstract

In a RFID system, readers need to acquire ID information stored in tags via the wireless channel. The binary search algorithm is used to coordinate the transmissions from multiple tags to one reader. In this paper, we propose a new approach to use interference cancellation in the binary search algorithm, which achieves time saving of around 50% to read all tags' IDs. In addition, for algorithms with and without interference cancellation, we analyze the reliability of ID detection and obtain analytical results of the average probability of success for ID detection