Bit arbitration query tree anti-collision algorithm based on grouping mechanism

Yu FU; hong QIANZhi; Chao CHENG; hui LIUXiao

doi:10.11959/j.issn.1000-436x.2016014

您当前的位置：

首页 >

文章列表页 >

Bit arbitration query tree anti-collision algorithm based on grouping mechanism

Academic paper | 更新时间：2024-06-05

- Bit arbitration query tree anti-collision algorithm based on grouping mechanism
- Journal on Communications Vol. 37, Issue 1, Pages: 123-129(2016)
- 作者机构：
  
  1. 吉林大学通信工程学院，吉林长春 130012
  2. 长春工业大学计算机科学与工程学院，吉林长春 130012
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(61371092);Research Project of Science and Technology Department of Jilin Province(20140204019GX)
- DOI：10.11959/j.issn.1000-436x.2016014
  CLC： TN92
- Online First：2016-01，
  
  Published：25 January 2016
- 稿件说明：
移动端阅览
Yu FU, hong QIANZhi, Chao CHENG, et al. Bit arbitration query tree anti-collision algorithm based on grouping mechanism[J]. Journal on Communications, 2016, 37(1): 123-129.
DOI：

Yu FU, hong QIANZhi, Chao CHENG, et al. Bit arbitration query tree anti-collision algorithm based on grouping mechanism[J]. Journal on Communications, 2016, 37(1): 123-129. DOI： 10.11959/j.issn.1000-436x.2016014.

摘要

提出了一种基于分组机制的位仲裁查询树(GBAQT

bit arbitration query tree based on grouping mechanism)算法。该算法根据标签ID自身特征分组，采用3位仲裁位来取代传统1位仲裁识别标签的方式，通过碰撞位信息得到传输数据，从而能避免一些空闲时隙。算法的性能分析和仿真结果表明，GBAQT 防碰撞算法具有较少的总时隙数，系统效率和时隙利用率也明显优于其他算法。

Abstract

A bit arbitration query tree anti-collision algorithm based on grouping mechanism was proposed. GBAQT divided tags into two groups according to the tag ID's feature and used three arbitration bits to identify tags instead of using one bit in traditional methods. The reader can obtain the transmit data based on information of collision bits and thus avoid some idle timeslots. The algorithm performance analysis and simulation resu show that GBAQT anti-collision algorithm has fewer total number of timeslots. Timeslot utilization and system efficiency of GBAQT algorithm are significantly better than the other algorithms.

关键词

Keywords

references

BLETSAS A , KIMIONIS J , DIMITRIOUS A G , et al . Single-antenna coherent detection of collided FM0 RFID signals [J ] . IEEE Transac-tions on Communications , 2012 , 60 ( 3 ): 756 - 766 .

HSU C H , CHAO H C , PARK J H . Threshold jumping and wrap-around scan techniques toward efficient tag identification in high density RFID systems [J ] . Information Systems Frontiers , 2011 , 13 ( 4 ): 471 - 480 .

李萌 , 钱志鸿 , 张旭，等．基于时隙预测的 RFID 防碰撞 ALOHA算法 [J ] . 通信学报 2012 , 32 ( 12 ): 43 - 50 .

LI M , QIAN Z H , ZHANG X , et al . Slot-predicting based ALOHA algorithm for RFID anti-collision [J ] . Journal on Communications , 2012 , 32 ( 12 ): 43 - 50 .

ZANELLA A . Adaptive batch resolution algorithm with deferred feedback for wireless systems [J ] . IEEE Transactions on Wireless Communications , 2012 , 11 ( 10 ): 3528 - 3539 .

ZHU L , YUM T P . Optimal framed Aloha based anti-collision algo-rithms for RFID systems [J ] . IEEE Transactions on Commu ications , 2010 , 58 ( 12 ): 3583 - 3592 .

JIANG Y , ZHANG R N . An adaptive combination query tree protocol for tag identification in RFID systems [J ] . IEEE Communications Let-ters , 2012 , 16 ( 8 ): 1192 - 1195 .

YANG C N , HU L J , LAI J B . Query tree algorithm for RFID tag with binary-coded decimal EPC [J ] . I IEEE Communications Letters , 2010 , 16 ( 10 ): 1616 - 1619 .

LAW C , LEE K , SIU K Y . Efficient memory-less protocol for tag identification [C ] // The 4th International Workshop on Discrete Algo-rithms and Methods for Mobile Computing and CommunicationsBos-ton . c 2000 : 75 - 84 .

HUSH D R , WOOD C . Analysis of tree algorithms for RFID arbitra-tion [C ] // IEEE International Symposium on Information Theory. Cam-bridge , c 1998 : 107 .

JIA X L , FENG Q Y , YU L S . Stability analysis of an ef icient an-ti-collision protocol for RFID tag identification [J ] . IEEE Transactions on Communications , 2012 , 60 ( 8 ): 2285 - 2294 .

LIU X H , QIAN Z H , ZHAO Y H , et al . An adaptive tag anti-collision protocol in RFID wireless systems [J ] . China Communications , 2014 , 11 ( 7 ): 117 - 127 .

GAO J , WANG J , HE J , et al . QSA: query splitting-based anticollision for mobile RFID-based internet-of-things [J ] . International Journal of Distributed Sensor Networks , 2013 ,DOI:10.1155/2013/674698..

CHEN Y H , HORNG S J , RUN R S , et al . A novel anti-collision algorithm in RFID systems for identifying passive tags IEEE Transactions on Industrial Informatics . 2012 , 6 ( 1 ): 105 - 121 .

ZHANG W , GUO Y J , TANG X M , et al . An efficient adaptive anti-collision algorithm based on 4-ary pruning query tree . International Journal of Distributed Sensor Networks , 2013 , 14 ( 2 ): 135 - 143 .

Views

1392

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Capture-aware bit-detecting M-ary tree protocol for RFID tag identification

Improved tree structure anti-collision algorithm of RFID

Passive UHF tag collision resolution on PHY layer

CATPE protocol with capture effect for RFID tag anti-collision

Information monitor method of RFID system based on logarithm spectrum RF fingerprint identification

Related Author

Daishu YUAN

Yong WANG

Lei LEI

Mingqiu FAN

Lijuan ZHANG

Xue WANG

Zhi-hong QIAN

Xiao-hui LIU

Related Institution

Zhongxing Telecommunication Equipment Corporation

School of Physical Science and Technology, Southwest Jiaotong University

College of Electronic Information Engineering, University of Aeronautics and Astronautics

School of Communication Engineering,University of Jilin

School of Electrical and Information Technology,Yunnan University of Nationalities

AI问答

⁰