计算机应用 ›› 2012, Vol. 32 ›› Issue (12): 3490-3493.DOI: 10.3724/SP.J.1087.2012.03490

• 网络与通信 • 上一篇    下一篇

基于优先级分组的防碰撞算法

张从力,彭璇,杨磊   

  1. 重庆大学 自动化学院,重庆 400030
  • 收稿日期:2012-06-22 修回日期:2012-08-09 发布日期:2012-12-29 出版日期:2012-12-01
  • 通讯作者: 彭璇
  • 作者简介:张从力(1960-),男,重庆人,教授,主要研究方向:检测与自动化、煤矿安全、智能交通;〓彭璇(1989-),女,江西宜春人,硕士研究生,主要研究方向:射频识别、数字语音信号处理与传输;〓杨磊(1988-),男(侗族),贵州凯里人,硕士研究生,主要研究方向:矿井无线通信。
  • 基金资助:
    中央高校基本科研业务费科研专项研究生科技创新基金资助项目

Anti-collision algorithm based on priority grouping

ZHANG Cong-li,PENG Xuan,YANG Lei   

  1. School of Automation, Chongqing University, Chongqing 400044, China
  • Received:2012-06-22 Revised:2012-08-09 Online:2012-12-29 Published:2012-12-01
  • Contact: PENG Xuan

摘要: 针对在标签数量较多、运动较快的场合,常存在识别效率低且标签漏读率高的问题,提出一种先分组再处理的防碰撞算法——PAJS。该算法按照到达顺序对标签进行分组,以减小漏读率;根据标签识别过程中时隙状况自适应调整帧长度,提高算法的搜索效率;采用跳跃式动态搜索算法处理冲突时隙,从而减少搜索次数和系统传输量。Matlab仿真结果表明,该算法通信复杂度明显小于其他常用算法,吞吐率可达0.59~0.6。在待识别标签较多的场合,该算法优越性更加明显。

关键词: 射频识别, 防碰撞, 优先级分组, 自适应动态帧调整, 跳跃式动态树形识别

Abstract: Concerning the problems of low recognition efficiency and high misreading rate on the occasions of many tags which move fast, an anti-collision algorithm based on packet-first then handling-second was proposed. The algorithm reduced the misreading rate by to grouping the tags according to the order of arriving, it could adaptively adjust frame length based on slot situation to improve the search efficiency, and use jumping dynamic searching algorithm to deal with conflict slots, which could reduce the number of search for readers and the transmission of system. Matlab simulation results show that the algorithm’s communication complexity is lower than other commonly used algorithms, and throughput can achieve 0.59~0.6. The larger the number of tags is the more obvious superiority of the algorithm is.

Key words: Radio frequency identification, tag collision, priority packet, adaptive dynamic frame adjustment, jumping dynamic searching