Abstract

Aiming at the data redundancy problem in process of anti-collision in RFID, an OP(occurrence position) algorithm is proposed in this study, OP algorithm is based on the theory of direct georeference and BS (binary search) algorithm, improve traditional binary search mechanism by changing data transformed by anti-collision commands, data transformed by anti-collision commands in OP algorithm contains the same information as those data in BS algorithm, but contains less data bits than that in BS algorithm. Analysis is made for binary search algorithm used in process of anti-collision and shortcomings are given, analysis for ALOHA algorithm is also given, then principles of OP algorithm which is proposed to improve those shortcomings existing in BS algorithm and ALOHA algorithm are elaborated, analysis is also made for OP algorithm. Finally a module for OP algorithm is established on transmission delay and data redundancy, results of simulations show that OP algorithm has even higher capability than other Binary Search algorithm and has better suitability on occasion of much more tags.

Keywords:

Anti-collision, binary search, occurrence position, RFID,

References

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.