Abstract
This paper studies the hybrid query tree algorithm, which uses the combined information of the largest and smallest collision bits to classify the markers. The labels are placed in four matrices to reduce collisions. The function analysis shows that the algorithm is better than QT and HQT by reducing the number of queries and system communication frequency. Thereby greatly improving the efficiency of label recognition.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cheng W, Zhao M, Xu J, et al (2007) Improved ALOHA algorithm for RFID dynamic frame time slots. J Huazhong Univ Sci Technol Nat Sci Ed 35(6):14–16
Ryu J, Lee H, Seok Y et al (2007) A hybrid query tree protocol for tag collision arbitration in RFID system. In: Proceedings of the IEEE international conference on communications. Glasgow: IEEE, 11(12), pp 5981–5986
SCHOUTEFS (1983) Dynamic frame length ALOHA. IEEE Trans Commun Lett 31(4):565–568
Acknowledgements
This study is supported by the National Natural Science Foundation of China (No: 61572174), the Science and Technology Plan Project of the Hunan Province (No: 2016TP1020) and Hunan natural science foundation project (2017JJ4012).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Deng, Hw., Li, L. & Liang, XM. Study on optimization of anti-collision algorithm for mixed query tree. J Ambient Intell Human Comput (2018). https://doi.org/10.1007/s12652-018-1010-1
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s12652-018-1010-1