ISSN 1000-1239 CN 11-1777/TP

计算机研究与发展 ›› 2015, Vol. 52 ›› Issue (12): 2725-2735.doi: 10.7544/issn1000-1239.2015.20140560

• 网络技术 • 上一篇    下一篇

一种基于关联ID的防碰撞新方法

张德干,宋孝东,郑可,梁彦嫔   

  1. (计算机视觉与系统省部共建教育部重点实验室(天津理工大学) 天津 300384) (智能计算及软件新技术天津市重点实验室(天津理工大学) 天津 300384) (天津理工大学计算机与通信工程学院 天津 300384) (gandegande@126.com)
  • 出版日期: 2015-12-01
  • 基金资助: 
    国家自然科学基金项目(61571328,61202169);教育部新世纪优秀人才支持计划基金项目(NCET-09- 0895);天津市自然科学基金重点项目(13JCZDJC34600);国家留学基金资助出国留学项目(201308120010);天津市科技创新团队基金项目(TD12-5016)

A Kind of New Anti-Collision Approach Based on AID

Zhang Degan, Song Xiaodong, Zheng Ke, Liang Yanpin   

  1. (Key Laboratory of Computer Vision and System (Tianjin University of Technology), Ministry of Education, Tianjin 300384) (Tianjin Key Laboratory of Intelligent Computing & Novel Software Technology (Tianjin University of Technology), Tianjin 300384) (School of Computer and Communication Engineering, Tianjin University of Technology, Tianjin 300384)
  • Online: 2015-12-01

摘要: 射频识别(radio frequency identification, RFID)是物联网需要研究的关键技术之一.基于对RFID技术的研究,提出了一种基于关联ID的防碰撞新方法.有记忆标签和无记忆标签在防碰撞算法上的主要区别在于二者实现的机理有所不同.针对有记忆的标签,该方法增加标签之间的关联关系,使标签在一定的触发条件下可以主动发送自己的ID.该方法不同于无记忆的标签.由于父子标签间存在关联关系,将该方法应用于基于多叉搜索树的确定性防碰撞情况中,其优势是单次通信可以同时识别多个标签,极大地提高了识别效率;将该方法应用于不确定性的ALOHA防碰撞情况中,读写器可以依据脉冲的位置判断出空时隙的位置,从而避免由于(在读取时隙时)读取空时隙而造成的效率下降问题.由于该方法不受ID的长度限制,通过大量的实验表明,该方法在多种应用过程中能够大幅降低碰撞的概率,能够提高系统的识别效率.

关键词: 物联网, 关联, 记忆, 冲突, 身份, 效率

Abstract: The RFID technology is one of the key technologies of the Internet of things which need to be studied. Based on our researches of the RFID technologies, a kind of new anti-collision approach based on AID (associated ID) has been put forward in this paper. As we know, the realization mechanism of anti-collision approach is between the tags with the memory and the memory-less tags. We propose a method to build the association between tags with memory, so that tags in a certain trigger condition can take the initiative to send their own ID.Tags use modulated binary pulse to send data to the reader. This approach is different from that with the memory-less tags. Because there exists association relationship between father-tag and son-tag, when it is applied to the multi-tree searching method that we have proposed, the advantage of this method is that a single communication can identify multiple tags at one time, which has greatly improved the identification efficiency. When the approach is applied to the uncertainty ALOHA algorithm, the reader can decide the location of the empty slots based on the position of the binary pulse, so the working reader can avoid the efficiency decreasing problem caused by reading empty slots. Due to no limit of ID length, experimental results of our simulations show that this approach can greatly decrease the probability of collision and improve the identification efficiency of the system during many kinds of its applications.

Key words: Internet of things (IOT), association, memory, conflict, identification, efficiency

中图分类号: