DocumentCode :
3226267
Title :
A Bit collision detection based Query Tree protocol for anti-collision in RFID system
Author :
Gou, Haosong ; Jeong, Hyo-Cheol ; Yoo, Younghwan
Author_Institution :
Sch. of Comput. Sci. & Eng., Pusan Nat. Univ., Busan, South Korea
fYear :
2010
fDate :
11-13 Oct. 2010
Firstpage :
421
Lastpage :
428
Abstract :
Anti-collision algorithms in the RFID system can be divided into two categories: ALOHA based and binary tree based algorithm. Each of them has its own advantages or disadvantages. The QT protocol, as a classic binary tree based algorithm, was proposed to achieve the reliable throughput of identification by using prefix to avoid collisions. This paper proposes an improved QT protocol called Bit collision detection based Query Tree (BQT) by adopting individual bit collision detection, which can detect the collision in each bit. It can reduce the collision for the tags which have the same prefix and accelerate identification process. The simulation results and analysis show that our BQT protocol could reduce the collisions and achieve much better performance on tag identification.
Keywords :
protocols; radiofrequency identification; ALOHA based algorithm; QT protocol; RFID System; anti-collision algorithms; anticollision algorithm; binary tree based algorithm; bit collision detection; query tree protocol; radiofrequency identification; tag identification; Adaptation model; Performance analysis; BQT protocol; Binary tree search; QT protocol; RFID system;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless and Mobile Computing, Networking and Communications (WiMob), 2010 IEEE 6th International Conference on
Conference_Location :
Niagara Falls, ON
Print_ISBN :
978-1-4244-7743-2
Electronic_ISBN :
978-1-4244-7741-8
Type :
conf
DOI :
10.1109/WIMOB.2010.5645031
Filename :
5645031
Link To Document :
بازگشت