CN105205425A - Multi-tree-based RFID anti-collision method - Google Patents
Multi-tree-based RFID anti-collision method Download PDFInfo
- Publication number
- CN105205425A CN105205425A CN201510732141.7A CN201510732141A CN105205425A CN 105205425 A CN105205425 A CN 105205425A CN 201510732141 A CN201510732141 A CN 201510732141A CN 105205425 A CN105205425 A CN 105205425A
- Authority
- CN
- China
- Prior art keywords
- rfid label
- label tag
- collision
- sequence
- rfid
- 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
Abstract
The application of the invention discloses a multi-tree-based RFID anti-collision method which comprises the following steps: classifying the RFID labels with the same collision bit matching prefix into the same category; carrying out query operation on all RFID labels in each category sequentially according to the time sequence; when carrying out query operation on any category of RFID labels, judging whether collision information is generated or not and whether the number of collision bits of the collision information is greater than one or not: if no, identifying all RFID labels in the category; if yes, reconstructing the collision bit matching prefix of each RFID label in the category, until all RFID labels in the identified area are identified. According to the application of the invention, the multi-tree-based query mechanism is adopted to identify the RFID labels in each category, so that the purpose of correct identification and treatment to a plurality of RFID labels is realized.
Description
Technical field
The present invention relates to radio RF recognition technology field, particularly a kind of RFID anti-collision method based on multiway tree.
Background technology
RFID (RFID, i.e. RadioFrequencyIdentification, radio frequency identification) technology, as a kind of communication technology, by non-contacting mode, identifies RFID label tag and reads and writes the related data in RFID label tag.
Along with the development of RFID technique application, a RFID reader needs to carry out identifying processing to multiple RFID label tag usually.When RFID reader sends query statement to group RFID label tag of in certain limit, two or more RFID label tag may be there is respond the query statement that reader sends simultaneously, thus cause the mutual interference between data message, greatly reduce recognition speed and the recognition efficiency of reader thus.
Can find out in sum, how realizing carrying out accurate identifying processing to multiple RFID label tag is current problem demanding prompt solution.
Summary of the invention
In view of this, the object of the present invention is to provide a kind of RFID anti-collision method based on multiway tree, achieve the object of multiple RFID label tag being carried out to accurate identifying processing.Its concrete scheme is as follows:
Based on a RFID anti-collision method for multiway tree, comprising:
Step S11: simultaneously query manipulation is carried out to all RFID label tag be identified on region;
Step S12: make K
ifor positive integer, wherein, i ∈ 1,2 ..., N}, and K
i+1be greater than K
i; The all RFID label tag be identified described in judgement on region whether produce collision information after replying the query manipulation in step S11 and the quantity of the collision position of this collision information is greater than one, if not, then the described all RFID label tag be identified on region are identified, and terminate, if, be identified the collision position coupling prefix that each RFID label tag on region is corresponding described in then obtaining, this collision position coupling prefix is the front K of the collision bit sequence of RFID label tag
iindividual sequence number, herein i=1, wherein, the collision bit sequence of arbitrary RFID label tag is sequence corresponding with the collision position of the collision information produced in step S12 in position in the sequence label of this RFID label tag;
Step S13: respectively the RFID label tag with identical collision position coupling prefix is divided into a class, correspondingly obtains the RFID label tag of more than a class or a class;
Step S14: according to time order and function order, carries out query manipulation to all RFID label tag in each the class RFID label tag obtained in step S13 successively; When carrying out query manipulation to arbitrary class RFID label tag, the all RFID label tag judging in such RFID label tag whether produce collision information after replying this query manipulation and the quantity of the collision position of this collision information is greater than one, if not, then all RFID label tag in such RFID label tag are identified, if, then make i=i+1, and re-constructing the collision position coupling prefix of each RFID label tag in such RFID label tag, this collision position coupling prefix is the front K of the collision bit sequence of RFID label tag
iindividual sequence number, and enter step S13, until described in all RFID label tag be identified on region be identified complete.
Preferably, step S11 specifically comprises: empty process to OPEN table and memory block; To the described all RFID label tag transmission Request order be identified on region, wherein, arbitrary RFID label tag needs to return the sequence label of self after receiving described Request order.
Preferably, in step S12, be identified the process of collision position coupling prefix corresponding to each RFID label tag on region described in described acquisition, comprise:
Utilize the collision information that step S12 obtains, construct corresponding latched position parameter, and be identified all RFID label tag on region described in being sent to by the lock command comprising described latched position parameter; Wherein, arbitrary RFID label tag needs to return First ray after receiving described lock command; This First ray comprises the first coded sequence and the first residue sequence; The first coded sequence that arbitrary RFID label tag returns is that this RFID label tag is to K before collision bit sequence
1the sequence that individual sequence number obtains after encoding; The first residue sequence that arbitrary RFID label tag returns is K before removing in the collision bit sequence of this RFID label tag
1sequence remaining after individual sequence number;
The first coded sequence returned after receiving described lock command to each RFID label tag is decoded, and correspondingly obtains the collision position coupling prefix that each RFID label tag is corresponding.
Preferably, step S13 specifically comprises:
Respectively the RFID label tag with identical collision position coupling prefix is divided into a class, and the collision position coupling prefix corresponding to same class RFID label tag is stored to described OPEN shows, correspondingly obtain the RFID label tag of more than a class or a class.
Preferably, in step S14, described according to time order and function order, successively all RFID label tag in each the class RFID label tag obtained in step S13 are carried out to the process of query manipulation, comprising:
According to time order and function order, all RFID label tag in each the class RFID label tag obtained in step S13 successively send Request (R-UID) order, wherein, the Request (R-UID) corresponding with arbitrary class RFID label tag orders and includes R-UID parameter, it is identical that prefix is mated in this R-UID parameter and the collision position corresponding to such RFID label tag, and, whenever sending corresponding Request (R-UID) to arbitrary class RFID label tag and ordering, all need delete from described OPEN table orders corresponding collision position to mate prefix with this Request (R-UID), and this collision position coupling prefix is stored to described memory block,
After each RFID label tag in arbitrary class RFID label tag receives corresponding Request (R-UID) order, return corresponding second sequence; This second sequence is the sequence that this RFID label tag obtains according to current residual collision sequence; The current residual collision sequence of this RFID label tag is remove from the collision bit sequence this RFID label tag the sequence obtained after the collision position coupling prefix of this RFID label tag current;
Wherein, the second sequence that arbitrary RFID label tag returns comprises the second coded sequence and the second residue sequence; The second coded sequence that arbitrary RFID label tag returns is the sequence that this RFID label tag obtains after encoding n sequence number before current residual collision sequence, n=K
i+1-K
i; The second residue sequence that arbitrary RFID label tag returns is sequence remaining after n sequence number before removing in the current residual collision sequence of this RFID label tag.
Preferably, after arbitrary RFID label tag is identified, also comprise:
Sleep (S-UID) order is sent to this RFID label tag, to forbid that any instruction to external world of this RFID label tag is replied, wherein, the Sleep (S-UID) corresponding with arbitrary RFID label tag orders and includes S-UID parameter, this S-UID parameter is identical with the collision bit sequence of this RFID label tag, and prefix is mated in the deletion collision position corresponding with this RFID label tag from described memory block.
Preferably, in step S14, described in re-construct each RFID label tag in such RFID label tag collision position coupling prefix process, comprising:
The second coded sequence that each RFID label tag in such RFID label tag returns is decoded, and order corresponding collision position to mate prefix with current Request (R-UID) sequence that obtains after decoding to combine, prefix is mated in the new collision position obtaining this RFID label tag.
Preferably, in step S14, described until described in all RFID label tag be identified on region be identified complete process, comprising: until described OPEN shows as sky.
The invention provides a kind of RFID anti-collision method based on multiway tree, comprising: step S11: carrying out query manipulation to being identified region simultaneously; Step S12: make K
ifor positive integer, wherein, i ∈ 1,2 ..., N}, and K
i+1be greater than K
i; Judge whether to produce collision information and the quantity of the collision position of this collision information is greater than, if not, then all RFID label tag be identified on region are identified, and terminate, if, then obtain the collision position coupling prefix that each RFID label tag is corresponding, this collision position coupling prefix is the front K of the collision bit sequence of RFID label tag
iindividual sequence number, herein i=1; Step S13: respectively the RFID label tag with identical collision position coupling prefix is divided into a class; Step S14: according to time order and function order, carries out query manipulation to all RFID label tag in each the class RFID label tag obtained in step S13 successively; When carrying out query manipulation to arbitrary class RFID label tag, judge whether to produce collision information and the quantity of the collision position of this collision information is greater than, if not, then all RFID label tag in such RFID label tag are identified, if, then make i=i+1, and re-construct the collision position coupling prefix of each RFID label tag in such RFID label tag, this collision position coupling prefix is the front K of the collision bit sequence of RFID label tag
iindividual sequence number, and enter step S13, until all RFID label tag be identified on region are identified complete.Visible, the present invention is by producing collision information each other and all RFID label tag that the quantity of colliding position is greater than carry out the classification of one or many, then according to time order and function order, query manipulation is again carried out to each class RFID label tag, thus form a kind of multiway tree inquiry mechanism, until each class RFID label tag is all successfully identified, thus the identification work completed being identified RFID label tag all on region, thus achieve the object of multiple RFID label tag being carried out to accurate identifying processing.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, be briefly described to the accompanying drawing used required in embodiment or description of the prior art below, apparently, accompanying drawing in the following describes is only embodiments of the invention, for those of ordinary skill in the art, under the prerequisite not paying creative work, other accompanying drawing can also be obtained according to the accompanying drawing provided.
Fig. 1 is a kind of RFID anti-collision method process flow diagram based on multiway tree disclosed in the embodiment of the present invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, be clearly and completely described the technical scheme in the embodiment of the present invention, obviously, described embodiment is only the present invention's part embodiment, instead of whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art, not making the every other embodiment obtained under creative work prerequisite, belong to the scope of protection of the invention.
The embodiment of the invention discloses a kind of RFID anti-collision method based on multiway tree, shown in Figure 1, the method comprises:
Step S11: simultaneously query manipulation is carried out to all RFID label tag be identified on region;
Step S12: make K
ifor positive integer, wherein, i ∈ 1,2 ..., N}, and K
i+1be greater than K
i; The judgement all RFID label tag be identified on region whether produce collision information after replying the query manipulation in step S11 and the quantity of the collision position of this collision information is greater than one, if not, then all RFID label tag be identified on region are identified, and terminate, if, then obtain and be identified collision position coupling prefix corresponding to each RFID label tag on region, this collision position coupling prefix is the front K of the collision bit sequence of RFID label tag
iindividual sequence number, herein i=1;
Wherein, the collision bit sequence of arbitrary RFID label tag is sequence corresponding with the collision position of the collision information produced in step S12 in position in the sequence label of this RFID label tag;
Step S13: respectively the RFID label tag with identical collision position coupling prefix is divided into a class, correspondingly obtains the RFID label tag of more than a class or a class;
Step S14: according to time order and function order, carries out query manipulation to all RFID label tag in each the class RFID label tag obtained in step S13 successively; When carrying out query manipulation to arbitrary class RFID label tag, the all RFID label tag judging in such RFID label tag whether produce collision information after replying this query manipulation and the quantity of the collision position of this collision information is greater than one, if not, then all RFID label tag in such RFID label tag are identified, if, then make i=i+1, and re-constructing the collision position coupling prefix of each RFID label tag in such RFID label tag, this collision position coupling prefix is the front K of the collision bit sequence of RFID label tag
iindividual sequence number, and enter step S13, until all RFID label tag be identified on region are identified complete.
Embodiments providing a kind of RFID anti-collision method based on multiway tree, comprising: step S11: carrying out query manipulation to being identified region simultaneously; Step S12: make K
ifor positive integer, wherein, i ∈ 1,2 ..., N}, and K
i+1be greater than K
i; Judge whether to produce collision information and the quantity of the collision position of this collision information is greater than, if not, then all RFID label tag be identified on region are identified, and terminate, if, then obtain the collision position coupling prefix that each RFID label tag is corresponding, this collision position coupling prefix is the front K of the collision bit sequence of RFID label tag
iindividual sequence number, herein i=1; Step S13: respectively the RFID label tag with identical collision position coupling prefix is divided into a class; Step S14: according to time order and function order, carries out query manipulation to all RFID label tag in each the class RFID label tag obtained in step S13 successively; When carrying out query manipulation to arbitrary class RFID label tag, judge whether to produce collision information and the quantity of the collision position of this collision information is greater than, if not, then all RFID label tag in such RFID label tag are identified, if, then make i=i+1, and re-construct the collision position coupling prefix of each RFID label tag in such RFID label tag, this collision position coupling prefix is the front K of the collision bit sequence of RFID label tag
iindividual sequence number, and enter step S13, until all RFID label tag be identified on region are identified complete.
Visible, the embodiment of the present invention is by producing collision information each other and all RFID label tag that the quantity of colliding position is greater than carry out the classification of one or many, then according to time order and function order, query manipulation is again carried out to each class RFID label tag, thus form a kind of multiway tree inquiry mechanism, until each class RFID label tag is all successfully identified, thus the identification work completed being identified RFID label tag all on region, thus achieve the object of multiple RFID label tag being carried out to accurate identifying processing.
The embodiment of the invention discloses a kind of RFID anti-collision method based on multiway tree specifically, relative to a upper embodiment, the present embodiment has done further instruction and optimization to technical scheme.Concrete:
The step S11 of a upper embodiment specifically comprises:
Step S111: process is emptied to OPEN table and memory block;
Step S112: send Request order to all RFID label tag be identified on region, wherein, arbitrary RFID label tag needs the sequence label returning self after receiving Request order.It should be noted that in above-mentioned Request order and do not comprise any parameter, the sequence label that only need return self after RFID label tag receives Request order to the device (as RFID reader) sending this Request order just can.
Further, the acquisition in step S12 is identified the process of collision position coupling prefix corresponding to each RFID label tag on region, comprising:
Step S121: utilize the collision information that step S12 obtains, constructs corresponding latched position parameter, and the lock command comprising latched position parameter is sent to all RFID label tag be identified on region; Wherein, arbitrary RFID label tag needs to return First ray after receiving lock command; This First ray comprises the first coded sequence and the first residue sequence; The first coded sequence that arbitrary RFID label tag returns is that this RFID label tag is to K before collision bit sequence
1the sequence that individual sequence number obtains after encoding; The first residue sequence that arbitrary RFID label tag returns is K before removing in the collision bit sequence of this RFID label tag
1sequence remaining after individual sequence number;
Step S122: the first coded sequence returned after receiving lock command to each RFID label tag is decoded, correspondingly obtains the collision position coupling prefix that each RFID label tag is corresponding.
Wherein, above-mentioned lock command is specially Lock (L-UID) order, L-UID parameter is included in arbitrary Lock (L-UID) order, the latched position parameter that this L-UID parameter is also namely above-mentioned, the figure place of this L-UID parameter is identical with the figure place of the sequence label of this RFID label tag, further, the value of position corresponding with the collision bit sequence of this RFID label tag in this L-UID parameter is 1, and the value of all the other is 0; After arbitrary RFID label tag receives Lock (L-UID) order corresponding with it, corresponding First ray will be returned.
In addition, the step S13 of a upper embodiment specifically comprises: respectively the RFID label tag with identical collision position coupling prefix is divided into a class, and the collision position coupling prefix corresponding to same class RFID label tag is stored to OPEN table, correspondingly obtain the RFID label tag of more than a class or a class.
Further, in a upper embodiment step S14 according to time order and function order, successively all RFID label tag in each the class RFID label tag obtained in step S13 are carried out to the process of query manipulation, specifically comprise:
Step S141: according to time order and function order, all RFID label tag in each the class RFID label tag obtained in step S13 successively send Request (R-UID) order, wherein, the Request (R-UID) corresponding with arbitrary class RFID label tag orders and includes R-UID parameter, it is identical that prefix is mated in this R-UID parameter and the collision position corresponding to such RFID label tag, and, whenever sending corresponding Request (R-UID) to arbitrary class RFID label tag and ordering, all need delete from OPEN table orders corresponding collision position to mate prefix with this Request (R-UID), and this collision position coupling prefix is stored to memory block,
Step S142: after each RFID label tag in arbitrary class RFID label tag receives corresponding Request (R-UID) order, return corresponding second sequence; This second sequence is the sequence that this RFID label tag obtains according to current residual collision sequence; The current residual collision sequence of this RFID label tag is remove from the collision bit sequence this RFID label tag the sequence obtained after the collision position coupling prefix of this RFID label tag current;
Wherein, the second sequence that arbitrary RFID label tag returns comprises the second coded sequence and the second residue sequence; The second coded sequence that arbitrary RFID label tag returns is the sequence that this RFID label tag obtains after encoding n sequence number before current residual collision sequence, n=K
i+1-K
i; The second residue sequence that arbitrary RFID label tag returns is sequence remaining after n sequence number before removing in the current residual collision sequence of this RFID label tag.
In the present embodiment, also can comprise further after arbitrary RFID label tag is identified: send Sleep (S-UID) order to this RFID label tag, to forbid that any instruction to external world of this RFID label tag is replied, wherein, the Sleep (S-UID) corresponding with arbitrary RFID label tag orders and includes S-UID parameter, this S-UID parameter is identical with the collision bit sequence of this RFID label tag, and prefix is mated in the deletion collision position corresponding with this RFID label tag from memory block.
In addition, in a upper embodiment step S14, re-construct the process of the collision position coupling prefix of each RFID label tag in such RFID label tag, specifically comprise: the second coded sequence that each RFID label tag in such RFID label tag returns is decoded, and order corresponding collision position to mate prefix with current Request (R-UID) sequence that obtains after decoding to combine, prefix is mated in the new collision position obtaining this RFID label tag.
It is on the basis of such scheme, in a upper embodiment step S14 until all RFID label tag be identified on region are identified complete process is specially: until OPEN table is sky.
The embodiment of the invention discloses a kind of more specifically based on the RFID anti-collision method of multiway tree, supposing to be identified region has six RFID label tag to be identified, and be respectively Tag1 ~ Tag6, the sequence label of each RFID label tag is as follows respectively:
Tag1:00111101；Tag2:01011000；
Tag3:10010101；Tag4:11110010；
Tag5:01011111；Tag6:10010100。
Therefore in the present embodiment, the sequence label of each RFID label tag is 8 bit sequences.
Then, the RFID anti-collision method based on multiway tree in the present embodiment is specific as follows:
Step S211: process is emptied to OPEN table and memory block;
Step S212: send Request order to all RFID label tag (i.e. Tag1 ~ Tag6) be identified on region, after each RFID label tag receives Request order, will return the sequence label of self.Due in above-mentioned six sequence labels except the sequence number of the 4th, all the other sequence number is also incomplete same, it can thus be appreciated that the collision information that this query manipulation obtains is xxx1xxxx, wherein, x represents the position collided, and 1 represents the position do not collided.Like this, the collision bit sequence that each RFID label tag is corresponding is respectively:
Tag1:0011101；Tag2:0101000；
Tag3:1000101；Tag4:1110010；
Tag5:0101111；Tag6:1000100。
Step S221: utilize collision information xxx1xxxx, constructs corresponding latched position parameter 11101111, and the lock command Lock (11101111) comprising latched position parameter 11101111 is sent to all RFID label tag be identified on region; RFID label tag, according to the coding rule shown in table one, constructs corresponding First ray:
Table one
Wherein, shown in table one is the coding rule colliding bit sequence number about three, certainly, according to the application needs of reality, also can apply the coding rule about two collision bit sequence number in the present embodiment, or collide the coding rule of bit sequence number about more than three.
In the present embodiment, First ray comprises the first coded sequence and the first residue sequence; The first coded sequence that arbitrary RFID label tag returns is the sequence obtained after front 3 sequence numbers of this RFID label tag to collision bit sequence are encoded; The first residue sequence that arbitrary RFID label tag returns is sequence remaining after removing front 3 sequence numbers in the collision bit sequence of this RFID label tag; Such as, for Tag1, its collision bit sequence is 0011101, obviously, front 3 sequence numbers of this collision bit sequence are 001, as shown in Table 1, first coded sequence corresponding with 001 is 00000010, the first residue sequence that Tag1 returns is then remove sequence remaining after front 3 sequence numbers 001 from its collision bit sequence 0011101, namely 1101, then and this First ray corresponding to Tag1 label is then 000000101101.In like manner can obtain the First ray corresponding to other RFID label tag.Concrete, the First ray that each RFID label tag returns is respectively:
Tag1:000000101101；Tag2:000001001000；
Tag3:000100000101；Tag4:100000000010；
Tag5:000001001111；Tag6:000100000100。
Step S222: the first coded sequence returned after receiving lock command to each RFID label tag is decoded, correspondingly obtain the collision position coupling prefix that each RFID label tag is corresponding, wherein, corresponding respectively with Tag1 ~ Tag6 collision position is mated prefix and is followed successively by 001,010,100,111,010 and 100.
Step S231: respectively the RFID label tag with identical collision position coupling prefix is divided into a class, also four class RFID label tag are namely obtained, this corresponding to four classes RFID label tag collision position coupling prefix be respectively 001,010,100 and 111, and by corresponding to same class RFID label tag collision position coupling prefix be stored to OPEN table.Also namely, Tag1 is a class, Tag2 and Tag5 be a class, Tag3 and Tag6 is a class, Tag4 is another kind of.
Step S241: according to time order and function order, all RFID label tag in each the class RFID label tag obtained in step S231 successively send Request (R-UID) order, wherein, the Request (R-UID) corresponding with arbitrary class RFID label tag orders and includes R-UID parameter, it is identical that prefix is mated in this R-UID parameter and the collision position corresponding to such RFID label tag, and, whenever sending corresponding Request (R-UID) to arbitrary class RFID label tag and ordering, all need delete from OPEN table orders corresponding collision position to mate prefix with this Request (R-UID), and this collision position coupling prefix is stored to memory block, such as, the class RFID label tag being 010 to collision position coupling prefix sends Request (010) order, and remaining by that analogy.
Step S242: after each RFID label tag in arbitrary class RFID label tag receives corresponding Request (R-UID) order, return corresponding second sequence; This second sequence is the sequence that this RFID label tag obtains according to current residual collision sequence; The current residual collision sequence of this RFID label tag is remove from the collision bit sequence this RFID label tag the sequence obtained after the collision position coupling prefix of this RFID label tag current; Wherein, the second sequence that arbitrary RFID label tag returns comprises the second coded sequence and the second residue sequence; The second coded sequence that arbitrary RFID label tag returns is the sequence obtained after front 3 sequence numbers of this RFID label tag to current residual collision sequence are encoded; The second residue sequence that arbitrary RFID label tag returns is sequence remaining after removing front 3 sequence numbers in the current residual collision sequence of this RFID label tag.
Such as, for Tag1 label, after it receives Request (001) order, the second sequence obtained according to the current residual collision sequence of Tag1 label will be returned, wherein, the current residual collision sequence of Tag1 label is the sequence obtained remove the current collision position coupling prefix 001 of Tag1 label from the collision bit sequence 0011101 of Tag1 label after, is also 1101, the second sequence that Tag1 label is corresponding comprises the second coded sequence and the second residue sequence, wherein, second coded sequence of this label is the sequence obtained after encoding to front 3 sequence numbers (namely 110) of current residual collision sequence 1101, concrete coding rule can see table one, it can thus be appreciated that the second coded sequence corresponding to Tag1 label is 01000000, in addition, the second residue sequence that Tag1 label is corresponding is the sequence obtained after current residual collision sequence 1101 removes front 3 sequence numbers (namely 110), also 1 is, it can thus be appreciated that, the second sequence that Tag1 label is corresponding is 010000001.In like manner, other the second sequence corresponding to RFID label tag just can obtain by that analogy.Concrete, each second sequence corresponding to class RFID label tag is respectively:
Tag1：010000001；
Tag2 and Tag5:000100000 and 100000001;
Tag3 and Tag6:000001001 and 000001000;
Tag4：000000100。
Step S243: wherein, for Tag1 and Tag4 label, after they receive the order of each self-corresponding Request (R-UID) respectively, owing to not producing further collision information, so Tag1 and Tag4 is after making response to respective Request (R-UID) order, next will directly be identified.
And for Tag3 and Tag6, because they belong to of a sort, so they will receive identical Request (R-UID) order, also namely all receive Request (100) order.Because they receive between the rear respective second series (namely 000001001 and 000001000) returned of Request (100) order, although there occurs collision, but because collision position only has one, so can carry out direct identifying processing to Tag3 and Tag6.
For Tag2 and Tag5, they all receive Request (010) order, return to 000100000 and 100000001 separately, obviously collision information is created between above-mentioned two the second sequences returned, and collision position is 3, therefore need the collision position coupling prefix re-constructing Tag2 and Tag5, also be, the second coded sequence in the second sequence return Tag2 and Tag5 label is decoded, correspondingly obtain decoded sequence 100 and 111, and order corresponding collision position to mate prefix 010 with current Request (010) sequence that obtains after decoding to combine, the new collision position coupling prefix obtaining Tag2 label is the new collision position coupling prefix 010111 of 010100 and Tag5 label, then mate prefix for foundation with new collision position, carry out subseries again to Tag2 and Tag5, thus obtain two class RFID label tag, now, Tag2 is as a class label, and Tag5 is as another kind of label, then Request (010100) order is sent to Tag2, after Tag2 makes response to Request (010100) order, because do not produce collision information, therefore Direct Recognition can be carried out to it, in like manner send Request (010111) order to Tag5, and then complete the identification to Tag5 label.
It should be noted that, whenever sending corresponding Request (R-UID) to arbitrary class RFID label tag and ordering, all need delete from OPEN table orders corresponding collision position to mate prefix with this Request (R-UID), and this collision position coupling prefix is stored to memory block; Further, also comprise after arbitrary RFID label tag is identified: send Sleep (S-UID) order, to forbid that any instruction to external world of this RFID label tag is replied to this RFID label tag.
Finally, after judging that OPEN table becomes empty table, just can judge that above-mentioned six RFID label tag are all identified complete, as can be seen here, present invention achieves the object of multiple RFID label tag being carried out to accurate identifying processing.
Finally, also it should be noted that, in this article, the such as relational terms of first and second grades and so on is only used for an entity or operation to separate with another entity or operational zone, and not necessarily requires or imply the relation that there is any this reality between these entities or operation or sequentially.And, term " comprises ", " comprising " or its any other variant are intended to contain comprising of nonexcludability, thus make to comprise the process of a series of key element, method, article or equipment and not only comprise those key elements, but also comprise other key elements clearly do not listed, or also comprise by the intrinsic key element of this process, method, article or equipment.When not more restrictions, the key element limited by statement " comprising ... ", and be not precluded within process, method, article or the equipment comprising described key element and also there is other identical element.
Above a kind of RFID anti-collision method based on multiway tree provided by the present invention is described in detail, apply specific case herein to set forth principle of the present invention and embodiment, the explanation of above embodiment just understands method of the present invention and core concept thereof for helping; Meanwhile, for one of ordinary skill in the art, according to thought of the present invention, all will change in specific embodiments and applications, in sum, this description should not be construed as limitation of the present invention.
Claims (8)
1. based on a RFID anti-collision method for multiway tree, it is characterized in that, comprising:
Step S11: simultaneously query manipulation is carried out to all RFID label tag be identified on region;
Step S12: make K
ifor positive integer, wherein, i ∈ 1,2 ..., N}, and K
i+1be greater than K
i; The all RFID label tag be identified described in judgement on region whether produce collision information after replying the query manipulation in step S11 and the quantity of the collision position of this collision information is greater than one, if not, then the described all RFID label tag be identified on region are identified, and terminate, if, be identified the collision position coupling prefix that each RFID label tag on region is corresponding described in then obtaining, this collision position coupling prefix is the front K of the collision bit sequence of RFID label tag
iindividual sequence number, herein i=1, wherein, the collision bit sequence of arbitrary RFID label tag is sequence corresponding with the collision position of the collision information produced in step S12 in position in the sequence label of this RFID label tag;
Step S13: respectively the RFID label tag with identical collision position coupling prefix is divided into a class, correspondingly obtains the RFID label tag of more than a class or a class;
Step S14: according to time order and function order, carries out query manipulation to all RFID label tag in each the class RFID label tag obtained in step S13 successively; When carrying out query manipulation to arbitrary class RFID label tag, the all RFID label tag judging in such RFID label tag whether produce collision information after replying this query manipulation and the quantity of the collision position of this collision information is greater than one, if not, then all RFID label tag in such RFID label tag are identified, if, then make i=i+1, and re-constructing the collision position coupling prefix of each RFID label tag in such RFID label tag, this collision position coupling prefix is the front K of the collision bit sequence of RFID label tag
iindividual sequence number, and enter step S13, until described in all RFID label tag be identified on region be identified complete.
2. the RFID anti-collision method based on multiway tree according to claim 1, it is characterized in that, step S11 specifically comprises:
Process is emptied to OPEN table and memory block;
To the described all RFID label tag transmission Request order be identified on region, wherein, arbitrary RFID label tag needs to return the sequence label of self after receiving described Request order.
3. the RFID anti-collision method based on multiway tree according to claim 2, is characterized in that, in step S12, is identified the process of collision position coupling prefix corresponding to each RFID label tag on region, comprises described in described acquisition:
Utilize the collision information that step S12 obtains, construct corresponding latched position parameter, and be identified all RFID label tag on region described in being sent to by the lock command comprising described latched position parameter; Wherein, arbitrary RFID label tag needs to return First ray after receiving described lock command; This First ray comprises the first coded sequence and the first residue sequence; The first coded sequence that arbitrary RFID label tag returns is that this RFID label tag is to K before collision bit sequence
1the sequence that individual sequence number obtains after encoding; The first residue sequence that arbitrary RFID label tag returns is K before removing in the collision bit sequence of this RFID label tag
1sequence remaining after individual sequence number;
The first coded sequence returned after receiving described lock command to each RFID label tag is decoded, and correspondingly obtains the collision position coupling prefix that each RFID label tag is corresponding.
4. the RFID anti-collision method based on multiway tree according to claim 3, it is characterized in that, step S13 specifically comprises:
Respectively the RFID label tag with identical collision position coupling prefix is divided into a class, and the collision position coupling prefix corresponding to same class RFID label tag is stored to described OPEN shows, correspondingly obtain the RFID label tag of more than a class or a class.
5. the RFID anti-collision method based on multiway tree according to claim 4, it is characterized in that, in step S14, described according to time order and function order, successively all RFID label tag in each the class RFID label tag obtained in step S13 are carried out to the process of query manipulation, comprising:
According to time order and function order, all RFID label tag in each the class RFID label tag obtained in step S13 successively send Request (R-UID) order, wherein, the Request (R-UID) corresponding with arbitrary class RFID label tag orders and includes R-UID parameter, it is identical that prefix is mated in this R-UID parameter and the collision position corresponding to such RFID label tag, and, whenever sending corresponding Request (R-UID) to arbitrary class RFID label tag and ordering, all need delete from described OPEN table orders corresponding collision position to mate prefix with this Request (R-UID), and this collision position coupling prefix is stored to described memory block,
After each RFID label tag in arbitrary class RFID label tag receives corresponding Request (R-UID) order, return corresponding second sequence; This second sequence is the sequence that this RFID label tag obtains according to current residual collision sequence; The current residual collision sequence of this RFID label tag is remove from the collision bit sequence this RFID label tag the sequence obtained after the collision position coupling prefix of this RFID label tag current;
Wherein, the second sequence that arbitrary RFID label tag returns comprises the second coded sequence and the second residue sequence; The second coded sequence that arbitrary RFID label tag returns is the sequence that this RFID label tag obtains after encoding n sequence number before current residual collision sequence, n=K
i+1-K
i; The second residue sequence that arbitrary RFID label tag returns is sequence remaining after n sequence number before removing in the current residual collision sequence of this RFID label tag.
6. the RFID anti-collision method based on multiway tree according to claim 5, is characterized in that, after identifying arbitrary RFID label tag, also comprises:
Sleep (S-UID) order is sent to this RFID label tag, to forbid that any instruction to external world of this RFID label tag is replied, wherein, the Sleep (S-UID) corresponding with arbitrary RFID label tag orders and includes S-UID parameter, this S-UID parameter is identical with the collision bit sequence of this RFID label tag, and prefix is mated in the deletion collision position corresponding with this RFID label tag from described memory block.
7. the RFID anti-collision method based on multiway tree according to claim 6, is characterized in that, in step S14, described in re-construct each RFID label tag in such RFID label tag collision position coupling prefix process, comprising:
The second coded sequence that each RFID label tag in such RFID label tag returns is decoded, and order corresponding collision position to mate prefix with current Request (R-UID) sequence that obtains after decoding to combine, prefix is mated in the new collision position obtaining this RFID label tag.
8. the RFID anti-collision method based on multiway tree according to claim 7, is characterized in that, in step S14, described until described in all RFID label tag be identified on region be identified complete process, comprising:
Until described OPEN table is sky.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510732141.7A CN105205425B (en) | 2015-11-02 | 2015-11-02 | A kind of RFID anti-collision method based on multiway tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510732141.7A CN105205425B (en) | 2015-11-02 | 2015-11-02 | A kind of RFID anti-collision method based on multiway tree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105205425A true CN105205425A (en) | 2015-12-30 |
| CN105205425B CN105205425B (en) | 2017-12-26 |
Family
ID=54953098
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510732141.7A Active CN105205425B (en) | 2015-11-02 | 2015-11-02 | A kind of RFID anti-collision method based on multiway tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105205425B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107895130A (en) * | 2017-11-02 | 2018-04-10 | 东南大学 | A kind of adaptive multiway tree collision-proof method based on collision tree |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101441698A (en) * | 2007-11-20 | 2009-05-27 | 中兴通讯股份有限公司 | Method for judging label counting ending in radio frequency recognition system |
| CN103208019A (en) * | 2013-04-17 | 2013-07-17 | 广西南宁市东森动力信息科技有限公司 | Multi-way tree anti-collision algorithm applicable to radio frequency identification (RFID) system |
| CN103218635A (en) * | 2013-04-03 | 2013-07-24 | 浙江工商大学 | RFID (radio frequency identification) anti-collision method based on mixed multiway tree searching |
| CN103577784A (en) * | 2013-11-25 | 2014-02-12 | 电子科技大学 | Active RFID (radio frequency identification device) reader anti-collision method and system based on multiple radio frequency modules |
-
2015
- 2015-11-02 CN CN201510732141.7A patent/CN105205425B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101441698A (en) * | 2007-11-20 | 2009-05-27 | 中兴通讯股份有限公司 | Method for judging label counting ending in radio frequency recognition system |
| CN103218635A (en) * | 2013-04-03 | 2013-07-24 | 浙江工商大学 | RFID (radio frequency identification) anti-collision method based on mixed multiway tree searching |
| CN103208019A (en) * | 2013-04-17 | 2013-07-17 | 广西南宁市东森动力信息科技有限公司 | Multi-way tree anti-collision algorithm applicable to radio frequency identification (RFID) system |
| CN103577784A (en) * | 2013-11-25 | 2014-02-12 | 电子科技大学 | Active RFID (radio frequency identification device) reader anti-collision method and system based on multiple radio frequency modules |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107895130A (en) * | 2017-11-02 | 2018-04-10 | 东南大学 | A kind of adaptive multiway tree collision-proof method based on collision tree |
| CN107895130B (en) * | 2017-11-02 | 2020-10-16 | 东南大学 | Self-adaptive multi-branch tree anti-collision method based on collision tree |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105205425B (en) | 2017-12-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yang et al. | An effective 16-bit random number aided query tree algorithm for RFID tag anti-collision | |
| Shin et al. | Multiple RFID tags identification with M-ary query tree scheme | |
| US8174367B1 (en) | Causing RFID tags to backscatter more codes | |
| CN103902941B (en) | A kind of multi-label anti-collision method mapped based on continuous collision bit | |
| CN103577783A (en) | Efficient self-adaptive RFID (radio frequency identification) anti-collision tracking tree algorithm | |
| CN106650530A (en) | Enhanced quad-tree anti-collision algorithm suitable for RFID system | |
| Cho et al. | RFID tag anti-collision protocol: query tree with reversed IDs | |
| Shih et al. | Merged search algorithms for radio frequency identification anticollision | |
| Chen et al. | An enhanced anti-collision algorithm in RFID based on counter and stack | |
| CN107895130B (en) | Self-adaptive multi-branch tree anti-collision method based on collision tree | |
| CN105046181B (en) | A kind of certainty anti-collision algorithm of many prefix matchings based on inquiry tree method | |
| CN114186571A (en) | Query tree multi-label concurrent identification method and system based on feature group | |
| CN105654010B (en) | A kind of RFID tag collision-proof method based on adaptive search strategies | |
| CN102479316A (en) | Binary anti-collision identification method for serial numbers of RFID tags | |
| CN105205425A (en) | Multi-tree-based RFID anti-collision method | |
| CN101685495A (en) | Label identification method and reader and radio frequency identification system | |
| CN101697194B (en) | Data processing system and method for improving reliability of RFID application | |
| Ranasinghe et al. | Networked RFID systems | |
| CN104036210A (en) | Test method of identifying multi-tag performance by UHF reader | |
| Dong et al. | An Improved Binary Search Anti-Collision Protocol for RFID Tag Identification. | |
| Quan et al. | Performance analysis of tag anti-collision algorithms for RFID systems | |
| Jiang et al. | Image mining using inexact maximal common subgraph of multiple args | |
| Lee et al. | QT-CBP: A new RFID tag anti-collision algorithm using collision bit positioning | |
| CN105373760A (en) | RFID identification algorithm and intelligent anti-collision scenic spot multi-person parallel entry identification application | |
| CN105320911A (en) | Radio frequency communication method, apparatus, and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |