Collision-Resilient Symbol Based Extension of Query Tree Protocol for Fast RFID Tag Identification

Author(s):  
Jae-Min Seol ◽  
Seong-Whan Kim
2013 ◽  
Vol 12 (10) ◽  
pp. 2063-2075 ◽  
Author(s):  
Yuan-Cheng Lai ◽  
Ling-Yen Hsiao ◽  
Hong-Jie Chen ◽  
Ching-Neng Lai ◽  
Jian-Wei Lin

2020 ◽  
Vol 160 ◽  
pp. 779-789 ◽  
Author(s):  
Zelalem Legese Hailemariam ◽  
Yuan-Cheng Lai ◽  
Riyanto Jayadi ◽  
Yen-Hung Chen ◽  
Sheng-Chi Huang

2017 ◽  
Vol 112 ◽  
pp. 141-153 ◽  
Author(s):  
Riyanto Jayadi ◽  
Yuan-Cheng Lai ◽  
Chih-Chung Lin
Keyword(s):  

2013 ◽  
Vol 71 (4) ◽  
pp. 2947-2963 ◽  
Author(s):  
Chuyen T. Nguyen ◽  
Kazunori Hayashi ◽  
Megumi Kaneko ◽  
Petar Popovski ◽  
Hideaki Sakai

2021 ◽  
Vol 2021 ◽  
pp. 1-7
Author(s):  
Xinyan Wang

Tag collision is one of the critical problems in radiofrequency identification (RFID) technology which can be widely used to identify objects using tag attachment automatically. Through the transmission and reflection of wireless radiofrequency signals, noncontact identification is realized. However, when multiple tags respond to the reader simultaneously, a collision occurs, significantly degrading the identification performance of RFID systems. To tackle the tag collisions, we propose a fast hybrid strategy-based RFID anticollision (FHS-RAC) protocol. Based on the conventional query tree algorithm, the proposed FHS-RAC makes full use of collision bits and the total response bits to achieve the faster tag identification. Extensive simulations and experiments verify the feasibility and effectiveness of our proposed scheme.


Sign in / Sign up

Export Citation Format

Share Document