CN106650530B - Enhanced quaternary tree anti-collision algorithm suitable for RFID system - Google Patents
Enhanced quaternary tree anti-collision algorithm suitable for RFID system Download PDFInfo
- Publication number
- CN106650530B CN106650530B CN201610896194.7A CN201610896194A CN106650530B CN 106650530 B CN106650530 B CN 106650530B CN 201610896194 A CN201610896194 A CN 201610896194A CN 106650530 B CN106650530 B CN 106650530B
- Authority
- CN
- China
- Prior art keywords
- label
- request
- reader
- collision
- prefix
- 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.)
- Active
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.
- 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
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)
- Radar Systems Or Details Thereof (AREA)
- Near-Field Transmission Systems (AREA)
Abstract
The invention discloses a kind of enhanced quaternary tree anti-collision algorithm suitable for RFID system, including initial interrogation storehouse, detection collision bit, determines inquiry prefix, inquiry prefix stacking, judges query stacking.The invention firstly uses the collision bits that outgoing label is accurately positioned in Manchester's code, its collision bit is gone out to j bit length tag extraction and forms the new position k tag ID, the thus significantly less transmission of unused bits positions, and all collision bits of label is allowed to be connected in together, dynamic quadtree is taken to be identified again, reader sends the order of XOR XOR operation to label, inquiry prefix is redefined according to label return information, less free timeslot number and reader queries number, throughput is increased, system identification efficiency is improved.
Description
Technical field
The present invention relates to a kind of enhanced quaternary tree anti-collision algorithms suitable for RFID system, belong to radio frequency identification
In label collision prevention technology.
Background technique
Radio RF recognition technology (Radio Frequency Identification, RFID) is twentieth century 90 years
A kind of non-contact automatic identification technology that generation rises, the basic principle is that utilizing radiofrequency signal and Space Coupling (inductance or electricity
Magnetic coupling) transmission characteristic realizes to the automatic identification of identified object.It is obtained by radiofrequency signal automatic identification target object
Related data is taken, information input and processing can be completed without human contact, without optical visible, and simple and quick.
Radio Frequency Identification Technology is of wide application, and is mainly used in the every field such as military, industrial production and daily life.
The composition of radio-frequency recognition system are as follows: label, reader, computer network.In the application of RFID system, when multiple
Electronic tag work is in same frequency, when in the same reader sphere of action, multiple access is not being used to control machine
In the case of system, signal almost will be sent in response to the instruction of reader simultaneously, can thus lead to the problem of signal contention.Signal is mutual
It mutually interferes, reader cannot be properly received data, also cannot correctly identify electronic tag, so that reader misdeems
Accidentally, it is believed that this label is not in the sphere of action of oneself or can not correctly read information, that is, is collided.It is multiple simultaneously to read
Reading working range overlapping between device will also cause to collide, and the anticollision problem between reader is easy to solve, and mainly studies label
Between anticollision problem, the method avoided collision is thus referred to as anti-collision algorithm.The performance of system very great Cheng in many applications
Depend on the anti-collision algorithm of system on degree, thus in order to guarantee RFID system can work normally and efficiently, study anti-collision
Hitting algorithm is very important.
According to the difference of electronic tag working frequency range, there has been proposed different anti-collision algorithms, and it is anti-to be summarized as randomness
Collision algorithm and certainty anti-collision algorithm two major classes, representative algorithm is respectively Aloha method and binary search method.Base
It is a kind of randomness anti-collision algorithm in Aloha algorithm, principle is simple, and it is easily operated, but in certain slot range, system
To the total identification existing probability of label, it mainly includes pure that label, which is easy to produce misjudgement, fails to judge, " label is hungry to death " phenomenon,
Aloha algorithm, Slot-aloha algorithm, frame slot Aloha algorithm, dynamic frame Slot-aloha algorithm and innovatory algorithm.Binary system
Anti-collision algorithm is deterministic algorithm, will not generate " label is hungry to death " phenomenon, to the discrimination for having 100% on Label Theory, mainly
Including binary search algorithm, Dynamic binary searching algorithm, retrusive radix-2 algorithm, great-jump-forward binary algorithm and
Its adaptive algorithm, all kinds of innovatory algorithms.
Applicant once furtherd investigate anti-collision algorithm, and proposed a kind of multiway tree anti-collision algorithm, i.e., China is special
Benefit number discloses the multiway tree anti-collision algorithm suitable for RFID system for ZL201310133747.X；Algorithm steps include algorithm
Agreement, detection collision, selects way of search, determines prefix, determines prefix storehouse initialization prefix storehouse, finally makes prefix heap
Stack is sky, and algorithm terminates.The invention judges the adjacent number situation of collision bit using reader, when no free time is adaptive selected
The way of search of the Octree of gap or quaternary tree or binary tree, accelerates search speed, is judging that there are three adjacent collisions
The transmission of data thereafter is truncated behind position immediately, using counter in the adjacent collision bit of transmission time internal feedback of several bits
Lowest order, not only reduce the transmission of data, energy consumption reduced, and eliminate free timeslot, when shortening identification
Between.
Summary of the invention
It is an object of the invention to often, transmit for entire query process reader queries existing in the prior art
In place of the deficiencies of bit number is more, a kind of enhanced quaternary tree anti-collision algorithm suitable for RFID system is provided.This method is
Enhanced anti-collision algorithm towards RFID QuadTree algorithm, first extracts collision bit, forms new label, and another rule uses efficiency
Higher dynamic quadtree searching algorithm.Inquiry times and transmitted bit number are drastically reduced, throughput is improved, it is less
Recognition time, especially advantage is more obvious when number of tags, digit are more, significantly improves the anti-collision of system
Energy.
The technical solution adopted by the invention is as follows:
A kind of enhanced quaternary tree anti-collision algorithm suitable for RFID system, it is unique for arranging each tag ID, including
Following steps:
Step 1) initial interrogation storehouse: the prefix storehouse of initiating reader is allowed to as sky, and then reader is to work
All labels in range send the request command REQUEST(NULL containing search sequence), all labels respond and return to itself
ID is to reader；
Step 2 detects collision bit: reader decodes the id information that each label returns using Manchester's code,
Identify collision bit, by position of collision 1 all in the search sequence of j bit length, other positions 0 form new order hair
Label is given, self ID is compared with the order after receiving this order for label, extracts pair that tag ID number is 1
It answers position to form the new position k tag ID, is used for dynamic quadtree way of search during the collision recognition of subsequent step；
Step 3) determines inquiry prefix: all collision bits connect together at this time, directly adopt dynamic quadtree search, at this time
Reader first sends XOR order to label, and returns to message from REQUEST(00), REQUEST(01), REQUEST according to label
(10), REQUEST(11) determine new querying command；
Step 4) inquires prefix stacking: new querying command being pressed into storehouse, is sent to by the sequence by stack bottom to stack top
Label meets the label response of querying command；
Step 5) judges query stacking: judging whether stack command is empty, if not empty, then return step 3) continue to know
Not；If it is empty, then entire identification process terminates.
The present invention further illustrates, after identifying tag-collision position by Manchester's code in the step 2, passes through
The phase that reader is sent and position corresponding to order extraction 1, form the new position k tag ID, all collision bits of label are connected in
After together, then take dynamic quadtree way of search.
The present invention further illustrates that reader sends XOR order to label in the step 3), is responded and is tied according to label
Fruit, reader send different inquiry prefixes to label:
If result only has 1, reader transmission inquiry prefix REQUEST (00, DH), REQUEST(11, DH) label is given,
Then label is compared prefix is inquired with from height two, highest two be 00 label return self ID to reader into
The identification of row next step, highest two be 11 label also return to self-ID information to reader carry out next step identification；
If result only has 0, reader sends inquiry prefix REQUEST(01, DH), REQUEST(10, DH) to label；
If result existing 0 has 1 again, reader sends inquiry prefix REQUEST(01, DH), REQUEST(10, DH),
REQUEST(00, DH), REQUEST(11, DH) give label.
Advantages of the present invention:
1. detecting the collision bit of all labels first with Manchester's code, formed in all collision bits of extraction new
Label, the not only significantly less transmission of unused bits positions save the query process time, more conducively the knowledge to label in next step
Other process.If tag ID position is for 128,256 or more, this advantage for simplifying step can be obtained more obviously
It shows.
2. due to introducing collision bit XOR operation order in the identification process of pair label, when avoiding generating the extra free time
Gap, thus the present invention when carrying out quaternary tree search every layer search at most only more than binary tree search a free timeslots；Greatly
Reduce free timeslot number greatly, shortens query time, improve system performance.
Detailed description of the invention
Quaternary tree anti-collision algorithm flow chart suitable for RFID system Fig. 1 of the invention.
Label responds schematic diagram after Fig. 2 reader sends Request (NULL) instruction.
Fig. 3 reader sends phase, and label responds schematic diagram afterwards with instruction (01100101).
Label responds schematic diagram after Fig. 4 reader sends XOR instruction.
Label responds schematic diagram after Fig. 5 reader sends Request (00,11) instruction.
Label responds schematic diagram after Fig. 6 reader sends Request (01,11) instruction.
Label responds schematic diagram after Fig. 7 reader sends Request (00,01) instruction.
Label responds schematic diagram after Fig. 8 reader sends Request (01,01) instruction.
Label responds schematic diagram after Fig. 9 reader sends Request (10,01) instruction.
Label responds schematic diagram after Figure 10 reader sends Request (11,01) instruction.
Label responds schematic diagram after Figure 11 reader sends Request (10,11) instruction.
Label responds schematic diagram after Figure 12 reader sends Request (11,11) instruction.
Specific embodiment
The present invention is further described for Fig. 1~12 and specific example with reference to the accompanying drawing.
Arranged first: tag ID is unique, DH is the current adjacent highest order collided in two.Secondly following life is introduced
It enables:
(1) REQUEST (request) is ordered: including REQUEST (NULL), REQUEST (prefix, DH).When reader is sent out
Send REQUEST(11111111) to label when, label is right by comparison by self ID, is less than REQUEST(11111111), then return
Back to reader self ID；Conversely, label is not responding to.Prefix indicates the inquiry prefix that reader is sent to label, takes two
It is 0 and 1 when fork tree, is 00,01,10,11 when taking quaternary tree.DH indicates the highest order of current two collision bit.
(2) SELECT(is selected) order: when reader sends commands to label, label does self ID and querying command
Comparison returns to self ID to reader if being less than or equal to querying command, continues identification process；Conversely, being then not responding to.
(3) READ-DATA(reads data) order: the label chosen by SELECT order, reader are sent out to these labels
READ-DATA order is sent, then label returns to reader self-ID information.
(4) UNSELECT(suspend mode) order: after label sends self ID, reader successfully identifies the label, then sends
UNSELECT dormancy instruction makes it shield any instruction of the later transmission of reader to the label, unless it leaves the reader
Working range.
(5) XOR(exclusive or) order: it extracts after collision bit forms new label, reader is successively to current highest two
Send XOR order.Then label returns to the result after reader exclusive or.If result only has 1, reader sends inquiry prefix
REQUEST (00, DH), REQUEST(11, DH) give label；If result only has 0, reader sends inquiry prefix REQUEST
(01, DH), REQUEST(10, DH) give label；If result existing 0 has 1 again, reader sends inquiry prefix REQUEST(01,
DH), REQUEST(10, DH), REQUEST(00, DH), REQUEST(11, DH) give label.Successfully avoid the sky in quaternary tree
Idle gap reduces transmitted bit number.
Identification process is elaborated below by an example:
The label for being located at reader working range has: G:00111000, H:01011001, I:01111100, J:
00111100, j:00111101, L:00111001, the label to be identified that totally 6 EPC codes are 8, ID number Far Left are highest order
It is the 7th, rightmost is that lowest order is zero-bit.
Step 1) initial interrogation storehouse: initiating reader prefix storehouse is allowed to as sky, and reader is into working range
All labels send the request command REQUEST(NULL containing search sequence), be in this instance REQUEST(11111111),
Label is compared, and sequence number is respectively less than it, and all label responses return to self ID to reader；
Step 2 detects collision bit: reader decodes the id information that label returns using Manchester's code, identifies
Collision situation be 0 ×× 11 × 0 ×, the 6th, the 5th, second, zero-bit collided respectively, reader is according to this
When label collision situation retransmit mutually with order (0,110 0101) to label, label receive after order by this order with from
Body ID carries out phase and operation, and extracts the digital 1 corresponding information of tag ID, just forms new label information and returns to reader；
Six labels of above-mentioned G, H, I, J, j, L new label information corresponding at this time is respectively as follows: A(0100), DH(1001), C(1110), D
(0110), E(0111), F(0101)；Since the 7th, the 4th, third position and first are there is no collision, this four
Information is saved by reader, and present tag ID becomes 4, is equivalent to the collision bit in initial 8 ID is complete
Portion extracts, and currently all collision bit has been connected in together, starts the identification of dynamic quadtree way of search below；
Step 3) determines inquiry prefix: reader sends XOR order and gives current highest two progress XOR operation, is divided into three
Kind situation；
The first: if result only has 1, reader sends inquiry prefix REQUEST (00, DH), REQUEST(11, DH)
To label, then label will inquire prefix with itself highest two be compared, highest two be 00 label return self ID
Information carries out the identification of next step to reader, and highest two are that 11 label also returns to self-ID information and carries out down to reader
The identification of one step；
Second: if result only has 0, reader sends inquiry prefix REQUEST(01, DH), REQUEST(10, DH)
To label；
The third: if result existing 0 has 1 again, reader sends inquiry prefix REQUEST(01, DH), REQUEST
(10, DH), REQUEST(00, DH), REQUEST(11, DH) give label；
In this example, the 2nd and the 3rd progress exclusive or of label, result are 0 and 1, then reader is inquiry prefix
REQUEST(01,11), REQUEST(10,11), REQUEST(00,11), REQUEST(11,11) indentation storehouse, current highest
Collision bit is third position.
Step 4) inquires prefix stacking: new querying command being pressed into storehouse, is sent to by the sequence by stack bottom to stack top
Label meets the label response of querying command；
Specific identification process is as follows:
A) REQUEST(00,11) it pops, no label response.
B) REQUEST(01,11) it pops, label A, D, E, F collide and return to the letter of reader the 2nd, the 3rd
Breath, reader continue to send low two XOR orders to label, and result is 0 and 1, and reader sends inquiry prefix REQUEST(01,
01), REQUEST(10,01), REQUEST(00,01), REQUEST(11,01) give label.REQUEST(00,01) it pops, only
There is label A identical as inquiry prefix, so only A responds reader, then reader successfully identifies label A, reads the ID letter of A
Breath, makes its suspend mode.
C) REQUEST(01,01) it pops, only label F is identical as inquiry prefix, so only F responds reader, then reads
It reads device and successfully identifies label F, read the id information of F, make its suspend mode.
D) REQUEST(10,01) it pops, only label D is identical as inquiry prefix, so only D responds reader, then reads
It reads device and successfully identifies label D, read the id information of D, make its suspend mode.
E) REQUEST(11,01) it pops, only label E is identical as inquiry prefix, so only E responds reader, then reads
It reads device and successfully identifies label E, read the id information of E, make its suspend mode.
F) REQUEST(10,11) it pops, only label B is identical as inquiry prefix, so only B responds reader, then reads
It reads device and successfully identifies label B, read the id information of B, make its suspend mode.
G) REQUEST(11,11) it pops, only label C is identical as inquiry prefix, so only C responds reader, then reads
It reads device and successfully identifies label C, read the id information of C, make its suspend mode.
Step 5) judges query stacking: judging whether query stacking is sky, and if it is empty, entire identification process terminates；If no
For sky, Step3 is returned) continue to identify.
Finally it should be noted that the present invention is by multidigit label anti-collision algorithm technical staff's Long-Term Scientific Study experience
Accumulation, and gone out by creative work creation.Collision bit is first extracted, new label is formed, another rule is higher using efficiency
Dynamic quadtree drastically reduces inquiry times and transmitted bit number, improves throughput, less recognition time, especially
It is that advantage is more obvious when number of tags, digit are more, significantly improves the anti-collision energy of system.
Claims (3)
1. a kind of enhanced quaternary tree anti-collision algorithm suitable for RFID system, arranging each tag ID is unique, feature
Be, the algorithm the following steps are included:
Step 1) initial interrogation storehouse: the prefix storehouse of initiating reader is allowed to as sky, and then reader is to working range
Interior all labels send the request command REQUEST(NULL containing search sequence), all labels respond and return self ID to
Reader；
Step 2 detects collision bit: reader decodes the ID that each label returns using Manchester's code, identifies and touches
Position is hit, by position of collision 1 all in the search sequence of j bit length, other positions 0 form new order and are sent to label,
Self ID is compared with the order after receiving this order for label, extracts the correspondence position shape that number is 1 in tag ID
The position the k label id information of Cheng Xin, uses for dynamic quadtree way of search during the collision recognition of subsequent step；
Step 3) determines inquiry prefix: all collision bits connect together at this time, directly adopt dynamic quadtree search, read at this time
Device first sends XOR order to label, and returns to message from REQUEST(00), REQUEST(01), REQUEST according to label
(10), REQUEST(11) determine new querying command；
Step 4) inquires prefix stacking: new querying command is pressed into storehouse, is sent to label by the sequence by stack bottom to stack top,
Meet the label response of querying command；
Step 5) judges query stacking: judging whether stack command is empty, if not empty, then return step 3) continue to identify；If
For sky, then entire identification process terminates.
2. the enhanced quaternary tree anti-collision algorithm according to claim 1 suitable for RFID system, it is characterised in that:
After identifying tag-collision position by Manchester's code in the step 2, mark is extracted in phase and the order sent by reader
The corresponding position that number is 1 in ID is signed, the new position k label id information is formed, all collision bits of label is connected together
Afterwards, then dynamic quadtree way of search is taken.
3. the enhanced quaternary tree anti-collision algorithm according to claim 1 suitable for RFID system, it is characterised in that: institute
It states reader in step 3) and sends XOR order to label, according to the different response results of label, reader sends different inquiries
Prefix is to label:
If result only has 0, reader sends inquiry prefix REQUEST (00, DH), REQUEST(11, DH) to label, then
Label is compared prefix is inquired with self ID highest two, and highest two are that 00 label returns to self-ID information to reading
Device carry out next step identification, highest two be 11 label also return to self-ID information to reader carry out next step knowledge
Not；
If result only has 1, reader sends inquiry prefix REQUEST(01, DH), REQUEST(10, DH) to label；
If result existing 0 has 1 again, reader sends inquiry prefix REQUEST(01, DH), REQUEST(10, DH),
REQUEST(00, DH), REQUEST(11, DH) give label, in the present invention, REQUEST(x, y, DH) representated by be meant that:
X, y is inquiry prefix, and DH is the highest order of current two collision bit.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610896194.7A CN106650530B (en) | 2016-10-13 | 2016-10-13 | Enhanced quaternary tree anti-collision algorithm suitable for RFID system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610896194.7A CN106650530B (en) | 2016-10-13 | 2016-10-13 | Enhanced quaternary tree anti-collision algorithm suitable for RFID system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106650530A CN106650530A (en) | 2017-05-10 |
| CN106650530B true CN106650530B (en) | 2019-05-21 |
Family
ID=58856440
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610896194.7A Active CN106650530B (en) | 2016-10-13 | 2016-10-13 | Enhanced quaternary tree anti-collision algorithm suitable for RFID system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106650530B (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107526986B (en) * | 2017-07-28 | 2020-07-28 | 广东农工商职业技术学院(农业部华南农垦干部培训中心) | RFID label anti-collision method and system |
| CN107895130B (en) * | 2017-11-02 | 2020-10-16 | 东南大学 | Self-adaptive multi-branch tree anti-collision method based on collision tree |
| CN108491741B (en) * | 2018-03-12 | 2020-12-29 | 吉林大学 | Bit arbitration query tree anti-collision method based on quadtree |
| CN110210266A (en) * | 2019-05-31 | 2019-09-06 | 成都航空职业技术学院 | Five fork tree search RFID anti-collision method of one kind |
| CN111046685A (en) * | 2019-12-19 | 2020-04-21 | 长江大学 | Grouping paging-based locking type double-prefix probe anti-collision calculation method |
| CN111310488B (en) * | 2020-01-20 | 2023-03-14 | 太原理工大学 | Self-adaptive M-system tree RFID anti-collision method |
| CN111860009B (en) * | 2020-06-30 | 2023-05-09 | 广东海洋大学 | Enhanced binary grouping RFID anti-collision method and system |
| CN112257476B (en) * | 2020-09-30 | 2023-04-14 | 中国航天系统科学与工程研究院 | Hybrid RFID label anti-collision method |
| CN114386439B (en) * | 2020-10-16 | 2024-09-10 | 杭州旗捷科技股份有限公司 | Information anti-collision method, system, equipment and storage medium in radio frequency identification |
| CN112380884B (en) * | 2020-11-13 | 2024-02-23 | 成都航空职业技术学院 | Tree-shaped search RFID anti-collision method for reducing communication complexity |
| CN118211597B (en) * | 2024-05-14 | 2024-09-13 | 江苏红相蓝瑞电力科技有限公司 | Asset information reading method and system for metering device based on RFID technology |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101324916A (en) * | 2008-07-16 | 2008-12-17 | 华南理工大学 | Label recognition anti-collision method for RFID system |
| CN102880843A (en) * | 2012-08-24 | 2013-01-16 | 中国石油大学(华东) | Method for preventing collision of a plurality of labels in radio frequency identification (RFID) system |
| CN103208019A (en) * | 2013-04-17 | 2013-07-17 | 广西南宁市东森动力信息科技有限公司 | Multi-way tree anti-collision algorithm applicable to radio frequency identification (RFID) system |
| CN105956506A (en) * | 2016-04-27 | 2016-09-21 | 蓝盾信息安全技术有限公司 | Improved RFID anti-collision method |
-
2016
- 2016-10-13 CN CN201610896194.7A patent/CN106650530B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101324916A (en) * | 2008-07-16 | 2008-12-17 | 华南理工大学 | Label recognition anti-collision method for RFID system |
| CN102880843A (en) * | 2012-08-24 | 2013-01-16 | 中国石油大学(华东) | Method for preventing collision of a plurality of labels in radio frequency identification (RFID) system |
| CN103208019A (en) * | 2013-04-17 | 2013-07-17 | 广西南宁市东森动力信息科技有限公司 | Multi-way tree anti-collision algorithm applicable to radio frequency identification (RFID) system |
| CN105956506A (en) * | 2016-04-27 | 2016-09-21 | 蓝盾信息安全技术有限公司 | Improved RFID anti-collision method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106650530A (en) | 2017-05-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106650530B (en) | Enhanced quaternary tree anti-collision algorithm suitable for RFID system | |
| Zhang et al. | A novel approach to mapped correlation of ID for RFID anti-collision | |
| Liu et al. | Unknown tag identification in large RFID systems: An efficient and complete solution | |
| CN103902941B (en) | A kind of multi-label anti-collision method mapped based on continuous collision bit | |
| CN102004895B (en) | Time slot scanning anti-collision method based on collision precheck | |
| CN101359358B (en) | Label recognizing system, label accessing device and label sposition determining method | |
| CN103020569B (en) | A kind of radio-frequency identification multi-label anti-collision method | |
| CN103208019A (en) | Multi-way tree anti-collision algorithm applicable to radio frequency identification (RFID) system | |
| CN103020568A (en) | RFID (radio frequency identification) anti-collision method based on tag ID preprocessing | |
| CN103473524A (en) | RFID multi-tag identification method, reader and tags | |
| CN105654010B (en) | A kind of RFID tag collision-proof method based on adaptive search strategies | |
| CN103902942B (en) | A kind of mixing collision-proof method for Large Copacity multi-tag rfid system | |
| CN103065112A (en) | Radio frequency identification (RFID) label anti-collision identification method based on modular arithmetic label classification | |
| CN105046181A (en) | Deterministic anti-collision algorithm based on multi-prefix matching of query tree method | |
| CN107895130B (en) | Self-adaptive multi-branch tree anti-collision method based on collision tree | |
| CN104166867B (en) | A kind of many HASH functions multiframe coupled mode RFID anti-collision algorithms (MHMFG) | |
| Di et al. | A RFID anti-collision algorithm based on multithread regressive-style binary system | |
| CN103971077A (en) | ALOHA anti-collision method of ultrahigh frequency RFID system based on CRC code grouping | |
| CN103679096A (en) | Optimized RFID anti-collision method | |
| CN103455783B (en) | A kind of label anti-collision method based on low redundant search tree | |
| Lu et al. | An improved RFID anti-collision algorithm and its application in food tracking | |
| CN107451635A (en) | A kind of ultrahigh frequency RFID system | |
| CN103942514A (en) | RFID collision avoiding method based on related IDs | |
| Liu et al. | A fast and stable anti-collision algorithm for the EPCglobal UHF Class 1 Generation 2 standard | |
| Li | Application of improved anti-collision algorithm of RFID in warehouse management system |
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 |