CN110188581A - Based on the multi-fork query tree RFID anti-collision method for improving Manchester's code - Google Patents
Based on the multi-fork query tree RFID anti-collision method for improving Manchester's code Download PDFInfo
- Publication number
- CN110188581A CN110188581A CN201910466968.6A CN201910466968A CN110188581A CN 110188581 A CN110188581 A CN 110188581A CN 201910466968 A CN201910466968 A CN 201910466968A CN 110188581 A CN110188581 A CN 110188581A
- Authority
- CN
- China
- Prior art keywords
- manchester
- code
- collision
- rfid
- fork
- 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.)
- Pending
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
Landscapes
- Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Toxicology (AREA)
- Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Electromagnetism (AREA)
- General Health & Medical Sciences (AREA)
- Artificial Intelligence (AREA)
- Computer Vision & Pattern Recognition (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Near-Field Transmission Systems (AREA)
Abstract
The invention discloses a kind of based on the multi-fork query tree RFID anti-collision method for improving Manchester's code, for the problems such as existing RFID tree-shaped anti-collision algorithm searching times are more, recognition speed is slow, Manchester's code is improved, and it is applied in multi-fork query tree RFID anti-collision method, the anticollision search of any fork tree can be achieved, and without any free timeslot, any inquiry time slot is not needed, efficiently solves and collides the contradiction that time slot, free timeslot, inquiry time slot cannot be taken into account in multiway tree search yet.The present invention has less total timeslot number, higher search efficiency and search speed, not only has important theoretical value, it may have biggish practical value has vast potential for future development.
Description
Technical field
The invention belongs to technical field of RFID, and in particular to a kind of based on the multi-fork inquiry for improving Manchester's code
Set the design of RFID anti-collision method.
Background technique
Radio frequency identification (Radio Frequency Identification, RFID) is a kind of non-contact automatic identification skill
Art has many advantages, such as that at low cost, low in energy consumption, amount of storage is big, penetrability is strong, multi-targets recognition, logistics, military affairs, traffic,
The fields such as tourism, medical treatment are widely used, and typical RFID system is usually by electronic tag, reader and background server
Three parts composition, since reader and label share the same wireless channel, when multiple labels are sent out to the same reader simultaneously
Send data, will interfere with each other, here it is tag-collision problems, since tag energy is limited, calculate, processing, storage capacity compared with
Weak, many traditional methods all cannot be used for solving the problems, such as label anti-collision.
Anti-collision algorithm at this stage is mainly based upon time-division multiplex algorithm, can be divided into two classes: based on the probability of ALOHA
Algorithm and deterministic algorithm based on binary tree, ALOHA algorithm is relatively easy, but there are randomnesss big, inefficient, performance
The problems such as unstable, and there are problems that " starvation " caused by not being identified in for a long time due to label；Tree algorithm is true
There is the problems such as search time delay is longer, and search efficiency is lower in the biggish situation of number of labels in deterministic algorithm.
Classical tree-like anti-collision algorithm mainly has: basic binary search tree (Binary Search, BS) algorithm moves
State binary search tree (DBS) algorithm, query tree (Query Tree, QT) algorithm, collision tree (Collision Tree, CT) are calculated
Method, great-jump-forward News Search tree (umping and Dynamic searching, JDS) algorithm, based on the enhanced of search tree
RFID anticollision (Enhanced algorithm Based on Search Tree, EBST) algorithm, the inquiry of adaptive Pruning Away Branches
Set (Adaptive algorithm based on 4-ary Pruning Query Tree, A4PQT) algorithm etc..These algorithms
Label is traversed by binary tree polling mode, label " starvation " problem is not present, can absolutely identify label.
During tree search, reader issues search command, and the label for meeting search condition returns data to reading
Device, search time slot can be divided into following several situations:
(1) identify time slot: only one label returned data, reader can be with Direct Recognition labels.
(2) free timeslot: none of label returned data, this time slot are wasted, therefore should be subtracted as far as possible
Less or avoid free timeslot.
(3) collide time slot: there are two or more than two labels simultaneously returned data, that is, collided, reader is not
It can identify any label.
(4) inquire time slot: in the time slot, reader is in order to know a few, label specific values, and to this several
Data are inquired, and the data that label returns are usually the mapping code of corresponding data position, are mainly used in multiway tree search, inquiry
Time slot increases search time, therefore should reduce to the greatest extent or avoid.
Binary tree search can avoid free timeslot and inquiry time slot, but have more collision time slot, lead to tag search
Often, extend when search.In order to reduce the total time slot of search, raising search rate, many scholars study multiway tree,
But there are free timeslots for multi-fork tree algorithm, free timeslot can be reduced or avoided by the method for inquiring collision bit, but increase
Inquiry time slot.
Tree search algorithm is usually accurately to detect collision bit by Manchester's code, and phase is also in Manchester's code
Position coding, coding mode is to indicate value bit by the change of level, and there is a jump in the centre of each, from low to high
Jump indicates ' 0 ', and jump from high to low indicates ' 1 ', i.e., indicates data bit ' 0 ' by level " 01 ", indicates data by level " 10 "
Position ' 1 ', since each is all modulated into two level, message transmission rate only has the 50% of modulation rate.
Manchester's code can accurately detect collision bit, be widely used in RFID anti-collision algorithm.In fact, above-mentioned
Tree-like anti-collision algorithm is all to detect collision bit using Manchester's code, it is difficult at the same reduce collision time slot, free timeslot,
Time slot and data traffic are inquired, searches for that total time slot is more, and recognition efficiency is lower, total effect is not satisfactory.
Summary of the invention
The purpose of the present invention is to propose to it is a kind of based on improve Manchester's code multi-fork query tree RFID anti-collision method,
Collision bit can accurately be detected and realize the multiway tree search of any fork tree, collision time slot can be reduced, when avoiding the free time completely
Gap does not inquire time slot, does not increase data traffic, and then improve the efficiency of tag search.
The technical solution of the present invention is as follows: based on the multi-fork query tree RFID anti-collision method for improving Manchester's code, packet
Include following steps:
S1, storehouse is set in RFID reader, and initializes storehouse as sky.
S2, null prefix ε is sent to RFID label tag by RFID reader.
S3, the RFID label tag response command that prefix is consistent, and the label that the prefix is later are sent with RFID reader
ID sequence number is sent to RFID reader.
S4, the tag ID sequence number received is converted into improvement Manchester's code in RFID reader.
S5, judgement are improved in Manchester's code and are otherwise entered step with the presence or absence of collision bit if then entering step S6
S7。
S6, data bit using highest collision bit and its before are stored in storehouse as prefix respectively, enter step S8.
S7, identification obtain a RFID label tag, enter step S8.
S8, the stack head data for taking out storehouse.
S9, judge whether storehouse is sky, if then terminating process, otherwise enter step S10.
S10, RFID label tag, return step S3 are sent to using stack head data as prefix.
Further, storehouse is for storing the highest collision bit evidence searched for every time, and deposits by principle first-in last-out
Access evidence.
Further, the coding mode of Manchester's code is improved specifically:
Multilevel code, any one number of the improvement Manchester's code of M system can be realized by improving Manchester's code
It is divided into M equally spaced time slots according to position, wherein M-1 time slot is low level, and 1 time slot is high level, and minimum time slot position is height
Level indicates the symbol " 0 " of M system, and secondary low time slot position is that high level indicates that symbol " 1 " ... the highest time slot position of M system is high electricity
The flat symbol " M-1 " for indicating M system, M are the integer more than or equal to 2.
Further, tag ID sequence number is converted to the formula for improving Manchester's code in step S4 are as follows:
A0*M0+A1*M1+...+AH-1MH-1=B0*20+B1*21+...+BL-1*2L-1
Wherein AH-1…Ai…A1A0Indicate that the M system that length is H improves Manchester's code, BL-1…Bj…B1B0Indicate length
Degree is the binary label ID sequence number of L, Ai∈ { 0,1 ..., M-1 }, Bj∈ { 0,1 }, i=0,1,2 ..., H-1, j=0,1,
2,...,L-1。
Further, judgement improves in Manchester's code with the presence or absence of collision bit in step S5 method particularly includes:
When RFID label tag all or part of in RFID reader sphere of action sends tag ID serial number data simultaneously, sentence
A certain symbol of breaking in the improvement Manchester's code that it is converted into whether there are two or more than two high level, if then existing
Otherwise collision bit is not present in collision bit.
The beneficial effects of the present invention are: the present invention can reduce collision time slot, free timeslot is avoided completely, when not inquiring
Gap reduces amount of communication data, improves recognition efficiency, improve to effectively reduce total time slot of RFID label tag search
Recognition speed is better than existing RFID anti-collision algorithm；In addition, the energy that the present invention consumes label is less, label is not needed
With memory function, not needing label has complicated calculating and processing capacity, convenient for the realization of RFID system collision-proof method
And application, not only there is important theoretical value, it may have biggish practical value has vast potential for future development.
Detailed description of the invention
Fig. 1 show provided in an embodiment of the present invention based on the multi-fork query tree RFID anticollision for improving Manchester's code
Method flow diagram.
Fig. 2 show improvement Manchester's code collision bit detection schematic diagram provided in an embodiment of the present invention.
Fig. 3 show total timeslot number emulation schematic diagram provided in an embodiment of the present invention.
Fig. 4 show search efficiency emulation schematic diagram provided in an embodiment of the present invention.
Fig. 5 show communication delay emulation schematic diagram provided in an embodiment of the present invention.
Fig. 6 show search efficiency contrast schematic diagram provided in an embodiment of the present invention.
Specific embodiment
Carry out detailed description of the present invention illustrative embodiments with reference to the drawings.It should be appreciated that shown in attached drawing and
The embodiment of description is only exemplary, it is intended that is illustrated the principle and spirit of the invention, and is not limited model of the invention
It encloses.
The embodiment of the invention provides it is a kind of based on improve Manchester's code multi-fork query tree RFID anti-collision method,
As shown in Figure 1, including the following steps S1~S10:
S1, storehouse is set in RFID reader, and initializes storehouse as sky.
Storehouse accesses data for storing the highest collision bit evidence searched for every time, and by principle first-in last-out.
S2, null prefix ε is sent to RFID label tag by RFID reader.
S3, the RFID label tag response command that prefix is consistent, and the label that the prefix is later are sent with RFID reader
ID sequence number is sent to RFID reader.
S4, the tag ID sequence number received is converted into improvement Manchester's code in RFID reader.
In the embodiment of the present invention, a kind of improvement Manchester's code, coding mode are proposed specifically:
Multilevel code, any one number of the improvement Manchester's code of M system can be realized by improving Manchester's code
It is divided into M equally spaced time slots according to position, wherein M-1 time slot is low level, and 1 time slot is high level, and minimum time slot position is height
Level indicates the symbol " 0 " of M system, and secondary low time slot position is that high level indicates that symbol " 1 " ... the highest time slot position of M system is high electricity
The flat symbol " M-1 " for indicating M system, M are the integer more than or equal to 2.
For example, the improvement Manchester's code of 4 systems, time slot level " 0001 " indicates that " 0 " of 4 systems, " 0010 " indicate
" 1 ", " 0100 " expression " 2 ", " 1000 " expression " 3 ".It can thus be seen that improving Manchester's code is to existing Manchester
The extension of coding, as M=2, binary improvement Manchester's code is exactly existing Manchester's code.
Therefore tag ID sequence number is converted to the formula for improving Manchester's code in step S4 are as follows:
A0*M0+A1*M1+...+AH-1MH-1=B0*20+B1*21+...+BL-1*2L-1 (1)
Wherein AH-1…Ai…A1A0Indicate that the M system that length is H improves Manchester's code, BL-1…Bj…B1B0Indicate length
Degree is the binary label ID sequence number of L, Ai∈ { 0,1 ..., M-1 }, Bj∈ { 0,1 }, i=0,1,2 ..., H-1, j=0,1,
2,...,L-1。
S5, judgement are improved in Manchester's code and are otherwise entered step with the presence or absence of collision bit if then entering step S6
S7。
Each of improvement Manchester's code due to M system symbol all one and only one high level, work as
When all or part of RFID label tag sends tag ID serial number data simultaneously in RFID reader sphere of action, judge that it is converted into
Improvement Manchester's code in a certain symbol whether there are two or more than two high level, it is no if then there is collision bit
Collision bit is then not present.
The representation method of crash data position: by taking the improvement Manchester's code of 4 systems as an example: certain data bit collides,
The reception data bit can use X0123Form indicate: X indicates that the data bit is collision bit, and subscript indicates to receive improvement simultaneously graceful
Che Site coding: " 0 ", " 1 ", " 2 " and " 3 ".Similarly, X023Indicate that the data bit is to receive the collision of " 0 ", " 2 ", " 3 " simultaneously
Position.
For example, if receiving the improvement Manchester's code of 4 systems simultaneously: " 3 " and " 0 ", " 3 " are by level " 1000 " table
Show, " 0 " is indicated by level " 0001 ", then the data level received is " 1001 ", two high level occurs in a symbol, can
Judgement is collided, and the collision bit evidence received is denoted as: X03, indicate while receiving improvement Manchester's code
" 0 " and " 3 ".
Assuming that there is 4 labels, binary system ID be respectively as follows: " 01011011 ", " 11010001 ", " 00010111 ",
" 10010011 ", corresponding 4 system improve Manchester's code and are respectively as follows: " 1123 ", " 3101 ", " 0113 ", " 2103 ", utilize
Manchester's code is improved, RFID reader can go out collision bit with accurate detection, as shown in Figure 2.As seen from Figure 2, it connects
The data received share 3 improvement manchester encoded datas and collide, and can indicate are as follows: X0123 1 X012X13。
S6, data bit using highest collision bit and its before are stored in storehouse as prefix respectively, enter step S8.
S7, identification obtain a RFID label tag, enter step S8.
S8, the stack head data for taking out storehouse.
S9, judge whether storehouse is sky, if then terminating process, otherwise enter step S10.
S10, RFID label tag, return step S3 are sent to using stack head data as prefix.
Fundamental design idea of the invention is that search range is gradually reduced by tree search, until identifying that RFID is marked
Label.The specific data of some collision bit can accurately be predicted by improving Manchester's code, when detect collide when, can be with
Detection label is divided into several subsets according to highest collision bit, by stack access prefix, successively searches for each subset, if
There is collision, further according to highest collision bit the subset is split into several smaller subsets down and identify one if collisionless
A label, then pop-up a stack data, continue the search of other subsets, and so on, until identifying all labels.
Specific implementation process of the invention is described further so that 4 systems improve Manchester's code as an example below.
Assuming that there is 8 RFID label tags in RFID reader sphere of action, tag ID binary data bit is 10, then its 4
It is 5 that system, which improves Manchester's code, as shown in table 1.
1 label of table and its ID sequence number
Process of the invention is as shown in table 2, and 8 RFID label tags, total time slot only has 6 times.It is searched in the 2nd time, the 5th, the 6th time
In rope time slot, only one collision bit can the multiple labels of Direct Recognition.It is worth noting that: 4 systems improve Manchester's code
Do not increase data communication time, in fact, label sends identical ID data, 4 systems improve Manchester's code and existing
The call duration time of Manchester code is identical, but improves the query tree collision-proof method of Manchester's code significantly based on 4 systems
Reduce total recognition time.
The search process of the present invention of table 2
As can be seen that the present invention is simple and efficient, in entire algorithmic procedure, RFID label tag be not directed to complicated calculating and
Treatment process, and this conforms exactly to the requirement of RFID anti-collision algorithm: algorithm is simple as far as possible, do not need label have it is too high
It calculates, storage capacity.
Below with MATLAB software to provided by the invention based on the multi-fork query tree RFID for improving Manchester's code
Collision-proof method is emulated, simulated conditions are as follows: number of tags: 10,40,70,100, label binary system ID digit: 96
Position, multiway tree are 2-10 fork tree, and clock frequency: 96KHZ is emulated 100 times and is averaged.
Fig. 3 is the total timeslot number analogous diagram of the present invention, it will thus be seen that
(1) influence of the number of labels to total timeslot number: number of labels is more, and total timeslot number is bigger.When number of labels is more
When, with increasing for fork tree, total timeslot number decline is more apparent；When number of labels is less, with increasing for fork tree, total timeslot number
Suppression ratio is more gentle.
(2) influence of the different fork trees to total timeslot number: fork tree is bigger, and total timeslot number is fewer, with increasing for fork tree, when total
Gap declines by obviously moving towards relaxation.
When number of labels is 100, total timeslot number of binary tree RFID anti-collision method is that 199,10 forks set RFID anti-collision
The total timeslot number for hitting method is 131, is compared with the binary tree algorithm based on existing Manchester code, is improved based on 10 systems graceful thorough
Total timeslot number of 10 fork tree RFID anti-collision methods of Si Te coding reduces 68, and total timeslot number has dropped 34.1%.
Fig. 4 is search efficiency analogous diagram of the present invention, it will thus be seen that
(1) influence of the number of labels to search efficiency: number of labels influences search efficiency little.
(2) influence of the different fork trees to search efficiency: search efficiency increases with the increase of fork tree, but with fork tree
Increase, search efficiency increase eases up.
When number of labels is 100, the throughput of binary tree RFID anti-collision method is 50.3%, 10 fork tree RFID anti-collisions
The throughput for hitting method is 76.3%, is compared with the binary tree algorithm based on existing Manchester code, is improved based on 10 systems graceful
The search efficiency of 10 fork tree RFID anti-collision methods of Che Site coding improves 51.9%.
Fig. 5 is communication delay analogous diagram of the present invention, it will thus be seen that
(1) influence of the number of labels to communication delay: number of labels is bigger, and communication delay is longer.It is larger in number of labels
When, communication delay significant changes with the variation of fork tree, when number of labels is smaller, communication delay is unwise to fork tree variation
Sense changes relatively stable.
(2) influence of the different fork trees to communication delay: in the RFID anti-collision method no more than 10 fork tree, based on graceful thorough
The binary tree RFID anti-collision method of Si Te coding has maximum communication delay, improves the 4 of Manchester's code based on 4 systems
After there is fork tree RFID anti-collision method the smallest communication delay, 4 forks to set, with increasing for fork tree, communication delay gradually increases
Greatly.
When number of labels is 100, the communication delay of binary tree RFID anti-collision method is 200ms, 4 fork tree RFID anti-collisions
The communication delay for hitting method is 160ms, is compared with the binary tree algorithm based on existing Manchester code, is improved based on 4 systems graceful
The communication delay of 4 fork tree RFID anti-collision methods of Che Site coding reduces 40ms, and communication delay has dropped 20%.
In RFID anti-collision algorithm, search efficiency is a very important index, and Fig. 6 is 4 fork tree RFID anticollisions
Method and other existing algorithm search efficiency comparative figures, as seen from Figure 6,4 fork tree RFID anti-collision methods have highest search
Efficiency, search efficiency are apparently higher than other algorithms, in conjunction with Fig. 4 it is found that with the increase that fork is set, search efficiency of the invention
It is increasing and is compared with other algorithms, with greater advantage.
In summary, the multi-fork query tree RFID anti-collision method provided by the invention based on improvement Manchester's code,
The total time slot for reducing RFID label tag search, reduces amount of communication data, improves recognition efficiency, improve recognition speed, excellent
In existing RFID anti-collision algorithm；In addition, the energy that the present invention consumes label is less, not needing label has memory function
Can, not needing label has complicated calculating and processing capacity, convenient for the implementation and application of RFID system collision-proof method, not only
With important theoretical value, it may have biggish practical value has vast potential for future development.
Those of ordinary skill in the art will understand that the embodiments described herein, which is to help reader, understands this hair
Bright principle, it should be understood that protection scope of the present invention is not limited to such specific embodiments and embodiments.This field
Those of ordinary skill disclosed the technical disclosures can make according to the present invention and various not depart from the other each of essence of the invention
The specific variations and combinations of kind, these variations and combinations are still within the scope of the present invention.
Claims (5)
1. based on the multi-fork query tree RFID anti-collision method for improving Manchester's code, which comprises the following steps:
S1, storehouse is set in RFID reader, and initializes storehouse as sky；
S2, null prefix ε is sent to RFID label tag by RFID reader；
S3, the RFID label tag response command that prefix is consistent, and the tag ID sequence that the prefix is later are sent with RFID reader
Row number is sent to RFID reader；
S4, the tag ID sequence number received is converted into improvement Manchester's code in RFID reader；
Otherwise S5, judgement, which improve in Manchester's code, enters step S7 if then entering step S6 with the presence or absence of collision bit；
S6, data bit using highest collision bit and its before are stored in storehouse as prefix respectively, enter step S8；
S7, identification obtain a RFID label tag, enter step S8；
S8, the stack head data for taking out storehouse；
S9, judge whether storehouse is sky, if then terminating process, otherwise enter step S10；
S10, RFID label tag, return step S3 are sent to using stack head data as prefix.
2. multi-fork query tree RFID anti-collision method according to claim 1, which is characterized in that the storehouse is for storing
The highest collision bit evidence searched for every time, and data are accessed by principle first-in last-out.
3. multi-fork query tree RFID anti-collision method according to claim 1, which is characterized in that described improvement Manchester
The coding mode of coding specifically:
Any one data bit of the improvement Manchester's code of M system is divided into M equally spaced time slots, wherein M-1 time slot
For low level, 1 time slot is high level, and minimum time slot position is the symbol " 0 " that high level indicates M system, and secondary low time slot position is height
Level indicates that symbol " 1 " ... the highest time slot position of M system is the symbol " M-1 " that high level indicates M system, and M is more than or equal to 2
Integer.
4. multi-fork query tree RFID anti-collision method according to claim 3, which is characterized in that will mark in the step S4
Label ID sequence number is converted to the formula for improving Manchester's code are as follows:
A0*M0+A1*M1+...+AH-1MH-1=B0*20+B1*21+...+BL-1*2L-1
Wherein AH-1…Ai…A1A0Indicate that the M system that length is H improves Manchester's code, BL-1…Bj…B1B0Indicate that length is
The binary label ID sequence number of L, Ai∈ { 0,1 ..., M-1 }, Bj∈ { 0,1 }, i=0,1,2 ..., H-1, j=0,1,
2,...,L-1。
5. multi-fork query tree RFID anti-collision method according to claim 3, which is characterized in that judge in the step S5
It improves in Manchester's code with the presence or absence of collision bit method particularly includes:
When RFID label tag all or part of in RFID reader sphere of action sends tag ID serial number data simultaneously, it is judged
In the improvement Manchester's code being converted into a certain symbol whether there are two or more than two high level, if then exist collision
Otherwise collision bit is not present in position.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910466968.6A CN110188581A (en) | 2019-05-31 | 2019-05-31 | Based on the multi-fork query tree RFID anti-collision method for improving Manchester's code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910466968.6A CN110188581A (en) | 2019-05-31 | 2019-05-31 | Based on the multi-fork query tree RFID anti-collision method for improving Manchester's code |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110188581A true CN110188581A (en) | 2019-08-30 |
Family
ID=67719353
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910466968.6A Pending CN110188581A (en) | 2019-05-31 | 2019-05-31 | Based on the multi-fork query tree RFID anti-collision method for improving Manchester's code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110188581A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115225423A (en) * | 2022-07-22 | 2022-10-21 | 四川灵通电讯有限公司 | Two-wire system inter-device communication method based on polarity Manchester code |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170061176A1 (en) * | 2015-04-08 | 2017-03-02 | Fractal Antenna Systems, Inc. | Fractal plasmonic surface reader antennas |
| CN108537079A (en) * | 2018-03-12 | 2018-09-14 | 吉林大学 | A kind of adaptive bifurcated query tree multi-label anti-collision method based on impact factor |
| CN109241802A (en) * | 2018-09-25 | 2019-01-18 | 西南科技大学 | A kind of multi-tag recognition methods for mobile RFID system |
-
2019
- 2019-05-31 CN CN201910466968.6A patent/CN110188581A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170061176A1 (en) * | 2015-04-08 | 2017-03-02 | Fractal Antenna Systems, Inc. | Fractal plasmonic surface reader antennas |
| CN108537079A (en) * | 2018-03-12 | 2018-09-14 | 吉林大学 | A kind of adaptive bifurcated query tree multi-label anti-collision method based on impact factor |
| CN109241802A (en) * | 2018-09-25 | 2019-01-18 | 西南科技大学 | A kind of multi-tag recognition methods for mobile RFID system |
Non-Patent Citations (1)
| Title |
|---|
| 《电视技术》: ""无空闲时隙的 ＲFID 三叉树搜索防碰撞算法"", 《电视技术》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115225423A (en) * | 2022-07-22 | 2022-10-21 | 四川灵通电讯有限公司 | Two-wire system inter-device communication method based on polarity Manchester code |
| CN115225423B (en) * | 2022-07-22 | 2023-09-26 | 四川灵通电讯有限公司 | Two-wire system device-to-device communication method based on polar Manchester code |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8477016B2 (en) | Method for identifying tags using adaptive binary tree splitting technique in RFID system and RFID system therefore | |
| CN103020568B (en) | Based on the pretreated RFID anti-collision method of label ID | |
| CN101840489A (en) | Multi-tag identification anti-collision method based on collision tree | |
| CN104517087A (en) | RFID multi-label identification anti-collision method | |
| CN103065112B (en) | Based on the RFID label tag anticollision recognition methods of modular arithmetic labeling | |
| CN103473524A (en) | RFID multi-tag identification method, reader and tags | |
| CN103020569B (en) | A kind of radio-frequency identification multi-label anti-collision method | |
| CN108416241A (en) | A kind of double time slot RFID anti-collision algorithms based on search tree | |
| Liu et al. | An adaptive tag anti-collision protocol in RFID wireless systems | |
| CN103218635B (en) | A kind of RFID anti-collision method based on mixing multiway tree search | |
| CN107895130A (en) | A kind of adaptive multiway tree collision-proof method based on collision tree | |
| CN103870782A (en) | Anti-collision method based on label confliction IDs | |
| CN110188581A (en) | Based on the multi-fork query tree RFID anti-collision method for improving Manchester's code | |
| CN111046685A (en) | Grouping paging-based locking type double-prefix probe anti-collision calculation method | |
| CN103679092A (en) | An RFID anti-collision algorithm based on a feedback mechanism | |
| CN101650770A (en) | Binary search anti-collision method with unknown label quantity estimation function | |
| CN102663332B (en) | Multi-label anti-collision guiding identification method for RFID system | |
| CN108090386A (en) | A kind of multicycle RFID anti-collision algorithm decomposed based on binary tree | |
| CN117113804A (en) | RFID lost tag identification method based on tree splitting | |
| CN107526986A (en) | A kind of RFID label tag collision-proof method and system | |
| CN110210266A (en) | Five fork tree search RFID anti-collision method of one kind | |
| CN109543477A (en) | Adaptive multiway tree anti-collision algorithm based on mapping code | |
| Kalache et al. | Performances comparison of RFID anti-collision algorithms | |
| Shao et al. | An improved dynamic adaptive multi-tree search anti-collision algorithm based on RFID | |
| Alotaibi et al. | Tag anti-collision algorithms in RFID systems-a new trend |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190830 |
|
| RJ01 | Rejection of invention patent application after publication |