基于图论的射频识别阅读器防碰撞算法

发布时间：2018-03-27 20:37

本文选题：射频识别　切入点：阅读器　出处：《计算机应用》2017年08期

【摘要】：射频识别(RFID)系统的运行往往需要多个阅读器,以保证覆盖整个目标区域。在密集的阅读器的环境中,由于阅读器之间存在相互干扰,会影响整个RFID系统的工作效率,降低识别效率。针对上述问题,提出一种新的基于图论的阅读器防碰撞算法。首先把阅读器网络看成简单图,以时隙对阅读器分组,同时隙阅读器为一组,相邻阅读器分配不同的时隙,以解决阅读器因读取范围交叉重叠而引起的干扰;同时考虑组内阅读器的频率干扰问题,同样以频率对组内阅读器再分组,同频率阅读器为一组,相邻阅读器分配不同频率,以解决因干扰范围过大而引起的频率碰撞问题;然后根据分组信息,中央服务器通过配置命令将时隙和频率资源调度分配给每个阅读器;最后通过时序命令控制每组阅读器的工作顺序。仿真结果显示,相比邻近友好型防碰撞(NFRA)算法,该算法平均工作效率提升了6.5个百分点;阅读器数量为1 000时系统工作效率提升了9.5个百分点。新算法能优化给定时间内工作阅读器的数量,减少闲置等待的阅读器数量。
[Abstract]:Radio frequency identification (RFID) system often needs multiple readers to cover the whole target area. In the dense reader environment, the efficiency of the whole RFID system will be affected because of the interference between the readers. To reduce the recognition efficiency, a new anti-collision algorithm for readers based on graph theory is proposed. Firstly, the reader network is regarded as a simple graph. The adjacent readers allocate different time slots to solve the interference caused by the overlapping of the reading range. At the same time, considering the frequency interference of the readers in the group, the same frequency is used to regroup the readers in the group, the same frequency reader is a group of readers. The adjacent reader allocates different frequencies to solve the frequency collision problem caused by the excessive interference range; then, according to the packet information, the central server dispatches time slots and frequency resources to each reader by configuring commands. Finally, the working order of each group of readers is controlled by sequential commands. The simulation results show that compared with the adjacent friendly anti-collision NFRAalgorithm, the average efficiency of the algorithm is increased by 6.5 percentage points. When the number of readers is 1,000, the efficiency of the system increases by 9.5 percentage points. The new algorithm can optimize the number of working readers in a given time and reduce the number of idle waiting readers.
【作者单位】：北京信息科技大学信息与通信工程学院;
【基金】：国家自然科学基金资助项目(61340005) 北京市自然科学基金面上项目(4132012) 北京市教委科技发展计划项目(KM201411232011)~~
【分类号】：O157.5;TP391.44

【参考文献】