WO2009065311A1 - Procédé d'arbre binaire destiné au procédé d'anti-collision d'étiquettes multiples - Google Patents

Procédé d'arbre binaire destiné au procédé d'anti-collision d'étiquettes multiples Download PDF

Info

Publication number
WO2009065311A1
WO2009065311A1 PCT/CN2008/071623 CN2008071623W WO2009065311A1 WO 2009065311 A1 WO2009065311 A1 WO 2009065311A1 CN 2008071623 W CN2008071623 W CN 2008071623W WO 2009065311 A1 WO2009065311 A1 WO 2009065311A1
Authority
WO
WIPO (PCT)
Prior art keywords
tag
time slot
label
reader
counter value
Prior art date
Application number
PCT/CN2008/071623
Other languages
English (en)
Chinese (zh)
Inventor
Huan ZHOU
Hongai Jiao
Jian Zhang
Original Assignee
Zte Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zte Corporation filed Critical Zte Corporation
Priority to US12/742,715 priority Critical patent/US8310343B2/en
Priority to EP08773174.1A priority patent/EP2230625B1/fr
Publication of WO2009065311A1 publication Critical patent/WO2009065311A1/fr

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
    • G06K7/0008—General problems related to the reading of electronic memory record carriers, independent of its reading method, e.g. power transfer
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
    • G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
    • G06K7/10009—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves
    • G06K7/10019—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers.
    • G06K7/10029—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers. the collision being resolved in the time domain, e.g. using binary tree search or RFID responses allocated to a random time slot
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
    • G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
    • G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
    • G06K7/10009—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves
    • G06K7/10019—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers.
    • G06K7/10029—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers. the collision being resolved in the time domain, e.g. using binary tree search or RFID responses allocated to a random time slot
    • G06K7/10039—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers. the collision being resolved in the time domain, e.g. using binary tree search or RFID responses allocated to a random time slot interrogator driven, i.e. synchronous
    • G06K7/10049—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers. the collision being resolved in the time domain, e.g. using binary tree search or RFID responses allocated to a random time slot interrogator driven, i.e. synchronous binary tree

