首页 | 本学科首页   官方微博 | 高级检索  
     

RFID中基于二分叠加的二进制防碰撞算法
引用本文:何晓桃, 郑文丰. RFID中基于二分叠加的二进制防碰撞算法[J]. 华南师范大学学报(自然科学版), 2011, (3).
作者姓名:何晓桃  郑文丰
作者单位:1.1.广东工业大学计算机学院,广东广州 510006;
基金项目:广东省自然科学基金项目(7005833); 广东省教育厅优秀青年创新人才培养计划项目(LYM10064)
摘    要:提出了基于二分叠加的二进制搜索树防碰撞算法.对标签生成随机数的过程进行优化,标签每次生成随机数(0,1)的概率都相同,经过二次叠加后分布的概率就不完全相同,可从源头上降低碰撞概率,提高信道利用率.仿真结果表明,基于二分叠加的二进制搜索树防碰撞算法能减少碰撞次数,提高信道利用率.

关 键 词:射频识别  防碰撞  二进制搜索树算法  二分叠加
收稿时间:2011-03-02
修稿时间:2011-05-15

A BINARY ANTI-COLLISION ALGORITHM BASED ON SUM OF TWICE IN RFID SYSTEM
A BINARY ANTI-COLLISION ALGORITHM BASED ON SUM OF TWICE IN RFID SYSTEM[J]. Journal of South China Normal University (Natural Science Edition), 2011, (3).
Authors:HE Xiaotao  ZHEND Wenfeng
Affiliation:HE Xiaotao1,ZHEND Wenfeng2(1.Faculty of Computer,Guangdong University of Technology,Guangzhou 510006,China,2.Center for Public Education & Information of Guangdong Province,Guangzhou 510040,China)
Abstract:In order to improve the existing problems of large collision numbers and weak collision performance of the traditional binary collision algorithm,a binary anti-collision algorithm based on sum of twice is proposed.The random generation process of the new algorithm is optimized,which has different distribution probability through the sum of twice,although every random number(0,1) is the same.The new algorithm can obtain less collision times and higher channel utilization.
Keywords:RFID  anti-collision  binary tree algorithm  sum of twice  
本文献已被 CNKI 等数据库收录!
点击此处可从《华南师范大学学报(自然科学版)》浏览原始摘要信息
点击此处可从《华南师范大学学报(自然科学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号