Radio frequency identification (RFID) is a new generation of automatic identification systems, based on wireless communication technology. In these systems all the tags using one communication channel to communicate with the reader. When two or more tags transmit their data to the reader simultaneously, their transmitted signals will collide. Resolving this collision has a direct impact on the speed of tag identification, especially in systems with large number of tags. In this paper we proposed enhanced bit collision detection algorithm (EBCDA) based on tree algorithm and collision detection bit in the tag’s ID. In this algorithm, the reader is able to reduce greatly the amount of data exchanged between the tag and reader. The exchanged data reduction will increase the speed of tag identification. By comparing the proposed algorithm with other existing algorithms, we show that the proposed algorithm has a better performance.
