A new anti-collision based on a-priori information

A collision occurs when more than two tags present in the readerpsilas field of a radio frequency identification system. Anti-collision algorithms such as binary trees and dynamic framed slotted aloha (DFSA) have been employed to prevent such a collision. The identification number of tag consists of 64 bits and certain parts of 64 bits can be considered a priori-information. This paper proposes a new anti-collision algorithm based on a-priori information about the manufacturer code. This prior-information reduces the number of bits to analyze in the algorithm, hence reduces the operation time for the faster read-performance. Results indicate that the proposed anti-collision algorithm required a less number of used time slots, thus minimizing the operation time more than 50% comparing to the existing ones.