Study on optimization of anti-collision algorithm for mixed query tree

被引：0
|
作者：
Deng H.-W. [1 ]
Li L. [2 ]
Liang X.-M. [2 ]
机构：
[1] College of Information Engineering, Hengyang Normal University, Hengyang
[2] College of Computer Science and Technology, Hengyang Normal University, Hengyang
来源：
Journal of Ambient Intelligence and Humanized Computing | 2024年 / 15卷 / Suppl 1期
关键词：
Anti-collision algorithm; Highest bit of collision; Hybrid query tree algorithm; Lowest bit of collision;
D O I：
10.1007/s12652-018-1010-1
中图分类号：
学科分类号：
摘要：
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. © 2018, Springer-Verlag GmbH Germany, part of Springer Nature.
引用
收藏
页码：19 / 19
相关论文
共 50 条
  • [21] A novel RFID anti-collision algorithm based on binary tree
    College of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, Henan, China
    1600, Academy Publisher (08):
  • [22] Mixed frame anti-collision algorithm based on binary tree and frame time slot ALOHA
    Liang, Shi-Li
    Xu, Mei-Ling
    Lin, Qing
    Gong, Shan
    Zhao, Xing-Bo
    Guangxue Jingmi Gongcheng/Optics and Precision Engineering, 2014, 22 (09): : 2580 - 2584
  • [23] Improved dynamic slots collision tracking tree for RFID anti-collision algorithm
    Department of Electronic and Communication Engineering, Sun Yat-Sen University, Guangzhou
    Guangdong
    510006, China
    Tien Tzu Hsueh Pao, 8 (1465-1470):
  • [24] An enhanced binary tree-based anti-collision algorithm
    Wang, Chun-Hua
    Liu, Chi-Shi
    Xu, Hao
    Tu, Yu-Xiang
    Hunan Daxue Xuebao/Journal of Hunan University Natural Sciences, 2013, 40 (08): : 97 - 101
  • [25] An anti-collision algorithm in RFID based on B+ TREE
    Luo, Juan
    Wang, Yun-Fei
    Li, Ren-Fa
    Ling, Lin
    Hunan Daxue Xuebao/Journal of Hunan University Natural Sciences, 2009, 36 (06): : 72 - 75
  • [26] Pre-split anti-collision binary tree algorithm
    Cui, Yinghua
    Zhao, Yuping
    Wang, Huiyang
    Zhou, Jinhe
    ADVANCES IN MANUFACTURING TECHNOLOGY, PTS 1-4, 2012, 220-223 : 2403 - +
  • [27] An Effective 16-bit Random Number Aided Query Tree Algorithm for RFID Tag Anti-Collision
    Yang, Ching-Nung
    He, Jyun-Yan
    IEEE COMMUNICATIONS LETTERS, 2011, 15 (05) : 539 - 541
  • [28] An Enhanced Query Tree (EQT) Protocol for Memoryless Tag Anti-Collision in RFID Systems
    Hsu, Ching-Hsien
    Yu, Chia-Hao
    Huang, Yi-Pin
    Ha, Kyung-Jae
    FGCN: PROCEEDINGS OF THE 2008 SECOND INTERNATIONAL CONFERENCE ON FUTURE GENERATION COMMUNICATION AND NETWORKING, VOLS 1 AND 2, 2008, : 425 - +
  • [29] Heuristic Query Tree Protocol: Use of Known Tags for RFID Tag Anti-Collision
    Sung, Jongwoo
    Kim, Daeyoung
    Kim, Taehong
    Choi, Jinhyuk
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2012, E95B (02) : 603 - 606
  • [30] A Dynamic Multi-ary Query Tree Protocol for Passive RFID Anti-collision
    Li, Gang
    Sun, Haoyang
    Li, Zhenbing
    Wu, Peiqi
    Inserra, Daniele
    Su, Jian
    Fang, Xiaochuan
    Wen, Guangjun
    CMC-COMPUTERS MATERIALS & CONTINUA, 2022, 72 (03): : 4931 - 4944
12345