.png){kind=icon}
返回
Identifying RFID Tags in Collisions
.png){kind=icon}
OA
AI
DOI：10.1109/TNET.2022.3219016.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
How to obtain the information from massive tags is a key focus of RFID applications. The occurrence of collisions leads to problems such as reduced identification efficiency in RFID networks. To tackle such challenges, most tag collision arbitration protocols focus on scheduling tag identification with collision avoidance. However, how to effectively identify tags in collisions to improve identification efficiency has not been well explored. In this paper, we propose a group query allocation method to divide the string space into mutually disjoint subsets which contains several strings. Each string can be viewed as a full ID or partial ID of a tag. When multiple string from a subset are sent simultaneously, the reader can identify all of them in a time slot. Based on the group query allocation method, a segment detection based characteristic group query tree (SD-CGQT) protocol is presented for fast tag identification by significantly reducing the collision slots and transmitted bits. Numerous experimental results verify the superiority of the proposed SD-CGQT, compared to prior arts in system efficiency, total identification time, communication complexity and energy consumption.
Keyword:
RFID
tag identification
characteristic group
group query
system efficiency
communication complexity
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容