Advanced Search
Volume 31 Issue 6
Jun.  2009
Turn off MathJax
Article Contents
Ding Zhi-guo, Guo Li, Zhu Xue-yong, Wang Zhao-hua. An Adaptive Anti-collision Algorithm Based on Binary-Tree Disassembly[J]. Journal of Electronics & Information Technology, 2009, 31(6): 1395-1399. doi: 10.3724/SP.J.1146.2008.00836
Citation: Ding Zhi-guo, Guo Li, Zhu Xue-yong, Wang Zhao-hua. An Adaptive Anti-collision Algorithm Based on Binary-Tree Disassembly[J]. Journal of Electronics & Information Technology, 2009, 31(6): 1395-1399. doi: 10.3724/SP.J.1146.2008.00836

An Adaptive Anti-collision Algorithm Based on Binary-Tree Disassembly

doi: 10.3724/SP.J.1146.2008.00836
  • Received Date: 2008-07-02
  • Rev Recd Date: 2008-12-08
  • Publish Date: 2009-06-19
  • A new adaptive anti-collision algorithm based on binary-tree disassembly is proposed in this paper. In order to enhance the search efficiency, a big and complex binary-tree is disassembled to several small and simple binary-trees by estimating the distributing of tags. The introduction of the collision stack, as well as adjusting the search paths adaptively based on the state of slots, the performance of the new algorithm is improved further, including reducing the search timeslots and improving the throughput of timeslots. Theory and computer simulations show that the new anti-collision algorithm is practical, especially when the number of tags is large.
  • loading
  • Finkenzeller K. RFID Handbook: Fundamentals andApplications in Contactless Smart Cards and Identification.John Wiley Sons. 2003.[2]Hwang Tae-Wook, Lee Byong-Gyo, and Kim Young-Soo.Improved anti-collision scheme for high speed identificationin RFID system. First International Conference onInnovative Computing, Information and Control, Beijing,China, 2006, Vol.2: 449-452.[3]Cha Jae-Ryong and Kim Jae-Hyun. Novel anti-collisionalgorithms for fast object identification in RFID system.,11th International Conference on Parallel and DistributedSystems Workshops, Fukuoka, Japan, 2005, Vol.2: 63-67.[4]Myung Jihoon, Lee Wonjun, and Srivastava J. Adaptivebinary splitting for efficient RFID tag anti-collision. IEEECommunications Letters, 2006, 10(3): 144-146.[5]Lai Yuan-Cheng and Lin Chih-Chung. A pair-resolutionblocking algorithm on adaptive binary splitting for RFID tagidentification[J].IEEE Communications Letters.2008, 12(6):432-434[6]Myung Jihoon and Lee Wonjun. Adaptive binary splitting: aRFID tag collision arbitration protocol for tag identification.2nd International Conference on Broadband Networks,Boston, United States, 2005, Vol.1: 347-355.[7]Myung J, Lee W, and Shih T. An adaptive memorylessprotocol for RFID tag collision arbitration[J].IEEE Trans. onMultimedia.2006, 8(5):1096-1101[8]杜海涛, 徐昆良等. 基于返回式树形搜索的反碰撞算法. 云南大学学报, 2006, 28(Sl): 133-136.Du Hai-tao and Xu Kun-liang, et al.. An anti-collisionalgorithm based on binary-tree Searching of backtracking.Journal of Yunnan University, 2006, 28(Sl): 133-136.[9]余松森, 詹宜巨等. 基于后退索引的二进制树形搜索反碰撞算法及其实现. 计算机工程与应用, 2004, 26(16): 26-28.Yu Song-sen and Zhang Yi-ju, et al.. An anti-collisionalgorithm based on binary-tree searching of regressive indexand its practice. Computer Engineering and Application, 2004,26(16): 26-28.
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (3452) PDF downloads(973) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return