摘要
标签冲突是射频识别(RFID)技术的常见问题。解决此问题的反碰撞算法有ALOHA算法、分隙ALOHA算法。这些算法同时对大量标签操作时,效率较低。本算法依据阅读器作用区域内,有限个标签的EPC代码构成的二进制树存在许多空闲结点,搜索时忽略空闲结点,可以高效地识别所有标签。随后采用树的先序遍历思想予以实现,最终算法模拟表明:该算法对大量标签操作时效率稳定在46.22%附近。
Tag collision is a common problem in RFID. There are several anti-collision algorithms to solve this problem, such as ALOHA, Slotted ALOHA and so on. But, they are often low-efficient when processing a lot of tags at the same time. In the reader＇s processing area, these are a lot of idle nodes in the binary-tree that are composed of a limited number of tags＇ EPC. If the reader ignores them when searching, all tags can be identified with high efficiency. This algorithm can be put into practice based on the pre-order traversing idea of threaded tree. Finally, algorithm simulation indicates that its efficiency is stabilized at 46.22% when processing large numbers of tags.
出处
《计算机工程》
CAS
CSCD
北大核心
2005年第16期217-218,230,共3页
Computer Engineering
基金
广州市重点科技攻关资助项目(2002Z3-D0151)
江西省教育厅资助项目(赣教计字[2005]30)
关键词
修剪枝
二进制树
反碰撞
标签冲突
RFID
先序遍历
Pruning away branches
Binary-tree
Anti-collision
Tags collision
RFID
Pre-order traversing
