期刊文献+

多维编码逐维识别RFID防碰撞算法 被引量:1

RFID Anti-collision Algorithms Based on Multi-Dimension Code and Gradual-Dimension Identification
下载PDF
导出
摘要 提出了多维编码逐维识别(Multi-dimension code and gradual-dimension identification,MDC-GDI)防碰撞算法,多维编码在每维中有且只有1个1。发生碰撞时,由于多维编码的特点,系统自动识别每维的碰撞数据,并逐个呼叫碰撞编码,完成对阅读器内所有标签的呼叫。分析算法表明,该算法在阅读器范围内标签较多时,在呼叫次数和呼叫所传输数据量方面具有较大的改善。随着标签碰撞的增多,呼叫每个标签的平均次数趋近4/3,呼叫所传输的数据趋近8位,因此更适用于无线射频识别(Radio frequency identification,RFID)防碰撞协议。 The multi-dimension code and gradual-dimension identification (MDC-GDI) algo- rithm is proposed. There is only one "1" in each dimension code of MDC. The reader can rec- ognize the collided MDC according to the characteristics of MDC while collision happening, and it returns to other collided MDC gradually to recognize all the tags. When the collided tags be- come more and more, the time searching for tags decrease by using the MDC-GDI algorithm as well as the data tranfered between reader and tags. With the increase of collided tags, the AVG times searching for one tag approach to 4/3, which is a limit, and the data between reader and tag tend to be 8 bit. So, the algorithms is suitable for radio frequency identification (RFID) anti-collision protocol.
出处 《数据采集与处理》 CSCD 北大核心 2013年第3期319-323,共5页 Journal of Data Acquisition and Processing
基金 江苏省行业专项基金(20110230)资助项目
关键词 无线射频识别 逐维识别 多维编码 防碰撞 radio frequency identification(RFID) gradual-dimension identification multi-dimension code anti-collision
  • 相关文献

参考文献13

二级参考文献71

共引文献182

同被引文献13

  • 1侯晓波,孙玲玲,钱忺.RFID二进制防碰撞算法研究与改进[J].杭州电子科技大学学报(自然科学版),2009,29(3):16-19. 被引量:5
  • 2Finkenzeller K. RFID Handbook: Fundamentals and Applications in Contactless Smart Cards and Identification[M]. 2nd Edition. New Jersey: John Wiley b- Sons Limited, 2003.
  • 3Bonuccellim A, Lonettif, Martellif. Tree Slotted Aloha: a New Protocol for Tag Identification in RFID Networks [C] // Proceedings of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks. Piscataway: IEEE, 2006: 603-608.
  • 4Wang C C, Derryberry J, Sleator D D. O(log log n) Competitive Dynamic Binary Search Trees [C] //Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm. New York: ACM, 2006, 374-383.
  • 5Choi J S, Lee H, Engels D W. Robust and Dynamic Bin Slotted Anti-collision Algorithms in RFID Systems [C]// Proceedings of IEEE International Conference on RFID. Piscataway: IEEE, 2008: 191-198.
  • 6Eom J, Lee T. Accurate Tag Estimation for Dynamic Framed-slotted ALOHA in RFID Systems [J]. IEEE Communications Letters, 2010, 14(1): 60-62.
  • 7王必胜,张其善.可并行识别的超高频RFID系统防碰撞性能研究[J].通信学报,2009,30(6):108-113. 被引量:25
  • 8李泽兰,何怡刚,刘拓晟.基于广义地址码的RFID防碰撞算法[J].计算机测量与控制,2010,18(5):1114-1117. 被引量:10
  • 9王雪,钱志鸿,胡正超,李奕男.基于二叉树的RFID防碰撞算法的研究[J].通信学报,2010,31(6):49-57. 被引量:117
  • 10杨坤,冷甦鹏.RFID系统时隙不完全竞争防碰撞算法[J].计算机工程,2011,37(1):260-262. 被引量:8

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部