Abstract

At present, some existing tag anti-collision algorithms are used mostly in scenarios of fixed number of tags and they perform poorly in tag moving scenarios. Therefore, this paper proposes a double reader tag movement RFID anti-collision method based on suffix, and through the cloud platform based on cloud computing, the supply chain data sharing is realized. Tag moving scenarios usually use a single reader. The proposed employs double reader to expand the recognition range and also to prolong the recognition time, but there is the problem of repeated recognition. This article proposes a suffix-based bit-slot ALOHA (SBSA) algorithm, where this problem is solved and the time-slot is reduced. In view of the problem that a large number of tags entering into the recognition area of readers lead to the reduction of the recognition efficiency. This article proposes a suffix-based tag group bit-slot ALOHA (STGBSA) algorithm, tag grouping and tag estimation methods are proposed. Complexity analysis is deployed in this article, from the perspective of the tag loss ratio and identification efficiency, the performances of various anti-collision algorithms are evaluated and compared with those of the existing methods. The simulation results show that the method proposed in this paper is better than the existing methods.

Highlights

  • In recent years, Internet of Things (IoT) has been widely used with the rapid development of a new generation of the information technology [1,2,3,4]

  • In order to solve this problem, a suffix-based tag group bit-slot ALOHA (STGBSA) algorithm is proposed in this paper, which controls the number of tags to be read at a time, and reduces the likelihood of collisions

  • The STGBSA algorithm is proposed, which groups the estimated number of tags to solve the problem that a large number of tags entering into the signal area of readers at the same time lead to increasing tag collision and difficulty in successfully reading tags

Read more

Summary

Introduction

Internet of Things (IoT) has been widely used with the rapid development of a new generation of the information technology [1,2,3,4]. This paper proposes a suffix-based bit-slot ALOHA (SBSA) algorithm. In this method, this problem can be solved. When the tag movement density is high, a large number of tags enter into the signal area of the reader at the same time. This results in increasing tag collisions and makes it difficult to read tags successfully. In order to solve this problem, a suffix-based tag group bit-slot ALOHA (STGBSA) algorithm is proposed in this paper, which controls the number of tags to be read at a time, and reduces the likelihood of collisions. The probability of the slot selected only for one tag (success slot) is: Psucceed

N p1ð1
À 2Lsuffix
Conclusions
Full Text
Paper version not known

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 call

Disclaimer: 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.