Skip to Main Content
In this paper, an efficient anti-collision protocol, named collision tree protocol (CT), is proposed, and a collision tree is put forward to capture the complete communications between the reader and tags in an execution of CT. The main novelty of CT is that both the generating of prefixes and the splitting of tag group are according to the collided bit directly. Both the properties of collision tree and the results of experiments show that the proposed protocol improves the efficiency of tags identification up to 50% and achieves the best performance of the tree-based tags identification protocols.
Date of Publication: November 2010