Abstract

Signal collision is an inevitable problem in mass RFID (Radio Frequency Identification) tags scenario. How to solve this problem effectively is increasingly attracting attentions. This paper analyzes the binary tree algorithm in detail, which is useful method to solve the collision problems among massive RFID tags. Due to the problems with the binary tree algorithm, an improvement to the algorithm, which based on the pretreatment method, is proposed in this paper. The simulation result shows that the proposed method outperforms the previous one.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call