DocumentCode
459394
Title
Prefix-Randomized Query-Tree Protocol for RFID Systems
Author
Chiang, Kong Wa ; Hua, Cunqing ; Yum, Tak-Shing Peter
Author_Institution
Department of Information Engineering, The Chinese University of Hong Kong, Shatin, NT, Hong Kong. E-mail: kwchian4@ie.cuhk.edu.hk
Volume
4
fYear
2006
fDate
38869
Firstpage
1653
Lastpage
1657
Abstract
In this paper we present a new tree search-based protocol for the anti-collision problem of RFID systems. This protocol builds a binary search tree according to the prefixes chosen randomly by tags rather than using their ID-based prefixes. Therefore, the tag identification time of the proposed protocol is no longer limited by the tag ID distribution and ID length as the conventional tree search protocol. The time complexity of the protocol is derived and shown that it can identify tags faster than the Query-Tree protocol.
Keywords
Access protocols; Binary search trees; Broadcasting; Data processing; Electronic mail; Intrusion detection; Multiaccess communication; Power supplies; Radiofrequency identification; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 2006. ICC '06. IEEE International Conference on
Conference_Location
Istanbul
ISSN
8164-9547
Print_ISBN
1-4244-0355-3
Electronic_ISBN
8164-9547
Type
conf
DOI
10.1109/ICC.2006.254956
Filename
4024389
Link To Document