An Effective Temporary ID Based Query Tree Algorithm for RFID Tag Anti-Collision

摘要：

This paper proposes an effective temporary ID based query tree algorithm (TID QTA) for RFID tag anticollision. Tags with 96-bit UID are mainly concerned. In TID QTA, a 16-bit sequence is selected from tag ID as its TID and query tree algorithm is implemented based on TID. If two tags have the same TID, they will renew their TIDs by selecting another 16 bits from their IDs. The simulation results show that the average number of transmitted bits for one tag identification in TID QTA is the fewest among QTA and its variants.

关键词： RFID anti-collision tree-based algorithm temporary ID tag identification

作者: Yun Tian Gongliang Chen Jianhua Li

作者单位: School of Information Security Engineering Shanghai Jiaotong University Shanghai, China School of Information Security Engineering/Department of Electronic Engineering Shanghai Jiaotong Un

会议类型: 国际会议

会议名称: The 2011 International Workshop on Internet of Things Technology and Innovative Application Design(2011年国际物联网技术与创新应用设计研讨会IOT Workshop 2011)

会议地点: 北京

会议语种:英文

页码: 427-430

在线出版日期: 2011-08-24（万方平台首次上网日期，不代表论文的发表时间）