Query tree based tag identification method in RFID systems
    1.
    发明公开
    Query tree based tag identification method in RFID systems 有权
    RFID系统中的Abfragenbaumbasiertes Tagidentifikationsverfahren

    公开(公告)号:EP1914660A1

    公开(公告)日:2008-04-23

    申请号:EP06026586.5

    申请日:2006-12-21

    IPC分类号: G06K7/00

    CPC分类号: G06K7/0008 G06K7/10049

    摘要: A query tree based tag identification method in RFID systems includes: (a) forming a temporary ID for each of the tags; (b) comparing an inquiry of the reader with a portion of the temporary ID in each tag when receiving the inquiry from the reader; (c) if the inquiry and the portion of the temporary ID are identical to each other, transmitting a remainder of the temporary ID in each tag to the reader; (d) if a collision occurs in the step (c), generating new inquiries for storing them in the reader; (e) if there is no collision in the step (c), transmitting an ACK signal to each tag whose temporary ID is identified to receive its real tag ID therefrom; and (f) repeating the steps (b) to (e) until there is no inquiry in the reader.

    摘要翻译: RFID系统中基于查询树的标签识别方法包括:(a)形成每个标签的临时ID; (b)当接收到读者的询问时,将读者的查询与​​每个标签中的临时ID的一部分进行比较; (c)如果查询和临时ID的部分相同,则将每个标签中的临时ID的剩余部分发送给读者; (d)如果在步骤(c)中发生冲突,产生新的查询以将其存储在读者中; (e)如果步骤(c)中没有冲突,则将ACK信号发送到其临时ID被识别以从其接收其真实标签ID的每个标签; 和(f)重复步骤(b)至(e),直到读者没有询问。

    Bi-slot tree based tag identification method in RFID systems
    4.
    发明公开
    Bi-slot tree based tag identification method in RFID systems 有权
    RFID系统中的双槽 - Baumbasiertes Tagidentifikationsverfahren

    公开(公告)号:EP1914659A1

    公开(公告)日:2008-04-23

    申请号:EP06026585.7

    申请日:2006-12-21

    IPC分类号: G06K7/00

    CPC分类号: G06K7/0008 G06K7/10049

    摘要: A bi-slot tree based tag identification method in RFID systems includes (a) transmitting an inquiry of (n-1) bits to each tag at the reader; (b) deciding whether the inquiry of (n-1) bits are identical with first (n-1) bits of each tag ID when receiving the inquiry of (n-1) bits at each tag within a readable range of the reader; (c) transmitting each tag ID by one bit from (n+1) th bit to last bit thereof to the reader through different time slots based on n th bit value of each tag ID at the tags whose first (n-1) bits are identical with the inquiry of (n-1) bits; and (d) at the reader, checking whether there is a collision among the tag IDs received from the tags and identifying each tag ID of the tags based on the check result.

    摘要翻译: RFID系统中基于双槽树的标签识别方法包括:(a)在读取器处向每个标签发送(n-1)比特的查询; (b)在读取器的可读范围内接收到每个标签上的(n-1)比特的查询时,决定(n-1)比特的查询是否与每个标签ID的第一(n-1)比特相同; (c)基于第一(n-1)比特的标签的每个标签ID的第n个比特值,通过不同的时隙将(n + 1)比特的每个标签ID从第(n + 1)比特发送给读取器 与(n-1)位的查询相同; 以及(d)在读取器处,检查从标签接收到的标签ID之间是否存在冲突,并且基于检查结果识别标签的每个标签ID。