A tag distribution distance based collision avoidance algorithm in RFID systems

A large number of tags are needed in many applications; this fact causes the tag collision problem which affects the system efficiency of identification. We propose a DBCA (tag distribution Distance Based Collision Avoidance) algorithm, which can effectively solve the tag collision problem for a large scale RFID environment. To identify tags with the best system efficiency, a new grouping structure, based on distribution distance, is presented. To reduce the identification time, we give a communication method for the reader and tags in the corresponding frame, based on the different frequencies belonging to the different tag properties. The simulation results and their analysis show preliminarily that our algorithm has better performance than the existing algorithms with respect to system efficiency and identification time.