Analytic Properties of the Binary Tree Based Multiple Access Protocol with Application to RFID Tag Collision Resolution

The binary tree based protocol provides an elegant and efficient method to resolve the collision occurred in multiple access broadcasted communication channel. In this paper, some statistical properties of the protocol are analyzed for the communication system with ternary feedbacks. The quantities under investigation include the mathematical expectations for the amount of total nodes, as well as the distribution and mathematical expectation for the amount of nodes in different level of the tree. Besides, the analytic results are introduced to the RFID system to resolve the tag collision and an improve binary query tree based protocol is proposed for successive tag collision resolution cycles. Some properties about the improved binary query tree protocol are presented and numeric evaluations are performed. The performance of this improved protocol is verified to outperform the original binary query tree based protocols in most cases regarding to throughput.