RFID Anti-collision algorithm Based on Bi-directional Binary Exponential Index

There are two basic approaches to solve the tag collision: deterministic collision resolution and stochastic collision resolution. These resolutions are all in the assumption that the number of the tags in the area doesn´t change. This algorithm gets over this disadvantage; the tags can enter into the reader´s area in the dynamic mode at any moment. According to the reader´s identified result each time, the tags can modify their responsive probability in the incremental or degressive mode. This bi-directional operation considers the impartiality of identification. This algorithm adopts Markov chain, and provides the analysis of the efficiency in the situation that tags appear in different patterns.