CN103902942B - A kind of mixing collision-proof method for Large Copacity multi-tag rfid system - Google Patents
A kind of mixing collision-proof method for Large Copacity multi-tag rfid system Download PDFInfo
- Publication number
- CN103902942B CN103902942B CN201410033760.2A CN201410033760A CN103902942B CN 103902942 B CN103902942 B CN 103902942B CN 201410033760 A CN201410033760 A CN 201410033760A CN 103902942 B CN103902942 B CN 103902942B
- Authority
- CN
- China
- Prior art keywords
- write line
- read write
- prefix
- label
- value
- 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
Landscapes
- Near-Field Transmission Systems (AREA)
- Radar Systems Or Details Thereof (AREA)
Abstract
The invention discloses a kind of mixing collision-proof method for Large Copacity multi-tag rfid system, the method can be largely classified into two stages, and the first stage is to utilize frame slot to separate and cognitive phase, and second stage is to utilize AMS method cognitive phase.The method can improve tag recognition performance, reduces the scope of each tag queries；The AMS method simultaneously used eliminates idle inquiry and reduces collision frequency, improves recognition efficiency and safety；In combination with ALOHA based method and the respective advantage of tree based method, solve the label hunger problem brought due to the uncertainty of stochastic process, eliminate the idle inquiry in conventional t ree based method, simultaneously without estimating number of tags, reduce computation complexity；And breach traditional method to number of tags quantitative limitation, it is adaptable to Large Copacity multi-tag rfid system.
Description
Technical field
The invention belongs to technical field of RFID, be specifically related to a kind of mixing anti-collision for Large Copacity multi-tag rfid system
Hit the design of method.
Background technology
In recent years, owing to UHF rfid system has distance far, label is passive, and service life is long, and tag read speed is fast
Many merits, therefore becomes the Main Trends of The Development of following RFID application, such as: supply chain management, item tracing etc..
Additionally, the number of tags covered in UHF rfid system read write line wide coverage, system is a lot, the read-write to label simultaneously
Requiring the highest, the tag-collision problem so making UHF rfid system is the most prominent.In order to solve multiple label simultaneously with reading
Writing the produced collision problem of device communication, read write line needs to use anticollision forwarding method to coordinate between read write line and multiple label
Communication.Owing to being restricted by factors, collision-proof method is simple as far as possible in the realization of label-side, particularly number of tags
The when that mesh being more.
Label anti-collision method is broadly divided into two classes: probabilistic approach and Deterministic Methods.Probabilistic approach i.e. ALOHA-based
Method, is mainly used in the international standard such as EPC Global C1Gen2, ISO 18000-6C and ISO 14443-3Type B.
ALOHA-based method mainly includes CDMA slotted ALOHA method (SA), Frame Slotted Aloha method (FSA) and dynamic
State Frame Slotted Aloha method (DFSA).The most most widely used is exactly DFSA, and ultimate principle is: read write line is to it
One the Query order of tag broadcast in working field, the time slot frame L of a regular length, label are specified in this Query order
A time slot responses read write line order can be randomly choosed, if certain time slot responds without label, when being idle between (1, L)
Gap, if the response of only one of which label, be successful time slot, and now label successfully can be read by read write line, if there being multiple label together
Time response then for collision time slot.When, after a frame end, read write line adds up free timeslot, collision time slot and the quantity of success time slot,
And estimate Unidentified number of tags as parameter, then adjust the length of next frame, repeat said process until all labels
Till Bei Shibie.Most widely used in Tree-based method is exactly query tree method (QT).
The basic feature of QT method is, each label has prefix (prefix) match circuit of oneself, and read write line is from inquiry heap
In stack, selecting a prefix to inquire about, self No. ID is compared by all labels with the prefix received, if it does,
Then label responds read write line and replys oneself No. ID, if do not mated, label does not responds.Occur without collision, then
Read write line successfully recognizes a label, and chooses new inquiry prefix from storehouse and inquire about；If it occur that collision, read-write
The prefix just sent is increased by one 0 or 1 and put into storehouse according to collision information by device, and subsequent query uses by the time；If not yet
Receiving reply, read write line is chosen new prefix from storehouse and is continued inquiry；Circulation aforesaid operations, until completing all labels
Identification.
The main pluses and minuses of the most of RFID anti-collision method that presently, there are are: ALOHA-based method is with time slot as base
Plinth carries out packet and identifies label, and method realizes simple, but there is " tag starvation " (label is hungry) and " cardinality
Sensitive " (number of tags is sensitive) problem.There is not label hunger problem in Tree-based class method, it is ensured that label complete
Identify, but when processing a large amount of tag-collision, read write line is had to repeatedly send tag ID number and carried out splitting label group, so makes
Become the information leakage of label.
Summary of the invention
The invention aims to solve collision-proof method discrimination is low, unstable in prior art shortcoming and propose a kind of suitable
For the mixing collision-proof method of Large Copacity multi-tag rfid system, the method is stable, efficient, and autgmentability is strong.
The technical scheme is that a kind of mixing collision-proof method for Large Copacity multi-tag rfid system, specifically include:
Step 1: read write line initialize reset, read write line time slot counter Sc, free timeslot number Ne, collision timeslot number Nc with
And the value of success timeslot number Nr is 0；
Step 2: read write line one Query order of the tag broadcast in its coverage, described Query order specifies one
The time slot frame L=2 of regular lengthQ, read write line time slot counter Sc=Sc+1；
Step 3: the label to be identified in described read write line coverage receives the Query order of read write line, extracts in order
Q-value, [1, L] randomly generates a number and is loaded on the enumerator of oneself, and compare the value of enumerator and read with current
Write the value of device Sc, if equal, then respond the Query order of read write line and reply the ID of oneself, otherwise not response；
Step 4: read write line receives tag responses, without receiving tag return, then it represents that in read write line coverage
There is no label to be identified, now by Ne=Ne+1；
If generation is not collided in the response received, then it represents that successfully by tag recognition, now by Nr=Nr+1；
If the response received collides, then it represents that there is multiple label to respond, now by Nc=Nc+1 in current time slots simultaneously
And the value of current Sc is put into time slot storehouse；
Step 5: current read-write device time slot counter Sc=Sc+1, it is judged that whether the value of current Sc reaches maximum L, if then
Jump to step 8, otherwise send QueryRep order；
Step 6: the label to be identified in described read write line coverage receives the QueryRep order of read write line, and judges certainly
The value of body timer and the value of current read-write device Sc, if equal, then respond the QueryRep order of read write line and reply oneself
ID, otherwise not response；
Step 7: jump to step 4；
Step 8: the value of Ne, Nc and Nr in statistics epicycle query script, and judge whether the value of Ne-6*Nc exceedes setting
Threshold value, if then jumping to step 9, if otherwise Ne, Nr and Nc value being reset, Q=Q+1 also jumps to step 2；Step
Rapid 9: read write line uses the self adaptation multi-system tree query AMS unidentified label of method identification based on impact factor.
Further, in described step 9, AMS method specifically includes:
Step 9.1: whether read write line detection time slot storehouse is empty, the most then jump to step 9.9, and otherwise read write line is from time slot
Storehouse extracts a slot values and etc. querying command to be sent；
Step 9.2: read write line extracts an inquiry prefix from prefix storehouse, in conjunction with current time slots value mark in coverage
Sign and issue and send querying command；
Step 9.3: the querying command of label reception read write line, and compare value and the current time slots value of the enumerator of self, if equal,
Then respond read write line current queries order and reply the ID of oneself, otherwise not response；
Step 9.4: read write line receives the response of label, if collisionless, then it represents that successfully identify label and jump to step 9.8；
If collision, then calculating impact factor, described impact factor is defined as number of bits and the tag ID length ratio collided；If
Impact factor is more than or equal to 0.75, then jump to step 9.5；If impact factor is less than 0.75, the first collision bit of note is Dc, produces
Raw two new inquiry prefixes, are arranged respectively to 0 or 1 by Dc, and remaining part is by the first in the ID inquiring about prefix and receive
Part composition before collision bit, and the inquiry prefix that two are new is put into prefix storehouse, and jump to step 9.8；
Step 9.5: read write line sends custom command QueryP makes label return the data of a 4bit, and these data are used for reflecting
First two information of tag-collision；
First two crash datas are converted into decimal number x by step 9.6: custom command QueryP is responded by label,
Then 4bit data, these data D are returned to read write linexPosition is 1, and remaining position is 0；
Step 9.7: read write line, according to the 4bit data received, parses first two crash datas of label, and they are placed in look into
Produce new inquiry prefix after asking prefix prefix, and these new prefixes are put into prefix storehouse；
Step 9.8: judge whether current prefix storehouse is empty, if it is empty, then jumps to step 9.1, otherwise jumps to step 9.2；
Step 9.9: whole tag recognition process terminates.
Further, in described step 9, AMS method specifically includes:
Step 9.1: whether read write line detection time slot storehouse is empty, the most then jump to step 9.6, and otherwise read write line is from time slot
Storehouse extracts a slot values and etc. querying command to be sent；
Step 9.2: read write line extracts an inquiry prefix from prefix storehouse, in conjunction with current time slots value mark in coverage
Sign and issue and send querying command；
Step 9.3: the querying command of label reception read write line, and compare value and the current time slots value of the enumerator of self, if equal,
Then response read write line current queries order, and reply the ID of oneself and the head of the remaining part of inquiry prefix prefix matching portions
Two, this two bits it is converted into four Bit datas according to mapping table simultaneously and is sent to read write line；
First two collision bit if colliding, are then arranged respectively to by step 9.4: read write line receives the response data of label
00/01/10/11, and produce new inquiry prefix after they are placed in inquiry prefix prefix, and these new prefixes are put into prefix
Storehouse；If collisionless, illustrate tag ID under current time slots value first two identical, then according to mapping table by this two positions in looking into
After asking prefix prefix, produce new inquiry prefix, and a new prefix is put into prefix storehouse；
Step 9.5: judge whether current prefix storehouse is empty, if it is empty, then jumps to step 9.1, otherwise jumps to step 9.2；
Step 9.6: whole tag recognition process terminates.
Further, inquiring about prefix prefix in described step 9.2 first is empty string, i.e. allows all Counter Values equal to current read-write
The label response of device slot values.
Beneficial effects of the present invention: a kind of mixing collision-proof method for Large Copacity multi-tag rfid system of the present invention is by label
Identification process be divided into two stages, first stage read write line by one Query order of tag broadcast in its working field,
This order specifies the time slot frame L of a regular length, and label randomly chooses a time slot responses read write line order in the frame, if
Time slot produces collision, then collision labels can be identified by two kinds of AMS methods, can improve tag recognition performance, and
And utilize the thought of time division multiplexing tdm A to be grouped by label, reduce the scope of each tag queries；Use simultaneously
AMS method eliminates idle inquiry and reduces collision frequency, improves recognition efficiency and safety；In combination with
ALOHA-based method and the respective advantage of tree-based method, solve the mark brought due to the uncertainty of stochastic process
Sign hungry problem, eliminate the idle inquiry in conventional t ree-based method, simultaneously without estimating number of tags, reduce calculating multiple
Miscellaneous degree；And breach traditional method to number of tags quantitative limitation, be not distributed by tag ID simultaneously and affected, be particularly well-suited to big
Capacity multi-tag rfid system.
Accompanying drawing explanation
Fig. 1 is a kind of mixing collision-proof method FB(flow block) for Large Copacity multi-tag rfid system that the present invention proposes；
Fig. 2 is the flow chart of AMS method 1；
Fig. 3 is the custom command QueryP and the interaction flow of label that in AMS method 1, read write line uses；
Fig. 4 is the flow chart of AMS method 2；
Fig. 5 is an example of 8 labels of inventive method identification；
Fig. 6 is the inventive method advantage curve in recognition speed；
Fig. 7 is the inventive method advantage curve in energy efficiency.
Detailed description of the invention
The invention will be further elaborated with specific embodiment below in conjunction with the accompanying drawings.
It is illustrated in figure 1 the FB(flow block) of a kind of mixing collision-proof method for Large Copacity multi-tag rfid system of the present invention,
Specifically include:
Step 1: read write line initialize reset, read write line time slot counter Sc, free timeslot number Ne, collision timeslot number Nc with
And the value of success timeslot number Nr is 0；
Step 2: read write line one Query order of the tag broadcast in its coverage, described Query order specifies one
The time slot frame L=2 of regular lengthQ, read write line time slot counter Sc=Sc+1；
Step 3: the label to be identified in described read write line coverage receives the Query order of read write line, extracts in order
Q-value, this Q-value is time slot frame L=2 in described step 2QIn Q-value, [1, L] randomly generates a number and is loaded into
On the enumerator of oneself, and compare the value of enumerator and the value of current read-write device Sc, if equal, then respond the Query of read write line
Order and reply the ID of oneself, otherwise not response；
Step 4: read write line receives tag responses, without receiving tag return, then it represents that in read write line coverage
There is no label to be identified, now by Ne=Ne+1；
If generation is not collided in the response received, then it represents that successfully by tag recognition, now by Nr=Nr+1；
If the response received collides, then it represents that there is multiple label to respond, now by Nc=Nc+1 in current time slots simultaneously
And the value of current Sc is put into time slot storehouse；
Step 5: current read-write device time slot counter Sc=Sc+1, it is judged that whether the value of current Sc reaches maximum L, if then
Jump to step 8, otherwise send QueryRep order；
Step 6: the label to be identified in described read write line coverage receives the QueryRep order of read write line, and judges certainly
The value of body timer and the value of current read-write device Sc, if equal, then respond the QueryRep order of read write line and reply oneself
ID, otherwise not response；
Step 7: jump to step 4；
Step 8: the value of Ne, Nc and Nr in statistics epicycle query script, and judge whether the value of Ne-6*Nc exceedes setting
Threshold value, if then jumping to step 9, if otherwise Ne, Nr and Nc value being reset, Q=Q+1 also jumps to step 2；Its
In, as frame length L=2n, n is number of tags to be identified, can derive Ne:Nr:Nc=2:1:7/24, and its derivation belongs to
In prior art, the present patent application scheme is no longer described in detail, and therefore can set certain threshold value according to this ratio,
Verify that current L-value is the most suitable by the value of Ne-6*Nc, " * " meaning being multiplied should be represented；
Step 9: read write line uses the self adaptation multi-system tree query AMS unidentified label of method identification based on impact factor.
The ID of label uses Manchester's code mode in the present invention, because according to Manchester's code, read write line can be correct
Identify the position of the binary digit collided.
The inventive method procedure structure is clear, it is achieved convenient, can be largely classified into two stages, and the first stage is to utilize frame slot
Separating and cognitive phase, second stage is to utilize AMS method cognitive phase；Wherein AMS method cognitive phase the present patent application
Scheme provides two kinds of methods and is identified, and is described in detail below in conjunction with accompanying drawing:
Being illustrated in figure 2 the flow chart of AMS method 1, it specifically includes:
Step 9.1: whether read write line detection time slot storehouse is empty, the most then jump to step 9.9, and otherwise read write line is from time slot
Storehouse extracts a slot values and etc. querying command to be sent；
Step 9.2: read write line extracts an inquiry prefix from prefix storehouse, and (inquiry prefix prefix is empty string first, i.e. allows
All Counter Values are equal to the label response of current read-write device slot values), then send inquiry life to label in conjunction with current time slots value
Order；
Step 9.3: the querying command of label reception read write line, and compare value and the current time slots value of the enumerator of self, if equal,
Then response read write line current queries order, and reply the ID of oneself；
Step 9.4: read write line receives the response of label, if collisionless, the most successfully identifies label and jumps to step 9.8；If touching
Hit, then calculate impact factor (impact factor is defined as number of bits and the tag ID length ratio collided)；If collision because of
Son more than or equal to 0.75, then jumps to step 9.5；If impact factor is less than 0.75, the first collision bit of note is Dc, produces two
New inquiry prefix, is arranged respectively to 0 or 1 by Dc, and remaining part is by collision bit the first in the ID inquiring about prefix and receive
Part composition before, and the inquiry prefix that two are new is put into prefix storehouse, and jump to step 9.8；Wherein, described 0.75
Being a theoretical derivation value out, this derivation belongs to existing with regard to technology, is no longer described in detail in the present invention program；
Step 9.5: read write line sends custom command QueryP makes label return the data of a 4bit, and these data can be accurate
Really reflect first two information of tag-collision；
Step 9.6: custom command QueryP is responded by label, by first two crash datas (00 or 01 or 10 or 11)
It is converted into decimal number x, then returns to 4bit data, this data Dx position 1, remaining position 0 to read write line；
Step 9.7: read write line, according to the 4bit data received, parses referring specifically to of first two crash datas of label
00/01/10/11, and produce new inquiry prefix after they are placed in inquiry prefix prefix, and these new prefixes are put into prefix
Storehouse；
Step 9.8: judge whether current prefix storehouse is empty, if it is empty, then jumps to step 9.1, otherwise jumps to step 9.2；
Step 9.9: whole tag recognition process terminates.
The specific implementation process of the custom command QueryP being previously mentioned in AMS method 1 as described in Figure 3, when read write line detects
During to collision, calculating impact factor, now impact factor is equal to 0.75, and read write line can first send a custom command QueryP
Require that label responds its specifying information of first two；First two collision informations of oneself are converted into ten by label as we can see from the figure
System number x, is then back to the data of a 4bit, and wherein Dx position is 1, and remaining everybody be 0；Read write line receives label
After response data 0xx0, it is judged that D2, D1 position is collided, thus it is appreciated that the highest collision bit of the label collided and second highest
The concrete collision information of collision bit is respectively 01 and 10, and therefore 01 and 10 can be added in original looking into by subsequent query order respectively
New querying command is generated after asking sequence.
Being illustrated in figure 4 the flow chart of AMS method 2, it specifically includes:
Step 9.1: whether read write line detection time slot storehouse is empty, the most then jump to step 9.6, and otherwise read write line is from time slot
Storehouse extracts a slot values and etc. querying command to be sent；
Step 9.2: read write line extracts an inquiry prefix from prefix storehouse, and (inquiry prefix prefix is empty string first, i.e. allows
All Counter Values are equal to the label response of current read-write device slot values), then send inquiry life to label in conjunction with current time slots value
Order；
Step 9.3: the querying command of label reception read write line, and compare value and the current time slots value of the enumerator of self, if equal,
Then response read write line current queries order, and reply the ID of oneself and the head of the remaining part of inquiry prefix prefix matching portions
Two, this two bits can be converted into four Bit datas according to mapping table and be sent to read write line simultaneously；
First two collision bit if colliding, are then arranged respectively to by step 9.4: read write line receives the response data of label
00/01/10/11, and produce new inquiry prefix after they are placed in inquiry prefix prefix, and these new prefixes are put into prefix
Storehouse；If collisionless, illustrate tag ID under current time slots value first two identical, then according to mapping table by this two positions in looking into
After asking prefix prefix, produce new inquiry prefix, and a new prefix is put into prefix storehouse；
Step 9.5: judge whether current prefix storehouse is empty, if it is empty, then jumps to step 9.1, otherwise jumps to step 9.2；
Step 9.6: whole tag recognition process terminates.
The mapping table given used in AMS method 2 as shown in table 1 below, can quick obtaining according to mapping table read write line
Tag-collision information, it is to avoid free timeslot, accelerates inquiry velocity simultaneously.
Table 1 mapping table
| 2bit (collision bit) | 4bit (mapping data) |
| 00 | 0001 |
| 01 | 0010 |
| 10 | 0100 |
| 11 | 1000 |
The flow diagram of AMS the method 1 and AMS method 2 be given by Fig. 2 and Fig. 4, the difference of two kinds of methods is,
A kind of is to determine new inquiry prefix based on impact factor and custom command QueryP, and another kind is to directly utilize label to return
Mapping data determine new inquiry prefix, be not difficult to find out, the latter is without extra custom command, and need not label and return
Returning complete id information, therefore performance is more excellent.
In order to skilled artisans appreciate that and implement technical solution of the present invention, below in conjunction with specific embodiment to this
Bright application scheme elaborates:
As shown in Figure 5 below as a example by the identification process of 10 labels, and use AMS method 2 to illustrate skill of the present invention
Art scheme, 10 labels are respectively 00110011,01000101,01011101,01001010,00010011,00010001,
11011110,11111000,10011011,11110110, according to the method flow diagram shown in Fig. 1 and the mapping shown in Fig. 5
Table, the present invention to be embodied as step as follows:
Step 1: the read write line tag broadcast in working field one Query order, now frame length L=4；As shown in Figure 6,
Label T3, T10 select respond at time slot 1, label T5 select respond at time slot 2, label T1, T2, T6, T8 and
T9 selects to respond at time slot 3, and label T4, T7 select to respond at time slot 4；Owing to time slot 2 is successfully time slot, therefore label
T5 gap at this moment is successfully identified；Remaining time slot is collision time slot, according to the principle of the inventive method, timeslot number 1,3,4
It is pressed into time slot storehouse, it is simple to AMS method identification.Follow-up read write line can be according to the information of time slot storehouse, respectively to timer
Value equal to 1,3,4 collision labels be identified.
Step 2: read write line extracts timeslot number 1 from time slot storehouse, sends empty string inquiry so that all Counter Values are equal to 1
Label responds, and replys the mapping data of self ID and first two of the remainder of inquiry prefix prefix matching portions；According to
Mapping table, label T3, T10 reply 0010 and 1000 respectively, and read write line receives response data x0x0 and judges collision information
Middle existence 01 and 11 prefix, and the two prefix is pressed into prefix storehouse；Read write line sends inquiry prefix 01, now label T3
Responding and reply 0010, collisionless occurs, so T3 is successfully identified；Read write line continues to send inquiry prefix 11, this markers
Signing T10 respond and reply 1000, collisionless occurs, so label T10 is successfully identified；Now prefix storehouse is empty, to meter
Count the tag recognition that device value is 1 to terminate；
Step 3: read write line extracts timeslot number 3 from time slot storehouse, sends empty string inquiry so that all Counter Values are equal to 3
Label responds, and replys the mapping data of self ID and first two of the remainder of inquiry prefix prefix matching portions；According to
Mapping table, label T1, T2, T6, T8 and T9 response, and reply data 0001,0010,0001,1000,0100,
Read write line receives response data xxxx and judges to there is prefix 00 in collision information, and 01,10,11 and be pressed into storehouse；Read-write
Device sends inquiry prefix 00, and now label T1, T6 responds and reply data 1000 and 0010, and read write line receives number of responses
According to x0x0, there are 01 and 11 prefixes during now read write line judges collision information and be pressed into storehouse；Read write line sends and looks into
Asking prefix 0001, the most only label T6 and respond and reply data 0001, collisionless occurs, and T6 is successfully identified；Read write line
Continuing to send inquiry prefix 0011, label T1 responds and replys data 0001, and collisionless occurs, and T1 is successfully identified；Read-write
Continuing to send inquiry prefix 01, label T2 responds and replys data 0001, and collisionless occurs, and T2 is successfully identified；Read write line
Continuing to send inquiry prefix 10, label T9 responds and replys data 0010, and collisionless occurs, and T9 is successfully identified；Read write line
Sending inquiry prefix 11, label T8 responds and replys data 1000, and collisionless occurs, and T8 is successfully identified；Now prefix heap
Stack is empty, terminates the tag recognition that timer value is 3；
Step 4: similar with above-mentioned steps, is also successfully identified the label that Counter Value is 4；
Step 5: now time slot storehouse is empty, and all labels in read write line working field are all successfully identified.
Fig. 6, Fig. 7 sets forth compared with classical collision-proof method, and the inventive method is on recognition efficiency and energy efficiency
Advantage, wherein CT for collision tree method, DFSA is dynamic frame CDMA slotted ALOHA method, and EDFSA is that enhancement mode is dynamic
Frame Slotted Aloha method, Splitting BTSA is for separating binary tree CDMA slotted ALOHA method.
Those of ordinary skill in the art is it will be appreciated that embodiment described here is to aid in the former of the reader understanding present invention
Reason, it should be understood that the protection domain of invention is not limited to such special statement and embodiment.Every do according to foregoing description
Go out various possible equivalent or change, be all considered to belong to the scope of the claims of the present invention.
Claims (2)
1. the mixing collision-proof method for Large Copacity multi-tag rfid system, it is characterised in that specifically include:
Step 1: read write line initialize reset, read write line time slot counter Sc, free timeslot number Ne, collision timeslot number Nc with
And the value of success timeslot number Nr is 0；
Step 2: read write line one Query order of the tag broadcast in its coverage, described Query order specifies one
The time slot frame L=2 of regular lengthQ, read write line time slot counter Sc=Sc+1；
Step 3: the label to be identified in described read write line coverage receives the Query order of read write line, extracts in order
Q-value, [1, L] randomly generates a number and is loaded on the enumerator of oneself, and compare the value of enumerator and read with current
Write the value of device Sc, if equal, then respond the Query order of read write line and reply the ID of oneself, otherwise not response；
Step 4: read write line receives tag responses, without receiving tag return, then it represents that in read write line coverage
There is no label to be identified, now by Ne=Ne+1；
If generation is not collided in the response received, then it represents that successfully by tag recognition, now by Nr=Nr+1；
If the response received collides, then it represents that there is multiple label to respond, now by Nc=Nc+1 in current time slots simultaneously
And the value of current Sc is put into time slot storehouse；
Step 5: current read-write device time slot counter Sc=Sc+1, it is judged that whether the value of current Sc reaches maximum L, if then
Jump to step 8, otherwise send QueryRep order；
Step 6: the label to be identified in described read write line coverage receives the QueryRep order of read write line, and judges certainly
The value of body timer and the value of current read-write device Sc, if equal, then respond the QueryRep order of read write line and reply oneself
ID, otherwise not response；
Step 7: jump to step 4；
Step 8: the value of Ne, Nc and Nr in statistics epicycle query script, and judge whether the value of Ne-6*Nc exceedes setting
Threshold value, if then jumping to step 9, if otherwise Ne, Nr and Nc value being reset, Q=Q+1 also jumps to step 2；
Step 9: read write line uses the self adaptation multi-system tree query AMS unidentified label of method identification based on impact factor,
In described step 9, AMS method specifically includes:
Step 9.1: whether read write line detection time slot storehouse is empty, the most then jump to step 9.9, and otherwise read write line is from time slot
Storehouse extracts a slot values and etc. querying command to be sent；
Step 9.2: read write line extracts an inquiry prefix from prefix storehouse, in conjunction with current time slots value mark in coverage
Sign and issue and send querying command；
Step 9.3: the querying command of label reception read write line, and compare value and the current time slots value of the enumerator of self, if equal,
Then respond read write line current queries order and reply the ID of oneself, otherwise not response；
Step 9.4: read write line receives the response of label, if collisionless, then it represents that successfully identify label and jump to step 9.8；
If collision, then calculating impact factor, described impact factor is defined as bit number and the tag ID length ratio collided；If touching
Hit the factor and be more than or equal to 0.75, then jump to step 9.5；If impact factor is less than 0.75, the first collision bit of note is Dc, produces
Two new inquiry prefixes, are arranged respectively to 0 or 1 by Dc, and remaining part is touched by first place in the ID inquiring about prefix and receive
Hit the part composition before position, and the inquiry prefix that two new is put into prefix storehouse, and jump to step 9.8；
Step 9.5: read write line sends custom command QueryP makes label return the data of a 4bit, and these data are used for reflecting
First two information of tag-collision；
First two crash datas are converted into decimal number x by step 9.6: custom command QueryP is responded by label,
Then returning 4bit data to read write line, this data Dx position is 1, and remaining position is 0；
Step 9.7: read write line, according to the 4bit data received, parses first two crash datas of label, and they are placed in look into
Produce new inquiry prefix after asking prefix prefix, and these new prefixes are put into prefix storehouse；
Step 9.8: judge whether current prefix storehouse is empty, if it is empty, then jumps to step 9.1, otherwise jumps to step 9.2；
Step 9.9: whole tag recognition process terminates；
Or,
In described step 9, AMS method specifically includes:
Step 9.1: whether read write line detection time slot storehouse is empty, the most then jump to step 9.6, and otherwise read write line is from time slot
Storehouse extracts a slot values and etc. querying command to be sent；
Step 9.2: read write line extracts an inquiry prefix from prefix storehouse, in conjunction with current time slots value mark in coverage
Sign and issue and send querying command；
Step 9.3: the querying command of label reception read write line, and compare value and the current time slots value of the enumerator of self, if equal,
Then response read write line current queries order, and reply the ID of oneself and the head of the remaining part of inquiry prefix prefix matching portions
Two, this two bits it is converted into four Bit datas according to mapping table simultaneously and is sent to read write line；
First two collision bit if colliding, are then arranged respectively to by step 9.4: read write line receives the response data of label
00/01/10/11, and produce new inquiry prefix after they are placed in inquiry prefix prefix, and these new prefixes are put into prefix
Storehouse；If collisionless, illustrate tag ID under current time slots value first two identical, then according to mapping table by this two positions in looking into
After asking prefix prefix, produce new inquiry prefix, and a new prefix is put into prefix storehouse；
Step 9.5: judge whether current prefix storehouse is empty, if it is empty, then jumps to step 9.1, otherwise jumps to step 9.2；
Step 9.6: whole tag recognition process terminates.
A kind of mixing collision-proof method for Large Copacity multi-tag rfid system, its feature exists
In, inquiring about prefix prefix in described step 9.2 first is empty string, i.e. allows all Counter Values equal to current read-write device slot values
Label responds.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410033760.2A CN103902942B (en) | 2014-01-23 | 2014-01-23 | A kind of mixing collision-proof method for Large Copacity multi-tag rfid system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410033760.2A CN103902942B (en) | 2014-01-23 | 2014-01-23 | A kind of mixing collision-proof method for Large Copacity multi-tag rfid system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103902942A CN103902942A (en) | 2014-07-02 |
| CN103902942B true CN103902942B (en) | 2016-11-02 |
Family
ID=50994255
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410033760.2A Active CN103902942B (en) | 2014-01-23 | 2014-01-23 | A kind of mixing collision-proof method for Large Copacity multi-tag rfid system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103902942B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104134052B (en) * | 2014-07-10 | 2016-11-16 | 广东工业大学 | A kind of RFID anti-collision method based on adaptive packet mechanism |
| CN106919879B (en) * | 2015-12-28 | 2020-03-13 | 航天信息股份有限公司 | Double-frequency label anti-collision equipment and method |
| CN107590408B (en) * | 2017-08-01 | 2020-05-12 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | ALOHA anti-collision method based on binary hash |
| CN108108643B (en) * | 2017-12-20 | 2021-02-19 | 深圳市航天华拓科技有限公司 | Radio frequency identification anti-collision optimal Q value calculation method and device |
| CN111523337B (en) * | 2020-04-21 | 2023-06-09 | 中煤科工集团重庆研究院有限公司 | Anti-collision method based on label serial number sliding window iterative grouping |
| CN112949334B (en) * | 2021-03-04 | 2022-06-10 | 武汉大学 | Reliable radio frequency identification method based on packet multiplexing |
| CN114186571B (en) * | 2021-11-08 | 2023-06-09 | 南京信息工程大学 | Query tree multi-label concurrent identification method and system based on feature set |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101004780A (en) * | 2006-01-16 | 2007-07-25 | 北京大学 | Anticollision method for reading ID information in radio frequency |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7193504B2 (en) * | 2001-10-09 | 2007-03-20 | Alien Technology Corporation | Methods and apparatuses for identification |
-
2014
- 2014-01-23 CN CN201410033760.2A patent/CN103902942B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101004780A (en) * | 2006-01-16 | 2007-07-25 | 北京大学 | Anticollision method for reading ID information in radio frequency |
Non-Patent Citations (3)
| Title |
|---|
| 基于AS3992的防碰撞Q算法分析与改进;邓敦建等;《传感器与微***》;20130331;第32卷(第3期);第8页第1节 * |
| 基于堆栈的RFID防碰撞算法设计;陆洲艳等;《物流工程与管理》;20120930;第34卷(第9期);第141页第2节 * |
| 自适应多叉树防碰撞算法研究;丁治国等;《自动化学报》;20100228;第36卷(第2期);第238页第1-2节，图1-4 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103902942A (en) | 2014-07-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103902942B (en) | A kind of mixing collision-proof method for Large Copacity multi-tag rfid system | |
| CN103902941B (en) | A kind of multi-label anti-collision method mapped based on continuous collision bit | |
| Lai et al. | A novel query tree protocol with bit tracking in RFID tag identification | |
| La Porta et al. | Anticollision protocols for single-reader RFID systems: Temporal analysis and optimization | |
| Ryu et al. | A hybrid query tree protocol for tag collision arbitration in RFID systems | |
| US8477016B2 (en) | Method for identifying tags using adaptive binary tree splitting technique in RFID system and RFID system therefore | |
| CN103065112B (en) | Based on the RFID label tag anticollision recognition methods of modular arithmetic labeling | |
| CN103020568B (en) | Based on the pretreated RFID anti-collision method of label ID | |
| CN101944171B (en) | Multi-tag identification method of RFID reader | |
| CN104517087A (en) | RFID multi-label identification anti-collision method | |
| CN101840489A (en) | Multi-tag identification 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 | |
| CN101071471A (en) | Multi-label collision-proof method | |
| CN107895130A (en) | A kind of adaptive multiway tree collision-proof method based on collision tree | |
| CN103679092B (en) | RFID anti-collision algorithm based on feedback mechanism | |
| CN101324916B (en) | Label recognition anti-collision method for RFID system | |
| CN104166867B (en) | A kind of many HASH functions multiframe coupled mode RFID anti-collision algorithms (MHMFG) | |
| CN102663332B (en) | Multi-label anti-collision guiding identification method for RFID system | |
| CN101650770A (en) | Binary search anti-collision method with unknown label quantity estimation function | |
| Su et al. | Bit query based M-ary tree protocol for RFID tags identification | |
| Kalache et al. | Performances comparison of RFID anti-collision algorithms | |
| CN101231686A (en) | Method for recognizing contrary collision of inquiry tree radio frequency labels of amalgamation database | |
| Maselli et al. | Dynamic tag estimation for optimizing tree slotted aloha in RFID networks | |
| Dong et al. | An Improved Binary Search Anti-Collision Protocol for RFID Tag Identification. | |
| Zein_Elabdeen et al. | An enhanced binary tree anti-collision technique for dynamically added tags in RFID systems |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |