Bit arbitration query tree anti-collision algorithm based on grouping mechanism
A bit arbitration query tree anti-collision algorithm based on grouping mechanism was proposed. GBAQT divided tags into two groups according to the tag ID's feature and used three arbitration bits to identify tags instead of using one bit in traditional methods. The reader can obtain the transm...
Saved in:
| Main Authors: | Yu FU, hong QIANZhi, Chao CHENG, hui LIUXiao |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2016-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2016014/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Improved tree structure anti-collision algorithm of RFID
by: Xue WANG, et al.
Published: (2015-07-01) -
LRST: searching tree anti-collision algorithm with low-redundancy
by: Qiong HUANG, et al.
Published: (2014-06-01) -
CATPE protocol with capture effect for RFID tag anti-collision
by: Xi YANG, et al.
Published: (2014-07-01) -
Research on RFID anti-collision hybrid algorithm based on discrete processing
by: Ping LI, et al.
Published: (2013-08-01) -
Research on RFID anti-collision hybrid algorithm based on discrete processing
by: Ping LI, et al.
Published: (2013-08-01)