检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]电子工程学院,合肥230037
出 处:《火力与指挥控制》2013年第9期104-107,共4页Fire Control & Command Control
摘 要:提出了一种基于LS码的码分多址时隙ALOHA防碰撞算法(CDMA-LS-SALOHA),来解决射频识别中常用防碰撞算法识别标签速度慢、吞吐量低的问题。首先分析了算法的设计思想,然后构造了算法的数学模型并对算法性能进行了理论推导,最后进行了仿真实验和比较分析。结果表明,CDMA-LS-SALOHA算法的系统吞吐量明显优于时隙ALOHA算法、动态帧时隙ALOHA算法和二进制树搜索算法。In order to solve the problem that tags can't be identified quickly and the throughput is low in the common anti-collision algorithm for the RFID system.A novel Code Division Multiple Access Slotted ALOHA anti-collision algorithm based on loosely synchronized code (CDMA-LS-SALOHA) is presented. Firstly,the paper analyzes the design ideas of the algorithm,and then,a mathmatical model is constructed and the theoretical derivation of the algorithm is given,making simulation and comparative analysis finally. The results show that the system throughput of CDMA-IS-SALOHA algorithm is significantly better than the Slotted ALOHA algorithm,Danymic Frame Slotted ALOHA algorithm and binary-tree search algorithm.
关 键 词:射频识别 码分多址 时隙ALOHA 防碰撞 LS码
分 类 号:TP301.6[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43