Abstract
With the rapid development of the Internet of Things (IoT), the radio frequency identification (RFID) system becomes increasingly important. Tag identification is a basic problem of the RFID system, whose purpose is to inventory tags. However, in recent years, it requires a very short time for massive tag identification, which brings serious challenges. The traditional Aloha based anti-collision algorithms have disadvantages of either low efficiency or high complexity. Therefore, this article proposes a low complexity dynamic frame slotted Aloha (DFSA) anti-collision algorithm, named LC-DFSA. The reader can estimate the range of tag numbers according to the last frame size, the number of successful slots and the ratio of idle slots. Then the optimal frame size can be calculated. Complexity analysis is deployed in this article, and we validate the correctness of the analysis. Through our simulations, LC-DFSA outperforms other schemes in both the average access efficiency and the algorithm complexity. It also can be conveniently applied to engineering implementations.
Highlights
Over the years, with the rapid development of information technology, the Internet of Things (IoT) has begun to penetrate into people’s lives [1]
In order to reduce the complexity of anti-collision algorithms in the radio frequency identification (RFID) system while maintaining high efficiency, this paper proposes a low complexity anti-collision algorithm based on dynamic frame slotted Aloha (DFSA), named
This paper proposes a low complexity anti-collision algorithm named LC-DFSA, which can be conveniently applied to engineering implementations
Summary
With the rapid development of information technology, the Internet of Things (IoT) has begun to penetrate into people’s lives [1]. High efficient tag identification with low complexity is quite important. Sensors 2020, 20, 228 used the Maximum a Posteriori (MAP) to estimate the tag number They are either with low efficiency or with high complexity considering the limited power in passive RFID systems. In order to reduce the complexity of anti-collision algorithms in the RFID system while maintaining high efficiency, this paper proposes a low complexity anti-collision algorithm based on DFSA, named. The above values used in LC-DFSA can be stored in the memory of the reader in advance, which means that the LC-DFSA algorithm only performs some simple calculation and comparison It lowers the complexity of the passive RFID system. This paper proposes a low complexity anti-collision algorithm named LC-DFSA, which can be conveniently applied to engineering implementations.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
