Bi⁃direction segmented anti⁃collision algorithm based on query tree

被引：0
|
作者：
Zhao H.-W. [1 ,2 ]
Zhang Z.-J. [1 ]
Li J. [3 ]
Zhang Y. [1 ]
Hu H.-S. [4 ]
Zang X.-B. [1 ]
机构：
[1] College of Computer Science and Technology, Jilin University, Changchun
[2] Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun
[3] Library, Jilin University, Changchun
[4] School of Computer Science and Engineering, Changchun University of Technology, Changchun
来源：
Li, Jiao (lijiao@jlu.edu.cn) | 1830年 / Editorial Board of Jilin University卷 / 51期
关键词：
Anti-collision algorithm; Bi-direction; Computer application technology; Pre identification; Radio frequency identification;
D O I：
10.13229/j.cnki.jdxbgxb20200808
中图分类号：
学科分类号：
摘要：
Focusing on the problem of the low system efficiency caused by multi-tags collision of RFID system, this paper proposes an anti-collision algorithm based on query tree, intended to reduce system energy consumption and improve communication efficiency. The method divides the tags into two groups and segments the IDs so that the tags respectively respond to the prefix and suffix in the query command and only transmit the partial ID sequence of the query segment according to the state code. Compared with the traditional query tree algorithm, the algorithm significantly reduces the transmission of bits useless for identification, eliminates idle time slots, and improves system throughput. Theoretical analysis and simulation results show that the proposed algorithm performs better than the existing query tree anti-collision algorithm and helps to design an efficient RFID identification system. © 2021, Jilin University Press. All right reserved.
引用
收藏
页码：1830 / 1837
页数：7
相关论文
共 18 条
  • [1] HuangKai -feng, LiuWei -chao, LiLi, Mutual-authentication scheme based on Hash function and elliptic curve cryptography, Journal of Jilin University(Science Edition), 55, 2, pp. 340-344, (2017)
  • [2] HuHuang -shui, WangHong -zhi, Et al., An RFID anti-collision algorithm based on equal area division, Journal of Jilin University(Science Edition), 58, 1, pp. 120-126, (2020)
  • [3] Liu L, Lai S., ALOHA-based anti-collision algorithms used in RFID system, International Conference on Wireless Communications, Networking and Mobile Computing, pp. 1-4, (2006)
  • [4] Vogt H., Efficient object identification with passive RFID tags, International Conference on Pervasive Computing, pp. 98-113, (2002)
  • [5] Lee S R, Joo S D, Lee C W., An enhanced dynamic framed slotted ALOHA algorithm for RFID tag identification, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, pp. 166-172, (2005)
  • [6] Law C, Lee K, Siu K Y., Efficient memoryless protocol for tag identification, Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 75-84, (2000)
  • [7] Finkenzeller K., RFID Handbook: Fundamentals and Applications in Contactless Smart Cards, Radio Frequency Identification and Near-Field Communication, (2010)
  • [8] Su J, Wen G, Hong D., A new RFID anti-collision algorithm based on the Q-ary search scheme, Chinese Journal of Electronics, 24, 4, pp. 679-683, (2015)
  • [9] Landaluce H, Perallos A, Angulo I., Managing the number of tag bits transmitted in a bit-tracking RFID collision resolution protocol, Sensors, 14, 1, pp. 1010-1027, (2014)
  • [10] JiaQing -xuan, GaoXin, Et al., Highly efficient RFID adaptive tracking tree anti-collision algorithm, Journal of Jilin University(Engineering and Technology Edition), 45, 4, pp. 1225-1233, (2015)
12