Fast wireless anti-collision algorithm in ubiquitous ID system

This paper proposes and analyzes the fast wireless anti-collision algorithms (modified bit-by-bit binary-tree algorithm (MBBT) and enhanced bit-by-bit binary-tree algorithm (EBBT)) for a ubiquitous ID system. This paper mathematically compares the performance of the proposed algorithms with that of the binary search algorithm (BS), slotted binary-tree algorithm (SBT) using time slot, and bit-by-bit binary-tree algorithm (BBT). We also validated analytical results using OPNET simulation. According to the analysis, comparing MBBT with BBT, which is the best among existing algorithms, the performance of MBBT is about 5% higher when the number of the tags is 20, and 100% higher for 200 tags. Also, comparing EBBT with MBBT, the performance of EBBT is about 355% higher when the number of tags is 20, and 145% higher for 200 tags.