LRST: searching tree anti-collision algorithm with low-redundancy
During the RFID tag identification process, the tree-based anti-collision algorithms usually incur large amount of redundant data due to an excess of long query commands,which increases the communication overhead. To resolve this problem, a searching tree anti-collision algorithm with low-redundancy...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2014-06-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.06.014/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539741602807808 |
|---|---|
| author | Qiong HUANG Jiang-tao LING Min ZHANG Xiao-long YANG |
| author_facet | Qiong HUANG Jiang-tao LING Min ZHANG Xiao-long YANG |
| author_sort | Qiong HUANG |
| collection | DOAJ |
| description | During the RFID tag identification process, the tree-based anti-collision algorithms usually incur large amount of redundant data due to an excess of long query commands,which increases the communication overhead. To resolve this problem, a searching tree anti-collision algorithm with low-redundancy on the basis of regressive-style dynamic searching tree algorithm was proposed. In order to reduce the number of queries, a novel query mode was developed, i.e., single query with duo responses. Depending on the most significant collided bit, the collided tags respond in the first or second slot separately. In order to reduce the length of query command, the prefix matching circuit in tag was replaced with a counter, which eliminated the prefix as the parameter of query command. The predictive identification and block-ing technique were also introduced to avoid unnecessary queries. Theoretical analysis and simulation results show that the communication overhead is greatly reduced. |
| format | Article |
| id | doaj-art-7abe3fa858424d8a9b80019bb40141db |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2014-06-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-7abe3fa858424d8a9b80019bb40141db2025-01-14T06:43:34ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2014-06-013511011559682110LRST: searching tree anti-collision algorithm with low-redundancyQiong HUANGJiang-tao LINGMin ZHANGXiao-long YANGDuring the RFID tag identification process, the tree-based anti-collision algorithms usually incur large amount of redundant data due to an excess of long query commands,which increases the communication overhead. To resolve this problem, a searching tree anti-collision algorithm with low-redundancy on the basis of regressive-style dynamic searching tree algorithm was proposed. In order to reduce the number of queries, a novel query mode was developed, i.e., single query with duo responses. Depending on the most significant collided bit, the collided tags respond in the first or second slot separately. In order to reduce the length of query command, the prefix matching circuit in tag was replaced with a counter, which eliminated the prefix as the parameter of query command. The predictive identification and block-ing technique were also introduced to avoid unnecessary queries. Theoretical analysis and simulation results show that the communication overhead is greatly reduced.http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.06.014/RFIDanti-collisionsearching treelow-redundancy |
| spellingShingle | Qiong HUANG Jiang-tao LING Min ZHANG Xiao-long YANG LRST: searching tree anti-collision algorithm with low-redundancy Tongxin xuebao RFID anti-collision searching tree low-redundancy |
| title | LRST: searching tree anti-collision algorithm with low-redundancy |
| title_full | LRST: searching tree anti-collision algorithm with low-redundancy |
| title_fullStr | LRST: searching tree anti-collision algorithm with low-redundancy |
| title_full_unstemmed | LRST: searching tree anti-collision algorithm with low-redundancy |
| title_short | LRST: searching tree anti-collision algorithm with low-redundancy |
| title_sort | lrst searching tree anti collision algorithm with low redundancy |
| topic | RFID anti-collision searching tree low-redundancy |
| url | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.06.014/ |
| work_keys_str_mv | AT qionghuang lrstsearchingtreeanticollisionalgorithmwithlowredundancy AT jiangtaoling lrstsearchingtreeanticollisionalgorithmwithlowredundancy AT minzhang lrstsearchingtreeanticollisionalgorithmwithlowredundancy AT xiaolongyang lrstsearchingtreeanticollisionalgorithmwithlowredundancy |