Skip to Main Content
Reducing the number of tag collisions is one of the most important issues in RFID systems, as collisions induce inefficiency. This paper presents a mechanism of grouping of tags via a bit mask, quick tag estimation by a pilot frame and near optimal binary tree-based collision resolution with a frame. Performance analysis and simulation results show that the proposed anti-collision algorithm consumes fewer time slots as compared to previous work, and approaches to the case with the optimal frame size using binary tree collision resolution.
Date of Publication: November 2008