ABSTRACT
Radio frequency identification device (RFID) is an automatic recognition system that consists of a number of tags and readers. This chapter presents background material and a detailed description on tree-based and probabilistic anticollision protocols. It provides analytic study on performance of tag anticollision protocols, and performance evaluation and analysis. The tag identification process is a continuation of many reading slots, which consist of a reader’s request and tags’ replies. Tag anticollision protocols can be classified into two approaches in terms of the way of determining the point of transmission time: tree-based approach and probabilistic approach. The binary tree protocol uses the pseudo-random number generator to divide tags into several groups. The counter variable in each tag is used for identifying each group. The chapter analyzes the performance of tag anticollision protocols. All tree-based protocols use binary search tree as their searching method to identify tags.