Definitions

  • the present invention relates to the field of wireless communications, and more particularly to radio frequency identification (RFID) multi-tag anti-collision methods.
  • RFID radio frequency identification
  • the (binary tree) algorithm solves collisions.
  • ALOHA The basic feature of ALOHA is that the system divides the channel replied by the tag into time intervals (the interval is called a time slot) and requires the tag to select one of the replies.
  • the reader gives each tag a transmission probability (or range of optional time slots) by instruction, the tag is randomly selected and replied on time; if a collision occurs, it is reselected and sent or reselected in subsequent time slots. Or send until all tags are connected to the reader.
  • each tag has a random number generator that generates 0 or 1; each tag has a counter, and when the counter has a value of 0, the tag replies.
  • the operation method is shown in Figure 1. The reader sends an instruction to start replying all the tags.
  • the tag After receiving the command, the tag first generates 0 or 1 by the random number generator, so that the tag to be replied is divided into two subsets (the random number is 0 and 1); A tag with a random number of 0 responds immediately, a tag with a random number of 1 sets the counter value to 1; if there is no collision and the reply is successful, the reader sends an instruction acknowledgement and decrements the other tag counter values by one; If no information is returned, the reader sends an instruction to confirm that all tag counters are decremented by one until the reader receives the return information of the tag; if the tag collides, the reader sends an instruction to cause the collision tag to generate a random number for splitting, and other tag counter values Add 1; cycle this way until all tags have successfully replied.
  • the reader makes all the collisions
  • the collision tag generates a random number; if no information is returned in the second time slot, it indicates that the random number generated by the collision tag of the previous time slot is 1.
  • 18000-6 TypeB's solution is to decrement all tags by 1.
  • the third time slot is also a collision, because the first time slot is the collision tag, and the time slot is still 0 tag; then the fourth time slot
  • the reader sends an instruction to regenerate the random number for all collision tags. It can be seen that the acknowledgement instruction of the third time slot decrements all the tag counters by one, which wastes the counting process of one time slot.
  • the technical problem to be solved by the present invention is to provide a multi-tag anti-collision binary tree method, which solves the problem of wasting time slots when multi-tag inventory is performed by Binary Tree in the prior art, and improves the tag inventory efficiency.
  • a multi-tag anti-collision binary tree method comprising: in the process of label inventory, if the reader does not receive the tag reply information in a predetermined time slot, and one of the following conditions is met, The reader sends a re-split instruction to the tag, and enters the next time slot to receive: the reader receives a tag reply message in a time slot error or sends a re-split command in the last time slot;
  • the counter value is not 1, the counter value remains unchanged, and the label with the counter value of 1 is split into two subsets, and the counter value of the label in one subset remains unchanged.
  • the counter value of the label in the other subset is decremented by 1, and then the label with the counter value of 0 replies to the reader.
  • the reader sends a successful confirmation command to the label, and proceeds to the next time slot to receive: The reader does not receive the label reply information or correctly receives the label reply information in a time slot of the reader;
  • the tag When the tag receives the success confirmation command, the label of the correct reply message leaves the inventory process, and the tag counter value of the incorrect reply message is decremented by 1, and then the tag with the counter value of 0 is returned to the reader.
  • the device sends a successful confirmation command to the label, and proceeds to receive the next time slot;
  • the label of the correct reply information leaves the inventory process,
  • the tag counter value of the correct reply message is decremented by 1, and then the tag with a counter value of 0 replies to the reader. Further, in the process of label enumeration, if the reader erroneously receives the tag reply information on the specified time slot, the device sends a failure confirmation command to the tag, and proceeds to receive the next time slot;
  • the counter value is not 0, the counter value is incremented by 1; the counter with the counter value of 0 is split into two subsets, and the counter value of the label in one subset remains unchanged, the other The counter value of the label in the subset is incremented by 1, and then the label with the counter value of 0 is replied to the reader.
  • a random number generator is started, a value of 1 is generated for a label of one subset, a value of 0 is generated for a label of another subset, and a counter of a label having a value of 0 is decremented by one. The value of the counter that generates a value of 1 remains unchanged.
  • a random number generator is started, a value of 1 is generated for a label of one subset, a value of 0 is generated for a label of another subset, and a counter value of a label having a value of 0 is maintained. The value of the counter with a value of 1 is incremented by one.
  • the reader does not receive the label reply information on the specified time slot, and the last time slot sends a re-split instruction
  • the number of consecutively sent re-split commands is N, and if N ⁇ n, the reader goes to the label.
  • n value is 2.
  • the present invention provides a multi-label anti-collision binary tree method, which optimizes Binary
  • FIG. 1 is a flow chart of interaction between a reader and a tag according to the existing ISO 18000-6 multi-tag access
  • FIG. 2 is a flow chart of interaction between a reader and a tag during multi-label inventory in the embodiment of the present invention
  • FIG. 3 is a second embodiment of the present invention
  • FIG. 4 is a schematic diagram of comparison between ISO 18000-6 and an application example of the present invention.
  • Fig. 5 is a schematic view showing the comparison between ISO 18000-6 and the application example 2 of the present invention.
  • the present invention provides a multi-tag anti-collision binary tree method, including: during a tag inventory process, if a reader does not receive tag reply information on a specified time slot and one of the following conditions is met, the reader sends a re-send to the tag. Splitting instruction, entering the next time slot connection: the reader receives a tag reply message in a time slot error or sends a re-split command in a previous time slot;
  • the counter value is not 1, the counter value remains unchanged, and the tag with the counter value of 1 is split into two subsets, and the counter value of the tag in one subset remains unchanged, and the other sub-
  • the counter value of the centralized tag is decremented by 1, and then the tag with a counter value of 0 replies to the reader.
  • a subset is an empty set.
  • the reader sends an instruction to start counting the tag and receives the signal from the tag on the specified time slot.
  • the reader sends a selection instruction, and all the tags are matched after the selection instruction is received, and the label that satisfies the condition enters the inventory process.
  • Step S4 after receiving the instruction to start the inventory, the tag initializes its own information, the counter is set to 0, and the tag information is sent to the reader.
  • Step S5 the reader receives the tag reply information, and is divided into the following cases:
  • step S5a if the reader correctly receives the reply message of the tag within the specified time slot, the reader sends a successful confirmation command to the tag, and proceeds to the next time slot reception, and proceeds to step S6a;
  • step S5b if the reader erroneously receives the tag reply information in the specified time slot, that is, the tag replies with a collision, the reader sends a failure confirmation command to the tag, and proceeds to the next time slot reception, and proceeds to step S6b;
  • step S5c if the reader does not receive the tag reply information on the specified time slot, there are three alternative embodiments, which are respectively described below.
  • the reader sends a successful confirmation command to the tag, and proceeds to step S6a. ; enter the next time slot to receive;
  • the reader sends a re-split command to the tag, and proceeds to step S6c. ; enter the next time slot to receive;
  • step S6a if the reader continuously sends the re-split command twice, and the reception into the next time slot is still empty, the reader sends a success confirmation command to the tag, so that all tag counters in the system are decremented by one, and the next time slot is received and transferred. Proceed to step S6a.
  • Step S6a when the label receives the success confirmation command, the label is correctly sent to the reader, and the label is successfully confirmed to leave the access process, and no longer responds to the access-related instruction, and the label of the information is not correctly sent (ie, the counter value is not The label of 0), the counter is decremented by 1, and the process proceeds to step S7;
  • Step S6b when the label receives the failure confirmation command, the counter value is not 0, the counter value is incremented by 1; the label with the counter value of 0 is split, the random number generator is started, and all the labels generated by 1 are incremented by 1; Generate a label of 0, the counter value remains unchanged (the counter value is 0), and proceeds to step S7;
  • Step S6c when the tag receives the re-split instruction, the counter value is not the label of 1, and the counter value remains unchanged.
  • a tag with a counter value of 1 starts the random number generator. All the tags generated 1 keep the counter value unchanged; all the tags generated as 0, the counter value is decremented by 1 (becomes 0), and the tag information is immediately returned, and the process proceeds to step S7;
  • step S7 the tag with the counter value of 0 returns the message, and the process proceeds to step S4.
  • the main innovations of the present invention compared to the method of ISO 18000-6 are:
  • the reader receives the error message, and then sends a failure confirmation command, causing the collision tag to regenerate the random number to continue splitting.
  • the tag can generate a random number for re-splitting through two time slots, and in the present invention, the tag is re-splitted only after one time slot.
  • the reader when the reception is empty and the last time slot is sent as a resplit instruction, the reader sends a resplit instruction to the tag, so that the tag with the tag end counter is again split again.
  • the re-split command can be sent continuously.
  • the maximum number of consecutive transmissions n can be specified by the system or the user.
  • the reader sends the re-split command twice at most. If the next slot still receives null, the reader sends the label successfully.
  • the acknowledgment command decrements all tag count values in the RF range and enters the next time slot for reception.
  • FIG. 4 is an application example 1 of the present invention, and an inventory process of five tags is given, wherein the left half is an inventory process of ISO18000-6, and the right half is an inventory process of the present invention.
  • a schematic diagram of a first embodiment of the embodiment of the present invention that is, when the current time slot reception is empty and the previous time slot receives error information, the reader sends a re-split instruction to the tag, and the tag directly splits.
  • Time slot the counter is decremented by 1 to be 0011; (5) time slot, collision, generating random number, is 1122;
  • time slot, no reply, counter minus 1 is 0011;
  • Time slot the counter is decremented by 1, which is 011;
  • Time slot, counter minus 1 is 0011;
  • Time slot, counter minus 1, is 011;
  • Time slot 0 replies successfully, counter is decremented by 1, and is 00;
  • Fig. 5 is a second application example of the present invention, showing an inventory process of five tags, wherein the left half is the inventory process of ISO18000-6, and the right half is the inventory process of the present invention.
  • a schematic diagram of a second implementation manner of the embodiment of the present invention that is, when the current time slot is received and the previous time slot receives the error information or the re-split instruction is sent, the reader sends a re-split instruction to the label, and the label is directly performed.
  • a brief description of the ISO 18000-6 inventory process is:
  • Time slot, counter minus 1 is 0011;
  • time slot, no reply, counter minus 1 is 0011;
  • time slot, no reply, counter minus 1 is 0011;
  • Time slot, counter minus 1 is 0011;
  • Time slot the counter is decremented by 1, which is 011;
  • the state of the time slot (6) is obtained, and then the tag information is transmitted, colliding, and the state of the time slot (7) is obtained; and by the improvement of the present invention, the re-splitting instruction is sent directly by (5) to (7), that is, In the right half of Figure 4, (5) and (6) save one time slot.
  • the present invention is an effective improvement to the Binary Tree.
  • the anti-collision method of the invention can reduce the number of tag replies, improve the access efficiency of multi-tags, and is simple to operate, and increases the reliability of tag access.
  • the multi-label anti-collision method for radio frequency identification provided by the invention optimizes the inventory process of Binary Tree, improves the inventory efficiency, saves the inventory time, and makes the whole process more reasonable.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • Toxicology (AREA)
  • Artificial Intelligence (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Electromagnetism (AREA)
  • General Health & Medical Sciences (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

La présente invention concerne un procédé d'anti-collision d'étiquettes multiples utilisant un arbre binaire pour une identification de fréquence radio, qui comprend : pendant l'inventaire des étiquettes, le lecteur envoie aux étiquettes l'instruction de fractionner de nouveau si le lecteur n'a pas reçu d'informations de retour de la part des étiquettes à un intervalle de temps défini et que le lecteur a soit reçu des informations d'étiquette incorrectes au dernier intervalle de temps soit envoyé des instructions de fractionner de nouveau au dernier intervalle de temps; les étiquettes recevant les instructions de fractionner de nouveau et les compteurs d'étiquettes ayant un décompte non égal à 1 conservent leur décompte; les étiquettes ayant un décompte de 1 sont divisées en deux sous-ensembles, les étiquettes dans un sous-ensemble conservent leur décompte et les étiquettes dans un autre sous-ensemble font décrémenter leur compteur, et par la suite les étiquettes ayant un décompte de 0 répondent au lecteur. Le procédé améliore le procédé d'arbre binaire pour l'inventaire d'étiquettes, améliore l'efficacité de l'inventaire, économise du temps et ajuste le flux en conséquence.
PCT/CN2008/071623 2007-11-20 2008-07-11 Procédé d'arbre binaire destiné au procédé d'anti-collision d'étiquettes multiples WO2009065311A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US12/742,715 US8310343B2 (en) 2007-11-20 2008-07-11 Binary tree method for multi-tag anti-collision
EP08773174.1A EP2230625B1 (fr) 2007-11-20 2008-07-11 Procédé d'arbre binaire destiné au procédé d'anti-collision d'étiquettes multiples

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200710187353.7A CN101441699B (zh) 2007-11-20 2007-11-20 一种用于射频识别的多标签防碰撞方法
CN200710187353.7 2007-11-20

Publications (1)

Publication Number Publication Date
WO2009065311A1 true WO2009065311A1 (fr) 2009-05-28

Family

ID=40667119

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2008/071623 WO2009065311A1 (fr) 2007-11-20 2008-07-11 Procédé d'arbre binaire destiné au procédé d'anti-collision d'étiquettes multiples

Country Status (4)

Country Link
US (1) US8310343B2 (fr)
EP (1) EP2230625B1 (fr)
CN (1) CN101441699B (fr)
WO (1) WO2009065311A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102024134A (zh) * 2010-10-27 2011-04-20 北京邮电大学 一种高效rfid多标签防碰撞识别方法
CN109241802A (zh) * 2018-09-25 2019-01-18 西南科技大学 一种用于移动rfid系统的多标签识别方法
US10668248B2 (en) 2004-11-04 2020-06-02 Covidien Ag Catheter insertion apparatus

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101923625A (zh) * 2009-06-12 2010-12-22 中兴通讯股份有限公司 一种标签防碰撞的方法及系统
CN102043934B (zh) * 2009-10-12 2014-12-10 中兴通讯股份有限公司 射频识别系统及其工作方法
CN102722685B (zh) * 2011-03-29 2014-12-31 中兴通讯股份有限公司 一种实现多标签识别的方法及装置
KR101307491B1 (ko) * 2011-10-18 2013-09-11 성균관대학교산학협력단 Ｒｆｉｄ 태그 이동성을 고려한 충돌 방지 시스템 및 방법
CN105095807B (zh) * 2014-05-22 2018-02-23 北京邮电大学 基于卡间通信机制的射频识别传感器网络防碰撞系统及算法
CN104200182B (zh) * 2014-08-25 2017-03-15 重庆邮电大学 一种基于二进制分裂树的标签防碰撞方法
CN104268494A (zh) * 2014-10-20 2015-01-07 浪潮电子信息产业股份有限公司 一种基于二叉树的rfid防碰撞算法
CN106650538B (zh) * 2016-12-28 2019-03-26 北京安拓思科技有限责任公司 一种rfid阅读器防碰撞方法及系统

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060076401A1 (en) * 2004-10-12 2006-04-13 Aristocrat Technologies Australia Pty, Ltd. Method and apparatus for synchronization of proximate RFID readers in a gaming environment
JP2007067791A (ja) * 2005-08-31 2007-03-15 Fujitsu Ltd 情報アクセス・システム、およびアクティブ型非接触情報記憶装置用の読取り書込み装置
CN1980076A (zh) * 2005-11-30 2007-06-13 华为技术有限公司 一种射频识别的方法及装置
CN101069193A (zh) * 2005-09-30 2007-11-07 Sk电信有限公司 在rfid系统中使用自适应二元树分离技术来识别标签的方法及应用该方法的rfid系统
CN101136053A (zh) * 2006-10-11 2008-03-05 中兴通讯股份有限公司 一种用于射频识别的多标签防碰撞方法
CN101145180A (zh) * 2006-10-10 2008-03-19 中兴通讯股份有限公司 一种用于射频识别的多标签防碰撞方法

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6072801A (en) * 1998-02-19 2000-06-06 Micron Technology, Inc. Method of addressing messages, method of establishing wireless communications, and communications system
US6727803B2 (en) * 2001-03-16 2004-04-27 E-Tag Systems, Inc. Method and apparatus for efficiently querying and identifying multiple items on a communication channel
US7486172B2 (en) * 2003-08-07 2009-02-03 Intermec Ip Corp. Enhanced identification protocol for RFID systems
EP1697875B1 (fr) * 2003-12-19 2009-07-01 Nxp B.V. Synchronisation en anti-collision
DE102004041437B3 (de) * 2004-08-27 2006-03-09 Atmel Germany Gmbh Verfahren zur Auswahl eines oder mehrerer Transponder
US20070001812A1 (en) * 2005-06-30 2007-01-04 Symbol Technologies, Inc. Systems and methods for optimizing communications between an RFID reader and a tag population using partial binary tree traversal
CN1897011A (zh) * 2005-07-14 2007-01-17 中国科学院半导体研究所 步进时隙脉冲检测防冲突方法及其电路
KR100845666B1 (ko) * 2006-10-19 2008-07-10 한국정보통신대학교 산학협력단 Ｒｆｉｄ 시스템에서의 두 슬롯 트리 기반의 태그 인식 방법
CN100461202C (zh) * 2006-11-07 2009-02-11 中兴通讯股份有限公司 EPC Gen2标准中标签清点流程的改进方法及装置

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060076401A1 (en) * 2004-10-12 2006-04-13 Aristocrat Technologies Australia Pty, Ltd. Method and apparatus for synchronization of proximate RFID readers in a gaming environment
JP2007067791A (ja) * 2005-08-31 2007-03-15 Fujitsu Ltd 情報アクセス・システム、およびアクティブ型非接触情報記憶装置用の読取り書込み装置
CN101069193A (zh) * 2005-09-30 2007-11-07 Sk电信有限公司 在rfid系统中使用自适应二元树分离技术来识别标签的方法及应用该方法的rfid系统
CN1980076A (zh) * 2005-11-30 2007-06-13 华为技术有限公司 一种射频识别的方法及装置
CN101145180A (zh) * 2006-10-10 2008-03-19 中兴通讯股份有限公司 一种用于射频识别的多标签防碰撞方法
CN101136053A (zh) * 2006-10-11 2008-03-05 中兴通讯股份有限公司 一种用于射频识别的多标签防碰撞方法

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
"Information Technology-Radio Frequency Identification (RFID) for Item Management -Part 6:Parameters for Air Interface Communications at 860-960 MHz, ANSI", ISO/IEC, ISO/IEC CD 18000-6, 4 May 2002 (2002-05-04), pages 85, XP000962942 *
WANG, HONGJV: "RFID System Design and Rearch of the Anti- collision Algorithm", MASTER DEGREE DISSERTATION OF NORTHWESTERN POLYTECCHNICAL UNIVERSITY, 31 March 2007 (2007-03-31), pages 19 - 29, XP008169120 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10668248B2 (en) 2004-11-04 2020-06-02 Covidien Ag Catheter insertion apparatus
CN102024134A (zh) * 2010-10-27 2011-04-20 北京邮电大学 一种高效rfid多标签防碰撞识别方法
CN109241802A (zh) * 2018-09-25 2019-01-18 西南科技大学 一种用于移动rfid系统的多标签识别方法
CN109241802B (zh) * 2018-09-25 2021-08-27 西南科技大学 一种用于移动rfid系统的多标签识别方法

Also Published As

Publication number Publication date
EP2230625A1 (fr) 2010-09-22
US20100271185A1 (en) 2010-10-28
CN101441699B (zh) 2011-08-10
CN101441699A (zh) 2009-05-27
US8310343B2 (en) 2012-11-13
EP2230625B1 (fr) 2018-12-12
EP2230625A4 (fr) 2015-01-07

Similar Documents

Publication Publication Date Title
WO2009065311A1 (fr) Procédé d'arbre binaire destiné au procédé d'anti-collision d'étiquettes multiples
US8207856B2 (en) Systems and methods for RFID tag arbitration where RFID tags generate multiple random numbers for different arbitration sessions
US8134452B2 (en) Methods and systems of receiving data payload of RFID tags
US8653947B2 (en) Radio frequency identification system and tag counting ending method for anti-collision thereof
EP2431908B1 (fr) Procédé et système anti-collision d'étiquettes
CN108229230B (zh) 用于提供关于射频标签的识别和访问的方法
US20120126952A1 (en) Communication Method in RFID or Remote Sensor Systems
CN108229229B (zh) 用于提供关于射频标签的识别和访问的方法
CN101145180A (zh) 一种用于射频识别的多标签防碰撞方法
WO2009059506A1 (fr) Procédé permettant d'éviter la collision d'étiquettes rfid dans un système rfid
US8963690B2 (en) Identification system
US9785803B2 (en) Method, apparatus and system for collecting tags using bit map in RFID system
CN102156846B (zh) 用于射频识别的阅读器与标签的信息传输方法及装置
CN101470791B (zh) 射频信号的识别、应答方法及系统,标签和阅读器
CN102332083B (zh) 用于射频识别的阅读器与标签的信息传输方法及装置
CN101136053A (zh) 一种用于射频识别的多标签防碰撞方法
CN100535921C (zh) 一种用于射频识别的多标签防碰撞方法
WO2011020278A1 (fr) Procédé et système pour compter les étiquettes dans un système d'identification par radiofréquence
CN101136054A (zh) 一种用于射频识别的多标签防碰撞方法
JP2009044648A (ja) Ｒｆｉｄタグ用リーダ
Luan et al. A simple novel idle slot prediction and avoidance scheme using prediction bits for dfsa in rfid
WO2008037140A1 (fr) Procédé d'accès multi-étiquette pour la reconnaissance rf
CN101136056A (zh) 一种用于射频识别的多标签防碰撞方法
CN101136055A (zh) 一种用于射频识别的多标签防碰撞方法
CN117933277A (zh) 一种标签盘存方法、装置、节点和存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08773174

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 12742715

Country of ref document: US

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2008773174

Country of ref document: EP