CN102024163A - Anti-collision method with packet previewing mechanism - Google Patents
Anti-collision method with packet previewing mechanism Download PDFInfo
- Publication number
- CN102024163A CN102024163A CN 201010567397 CN201010567397A CN102024163A CN 102024163 A CN102024163 A CN 102024163A CN 201010567397 CN201010567397 CN 201010567397 CN 201010567397 A CN201010567397 A CN 201010567397A CN 102024163 A CN102024163 A CN 102024163A
- Authority
- CN
- China
- Prior art keywords
- time slot
- label
- write line
- read write
- order
- Prior art date
- Legal status (The legal status 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 status listed.)
- Granted
Links
Images
Abstract
The invention provides an anti-collision method with a packet previewing mechanism, which is applied to an RFID (Radio Frequency Identification) system. The anti-collision method comprises the following steps of: 1 initializing; 2 starting and querying; 3 previewing packets; 4 detecting a timeslot; 5 reading the timeslot; 6 judging whether an aggregate Q is a null set or not; and 7 regulating range parameters of the timeslot. By the technical solution, the invention can solve the problem of collision of communication between a single reader and a plurality of labels, effectively reduce the time summation of timeslot detection, and improve the reading efficiency of the plurality of labels of the system under the interference environment.
Description
Technical field
The invention belongs to the radio-frequency (RF) identification communication technical field, be specifically related to a kind of collision-proof method of radio-frequency recognition system, relate in particular to a kind of collision-proof method that has the preview mechanism of dividing into groups.
Background technology
(Radio Frequency Identification, RFID) communication technology is a kind of non-contact automatic identification technology to radio-frequency (RF) identification.In radio-frequency recognition system, a read write line communicates by radiofrequency signal and some labels, and obtains the identifying information of storing on each label.
Radio-frequency recognition system with the common issue with that other typical radio-frequency (RF) communication system are faced is: need to solve the collision problem of communicating by letter simultaneously between a plurality of equipment in same system.For radio-frequency recognition system, then need to solve the collision problem of communicating by letter between single read write line and a plurality of labels.And the factor that is limited to cost and power consumption, label are merely able to provide extremely limited function to be used to realize anticollision mechanism, and the collision-proof method of present many labels mainly is divided into timeslot-based randomization method and based on the Deterministic Methods two big classes of binary tree.
The timeslot-based randomness collision-proof method of Ti Chuing is commonly referred to basic Aloha method at first, this method solves the communication collision problem in the following way, label is after entering the perform region of read write line, circulation at once sends response signal, the time interval between adjacent two secondary responses is by the label picked at random, the read write line decoding is from the response signal of different labels, and the label data that is not clashed.
First kind of improved Aloha method is for postponing the Aloha method, on the basis of basic Aloha method, increased the startup command of read write line, label is after receiving this startup command, just carry out subsequent operation according to basic Aloha method, this method has mainly solved the problem that many mobile tags enter the perform region simultaneously.
Second kind of improved Aloha method is time slot A loha method, on the basis of basic Aloha method, the continuous time is partitioned into a plurality of discrete time slots, label is merely able to send response in the interval of certain time slot, and can not cross over the border of time slot, this method has reduced half with the collision phase of label response.
The third improved Aloha method is a frame slot Aloha method, on the basis of time slot A loha method, a plurality of time slots is formed a frame, and label selects a time slot to send response in a certain frame at random, and this method has reduced the data volume that read write line sends.
The 4th kind of improved Aloha method is dynamic frame time slot A loha method, on the basis of frame slot Aloha method, increased the mechanism of dynamically adjusting frame length according to the number of labels of estimating, and this method can effectively improve the efficient of frame slot Aloha method.
The widest super high frequency RF recognition protocol of range of application is EPC UHF Class 1 Gen 2 at present, be also referred to as ISO 18000-6 Type C, the collision-proof method that adopts in this agreement belongs to time slot A loha method, specific as follows: read write line sends an inquiry (Query) order and specifies optional time slot scope, all labels are after receiving this order, in the scope of appointment, obtain a time slot value at random, and be kept in the time slot counter.Read write line sends one and repeats inquiry (QueryRep) order, open first time slot and detect, judge that according to the random number response of whether receiving label what do not have response is idle time slot, have single response for taking time slot, have a plurality of responses for the collision time slot.If for taking time slot, read write line sends one again and reads time slot (ACK) order, reads the tag identification number of current time slots, if be idle time slot or collision time slot, read write line continues to send the repetition querying command, opens next time slot and detects.
Simultaneously, in the collision-proof method that above-mentioned agreement adopts, label is after being kept at the time slot value in the time slot counter, whenever receive that is repeated a querying command, then the count value of time slot counter subtracts one, when being zero, count value sends the random number response, if an ensuing order, then sends the identifier response of label for reading the time slot order.
Though the mode of this method by before reading time slot, detecting, saved and read idle time slot and collision time slots, but detect owing to only open single time slot at every turn, detect the time slots summation in actual applications often much larger than reading time slots.
Summary of the invention
The objective of the invention is, the deficiency at existing time slot A loha method exists provides a kind of time slot A loha method that has the preview mechanism of dividing into groups, and effectively reduces and detects time slots summation, the reading efficiency of raising system many labels under interference environment.
Technical scheme of the present invention is that a kind of collision-proof method that has the preview mechanism of dividing into groups is applied to radio-frequency recognition system, it is characterized in that comprising the steps:
Step 1: initialization operation.
Read write line sends initialization command.
The sign of checking that all labels receive after this order separately is set to not check.
Read write line is provided with the initial value of following parameter: time slot range parameter M and grouping serial number parameter P.Wherein, M chooses between 0 to 15 according to the number of labels of estimating, makes 2
MBetween 1 times to 4 times of number of labels; P=0.
Step 2: start inquiry.
Read write line sends a startup querying command that comprises time slot range parameter M.
Check and be masked as the label of having checked and do not respond this order.Check and be masked as the label do not checked after receiving this order, produce one less than 2
MRandom number as the time slot value of label.
Step 3: grouping preview.
Read write line sends a grouping preview command that comprises grouping serial number parameter P, and what specify current preview is the P grouping.
Check be masked as do not check and the time slot value after the label between [4*P, 4*P+3] is receiving this order, send length and be 16 time slot index response, other label does not respond this order.
The time slot value is the label of 4*P+j, and the 4*j position of the time slot index response of transmission is one 4 random number to the 4*j+3 position, and all the other positions all are 0, wherein integer j ∈ [0,3].4 random number adopts the coding rule with collision position detectability to encode for example Manchester's cde; All the other adopt nonreturn to zero code to encode.
Step 4: time slot detects.
After read write line received the time slot index response of label, response was judged to the time slot index:
If the time slot index that receives response all is low level from the 4*i position to the 4*i+3 position, wherein i=0,1,2 or 3 then is labeled as idle time slot with time slot 4*P+i.
If the response that receives includes high level from the 4*i position to the 4*i+3 position, judge further then whether the response from the 4*i position to the 4*i+3 position meets coding rule, if meet, then time slot 4*P+i is labeled as and takies time slot; If do not meet, then time slot 4*P+i is labeled as the collision time slot.
Read write line is added up idle time slot, is taken the quantity of time slot and collision time slot, is designated as C respectively
P, 0, C
P, 1And C
P, 2All take time slot time slot corresponding value and form set Q, that is: if time slot x is for taking time slot, and x ∈ Q then.
If set Q is an empty set, jump to step 7.
Step 5: read time slot.
From set Q, appoint and get a time slot value, be designated as k, simultaneously this time slot value is deleted from set Q.
Read write line sends and reads the time slot order, reads the time slot order and comprises minislot parameter k.
Check and be masked as the label of having checked and do not respond this order.Check and be masked as the label do not checked after receiving this order, the time slot value of judging self whether and the minislot parameter k that reads in the time slot order equate.If equate, label is to the unique identifier of read write line transmission label, and unique identifier adopts has the coded system that the collision position is detected, for example Manchester's cde; If unequal, label does not send response.
Read write line judges whether to meet the Manchester's cde rule after receiving the unique identifier that label sends, if meet, read write line sends and comprises the minislot parameter k order of accepting one's fate really, and the time slot value is that the label of k receives this order and checks and indicate and be set to check.
Step 6: judge whether set Q is empty set.
If set Q is not an empty set, then return step 5; If set Q is an empty set, then jump to step 7.
Step 7: adjust the time slot range parameter.
P adds 1.
If P is less than 2
M-2, then return step 3.
If P equals 2
M-2, read write line calculates total idle time slot S, total time slot R and total collision time slot T of taking, and computing method are as follows:
If R and T are 0, show that this inquiry is without any label response, poll-final;
If R and T not all are 0, then read write line is adjusted time slot range parameter M according to S, R and T, and the method for adjustment has Lower bound algorithm, Schoute algorithm or Vogt algorithm etc.; P is made as 0, returns step 2.
The invention has the beneficial effects as follows: if not all be 0 by mechanism R and the T that adopts the grouping preview, then read write line is adjusted time slot range parameter M according to S, R and T, and the method for adjustment has Lower bound algorithm, Schoute algorithm or Vogt algorithm etc.; P is made as 0, returns step 2.
, open a plurality of time slots at every turn and detect, contrast the method that existing each unlatching single time slot detects, all be 0 if can effectively reduce the R and the T that detect time slot, show that this inquiry is without any label response, poll-final;
Temporal summation, thus the reading efficiency of many labels improved.
Description of drawings
Fig. 1 is the process flow diagram that has the time slot A loha method of the preview mechanism of dividing into groups.
Fig. 2 is the time slot value that 16 labels are selected at random.
The time slot index response that Fig. 3 sends for label.
Embodiment
Below in conjunction with accompanying drawing a specific embodiment of the present invention is described in detail, but is not construed as limiting the invention, have the preview mechanism of dividing into groups time slot A loha method flow process as shown in Figure 1, comprise the steps:
Step 1: read write line initial interrogation parameter.
Read write line sends initialization command.
The sign of checking that all labels receive after this order separately is set to not check.
Read write line is provided with the initial value of following parameter: time slot range parameter M and grouping serial number parameter P.Wherein, M chooses between 0 to 15 according to the number of labels of estimating, makes 2
MBetween 1 times to 4 times of number of labels, hypothesis has 16 labels in this example, and the M initial value gets 5; P=0.
Step 2: start inquiry.
Read write line sends a startup querying command that comprises time slot range parameter M.
Check and be masked as the label of having checked and do not respond this order.Check and be masked as the label do not checked after receiving this order, produce one less than 2
MRandom number as the time slot value of label.
In this example, label produces one less than 2 after receiving above-mentioned startup querying command
5Random number as the time slot value of label.For ease of describing, suppose that the time slot value that label produces is respectively 15,21,17,2,30,23,15,19,24,16,1,29,17,3,24,28, as shown in Figure 2, the 1st row is the numbering of label, from 1 to 16, the 2 row is the time slot corresponding value.
Step 3: grouping preview.
Read write line sends a grouping preview command that comprises grouping serial number parameter P, and what specify current preview is the P grouping.
Check be masked as do not check and the time slot value after the label between [4*P, 4*P+3] is receiving this order, send length and be 16 time slot index response, other label does not respond this order.
The time slot value is the label of 4*P+j, and the 4*j position of the time slot index response of transmission is one 4 random number to the 4*j+3 position, and all the other positions all are 0, wherein integer j ∈ [0,3].4 random number adopts the coding rule with collision position detectability to encode for example Manchester's cde; All the other adopt nonreturn to zero code to encode.
In this example, when read write line sends the grouping preview command for the first time, grouping serial number parameter P=0, what specify current preview is the 0th grouping.
Totally 3 on the label of time slot value in 0 to 3 scope is respectively label 4, label 11 and label 14.These 3 labels all send length and are 16 time slot index response after receiving above-mentioned grouping preview command, all the other labels do not send response.
For convenience of description, 4 random numbers in the time slot index response of label transmission adopt Manchester's cdes.The random number that label 4 sends is a binary sequence 0111, and the random number that label 11 sends is a binary sequence 0011, and the random number that label 14 sends is a binary sequence 1100, as shown in Figure 3.
Step 4: time slot detects.
After read write line received the time slot index response of label, response was judged to the time slot index:
If the time slot index that receives response all is low level from the 4*i position to the 4*i+3 position, wherein i=0,1,2 or 3 then is labeled as idle time slot with time slot 4*P+i.
If the response that receives includes high level from the 4*i position to the 4*i+3 position, judge further then whether the response from the 4*i position to the 4*i+3 position meets coding rule, if meet, then time slot 4*P+i is labeled as and takies time slot; If do not meet, then time slot 4*P+i is labeled as the collision time slot.
Read write line is added up idle time slot, is taken the quantity of time slot and collision time slot, is designated as C respectively
P, 0, C
P, 1And C
P, 2All take time slot time slot corresponding value and form set Q, that is: if time slot x is for taking time slot, and x ∈ Q then.
In this example to the 0th the grouping statistics C
0,0, C
0,1And C
0,2Be respectively 1,3,0, all take the set Q={1 of time slot, 2,3}.
If set Q is an empty set, jump to step 7.
Step 5: read time slot.
From set Q, appoint and get a time slot value, be designated as k, simultaneously this time slot value is deleted from set Q.In this example, the time slot value of getting for the 1st time is 1.
Read write line sends and reads the time slot order, reads the time slot order and comprises minislot parameter k.
Check and be masked as the label of having checked and do not respond this order.Check be masked as the label do not checked receive read the time slot order after, the time slot value of judging self whether and the minislot parameter k that reads in the time slot order equate.If equate, label is to the unique identifier of read write line transmission label, and unique identifier adopts has the coded system that the collision position is detected, for example Manchester's cde; If unequal, label does not send response.
Read the time slot order for what send for the first time in this example, the time slot value of label 11 equates with the minislot parameter that reads the time slot order, therefore label 11 sends the unique identifier of self, unique identifier adopts the coded system with collision position detectability, adopts the Manchester's cde mode in this example.
Read write line judges whether to meet the Manchester's cde rule after receiving the unique identifier that label sends, if meet, read write line sends and comprises the minislot parameter k order of accepting one's fate really, and the time slot value is that the label of k receives this order and checks and indicate and be set to check.
In this example label 11 at first obtain identification, and check the sign be set to check.
Step 6: judge whether Q is empty set.
If set Q is not an empty set, then return step 5; If set Q is an empty set, then jump to step 7.
Read for the first time Q={2 behind the time slot in this example, 3} be an empty set, and therefore returning step 5 continues to read next idle time slot, and label 4 will obtain identification, and checks and indicate and be set to check.
Reading for the second time Q={3} behind the time slot, be empty set, and therefore still returning step 5 reads next idle time slot, and label 14 will obtain identification, and checks and indicate and be set to check.
Read for the third time that Q is an empty set behind the time slot, jump to step 7.
Step 7: adjust the time slot range parameter.
P adds 1.
If P is less than 2
M-2, then return step 3;
If P equals 2
M-2, read write line calculates total idle time slot S, total time slot R and total collision time slot T of taking, and computing method are as follows:
Total idle time slot S=
Total time slot R=that takies
Total collision time slot T=
If R and T are 0, show that this inquiry is without any label response, poll-final.Otherwise read write line is write device and is adjusted time slot range parameter M according to S, R and T; P is made as 0, returns step 2.
P will become 1, P＜2 after the 0th grouping preview is finished in this example
M-2, therefore jump to the preview that step 3 continues next grouping.
More than a specific embodiment of the present invention is described in detail, but this embodiment is only as being convenient to describe and the imagery example of giving an example should not be construed as limiting the invention.Those skilled in the art is to be understood that; detailed description according to technical scheme of the present invention and embodiment; still can carry out various modifications or be equal to replacement the present invention, but all such modifications or replacement all should belong to the protection domain of claim of the present invention.
Claims (4)
1. a collision-proof method that has the preview mechanism of dividing into groups is applied to radio-frequency recognition system, it is characterized in that comprising the steps:
Step 1: initialization operation;
Read write line sends initialization command;
The sign of checking that all labels receive after this order separately is set to not check;
Read write line is provided with the initial value of following parameter: time slot range parameter M and grouping serial number parameter P; P=0 wherein;
Step 2: start inquiry;
Read write line sends a startup querying command that comprises time slot range parameter M;
Check and be masked as the label of having checked and do not respond this order; Check and be masked as the label do not checked after receiving this order, produce one less than 2
MRandom number as the time slot value of label;
Step 3: grouping preview;
Read write line sends a grouping preview command that comprises grouping serial number parameter P, and what specify current preview is the P grouping;
Check be masked as do not check and the time slot value after the label between [4*P, 4*P+3] is receiving this order, send length and be 16 time slot index response, other label does not respond this order;
The time slot value is the label of 4*P+j, and the 4*j position of the time slot index response of transmission is one 4 random number to the 4*j+3 position, and all the other positions all are 0, wherein integer j ∈ [0,3]; 4 random number adopts the coding rule with collision position detectability to encode; All the other adopt nonreturn to zero code to encode;
Step 4: time slot detects;
After read write line received the time slot index response of label, response was judged to the time slot index:
If the time slot index that receives response all is low level from the 4*i position to the 4*i+3 position, wherein i=0,1,2 or 3 then is labeled as idle time slot with time slot 4*P+i;
If the response that receives includes high level from the 4*i position to the 4*i+3 position, judge then whether the response from the 4*i position to the 4*i+3 position meets coding rule, if meet, then time slot 4*P+i is labeled as and takies time slot; If do not meet, then time slot 4*P+i is labeled as the collision time slot;
Read write line is added up idle time slot, is taken the quantity of time slot and collision time slot, is designated as C respectively
P, 0, C
P, 1And C
P, 2All take time slot time slot corresponding value and form set Q, that is: if time slot x is for taking time slot, and x ∈ Q then;
If set Q is an empty set, jump to step 7;
Step 5: read time slot;
From set Q, appoint and get a time slot value, be designated as k, simultaneously this time slot value is deleted from set Q;
Read write line sends and reads the time slot order, reads the time slot order and comprises minislot parameter k;
Check and be masked as the label of having checked and do not respond this order; Check and be masked as the label do not checked after receiving this order, the time slot value of judging self whether and the minislot parameter k that reads in the time slot order equate; If equate, label is to the unique identifier of read write line transmission label, and unique identifier adopts has the coded system that the collision position is detected, for example Manchester's cde; If unequal, label does not send response;
Read write line judges whether to meet coding rule after receiving the unique identifier that label sends, if meet, read write line sends and comprises the minislot parameter k order of accepting one's fate really, and the time slot value is that the label of k receives this order and checks and indicate and be set to check;
Step 6: judge whether set Q is empty set;
If set Q is not an empty set, then return step 5; If set Q is an empty set, then jump to step 7;
Step 7: adjust the time slot range parameter;
P adds 1;
If P is less than 2
M-2, then return step 3;
If P equals 2
M-2, read write line calculates total idle time slot S, total time slot R and total collision time slot T of taking, and computing method are as follows:
If R and T are 0, show that this inquiry is without any label response, poll-final;
If R and T not all are 0, then read write line is adjusted time slot range parameter M according to S, R and T; P is made as 0, returns step 2.
2. the collision-proof method that has the preview mechanism of dividing into groups according to claim 1 is characterized in that, M chooses between 0 to 15 according to the number of labels of estimating, makes 2
MBetween 1 times to 4 times of number of labels.
3. the collision-proof method that has the preview mechanism of dividing into groups according to claim 2 is characterized in that, the coding rule that 4 random number adopts is the Manchester's cde rule.
4. the collision-proof method that has the preview mechanism of dividing into groups according to claim 3 is characterized in that, the method for adjusting time slot range parameter M is Lower bound algorithm, Schoute algorithm or Vogt algorithm.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010567397A CN102024163B (en) | 2010-12-01 | 2010-12-01 | Anti-collision method with packet previewing mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010567397A CN102024163B (en) | 2010-12-01 | 2010-12-01 | Anti-collision method with packet previewing mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102024163A true CN102024163A (en) | 2011-04-20 |
| CN102024163B CN102024163B (en) | 2012-09-05 |
Family
ID=43865438
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010567397A Active CN102024163B (en) | 2010-12-01 | 2010-12-01 | Anti-collision method with packet previewing mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102024163B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103562751A (en) * | 2011-03-25 | 2014-02-05 | 梁中明 | Methods and apparatuses for the simultaneous detection of multiple radio frequency identification tags |
| CN103914714A (en) * | 2012-12-31 | 2014-07-09 | 西门子公司 | System for initialization of electronic label |
| CN104392191A (en) * | 2014-08-27 | 2015-03-04 | 北京中电华大电子设计有限责任公司 | Active RFID low-power-consumption anti-collision method |
| CN104657693A (en) * | 2015-02-26 | 2015-05-27 | 江西理工大学 | RFID (radio frequency identification) anti-collision method based on GASS (grouped adaptive allocating slots) |
| CN102999739B (en) * | 2011-09-16 | 2017-02-08 | 北京邮电大学 | RFID (radio frequency identification) tag and identification method and identification device |
| CN108052849A (en) * | 2017-12-25 | 2018-05-18 | 江西理工大学 | A kind of frame slot RFID system collision-proof method of force zero precoding |
| CN108090386A (en) * | 2017-12-23 | 2018-05-29 | 北京邮电大学 | A kind of multicycle RFID anti-collision algorithm decomposed based on binary tree |
| CN111444735A (en) * | 2020-03-18 | 2020-07-24 | 杭州电子科技大学 | Code scanning identification method and system for a large number of articles in short time |
| WO2022188684A1 (en) * | 2021-03-10 | 2022-09-15 | 谷泽竑 | Short circuit early warning detection method and device for electrolysis electrode plate, and electrolysis system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070126556A1 (en) * | 2005-12-07 | 2007-06-07 | Kovio, Inc. | Printed radio frequency identification (RFID) tag using tags-talk-first (TTF) protocol |
| KR100860048B1 (en) * | 2007-05-02 | 2008-09-25 | 경희대학교 산학협력단 | A method of anti-collision in multiple rfid using capture phenomena |
| CN101393594A (en) * | 2008-10-24 | 2009-03-25 | 中山大学 | Multi-label anticollision method based on packet dynamic frame and binary tree search for RFID system |
| CN101866413A (en) * | 2010-06-11 | 2010-10-20 | 南京邮电大学 | Multi-label anti-collision method based on grouping mechanism and jumping dynamic binary recognition |
-
2010
- 2010-12-01 CN CN201010567397A patent/CN102024163B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070126556A1 (en) * | 2005-12-07 | 2007-06-07 | Kovio, Inc. | Printed radio frequency identification (RFID) tag using tags-talk-first (TTF) protocol |
| KR100860048B1 (en) * | 2007-05-02 | 2008-09-25 | 경희대학교 산학협력단 | A method of anti-collision in multiple rfid using capture phenomena |
| CN101393594A (en) * | 2008-10-24 | 2009-03-25 | 中山大学 | Multi-label anticollision method based on packet dynamic frame and binary tree search for RFID system |
| CN101866413A (en) * | 2010-06-11 | 2010-10-20 | 南京邮电大学 | Multi-label anti-collision method based on grouping mechanism and jumping dynamic binary recognition |
Non-Patent Citations (1)
| Title |
|---|
| 《电脑知识与技术》 20100731 姜世芬等 微波应答器的防碰撞技术分析与实现 5943,5944,5982 1-4 第6卷, 第21期 * |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103562751A (en) * | 2011-03-25 | 2014-02-05 | 梁中明 | Methods and apparatuses for the simultaneous detection of multiple radio frequency identification tags |
| CN102999739B (en) * | 2011-09-16 | 2017-02-08 | 北京邮电大学 | RFID (radio frequency identification) tag and identification method and identification device |
| CN103914714A (en) * | 2012-12-31 | 2014-07-09 | 西门子公司 | System for initialization of electronic label |
| CN103914714B (en) * | 2012-12-31 | 2017-03-01 | 西门子公司 | For the initialized system of electronic tag |
| CN104392191B (en) * | 2014-08-27 | 2017-04-19 | 北京中电华大电子设计有限责任公司 | Active RFID low-power-consumption anti-collision method |
| CN104392191A (en) * | 2014-08-27 | 2015-03-04 | 北京中电华大电子设计有限责任公司 | Active RFID low-power-consumption anti-collision method |
| CN104657693A (en) * | 2015-02-26 | 2015-05-27 | 江西理工大学 | RFID (radio frequency identification) anti-collision method based on GASS (grouped adaptive allocating slots) |
| CN104657693B (en) * | 2015-02-26 | 2018-05-29 | 江西理工大学 | A kind of RFID anti-collision method based on grouping self-adjusted block time slot |
| CN108090386A (en) * | 2017-12-23 | 2018-05-29 | 北京邮电大学 | A kind of multicycle RFID anti-collision algorithm decomposed based on binary tree |
| CN108052849A (en) * | 2017-12-25 | 2018-05-18 | 江西理工大学 | A kind of frame slot RFID system collision-proof method of force zero precoding |
| CN111444735A (en) * | 2020-03-18 | 2020-07-24 | 杭州电子科技大学 | Code scanning identification method and system for a large number of articles in short time |
| CN111444735B (en) * | 2020-03-18 | 2022-05-31 | 杭州电子科技大学 | Code scanning identification method and system for a large number of articles in short time |
| WO2022188684A1 (en) * | 2021-03-10 | 2022-09-15 | 谷泽竑 | Short circuit early warning detection method and device for electrolysis electrode plate, and electrolysis system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102024163B (en) | 2012-09-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102024163B (en) | Anti-collision method with packet previewing mechanism | |
| US7612672B2 (en) | Query tree based tag identification method in RFID systems | |
| CN102004895B (en) | Time slot scanning anti-collision method based on collision precheck | |
| CN105224970B (en) | A kind of RFID anti-collision method | |
| Chen et al. | An efficient and easy-to-implement tag identification algorithm for UHF RFID systems | |
| Yihong et al. | Multiple-bits-slot reservation aloha protocol for tag identification | |
| CN102708341A (en) | Label anti-collision method for radio frequency identification (RFID) system | |
| CN101071471A (en) | Multi-label collision-proof method | |
| Yoon et al. | ISS-TCA: An identified slot scan-based tag collection algorithm for performance improvement in active RFID systems | |
| Arjona et al. | Timing-aware RFID anti-collision protocol to increase the tag identification rate | |
| Yeh et al. | Adaptive splitting and pre-signaling for RFID tag anti-collision | |
| CN101324916B (en) | Label recognition anti-collision method for RFID system | |
| CN109472177B (en) | Inventory method capable of reading TID (terminal identification) number of electronic tag | |
| CN102768733B (en) | Be applicable to the multi-label anti-collision algorithm of rfid system, rfid system and read write line | |
| CN104680104A (en) | Dynamic efficient RFID (Radio Frequency Identification Device) tag identification mechanism | |
| CN103218635A (en) | RFID (radio frequency identification) anti-collision method based on mixed multiway tree searching | |
| Alsalih et al. | Optimal distance-based clustering for tag anti-collision in RFID systems | |
| CN107506674A (en) | ALOHA collision-proof methods based on slot prediction | |
| Wang et al. | A novel anti-collision algorithm with dynamic tag number estimation for RFID systems | |
| CN102682310B (en) | Method for identifying multiple tags | |
| Quan et al. | Performance analysis of tag anti-collision algorithms for RFID systems | |
| Cui et al. | A modified Q-parameter anti-collision scheme for RFID systems | |
| Liu et al. | A fast and stable anti-collision algorithm for the EPCglobal UHF Class 1 Generation 2 standard | |
| Yaacob et al. | A review of deterministic anti-collision algorithm of passive RFID systems | |
| CN101369913B (en) | Wireless communication network node number estimation method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |