Abstract

In order to reduce the identification delay and the energy consumption of the Query Tree Anti-collision Algorithm, the disadvantage of the current query tree anti-collision algorithms is analyzed and an improved query tree anti-collision algorithm is proposed, which is called collision Location based Hybrid Query Tree (LHQT) algorithm. In the algorithm, Manchester code is used and collision location is detected when a collision occurs. Then collision location is used to update quickly and accurately the query prefix in Query Tree (QT) algorithm and Hybrid Query Tree (HQT) Algorithm. Theoretical analysis and simulation show that the proposed algorithm can efficiently decrease the identification cycles and transmitted bits, which reduce the identification delay and the energy consumption.

Keywords:

Anti-collision algorithm, collision location, query tree,

References

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.