摘要
在标签运动较规律的无线射频识别(RFID,Radio Frequency Identification)系统中,读写器按照一般的算法不会优先读取即将离开可读范围的标签,而使系统出现较高的漏读率.针对这种场景,提出一种新的防碰撞算法——先到先服务(FCFS,First Come FirstServed)算法.读写器首先按照到达顺序对标签进行分组,先识别紧迫性高的时间分组标签;其次,算法通过新增一个参数有效避免了一些可预测的碰撞时隙.在识别时间分组的过程中设置了总时隙的上限,从而避免系统阻塞.仿真结果表明,在保持漏读率小于0.01的情况下,系统所能承受的标签运动速度比前缀随机化算法提高了50%.当标签到达率为0.45时,系统的通过率改善最明显,比前缀随机化算法提高了13%左右.
In some radio frequency identification （RFID） systems, there are lots of tags can not be identified when tags come into and get out of the scope of the reader in a regular way, for the readers with a gener- al algorithm do not give priority to read the leaving tags. A novel anti-collision algorithm was designed for this situation, which was called the first come first served （FCFS） algorithm. The reader grouped the tags by the order of arrival, and identified them according to the urgency of the time group. Secondly, algorithm avoided the predictable collision by setting a parameter. Thirdly, the reader set the upper value of the slots for every time group. The simulation result shows that keeping the leaking proportion less than 0.01, the arrival rate of tags which the system can bear increases by 50% and when the arrival rate of tags is 0.45, the throughput increases by 13% , compared to the prefix-randomized query-tree algorithm.
出处
《北京航空航天大学学报》
EI
CAS
CSCD
北大核心
2008年第3期276-279,共4页
Journal of Beijing University of Aeronautics and Astronautics
关键词
无线射频识别
多标签防碰撞算法
先到先服务算法
时间分组
RFID （ radio frequency identification）
anti-collision algorithm
FCFS （ first come firstserved） algorithm
time group
