A multi-tag anti-collision protocol based on 8-ary adaptive pruning query tree
In order to solve the problem of multi-tag anti-collision in radio frequency identification systems, a multi-tag anti-collision protocol based on 8-ary adaptive pruning query tree is proposed in this article. According to Manchester code, the highest collision bit can be detected. In the process of...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-11-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147718811823 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In order to solve the problem of multi-tag anti-collision in radio frequency identification systems, a multi-tag anti-collision protocol based on 8-ary adaptive pruning query tree is proposed in this article. According to Manchester code, the highest collision bit can be detected. In the process of tag identification, the protocol only locks the target on the three consecutive bits which start from the highest collision bit. The protocol has two tag identification mechanisms, and which one is chosen is determined by the value of collision coefficient. Using the collision information characteristics of the three bits, idle timeslots are evitable, and some collision timeslots are eliminated at the same time. The 8-ary adaptive pruning query tree protocol fully takes into account several important performance indicators such as the number of query timeslots, communication complexity, transmission delay, and throughput. Both theoretical analysis and simulation results show that this protocol performs better than other tree-based anti-collision protocols. The throughput of 8-ary adaptive pruning query tree protocol remains approximately 0.625. |
|---|---|
| ISSN: | 1550-1477 |