Improved tree structure anti-collision algorithm of RFID
The whole big query tree is divided into several branches,and the work of tag recognition is executed in each branch,thus reducing the probability of tag collision.The proposed algorithm can be divided into prefix determination and branch query two phases.In the prefix determination phase,the prefix...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2015-07-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015161/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539678703976448 |
|---|---|
| author | Xue WANG Zhi-hong QIAN Xiao-hui LIU Chao CHENG |
| author_facet | Xue WANG Zhi-hong QIAN Xiao-hui LIU Chao CHENG |
| author_sort | Xue WANG |
| collection | DOAJ |
| description | The whole big query tree is divided into several branches,and the work of tag recognition is executed in each branch,thus reducing the probability of tag collision.The proposed algorithm can be divided into prefix determination and branch query two phases.In the prefix determination phase,the prefix of every tag is identified,and each prefix denotes a branch.Traverse each branch by turns to recognize tags; in the branch query phase,backward search strategy and dynamic search method are used.Theoretical analysis and simulation experiment show that when the improved algorithm can improved the overall performance of RFID system from the aspects of the number of queries,time delay,and throughput. |
| format | Article |
| id | doaj-art-b26ca6683a5e4aaeabb21b534072ee03 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2015-07-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-b26ca6683a5e4aaeabb21b534072ee032025-01-14T06:46:46ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2015-07-013612913759694360Improved tree structure anti-collision algorithm of RFIDXue WANGZhi-hong QIANXiao-hui LIUChao CHENGThe whole big query tree is divided into several branches,and the work of tag recognition is executed in each branch,thus reducing the probability of tag collision.The proposed algorithm can be divided into prefix determination and branch query two phases.In the prefix determination phase,the prefix of every tag is identified,and each prefix denotes a branch.Traverse each branch by turns to recognize tags; in the branch query phase,backward search strategy and dynamic search method are used.Theoretical analysis and simulation experiment show that when the improved algorithm can improved the overall performance of RFID system from the aspects of the number of queries,time delay,and throughput.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015161/RFIDanti-collisiontree structureprefix querybackward search |
| spellingShingle | Xue WANG Zhi-hong QIAN Xiao-hui LIU Chao CHENG Improved tree structure anti-collision algorithm of RFID Tongxin xuebao RFID anti-collision tree structure prefix query backward search |
| title | Improved tree structure anti-collision algorithm of RFID |
| title_full | Improved tree structure anti-collision algorithm of RFID |
| title_fullStr | Improved tree structure anti-collision algorithm of RFID |
| title_full_unstemmed | Improved tree structure anti-collision algorithm of RFID |
| title_short | Improved tree structure anti-collision algorithm of RFID |
| title_sort | improved tree structure anti collision algorithm of rfid |
| topic | RFID anti-collision tree structure prefix query backward search |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015161/ |
| work_keys_str_mv | AT xuewang improvedtreestructureanticollisionalgorithmofrfid AT zhihongqian improvedtreestructureanticollisionalgorithmofrfid AT xiaohuiliu improvedtreestructureanticollisionalgorithmofrfid AT chaocheng improvedtreestructureanticollisionalgorithmofrfid |