A Fast Binary Search Anti-Collision Algorithm for Multiple Tag Identification

Author

Xu, Wu Zhong ; Zhu, Hui ; Hu, Bin Jie

Author_Institution

Sch. of Electron. & Inf. Eng., South China Univ. of Technol., Guangzhou

fYear

2008

fDate

12-14 Oct. 2008

Firstpage

1

Lastpage

4

Abstract

This paper presents a fast wireless anti-collision algorithm for radiofrequency identification (RFID) systems. The proposed algorithm introduces a new kind of inquiry round to gain the request prefixes from tags. It also has the advantages of jumping and dynamic searching algorithm (JDS) and prefix-randomized query-tree protocol (PRQT). Analysis and simulation results show that the proposed algorithm needs about 1.2 iterations to identify one tag, consuming 40.0% less iterations than JDS and 47.8% less iterations than PRQT.

Keywords

radiofrequency identification; search problems; telecommunication congestion control; trees (mathematics); binary search; jumping and dynamic search; prefix-randomized query-tree protocol; radiofrequency identification; wireless anti-collision; Algorithm design and analysis; Analytical models; Banking; Broadcasting; Electrical equipment industry; Heuristic algorithms; Protocols; Radiofrequency identification; Supply chains; Technical Activities Guide -TAG;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on

Conference_Location

Dalian

Print_ISBN

978-1-4244-2107-7

Electronic_ISBN

978-1-4244-2108-4

Type

conf

DOI

10.1109/WiCom.2008.679

Filename

4678587