通信学报 ›› 2013, Vol. 34 ›› Issue (8): 10-17.doi: 10.3969/j.issn.1000-436x.2013.08.002

• 学术论文 • 上一篇    下一篇

基于可离散处理的RFID防碰撞混杂算法研究

李平1,2,孙利民2,吴佳英1,方庆1,谢晋阳1,周博翔1   

  1. 1 长沙理工大学 计算机与通信工程学院,湖南 长沙 410114
    2 中国科学院 信息工程研究所 信息安全国家重点实验室,北京100093
  • 出版日期:2013-08-25 发布日期:2017-08-31
  • 基金资助:
    国家自然科学基金资助项目;国家重大科技专项基金资助项目;国家重点基础研究发展计划(“973”计划)基金资助项目

Research on RFID anti-collision hybrid algorithm based on discrete processing

Ping LI1,2,Li-min SUN2,Jia-ying WU1,Qing FANG1,Jin-yang XIE1,Bo-xiang ZHOU1   

  1. 1 School of Computer and Telecommunications,Changsha University of Science and Technology,Changsha 410114,China
    2 State Key Laboratory of Information Security,Institute of Information Engineering,Chinese Academy of Sciences,Beijing 100093,China
  • Online:2013-08-25 Published:2017-08-31
  • Supported by:
    The National Natural Science Foundation of China;The National Science and Technology Major Project;The National Basic Research Program of China(973 Program)

摘要:

针对一类二叉树搜索算法存在寻呼次数过高的应用局限,采用二叉树查询和离散处理相结合的方法,提出了RFID防碰撞混杂算法。理论分析表明,与以往算法不同,该算法实质上是对满足可离散处理特征的模式而非个体的标签进行二叉树搜索。算法充分考虑了阅读器寻呼次数、寻呼开销、吞吐率等重要的性能指标。仿真结果验证了该算法在寻呼次数、吞吐率等性能指标上有明显的提升。

关键词: RFID, 标签识别, 离散处理, 碰撞位序列

Abstract:

A kind of binary tree search algorithms have distinct application limitations such as high number of requests in case that a fairly large number of tags are available.A hybrid anti-collision algorithm was proposed,combining binary tree search with discrete processing.Theoretic analysis show that,different from available schemes,the algorithm essentially performs binary tree search not on a single tag,but on models which identify the property of discrete procession.The proposed algorithm fully takes the time of request into account,as well as power consumption and throughput of the system.Simulation result verifies that the algorithm achieves much better performances such as the time of request and throughput than the previous algorithms.

Key words: RFID, tag recognition, discrete processing, collision sequence

No Suggested Reading articles found!