CN106778421B - RFID anti-collision algorithm based on " optimum seeking method " - Google Patents
RFID anti-collision algorithm based on " optimum seeking method " Download PDFInfo
- Publication number
- CN106778421B CN106778421B CN201611218698.XA CN201611218698A CN106778421B CN 106778421 B CN106778421 B CN 106778421B CN 201611218698 A CN201611218698 A CN 201611218698A CN 106778421 B CN106778421 B CN 106778421B
- Authority
- CN
- China
- Prior art keywords
- label
- reader
- data
- collision
- optimum seeking
- 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.)
- Expired - Fee Related
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/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.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Toxicology (AREA)
- General Health & Medical Sciences (AREA)
- Electromagnetism (AREA)
- Computer Networks & Wireless Communication (AREA)
- Artificial Intelligence (AREA)
- Computer Vision & Pattern Recognition (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Small-Scale Networks (AREA)
- Radar Systems Or Details Thereof (AREA)
Abstract
RFID anti-collision algorithm the invention discloses one kind based on " optimum seeking method ", specifically: step 1: reader sends request command, and all labels respond, and the sequence number of all labels is issued reader；Step 2: the signal that reader detection receives label goes to step 4 if only one label responds；Step 3 is gone to if having collision to occur；If unresponsive, step 1 is gone to；Step 3: after collision occurs, then according to " optimum seeking method ", calculating data；By Request (datan, n) as reader next time send order；Step 4: reader reads the information of the label, and demodulates and decodes to the label, and decoded label information is uploaded to main system and carries out relevant treatment, and allows label suspend mode.The required total inquiry times of the present invention are few；The binary bits digit transmitted in total is few, so as to shorten transmission quantity；Throughput is high.
Description
Technical field
The invention belongs to technical field of RFID, and in particular to one kind is based on the RFID anti-collision algorithm of " optimum seeking method ".
Background technique
Radio Frequency Identification Technology (RFID, Radio Frequency Identification) is early 1980s development
A kind of advanced identification technology got up.It is realized using radiofrequency signal and its transmission characteristic of Space Coupling to static and shifting
The contactless automatic knowledge of animal product.
The problem of will being related to collision using radio-frequency technique, collision refer to go out in the antenna magnetic field region of reader
Existing multiple labels, or with the presence of other readers.When reader inquiry tag, multiple labels respond the life of reader simultaneously
As soon as order or label want Response to selection 2 or more the inquiry signals of reader simultaneously, it will appear signal interference generation
Channel collision issues.That is, when there is the label of more than one in the sphere of action of reader, it may appear that 1 label is humorous
Vibration, the detuning situation of 1 label.At this moment, it is difficult to read the internal information of label by judging the high low potential of output end,
Here it is the collision problems that we to be solved.
There are two main classes for anti-collision algorithm at present: nondeterministic algorithm and deterministic algorithm.Nondeterministic algorithm refers to being based on
The anti-collision algorithm of ALOHA mechanism, this algorithm require the label in reader efficient working range according to the sequence of oneself
Number the response time is randomly generated, in case of conflicting, then the label not recognized will be until the arrival of next round period again
The case where regenerating the response time, at this moment just will appear label " hungry to death " (i.e. label exist cannot identified possibility)；It passes
The deterministic algorithm of system has basic binary search algorithm, binary search calculation and retrusive binary search algorithm etc.,
But they respectively volume of transmitted data, inquiry times and in terms of have different degrees of shortcoming, be based on this, propose
One kind being based on the anti-collision algorithm of " optimum seeking method ".
Summary of the invention
The object of the present invention is to provide a kind of RFID anti-collision algorithms for being based on " optimum seeking method ", solve and deposit in the prior art
Volume of transmitted data is big, the problem more than inquiry times.
The technical scheme adopted by the invention is that a kind of RFID anti-collision algorithm for being based on " optimum seeking method ", specifically according to
Lower step is implemented:
Step 1: reader sends request command Request (1,111 1111), and all labels respond, and by institute
There is the sequence number of label to issue reader；
Step 2: the signal that reader detection receives label jumps to step 4 if only one label responds；If touching
It hits generation and then jumps to step 3；If unresponsive, step 1 is gone to；
Step 3: after collision occurs, collision bit is denoted as a, then according to " optimum seeking method ", calculates data, data has three every time
Group data；By Request (datan, n) and the order that is sent as reader next time, n is data bit, n=1,2,3, datanFor
The binary number i.e. collision bit obtained with " optimum seeking method "；
Step 4: reader reads the information of the label, and demodulates and decodes to the label, by decoded label
Information is uploaded to main system and carries out relevant treatment, and allows label suspend mode.
The features of the present invention also characterized in that:
" optimum seeking method " calculates the detailed process of data in step 3 are as follows:
A collide, and the maximum binary number of a digit isBeing converted into decimal number is 2a- 1, definition
One value range is [0,2a- 1], obtaining three points according to Fibonacci method (i.e. " optimum seeking method ") is respectively 0.382* (2a-1)、
0.618*(2a-1)、2a- 1, it is respectively data binary number is converted into after three obtained point round1、data2、
data3To get three groups of data for arriving data.
By Request (data in step 3n, n) as reader next time send order specifically:
After label collides, reader sends Request (data1, 1) and region interior label is given, label handle collides
The sequence number and received data of corresponding position1Compare, if more than data1Number of tags be greater than 1, go to step 3, otherwise, go to step
Rapid 4, meanwhile, reader sends Request (data2, 2) and give region interior label, sequence number of the label the corresponding position that collides
With received data2Compare, if more than data2Number of tags be greater than 1, go to step 3, otherwise, go to step 4, meanwhile, read-write
Device sends Request (data3, 3) and give region interior label, sequence number and received data of the label the corresponding position that collides3Than
Compared with if more than data3Number of tags be greater than 1, go to step 3, otherwise, go to step 4.
It is required total the beneficial effects of the present invention are: a kind of RFID anti-collision algorithm for being based on " optimum seeking method " of the present invention
Inquiry times are few, shorten recognition time；The binary bits digit transmitted in total is few, so as to shorten transmission quantity, improves
Delivery time provides efficiency；Throughput is high.
Detailed description of the invention
Fig. 1 is the implementation example figure using RFID anti-collision algorithm of the present invention；
Fig. 2 is inventive algorithm figure compared with total inquiry times of existing algorithm；
Fig. 3 is inventive algorithm figure compared with the binary number of bits of existing algorithm transmitted in total；
Fig. 4 is inventive algorithm figure compared with the throughput of existing algorithm.
Specific embodiment
The following describes the present invention in detail with reference to the accompanying drawings and specific embodiments.
A kind of RFID anti-collision algorithm being based on " optimum seeking method " of the invention, is specifically implemented according to the following steps:
Step 1: reader sends request command Request (1,111 1111), and all labels respond, and by institute
There is the sequence number of label to issue reader；
Step 2: the signal that reader detection receives label jumps to step 4, if touching if only one label responds
It hits generation and then jumps to step 3, it is as empty if unresponsive, then illustrate in reader effective range without label or all labels
All identified (entire identification process terminates), goes to step 1.
Step 3: after collision occurs, collision bit being denoted as a, then according to " optimum seeking method ", calculates data, data has every time
Three groups of data.
The detailed process of " optimum seeking method " calculating data are as follows:
A collide, and the maximum binary number of a digit isBeing converted into decimal number is 2a- 1, definition
One value range is [0,2a- 1], obtaining three points according to Fibonacci method (i.e. " optimum seeking method ") is respectively 0.382* (2a-1)、
0.618*(2a-1)、2a- 1, it is respectively data binary number is converted into after three obtained point round1、data2、
data3To get three groups of data for arriving data.
By Request (datan, n) and the order that is sent as reader next time, n is data bit, n=1,2,3, datan
For the binary number i.e. collision bit obtained with Fibonacci method.
After label collides, reader sends Request (data1, 1) and region interior label is given, label handle collides
The sequence number and received data of corresponding position1Compare, if more than data1Number of tags be greater than 1, go to step 3, otherwise, go to step
Rapid 4, meanwhile, reader sends Request (data2, 2) and give region interior label, sequence number of the label the corresponding position that collides
With received data2Compare, if more than data2Number of tags be greater than 1, go to step 3, otherwise, go to step 4, meanwhile, read-write
Device sends Request (data3, 3) and give region interior label, sequence number and received data of the label the corresponding position that collides3Than
Compared with if more than data3Number of tags be greater than 1, go to step 3, otherwise, go to step 4.
Collision bit is only sent every time, is greatly reduced the transmission quantity of data in this way, is improved the number compared.
Step 4: reader reads the information of the label, and demodulates and decodes to the label, by decoded label
Information is uploaded to main system and carries out relevant treatment, and allows label suspend mode.
Embodiment
Assuming that the Serial No. of label 8, present reader Active Area is interior, and there are four the electronics for being in preparation state
Label A, B, C, D, their sequence number are as follows: label A: 1,010 0111；Label B: 1,011 0101；Label C: 1,010 1111；
Label D:1011 1101.Its identification process is as shown in Figure 1:
(1) start reader and unknown state is in region interior label, so sending Request (1,111 1111) life
It enables, it is desirable that all tag responses in region.Label A, B, C, D are responded, and reader is read according to Manchester coding principle
Write the data that device receives are as follows:
101x x1x1；That is: D1, D3, D4 collide, 3 collisions, with " optimum seeking method ", 3 maximum binary numbers
It is 111, being converted into decimal number is exactly 7, that can define a value range [0,7], obtains three according to noted earlier
Point, it may be assumed that 2,4,7.2 to be converted to binary system be that 010,4 to be converted into binary system be that 100,7 to be converted into binary system be 111, can be obtained next
Serial No. needed for secondary Request: 010.
(2) reader sends Request (010,1), only label A response, and collisionless occurs, and reader reads label A
Information, and label A is demodulated and decoded, the information of decoded label A is uploaded to main system and carries out relevant treatment,
Sleep order is finally executed, it is masked, is allowed in " mute " state.Obtain sequence number next time, it may be assumed that 100.
(3) reader sends Request (100,2), only label B response, and collisionless occurs, and reader reads label B
Information, and label B is demodulated and decoded, the information of decoded label B is uploaded to main system and carries out relevant treatment.
Sleep order is finally executed, it is masked, is allowed to obtain sequence number next time, it may be assumed that 111 in " mute " state.
(4) reader sends Request (111,3), and at this moment label C, D are responded, and reader is compiled according to Manchester
Code principle, the data that reader receives are as follows: 101x 11x1；That is: D1, D4 collide, and 2 be collision, with " preferably
Method ", 2 maximum binary numbers are 11, and being converted into decimal number is 3, that can define a value range [0,3], root
Three points are obtained according to noted earlier, it may be assumed that 1,1,3.1 to be converted to binary system be 01,3 translation bit binary system is 11, can be obtained next time
Serial No. needed for Request: 01.
(5) reader sends Request (01,1), and only label C responds, and collisionless occurs, and reader reads label C
Information, and label C is demodulated and decoded, the information of decoded label C is uploaded to main system and carries out relevant treatment.Most
Sleep order is executed afterwards, masks it, is allowed in " mute " state.Obtain sequence number next time, it may be assumed that 11.
(6) reader sends Request (11,2), and only label D response, collisionless occurs, and reader reads label D's
Information, and label D is demodulated and decoded, the information of decoded label D is uploaded to main system and carries out relevant treatment.Most
Sleep order is executed afterwards, masks it, is allowed in " mute " state.Label all identifies at this time, and has not had
Data data.
(7) reader sends Request (1,111 1111) order, no tag responses again, and care label all identifies
Complete, entire tag recognition process terminates.
Algorithm performance analysis
1. total inquiry times analysis needed for reader
Existing two into search algorithm, identifies that single label averagely needs log from N number of label2N+1 times, dynamic
As radix-2 algorithm with binary identification number is with throughput, but the time is shortened, and the data flow of transmission compares
It is few, because the data of transmission are that dynamic adjusts.Their total searching times are as follows:
And it uses the present invention is based on the RFID anti-collision algorithm of " optimum seeking method ", total inquiry times needed for reader are as follows:
S (N)=1+2N
2. the binary bits digit analysis transmitted in total
Existing binary search algorithm, the binary number of bits transmitted in total are as follows:
Wherein, N is the number of label, and k is the digit of label.
Existing Dynamic binary searching algorithm, the binary number of bits transmitted in total are as follows:
Wherein, N is the number of label, and k is the digit of label.
The present invention is based on the RFID anti-collision algorithm of " optimum seeking method ", binary number of bits for transmitting in total are as follows:
L (N, k)=(2N+1) * (k+1)/2
Wherein, N is the number of label, and k is the digit of label.
3. throughput analysis
Existing binary search algorithm is as total searching times of Dynamic binary searching algorithm, then system effectiveness is just
Equally, that is, throughput is the same, throughput are as follows:
The present invention is based on the RFID anti-collision algorithm of " optimum seeking method ", throughputs are as follows:
E (N)=N/ (2N+1)
Wherein, N is the number of label.
4. simulation performance is analyzed
Realize the communication process of reader and label using the emulation platform of MATLAB exploitation, set number of labels as
200, label coding is 8.It is imitative that verifying has been carried out to the inquiry times of algorithm, transmission quantity and throughput respectively on MATLAB
Very, since binary searching times facilitate differentiation as the searching times of binary, throughput, when in order to emulate,
Total searching times of binary are become:
The throughput of binary is become:
It is illustrated in figure 2 existing radix-2 algorithm (basic binary system is written as in figure), binary algorithm and this hair
Total inquiry times of the reader of the bright RFID anti-collision algorithm (innovatory algorithm is written as in figure) based on " optimum seeking method " carry out
Comparison, can obtain inquiry times total needed for the algorithm of the application as analogous diagram and significantly reduce, that is, recognition time shortens.
It is illustrated in figure 3 existing radix-2 algorithm (basic binary system is written as in figure), binary algorithm and this hair
The binary system of the reader of the bright RFID anti-collision algorithm (innovatory algorithm is written as in figure) based on " optimum seeking method " transmitted in total
Number of bits compared, by analogous diagram it can be seen that with number of labels increase, using the application algorithm in total
Binary number of bits of transmission is significantly less than the above two, so as to shorten transmission quantity, improves transmission time.
It is illustrated in figure 4 existing radix-2 algorithm (basic binary system is written as in figure), binary algorithm and this hair
The throughput of the reader of the bright RFID anti-collision algorithm (innovatory algorithm is written as in figure) based on " optimum seeking method " compares, by
Analogous diagram can be seen that the increase with number of labels, probably stable 0.5 or so using the throughput of the application algorithm, explanation
The application algorithm throughput is apparently higher than the above two.
The present invention is based on the RFID anti-collision algorithm of " optimum seeking method ", to the feasibility of algorithm in total inquiry times, transmission
Amount, throughput are compared with existing radix-2 algorithm, binary algorithm, it can be seen that use algorithm of the invention
It is substantially better than existing two kinds of algorithms.
Claims (2)
1. a kind of RFID anti-collision method based on optimum seeking method, which is characterized in that be specifically implemented according to the following steps:
Step 1: reader sends request command Request (1,111 1111), and all labels respond, and by all marks
The sequence number of label issues reader；
Step 2: the signal that reader detection receives label jumps to step 4 if only one label responds；If there is collision to send out
It is raw then jump to step 3；If unresponsive, step 1 is gone to；
Step 3: after collision occurs, collision bit being denoted as a, then according to " optimum seeking method ", calculates data, data has three groups every time
Data；The order that Request (datan, n) is sent as reader next time, n are data bit, and n=1,2,3, datan are
The binary number i.e. collision bit obtained with " optimum seeking method "；
" optimum seeking method " calculates the detailed process of data in the step 3 are as follows:
A collide, and the maximum binary number of a digit is to be converted into decimal number as 2a-1, and defining a value range is
[0,2a-1], obtaining three points according to " optimum seeking method " is respectively 0.382* (2a-1), 0.618* (2a-1), 2a-1, respectively
To three rounds after be converted into binary number be data1, data2, data3 to get arrive data three groups of numbers
According to；
Step 4: reader reads the information of the label, and demodulates and decodes to the label, by decoded label information
It is uploaded to main system and carries out relevant treatment, and allow label suspend mode.
2. a kind of RFID anti-collision method based on optimum seeking method according to claim 1, which is characterized in that the step 3
The middle order for sending Request (datan, n) as reader next time specifically:
After label collides, reader sends Request (data1,1) to region interior label, and label is the correspondence that collides
The sequence number of position is greater than 1 compared with received data1, if more than the number of tags of data1, goes to step 3, otherwise, goes to step
4, meanwhile, reader sends Request (data2,2) to region interior label, label the sequence number of the corresponding position that collides with
Received data2 compares, and is greater than 1 if more than the number of tags of data2, goes to step 3, otherwise, go to step 4, meanwhile, reader
Request (data3,3) is sent to region interior label, sequence number and received data3 ratio of the label the corresponding position that collides
Compared with, if more than data3 number of tags be greater than 1, go to step 3, otherwise, go to step 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611218698.XA CN106778421B (en) | 2016-12-26 | 2016-12-26 | RFID anti-collision algorithm based on " optimum seeking method " |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611218698.XA CN106778421B (en) | 2016-12-26 | 2016-12-26 | RFID anti-collision algorithm based on " optimum seeking method " |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106778421A CN106778421A (en) | 2017-05-31 |
| CN106778421B true CN106778421B (en) | 2019-04-26 |
Family
ID=58926743
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611218698.XA Expired - Fee Related CN106778421B (en) | 2016-12-26 | 2016-12-26 | RFID anti-collision algorithm based on " optimum seeking method " |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106778421B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101071471A (en) * | 2007-06-25 | 2007-11-14 | 北京邮电大学 | Multi-label collision-proof method |
| CN101493880A (en) * | 2009-01-08 | 2009-07-29 | 张长明 | Jumping binary search collision resistance method by utilizing CPLD and singlechip |
| CN102024134A (en) * | 2010-10-27 | 2011-04-20 | 北京邮电大学 | High-efficiency multi-tag anti-collision radio frequency identification (RFID) method |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9430732B2 (en) * | 2014-05-08 | 2016-08-30 | Tego, Inc. | Three-dimension RFID tag with opening through structure |
| CN101430753B (en) * | 2007-11-08 | 2011-01-19 | 中兴通讯股份有限公司 | Label anti-collision method for radio frequency recognition system |
-
2016
- 2016-12-26 CN CN201611218698.XA patent/CN106778421B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101071471A (en) * | 2007-06-25 | 2007-11-14 | 北京邮电大学 | Multi-label collision-proof method |
| CN101493880A (en) * | 2009-01-08 | 2009-07-29 | 张长明 | Jumping binary search collision resistance method by utilizing CPLD and singlechip |
| CN102024134A (en) * | 2010-10-27 | 2011-04-20 | 北京邮电大学 | High-efficiency multi-tag anti-collision radio frequency identification (RFID) method |
Non-Patent Citations (1)
| Title |
|---|
| "基于黄金分割的动态帧时隙ALOHA防碰撞算法";董永峰 等;《河北工业大学学报》;20150630;第44卷(第3期);正文第2.2节 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106778421A (en) | 2017-05-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Buettner et al. | A software radio-based UHF RFID reader for PHY/MAC experimentation | |
| Cheng et al. | Analysis and simulation of RFID anti-collision algorithms | |
| US8072327B2 (en) | Causing RFID tags to reply using changed reply timing | |
| US20080258878A1 (en) | Facilitating rfid tags to refrain from participating in a subsequent inventorying attempt | |
| US8063740B1 (en) | Interfacing to RFID reader utility that causes RFID tags to reply using changed reply timing | |
| US8077013B2 (en) | RFID reader Q-parameter aided by RF power measurement | |
| CN103914132A (en) | Method and system for recognizing gestures based on fingers | |
| Arjona et al. | Timing-aware RFID anti-collision protocol to increase the tag identification rate | |
| He et al. | A fast RFID tag identification algorithm based on counter and stack | |
| CN102968606A (en) | Radio frequency identification (RFID) bidirectional authentication method | |
| Chen et al. | An enhanced anti-collision algorithm in RFID based on counter and stack | |
| CN105654010B (en) | A kind of RFID tag collision-proof method based on adaptive search strategies | |
| Kim et al. | Improved 4-ary query tree algorithm for anti-collision in RFID system | |
| CN102129580A (en) | Data communication method from label to reader-writer based on Miller codes | |
| CN103927506B (en) | RIFD anti-collision method based on dynamic timeslot conflict tracking tree | |
| CN106778421B (en) | RFID anti-collision algorithm based on " optimum seeking method " | |
| CN100592321C (en) | Method for recognizing contrary collision of inquiry tree radio frequency labels of amalgamation database | |
| CN209769591U (en) | RFID intelligent asset cabinet and document thereof | |
| CN104166867A (en) | Multi-HASH-function multi-frame coupling type RFID anti-collision (MHMFG) algorithm | |
| Chen et al. | Study on Anti-collision Q Algorithm for UHF RFID | |
| CN103679096A (en) | Optimized RFID anti-collision method | |
| Cui et al. | A modified Q-parameter anti-collision scheme for RFID systems | |
| Fraj et al. | An evaluation of UHF RFID anti-collision protocols with NS2 | |
| Uysal et al. | Q-frame-collision-counter: A novel and dynamic approach to RFID Gen 2's Q algorithm | |
| Quan et al. | Performance analysis of tag anti-collision algorithms for RFID systems |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190426 Termination date: 20211226 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |