CN106778421A - RFID anti-collision algorithms based on " optimum seeking method " - Google Patents
RFID anti-collision algorithms based on " optimum seeking method " Download PDFInfo
- Publication number
- CN106778421A CN106778421A CN201611218698.XA CN201611218698A CN106778421A CN 106778421 A CN106778421 A CN 106778421A CN 201611218698 A CN201611218698 A CN 201611218698A CN 106778421 A CN106778421 A CN 106778421A
- Authority
- CN
- China
- Prior art keywords
- label
- data
- write line
- read write
- collision
- 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
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.
Abstract
The invention discloses one kind based on " optimum seeking method " RFID anti-collision algorithms, specially：Step 1：Read write line sends request command, and all labels are responded, and the sequence number of all labels is issued into read write line；Step 2：Read write line detection receives the signal of label, if only one of which label is responded, goes to step 4；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 ", data is calculated；By Request (datan, the n) order sent as read write line next time；Step 4：Read write line reads the information of the label, and the label is demodulated and decoded, and decoded label information is uploaded into main system carries out relevant treatment, and allows label dormancy.Total inquiry times needed for the present invention are few；The binary bits digit for transmitting altogether 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 RFID anti-collision algorithm of the one kind based on " optimum seeking method ".
Background technology
REID (RFID, Radio Frequency Identification) is early 1980s development
A kind of advanced identification technology got up.It is realized to static and shifting using radiofrequency signal and its transmission characteristic of Space Coupling
The contactless automatic knowledge of animal product.
The problem of collision will be related to using radio-frequency technique, collision refers to that can go out in the antenna magnetic field region of read write line
Existing multiple label, or with the presence of other read write lines.When read write line inquiry tag, multiple labels respond the life of read write line simultaneously
Order or label want the inquiry signal of the read write line of Response to selection more than 2 simultaneously when, just occur that signal disturbs generation
Channel collision issues.That is, when the label for having more than one is in the sphere of action of read write line, it may appear that 1 label is humorous
Shake, 1 situation of label off resonance.At this moment, the internal information by judging the low potential high of output end to read label is difficult to,
Here it is our collision problems to be solved.
Current anti-collision algorithm mainly has two classes：Nondeterministic algorithm and deterministic algorithm.Nondeterministic algorithm refers to being based on
The anti-collision algorithm of ALOHA mechanism, label of this algorithm requirement in read write line efficient working range is according to the sequence of oneself
Number the response time is randomly generated, in the event of conflicting, then the label not recognized will be until arriving again the next round time period
The response time is regenerated, the situation (possibility that i.e. label presence can not be identified) of label " hungry to death " at this moment just occurs；Pass
The deterministic algorithm of system has basic binary search algorithm, binary search calculation and retrusive binary search algorithm etc.,
But they have different degrees of shortcoming at aspects such as volume of transmitted data, inquiry times and system effectivenesies respectively, based on this, propose
Anti-collision algorithm of the one kind based on " optimum seeking method ".
The content of the invention
It is an object of the invention to provide RFID anti-collision algorithm of the one kind 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 solution adopted in the present invention is, RFID anti-collision algorithm of the one kind based on " optimum seeking method ", specifically according to
Lower step is implemented：
Step 1：Read write line sends request command Request (1,111 1111), and all labels respond, and by institute
The sequence number for having label issues read write line；
Step 2：Read write line detection receives the signal of label, if only one of which label is responded, jumps to step 4；If touching
Hit generation and then jump to step 3；If unresponsive, step 1 is gone to；
Step 3：After collision occurs, collision bit is designated as a, then according to " optimum seeking method ", calculates data, and data has three every time
Group data；By Request (datan, the n) order sent as read write line next time, n is data bit, n=1,2,3, datanFor
The binary number i.e. collision bit drawn with " optimum seeking method "；
Step 4：Read write line reads the information of the label, and the label is demodulated and decoded, by decoded label
Information is uploaded to main system and carries out relevant treatment, and allows label dormancy.
The features of the present invention is also resided in：
The detailed process of " optimum seeking method " calculating data is in step 3：
A collides, and the maximum binary number of a digits isIt is 2 to be converted into decimal numbera- 1, definition
One span is [0,2a- 1], three points respectively 0.382* (2 is obtained according to Fibonacci method (i.e. " optimum seeking method ")a-1)、
0.618*(2a-1)、2a- 1, it is respectively data binary number is converted into after three rounds for obtaining1、data2、
data3, that is, obtain three groups of data of data.
By Request (data in step 3n, n) it is specially as the order of the transmission of read write line next time：
After label collides, read write line sends Request (data1, 1) and collide to region interior label, label handle
The sequence number of correspondence position and the data for receiving1Compare, if being more than data1Number of tags be more than 1, go to step 3, otherwise, go to step
Rapid 4, meanwhile, read write line sends Request (data2, 2) and give region interior label, sequence number of the label the correspondence position that collides
With the data for receiving2Compare, if being more than data2Number of tags be more 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 the data that receives of the label the correspondence position that collides3Than
Compared with if being more than data3Number of tags be more than 1, go to step 3, otherwise, go to step 4.
The beneficial effects of the invention are as follows：A kind of RFID anti-collision algorithms based on " optimum seeking method " of the invention, required is total
Inquiry times are few, shorten recognition time；The binary bits digit for transmitting altogether is few, so as to shorten transmission quantity, improves
Delivery time, there is provided efficiency；Throughput is high.
Brief description of the drawings
Fig. 1 is using the implementation illustration of RFID anti-collision algorithms of the present invention；
Fig. 2 is that inventive algorithm compares figure with total inquiry times of existing algorithm；
Fig. 3 is that inventive algorithm compares figure with the binary number of bits for transmitting altogether of existing algorithm；
Fig. 4 is that inventive algorithm compares figure with the throughput of existing algorithm.
Specific embodiment
The present invention is described in detail with reference to the accompanying drawings and detailed description.
A kind of RFID anti-collision algorithms based on " optimum seeking method " of the invention, specifically implement according to following steps：
Step 1：Read write line sends request command Request (1,111 1111), and all labels respond, and by institute
The sequence number for having label issues read write line；
Step 2：Read write line detection receives the signal of label, if only one of which label is responded, step 4 is jumped to, if touching
Hit generation and then jump to step 3, it is as empty if unresponsive, then illustrate in read write line effective range without label or all of label
(whole identification process terminates) all is identified, step 1 is gone to.
Step 3：After collision occurs, collision bit is designated as a, then according to " optimum seeking method ", calculates data, data has every time
Three groups of data.
" optimum seeking method " calculate data detailed process be：
A collides, and the maximum binary number of a digits isIt is 2 to be converted into decimal numbera- 1, definition
One span is [0,2a- 1], three points respectively 0.382* (2 is obtained according to Fibonacci method (i.e. " optimum seeking method ")a-1)、
0.618*(2a-1)、2a- 1, it is respectively data binary number is converted into after three rounds for obtaining1、data2、
data3, that is, obtain three groups of data of data.
By Request (datan, the n) order sent as read write line next time, n is data bit, n=1,2,3, datan
It is the binary number i.e. collision bit drawn with Fibonacci method.
After label collides, read write line sends Request (data1, 1) and collide to region interior label, label handle
The sequence number of correspondence position and the data for receiving1Compare, if being more than data1Number of tags be more than 1, go to step 3, otherwise, go to step
Rapid 4, meanwhile, read write line sends Request (data2, 2) and give region interior label, sequence number of the label the correspondence position that collides
With the data for receiving2Compare, if being more than data2Number of tags be more 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 the data that receives of the label the correspondence position that collides3Than
Compared with if being more than data3Number of tags be more than 1, go to step 3, otherwise, go to step 4.
Collision bit is only sent every time, the transmission quantity of data is so greatly reduced, and improves the number of times for comparing.
Step 4：Read write line reads the information of the label, and the label is demodulated and decoded, by decoded label
Information is uploaded to main system and carries out relevant treatment, and allows label dormancy.
Embodiment
Assuming that the Serial No. of label 8, there is four electronics in SBR in present read write line Active Area
Label A, B, C, D, their sequence number are as follows：Label A：1010 0111；Label B：1011 0101；Label C：1010 1111；
Label D：1011 1101.Its identification process is as shown in Figure 1：
(1) start read write line and unknown state is in region interior label, so sending Request (1,111 1111) lives
Order, it is desirable to all of tag responses in region.Label A, B, C, D are responded, and read write line is read according to Manchester coding principles
Writing the data that device receives is：
101x x1x1；I.e.：D1, D3, D4 collides, 3 collisions, with " optimum seeking method ", 3 maximum binary numbers
It is 111, it is exactly 7 to be converted into decimal number, that can just define a span [0,7], and three are obtained according to noted earlier
Point, i.e.,：2、4、7.2 to change into 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) read write line sends Request (010,1), and only label A response, collisionless occurs, and read write line reads label A
Information, and label A is demodulated and decoded, the information of decoded label A is uploaded into main system carries out relevant treatment,
Sleep orders are finally performed, it is masked, is allowed in " mute " state.Sequence number next time is obtained, i.e.,：100.
(3) read write line sends Request (100,2), and only label B response, collisionless occurs, and read write line reads label B
Information, and label B is demodulated and decoded, the information of decoded label B is uploaded into main system carries out relevant treatment.
Sleep orders are finally performed, it is masked, is allowed to, in " mute " state, obtain sequence number next time, i.e.,：111.
(4) read write line sends Request (111,3), and at this moment label C, D are responded, and read write line is compiled according to Manchester
Code principle, the data that read write line is received are：101x 11x1；I.e.：D1, D4 collides, and 2 is collision, with " preferably
Method ", the binary number of 2 maximums is 11, and it is 3 to be converted into decimal number, and that can just define a span [0,3], root
Three points are obtained according to noted earlier, i.e.,：1,1,3.1 to change into binary system be that 01,3 translation bit binary system is 11, can be obtained next time
Serial No. needed for Request：01.
(5) read write line sends Request (01,1), and only label C response, collisionless occurs, and read write line reads label C
Information, and label C is demodulated and decoded, the information of decoded label C is uploaded into main system carries out relevant treatment.Most
Sleep orders are performed afterwards, it is masked, and are allowed in " mute " state.Sequence number next time is obtained, i.e.,：11.
(6) read write line sends Request (11,2), and only label D responses, collisionless occurs, and read write line reads label D's
Information, and label D is demodulated and decoded, the information of decoded label D is uploaded into main system carries out relevant treatment.Most
Sleep orders are performed afterwards, it is masked, and are allowed in " mute " state.Now label is all recognized, and has not been had
Data data.
(7) read write line sends Request (1,111 1111) orders again, and without tag responses, care label is all recognized
Complete, whole tag recognition process terminates.
Algorithm performance is analyzed
1. inquiry times analysis total needed for read write line
Existing two enter search algorithm processed, identify that single label averagely needs log from N number of label2N+1 times, dynamic
As radix-2 algorithm is with throughput with binary identification number of times, but the time has shortened, and the data flow of transmission compares
It is few, because the data of transmission are dynamic adjustment.Their total searching times are：
And RFID anti-collision algorithm of the present invention based on " optimum seeking method " is used, total inquiry times are needed for read write line：
S (N)=1+2N
2. the binary bits digit analysis for transmitting altogether
Existing binary search algorithm, the binary number of bits for transmitting altogether is：
Wherein, N is the number of label, and k is the digit of label.
Existing Dynamic binary searching algorithm, the binary number of bits for transmitting altogether is：
Wherein, N is the number of label, and k is the digit of label.
The present invention is based on the RFID anti-collision algorithms of " optimum seeking method ", and the binary number of bits for transmitting altogether is：
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
As total searching times of Dynamic binary searching algorithm, then system effectiveness is just for existing binary search algorithm
Equally, that is, throughput is the same, throughput is：
The present invention is based on the RFID anti-collision algorithms of " optimum seeking method ", and throughput is：
E (N)=N/ (2N+1)
Wherein, N is the number of label.
4. simulation performance analysis
The emulation platform developed using MATLAB realizes the communication process of read write line and label, set number of labels as
200, label coding is 8.It is imitative that inquiry times, transmission quantity and throughput on MATLAB respectively to algorithm have carried out checking
It is very, convenient during in order to emulate to distinguish because binary searching times are as the searching times, throughput of binary,
Total searching times of binary are changed into：
The throughput of binary is changed into：
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 read write line of the bright RFID anti-collision algorithms (innovatory algorithm is written as in figure) based on " optimum seeking method " are carried out
Contrast, total inquiry times needed for the algorithm that can obtain the application as analogous diagram are significantly reduced, 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 for transmitting altogether of the read write line of the bright RFID anti-collision algorithms (innovatory algorithm is written as in figure) based on " optimum seeking method "
Number of bits contrasted, by analogous diagram it can be seen that with the increase of number of labels, using the application algorithm altogether
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 read write line of the bright RFID anti-collision algorithms (innovatory algorithm is written as in figure) based on " optimum seeking method " is contrasted, by
Analogous diagram can be seen that with the increase of number of labels, using the throughput probably stabilization of the application algorithm in 0.5 or so, explanation
The application algorithm throughput apparently higher than the above two.
RFID anti-collision algorithm of the present invention based on " optimum seeking method ", to the feasibility of algorithm in total inquiry times, transmission
Amount, throughput are contrasted 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 (3)
1. one kind is based on the RFID anti-collision algorithms of " optimum seeking method ", it is characterised in that specifically implement according to following steps：
Step 1：Read write line sends request command Request (1,111 1111), and all labels respond, and by all marks
The sequence number of label issues read write line；
Step 2：Read write line detection receives the signal of label, if only one of which label is responded, jumps to step 4；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 is designated as a, then according to " optimum seeking method ", calculates data, data there are three groups every time
Data；By Request (datan, the n) order sent as read write line next time, n is data bit, n=1,2,3, datanIt is use
The binary number that " optimum seeking method " draws i.e. collision bit；
Step 4：Read write line reads the information of the label, and the label is demodulated and decoded, by decoded label information
Being uploaded to main system carries out relevant treatment, and allows label dormancy.
2. one kind according to claim 1 is based on the RFID anti-collision algorithms of " optimum seeking method ", it is characterised in that the step
The detailed process of " optimum seeking method " calculating data is in 3：
A collides, and the maximum binary number of a digits isIt is 2 to be converted into decimal numbera- 1, define one
Span is [0,2a- 1], three points respectively 0.382* (2 is obtained according to " optimum seeking method "a-1)、0.618*(2a-1)、2a- 1,
It is respectively data binary number is converted into after three rounds for obtaining1、data2、data3, that is, obtain data's
Three groups of data.
3. one kind according to claim 1 is based on the RFID anti-collision algorithms of " optimum seeking method ", it is characterised in that the step
By Request (data in 3n, n) it is specially as the order of the transmission of read write line next time：
After label collides, read write line sends Request (data1, 1) and region interior label is given, label is the correspondence position that collides
Sequence number with receive data1Compare, if being more than data1Number of tags be more than 1, go to step 3, otherwise, go to step 4, together
When, read write line sends Request (data2, 2) and give region interior label, sequence number and reception of the label the correspondence position that collides
Data2Compare, if being more than data2Number of tags be more than 1, go to step 3, otherwise, go to step 4, meanwhile, read write line send
Request(data3, 3) and give region interior label, sequence number and the data that receives of the label the correspondence position that collides3Compare, if
More than data3Number of tags be more 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 true CN106778421A (en) | 2017-05-31 |
| CN106778421B 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 (5)
| 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 |
| US20100259366A1 (en) * | 2007-11-08 | 2010-10-14 | Zte Corporation | Method for preventing collision of rfid tags in an rfid system |
| CN102024134A (en) * | 2010-10-27 | 2011-04-20 | 北京邮电大学 | High-efficiency multi-tag anti-collision radio frequency identification (RFID) method |
| US20150324681A1 (en) * | 2014-05-08 | 2015-11-12 | Tego, Inc. | Flexible rfid tag for mounting on metal surface |
-
2016
- 2016-12-26 CN CN201611218698.XA patent/CN106778421B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101071471A (en) * | 2007-06-25 | 2007-11-14 | 北京邮电大学 | Multi-label collision-proof method |
| US20100259366A1 (en) * | 2007-11-08 | 2010-10-14 | Zte Corporation | Method for preventing collision of rfid tags in an rfid system |
| 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 |
| US20150324681A1 (en) * | 2014-05-08 | 2015-11-12 | Tego, Inc. | Flexible rfid tag for mounting on metal surface |
Non-Patent Citations (1)
| Title |
|---|
| 董永峰 等: ""基于黄金分割的动态帧时隙ALOHA防碰撞算法"", 《河北工业大学学报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106778421B (en) | 2019-04-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8742899B2 (en) | Methods and apparatuses to identify devices | |
| Cheng et al. | Analysis and simulation of RFID anti-collision algorithms | |
| CN100378732C (en) | Anti-collision method and system using optimized binary search tree | |
| US20060103505A1 (en) | Method and apparatus for efficiently querying and identifying multiple items on a communication channel | |
| US8077013B2 (en) | RFID reader Q-parameter aided by RF power measurement | |
| CN103914132A (en) | Method and system for recognizing gestures based on fingers | |
| He et al. | A fast RFID tag identification algorithm based on counter and stack | |
| CN104331679B (en) | A kind of RFID tag anti-collision method based on physical-layer network coding | |
| Liu et al. | Fast counting the key tags in anonymous RFID systems | |
| Chen et al. | An enhanced anti-collision algorithm in RFID based on counter and stack | |
| CN102968606A (en) | Radio frequency identification (RFID) bidirectional authentication method | |
| CN105654010B (en) | A kind of RFID tag collision-proof method based on adaptive search strategies | |
| Arjona et al. | Timing-aware RFID anti-collision protocol to increase the tag identification rate | |
| Liu et al. | A novel tag searching protocol with time efficiency and searching accuracy in RFID systems | |
| US9552539B2 (en) | Selectively addressing transponders | |
| Kim et al. | Improved 4-ary query tree algorithm for anti-collision in RFID system | |
| CN103927506B (en) | RIFD anti-collision method based on dynamic timeslot conflict tracking tree | |
| CN100592321C (en) | Method for recognizing contrary collision of inquiry tree radio frequency labels of amalgamation database | |
| Liu et al. | Fast and accurate missing tag detection for multi-category RFID systems | |
| Liu et al. | Pinpointing anomaly RFID tags: Situation and opportunities | |
| CN110222798B (en) | Tail code sequence re-identification method improved based on tail code random identification method | |
| CN103679096A (en) | Optimized RFID anti-collision method | |
| CN106778421B (en) | RFID anti-collision algorithm based on " optimum seeking method " | |
| CN104166867A (en) | Multi-HASH-function multi-frame coupling type RFID anti-collision (MHMFG) 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20190426 Termination date: 20211226 |