An enhanced binary tree anti-collision technique for dynamically added tags in RFID systems

Radio frequency identification (RFID) technology uses radio frequency waves to automatically identify people and objects. Tag collision arbitration is a significant issue for fast tag identification. This paper discusses the most widely used anti-collision algorithms and proposes a new technique based on the well known binary tree algorithm and has a new feature which is the ability to take in consideration the new tags entering the reader interrogation zone after starting the identification process.