摘要
A reader must be able to identify tags as quickly as possible, so tag anti-collision is a significant issue for the RFID system. In this paper, we propose a novel tag anti-collision protocol (ACQT), which is suitable for a large mobile tags environment. Based on a 3-ary tree, it has the optimal capacity to identify for tree-based protocols. Using a combination query tree, it can solve the problem of not being able to generate a 3-ary tree when the length of a tag's ID is not a multiple of 3. The joining and leaving strategies can efficiently be applied for tag mobility. The simulation results show that the protocol we present can achieve better performance than previous protocols by decreasing identification delay, collision cycles and idle cycles.
| 源语言 | 英语 |
|---|---|
| 期刊论文编号 | 6211362 |
| 页(从-至) | 1192-1195 |
| 页数 | 4 |
| 期刊 | IEEE Communications Letters |
| 卷 | 16 |
| 期 | 8 |
| DOI | |
| 出版状态 | 已出版 - 2012 |
学术指纹
探究 'An adaptive combination query tree protocol for tag identification in RFID systems' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver