Research into Tag Anti-collision Algorithms in RFID
Ang P
Abstract
Ang P
Abstract
Tag anti- collision is one of the key problems of RFID System. The technique of TDMA can solve this problem. In TDMA, there are several anti- collision algorithms, such as ALOHA, Slotted ALOHA, binary search, dynamic binary search, etc. These algo- rithms are different in realization mode and application efficiency. This paper provides analysis and argumentation of them.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Tag anti- collision is one of the key problems of RFID System. The technique of TDMA can solve this problem. In TDMA, there are several anti- collision algorithms, such as ALOHA, Slotted ALOHA, binary search, dynamic binary search, etc. These algo- rithms are different in realization mode and application efficiency. This paper provides analysis and argumentation of them.
Key concepts: Aloha, Computer science, Collision, Realization (probability), Time division multiple access, Key (lock), Algorithm, Binary number