An Efficient Adaptive Anticollision Algorithm Based on 4-Ary Pruning Query Tree
In radio frequency identification system (RFID), the efficiency in which the reader identifies multiple tags is closely related to the methods to solve the collision of multiple tags. At present, a reasonable solution is the introduction of 4-ary query tree (or n -ary query tree) to reduce the colli...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2013-12-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2013/848746 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832547930687406080 |
|---|---|
| author | Wei Zhang Yajun Guo Xueming Tang Guohua Cui Longkai Wu Ying Mei |
| author_facet | Wei Zhang Yajun Guo Xueming Tang Guohua Cui Longkai Wu Ying Mei |
| author_sort | Wei Zhang |
| collection | DOAJ |
| description | In radio frequency identification system (RFID), the efficiency in which the reader identifies multiple tags is closely related to the methods to solve the collision of multiple tags. At present, a reasonable solution is the introduction of 4-ary query tree (or n -ary query tree) to reduce the collision time slots and additional query is used to decrease idle timeslots. The advantage of a 4-ary tree anti-collision algorithm is that it is able to reduce collision timeslots, but it also increases the idle timeslots. To reduce these excessive idle timeslots the 4-ary tree anticollision algorithm brings, an anti-collision algorithm based on adaptive 4-ary pruning query tree (A4PQT) is proposed in this paper. On the basis of the information of collision bits, some idle timeslots can be eliminated through pruning the 4-ary tree. Both theoretical analysis and simulation results support that A4PQT algorithm can significantly reduce recognition time and improve throughput of the RFID system. |
| format | Article |
| id | doaj-art-8f0e34824260413fbff9b2f9eca43cca |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2013-12-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-8f0e34824260413fbff9b2f9eca43cca2025-02-03T06:42:58ZengWileyInternational Journal of Distributed Sensor Networks1550-14772013-12-01910.1155/2013/848746848746An Efficient Adaptive Anticollision Algorithm Based on 4-Ary Pruning Query TreeWei Zhang0Yajun Guo1Xueming Tang2Guohua Cui3Longkai Wu4Ying Mei5 School of Computer, Central China Normal University, Wuhan 430079, China School of Computer, Central China Normal University, Wuhan 430079, China School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China National Institute of Education, Nanyang Technological University, 1 Nanyang Walk, Singapore 637616 School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, ChinaIn radio frequency identification system (RFID), the efficiency in which the reader identifies multiple tags is closely related to the methods to solve the collision of multiple tags. At present, a reasonable solution is the introduction of 4-ary query tree (or n -ary query tree) to reduce the collision time slots and additional query is used to decrease idle timeslots. The advantage of a 4-ary tree anti-collision algorithm is that it is able to reduce collision timeslots, but it also increases the idle timeslots. To reduce these excessive idle timeslots the 4-ary tree anticollision algorithm brings, an anti-collision algorithm based on adaptive 4-ary pruning query tree (A4PQT) is proposed in this paper. On the basis of the information of collision bits, some idle timeslots can be eliminated through pruning the 4-ary tree. Both theoretical analysis and simulation results support that A4PQT algorithm can significantly reduce recognition time and improve throughput of the RFID system.https://doi.org/10.1155/2013/848746 |
| spellingShingle | Wei Zhang Yajun Guo Xueming Tang Guohua Cui Longkai Wu Ying Mei An Efficient Adaptive Anticollision Algorithm Based on 4-Ary Pruning Query Tree International Journal of Distributed Sensor Networks |
| title | An Efficient Adaptive Anticollision Algorithm Based on 4-Ary Pruning Query Tree |
| title_full | An Efficient Adaptive Anticollision Algorithm Based on 4-Ary Pruning Query Tree |
| title_fullStr | An Efficient Adaptive Anticollision Algorithm Based on 4-Ary Pruning Query Tree |
| title_full_unstemmed | An Efficient Adaptive Anticollision Algorithm Based on 4-Ary Pruning Query Tree |
| title_short | An Efficient Adaptive Anticollision Algorithm Based on 4-Ary Pruning Query Tree |
| title_sort | efficient adaptive anticollision algorithm based on 4 ary pruning query tree |
| url | https://doi.org/10.1155/2013/848746 |
| work_keys_str_mv | AT weizhang anefficientadaptiveanticollisionalgorithmbasedon4arypruningquerytree AT yajunguo anefficientadaptiveanticollisionalgorithmbasedon4arypruningquerytree AT xuemingtang anefficientadaptiveanticollisionalgorithmbasedon4arypruningquerytree AT guohuacui anefficientadaptiveanticollisionalgorithmbasedon4arypruningquerytree AT longkaiwu anefficientadaptiveanticollisionalgorithmbasedon4arypruningquerytree AT yingmei anefficientadaptiveanticollisionalgorithmbasedon4arypruningquerytree AT weizhang efficientadaptiveanticollisionalgorithmbasedon4arypruningquerytree AT yajunguo efficientadaptiveanticollisionalgorithmbasedon4arypruningquerytree AT xuemingtang efficientadaptiveanticollisionalgorithmbasedon4arypruningquerytree AT guohuacui efficientadaptiveanticollisionalgorithmbasedon4arypruningquerytree AT longkaiwu efficientadaptiveanticollisionalgorithmbasedon4arypruningquerytree AT yingmei efficientadaptiveanticollisionalgorithmbasedon4arypruningquerytree |