期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Multi-branch query tree protocol for solving RFID tag collision problem 被引量:3
1
作者 JIAO Chuan-hai WANG Ke-ren 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2008年第4期51-54,共4页
The technology of anti-collision is a key point in radio frequency identification (RFID) system. To avoid data collision, there are two approaches: ALOHA based algorithm and binary tree (BT) based algorithm. Howe... The technology of anti-collision is a key point in radio frequency identification (RFID) system. To avoid data collision, there are two approaches: ALOHA based algorithm and binary tree (BT) based algorithm. However, these cannot solve the collision problem completely, especially when the tag quantity is big and the tag ID is long. In this article, we present a multi-branch query tree (MBQT) protocol based on balanced incomplete block design (BIBD) code, and use 16-bit vectors derived from the BIBD as query prefix symbols of RFID reader. Compared with the conventional anti-collision algorithm, the theoretic analysis and simulation show that the proposed protocol improves the identification efficiency. 展开更多
关键词 RFID BIBD mbqt
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部