A Novel Contention Control Strategy for Fast Object Identification

The problem of tag contention is a major obstacle for performance improvement of RFID system. Contention control strategy can increase throughput of the finite shared wireless channel and thus accelerate the identification of large RFID tag populations. This paper presents a novel contention control strategy, interleave binary tree algorithm, that combines the advantages of Aloha algorithm and tree algorithm by using one Aloha frame to rearrange the leaves on the tag tree and then reconstruct correspond trees for tags involved in each collision slot to successively identify each tag. Interleave binary tree algorithm are compared to three different contention control strategies: dynamic frame size Aloha algorithm by Schoute, Q algorithm, and binary tree algorithm. The results show that the Interleave binary tree algorithm achieved a much higher throughput than other approaches, and its stability is quite better either.