CN109902784A - A kind of efficient label checking method based on historical information reasoning - Google Patents
A kind of efficient label checking method based on historical information reasoning Download PDFInfo
- Publication number
- CN109902784A CN109902784A CN201910162097.9A CN201910162097A CN109902784A CN 109902784 A CN109902784 A CN 109902784A CN 201910162097 A CN201910162097 A CN 201910162097A CN 109902784 A CN109902784 A CN 109902784A
- Authority
- CN
- China
- Prior art keywords
- label
- time slot
- information
- tag
- state
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a kind of efficient label checking method based on historical information reasoning, it include: before collecting tag return, according to use tag ID number Hash in database as a result, predicting the label condition replied in each time slot and the corresponding expecting state of the time slot；After receiving reader inquiry message, each label replys a 10 bit strings information according to oneself ID Hash result in corresponding time slot；In each time slot, if receiving the reply of some label, 1 is set by corresponding tag state；If not receiving the reply of some label, 0 is set by corresponding tag state；If reply label condition can not be determined, the state of the time slot and associated possible one history of label generation of replying are waited for that inferencing information is saved in history information library；Determining tag state is brought into history information library and searches whether that there are history to wait for inferencing information, infers the label of other states to be determined.The present invention can be improved the efficiency that RFID label tag is made an inventory.
Description
Technical field
The invention belongs to RFID of Internet-of-things technical applications, in particular to a kind of high criterion based on historical information reasoning
Sign checking method.
Background technique
With flourishing for Internet of Things, radio frequency identification (RFID, Radio as one of Internet of Things core technology
Frequency Identification) technology is gradually promoted in practical applications, such as warehousing management, intelligent transportation,
The fields such as material flow tracking.RFID technique refer to by radio wave come identify RFID label tag it is a kind of in the way of.In environment of internet of things
In, using RFID technique, unique address number can be distributed for each physical object, and physical object one can be assigned
Fixed computing capability, for example, passive RFID tags realize " passive intelligence " by each object.RFID technique adheres to Internet of Things
The core concept of " object object is connected " relies on its unique excellent especially in today of pursuit " convenient, efficient, safe " service theory
Gesture is made that contribution outstanding to Internet of Things industry and people's lives.It breaches the limit of traditional automatic identifying method distance
System, RFID technique application scenarios are wide, and it is exactly the hot spot faced in RFID technique that RFID label tag, which is made an inventory, in many applications
It is even up to a million that the quantity of RFID label tag is likely to be breached hundreds of thousands, is efficiently made an inventory label, judges that the true of label is deposited
In state, there is critically important realistic meaning.It is suitable to be to ensure that RFID technique is constantly updated for the label checking method that research is efficiently applicable in
Key.
Currently, in the world, RFID technique successful operation is in multiple fields.For example, Kang Fendaisi is all over the world
More than 70 cities provide intelligent ticket, provide Smart Logo to turnover box, motor vehicle, train etc., give various regions city bus rail
The passenger of road electric car and train, which brings, satisfied takes experience.New York Transport Department, big city (MTA) recent years starts gradually to take
The York City subway magnetic card for disappearing traditional, and the credit card based on RFID technique is used, this not only offers convenience to the trip of citizen,
And MTA saves about 6,000,000 dollars every year.Metro group (METRO Group) announced plans are in entire supply chain and its position
RFID technique is used comprehensively in " the following shop " of moral Rheinberg
In Chinese market, more and more fields start with RFID technique and improve innovation to business.Chongqing airport,
Using the first RFID baggage sorting system in domestic airport, baggage sorting packet loss is substantially reduced, and is carried compared to previous artificial knot, efficiency
At least improve 5 times.Nobody new retail shop of Ali uses RFID technique, greatly improves settlement efficiency, and helps businessman real
Stock object is made an inventory online.Technology of the RFID technique as a mature, shows new glamour in the new era.
RFID system composition: RFID system mainly includes three parts: RFID label tag, reader, background server.From the background
Server and reader are connected by wired or wireless, are responsible for handling information and are simultaneously sent instruction, and reader is according to the finger of server
It enables, twireless radio-frequency communication is carried out by antenna and RFID label tag, carries out the information exchange of high speed, completes search process.RFID mark
Label contain microchip, can complete simple logical operation.Chip interior stores different hardware numbers, and each RFID is marked
Label, it is this number have uniqueness, the radiofrequency signal of RFID tag reader, and by " backscattering " mechanism by itself
Information be sent to reader.
RFID basic communication agreement: since tag capabilities are limited, between label can not direct communication or negotiate reply when
Sequence.If all labels are all in the inquiry for receiving reader while to reply, these replies can rush at reader end
It dashes forward so that reader can not get any useful information.In order to avoid the conflict of label information, the reading that is widely used at present
Communication protocol between device and label is EPC C1G2 agreement.In the agreement, reader broadcasts the life comprising frame sign f
It enables, system label carries out Hash operation using the ID of oneself, replys its ID from one time slot of random selection in [0, f-1].For example,
If the Hash result of label t is 2, which will reply his ID to reader in second time slot.Due to Hash operation
Randomness, time slot is possible to there are three types of different types: " empty slot " is the time slot that no label selection is replied；" single time slot "
It is the time slot that the selection of only one label is replied；" conflict time slot " be there are two or the time slot that selects of the above label.It needs to infuse
What is anticipated is the specific number that reader can not often check the tag return for include in collision signal, and can only be known
Road is the label of two or more while replying.The information wherein replied in only single time slot could successfully be received by reader
It takes.
RFID label tag, which is made an inventory, to be referred in system label, judges that all database labels whether there is, and is realized to database
The update of middle tag ID.Wherein system label is exactly the label of physical presence in RFID system, i.e., within the scope of reader communication
The RFID label tag that can be carried out wireless communication with reader.Database label is the label that administrative staff need to make an inventory.For example,
In warehousing management, one of the most common type demand is exactly rapidly and accurately to inquire commodity whether also in warehouse, and find out and be not present
Commodity.Most straightforward approach is all to collect all tag IDs to compare, so that it may which obtaining database label is
No existing accurate information.But due to system label enormous amount, and tag ID number has 96 bits, the method all collected
It will take a long time, not enough efficiently.In order to solve this problem, existing research is logical by improving reader and RFID label tag
The basic agreement EPC C1G2 of letter, which avoids collecting unwanted tag ID as far as possible, carrys out raising efficiency: only detection is selected by database label
In single time slot quickly confirm that the label whether there is.In EPC C1G2 agreement, due to time slot and the empty slot of largely conflicting,
Cause the utilization rate of frame not high, if system label quantity is very big, the time loss of this way of search will be can not be ignored.Also
A kind of tag search mode, can by broadcasting the id information of label to be searched, if with the presence of corresponding label in system,
Response message can be responded immediately to, when database label quantity is larger, this method is extremely time-consuming.Due to the computing resource of label
Very little realizes efficient " exchange " mode between reader and RFID label tag, is RFID so designing applicable checking method
The critical issue that label is made an inventory.
Summary of the invention
It is an object of the present invention in view of the above shortcomings of the prior art, provide a kind of height based on historical information reasoning
Criterion label checking method can be improved the efficiency that RFID label tag is made an inventory.
In order to solve the above technical problems, the technical scheme adopted by the invention is that:
A kind of efficient label checking method based on historical information reasoning, its main feature is that including following methods:
Before collecting the reply of label, according to it is using tag ID number Hash in database as a result, reader predict it is every
The label condition and the corresponding expecting state of the time slot replied in a time slot, the expecting state be empty slot, single time slot or
Person's conflict time slot；
After receiving reader inquiry message, each label replys one in corresponding time slot according to oneself ID Hash result
A 10 bit strings information；In each time slot, reader is by combining the comparison of time slot expecting state and virtual condition to believe
Breath, and the tag return information that receives determine the specific label replied in the time slot: if receiving the reply of some label
(label presence) sets 1 for the corresponding tag state；If not receiving the reply (label is not present) of some label,
0 is set by the corresponding tag state；If reply label condition can not be determined, by the state of the time slot and it is associated can
One history of label generation can be replied and wait for that inferencing information is saved in history information library, S (t) is enabled to indicate the state of label t, S (t)
={ 0,1 }, if S (t)=0, then it represents that t is not present；If S (t)=1, then it represents that t exists；
Determining tag state is brought into history information library and searches whether to wait for that reasoning is believed there are history associated with it
Breath, to infer the label of other states to be determined.
As a preferred method, the following steps are included:
Step 1, instruction vector is established, reader first calculates optimum length of frame, and database label uses Hash letter according to parameter
The mapping time slot for calculating each label in database is counted, instruction vector is established, when each object is corresponded to number inside vector
Map tags in gap；Meanwhile reader broadcasts the querying command comprising parameter, system label is answered according to parameter, selection
Multiple time slot, the frame length are as follows:
Wherein f1For frame length；N is the set of database label；K is the number of database label in time slot；
Step 2, during collecting label, reader is that parameter value A and b: set A expression instruction is arranged in each time slot
The corresponding database label of vector, b indicate the system label quantity actually replied；When reader receive in a slot be conflict
When signal, it, which can not be determined specifically, has several signals to be conflicted, therefore b >=2 indicates that receive is collision signal；
Step 3, the reasoning that time slot label is carried out according to tag set A and b, there is following several situations:
If i. gap information are as follows: | A | > 0 and b=0 indicate that instruction vector forecasting has | A | a label mapping does not have actually
System label is replied, then judges that the label in set A is all not present, and deletes A from database label, and by the shape of label in A
State value is both configured to 0；
If ii. gap information are as follows: | A |=1 and b=1, or | A |=2 and b >=2 (show as reader receive conflict letter
Number), the quantity for indicating the number of labels of instruction vector forecasting and actually replying is equal, then judge that the label in set A all exists,
A is deleted from database label, reader, which sends " ACK ", at the end of time slot makes corresponding system label " sleep ", after being no longer participate in
Continuous activity；And the state value of label in A is both configured to 1；
If iii. gap information are as follows: | A | > 1 and b=1 indicate that instruction vector forecasting has multiple label mappings, actually only have
One system label is replied, and according to the 10 bit label information received, label in set A is detected, if some label in A
It is consistent with 10 bit informations after hash function is handled, then it may determine that the label exists, set 1 for its state；Simultaneously
Determine that other labels in A are not present, sets 0 for its state；Database label deletes set A, reader at the end of time slot
It sends " ACK ", makes existing label " sleep "；
If iv. gap information are as follows: | A | >=3 and b >=2 indicate the label more than two of instruction vector forecasting mapping, practical
The label of answer be it is multiple, due to that can not judge whether there is label to be not present in A, then will set A label and answer state value " 2 "
As historical information, it is denoted asIt is stored in history information library；
Step 4, after the reasoning of time slot label, if there is new label to be inferred in a slot, in time slot knot
Shu Hou needs to carry out historical information reasoning, for the historical information in history information libraryA indicates tag set,
The value of a is " 2 " or " 1 ", reasoning process are as follows:
I. if certain label t in AjIt has been judged as being not present, i.e. S (tj)=0, then A deletes tj, a is constant, history letter
Breath is updated to
Ii. if certain label t in AjIt has been judged as existing, i.e. S (tj)=1, then A deletes tj, a subtracts one, historical information
It is updated to
Iii. each historical information is eventually updated to two kinds of forms, it is assumed that set A is finally after n times update
An, then the first form is S (An) >=0, this information is meaningless, and the information is deleted from history information library；Second of form is S
(An)≥|An|, indicate AnIn label at least | An| it is a to be present in system, it is evident that A at this timenLabel be all it is existing,
Then by AnIn tag state be set as 1, and this historical information is deleted from history information library；
Step 5, step 1 is repeated to step 4, until all labels are judged.
The label inferred as a preferred method, cannot be deleted directly, need in subsequent gap information reasoning
It is deleted and " ACK ".
The present invention by gap information reasoning directly judge a part of label there are situations, while passing through historical information
Reasoning come judge label there are situations, this inference method enables various time slot label informations to obtain sufficiently in general
Utilization, to improve the efficiency of making an inventory of label.
Compared with prior art, the advantageous effect of present invention is that: the present invention is based on only with business RFID device
The model of historical information reasoning realizes efficiently making an inventory to RFID label tag, two generated according to database label and system label
Kind gap information, the implementation strategy of tag design reasoning construct history information library, efficiently use historical information.It is needed in the present invention
It is noted that in gap information reasoning process, reader send " ACK " time, this is easy to implement for reader,
And there is certain versatility, it is very promising.
Detailed description of the invention
Fig. 1 is the schematic diagram of a scenario of RFID system model of the present invention.
Fig. 2 is the set relation figure that the present invention participates in label.
Fig. 3 is schematic diagram of the present invention to time slot information inference.
Fig. 4 is that the present invention uses KEY value to judge schematic diagram existing for label.
Fig. 5 is the historical time slot information bank schematic diagram that the present invention stores.
Fig. 6 is that the present invention changes system label quantity, the execution time efficiency and false positive situation of two methods.
Fig. 7 is the ratio that the present invention changes database label and system label quantity, the execution time efficiency of two methods
With false positive situation.
Specific embodiment
Inventor observes in actual label is made an inventory, there are two types of time slot in the instruction vector that server is established, first
Kind of time slot can directly judge label there are situations, and corresponding delete operation is carried out to database label or reader is sent out
" ACK " is sent to make corresponding system label " sleep "；Second of time slot cannot directly judge time slot label that needing will at this time
Gap information preservation is historical information.
In the present invention, as shown in Figure 1, the RFID label tag being related to includes database label, system label, the database mark
Label include all label informations that should be stored in RFID system, and the system label is the mark in necessary being RFID system
Label, can carry out wireless communication with RFID reader, since factors, the system labels such as unexpected loss have only corresponded to database
A part of label.In actually storage application scenarios, article often faces unexpected the problems such as losing in warehouse, but commodity are clear
The information such as single are easy to obtain, and what we to be solved is exactly to judge database label whether necessary being is in RFID system label
In.The database label is used as priori knowledge, establishes instruction vector, indicates that each time slot of vector reflects number
According to the map information of library label, and the prediction of practical return information that reader is collected into；The system label pass through and
Reader carries out wireless communication, select it is corresponding reply time slot, return to actual reply message, in the same time slot, indicate to
Corresponding database label covers the system label of answer in amount, and simultaneity factor label uses 10-bit information-reply, reads
Device is able to detect three kinds of states for replying time slot, is empty slot, single time slot and conflict time slot respectively, being capable of corresponding label
Quantity is " 0 ", " 1 " and " being greater than or equal to 2 ", therefore according to the system mark for the database label quantity and reply predicted in time slot
The corresponding relationship for signing quantity, can make inferences analysis to time slot label.
The present invention specifically includes the following steps:
Step 1, instruction vector is established, reader first calculates optimum length of frame, and database label uses Hash letter according to parameter
The mapping time slot for calculating each label in database is counted, instruction vector is established, when each object is corresponded to number inside vector
Map tags in gap；Meanwhile reader broadcasts the querying command comprising parameter, system label is answered according to parameter, selection
Multiple time slot, the frame length are as follows:
Wherein f1For frame length；N is the set of database label；K is the number of database label in time slot；
Step 2, during collecting label, reader is that parameter value A and b: set A expression instruction is arranged in each time slot
The corresponding database label of vector, b indicate the system label quantity actually replied；When reader receive in a slot be conflict
When signal, it, which can not be determined specifically, has several signals to be conflicted, therefore b >=2 indicates that receive is collision signal；
Step 3, the reasoning that time slot label is carried out according to tag set A and b, there is following several situations:
If i. gap information are as follows: | A | > 0 and b=0 indicate that instruction vector forecasting has | A | a label mapping does not have actually
System label is replied, then judges that the label in set A is all not present, and deletes A from database label, and by the shape of label in A
State value is both configured to 0；
If ii. gap information are as follows: | A |=1 and b=1, or | A |=2 and b >=2 (show as reader receive conflict letter
Number), the quantity for indicating the number of labels of instruction vector forecasting and actually replying is equal, then judge that the label in set A all exists,
A is deleted from database label, reader, which sends " ACK ", at the end of time slot makes corresponding system label " sleep ", after being no longer participate in
Continuous activity；And the state value of label in A is both configured to 1；
If iii. gap information are as follows: | A | > 1 and b=1 indicate that instruction vector forecasting has multiple label mappings, actually only have
One system label is replied, and according to the 10 bit label information received, label in set A is detected, if some label in A
It is consistent with 10 bit informations after hash function is handled, then it may determine that the label exists, set 1 for its state；Simultaneously
Determine that other labels in A are not present, sets 0 for its state；Database label deletes set A, reader at the end of time slot
It sends " ACK ", makes existing label " sleep "；
If iv. gap information are as follows: | A | >=3 and b >=2 indicate the label more than two of instruction vector forecasting mapping, practical
The label of answer be it is multiple, due to that can not judge whether there is label to be not present in A, then will set A label and answer state value " 2 "
As historical information, it is denoted asIt is stored in history information library；
Step 4, after the reasoning of time slot label, if there is new label to be inferred in a slot, in time slot knot
Shu Hou needs to carry out historical information reasoning, for the historical information in history information libraryA indicates tag set,
The value of a is " 2 " or " 1 ", reasoning process are as follows:
I. if certain label t in AjIt has been judged as being not present, i.e. S (tj)=0, then A deletes tj, a is constant, history letter
Breath is updated to
Ii. if certain label t in AjIt has been judged as existing, i.e. S (tj)=1, then A deletes tj, a subtracts one, historical information
It is updated to
Iii. each historical information is eventually updated to two kinds of forms, it is assumed that set A is finally after n times update
An, then the first form is S (An) >=0, this information is meaningless, and the information is deleted from history information library；Second of form is S
(An)≥|An|, indicate AnIn label at least | An| it is a to be present in system, it is evident that A at this timenLabel be all it is existing,
Then by AnIn tag state be set as 1, and this historical information is deleted from history information library；The label inferred cannot be straight
Deletion is connect, needs to be deleted and " ACK " in subsequent gap information reasoning.
Step 5, step 1 is repeated to step 4, until all labels are judged.
In step 3, it is related to gap information reasoning, server by utilizing instruction vector sum actual time slot replies letter
Breath, some time slots can be whether there is with immediate reasoning outgoing label, and at the end of time slot, reader, which needs to send " ACK ", to be made to correspond to
System label " sleep ", be no longer participate in follow-up activities；Some time slots can produce historical information, be stored in history information library
In, wait historical information reasoning.
In step 4, it is related to historical information reasoning, server infers by historical information reasoning and deposits certain data
Library label exists, but cannot directly delete, because its corresponding system label can only be in gap information reasoning process by readding
It reads device transmission " ACK " to exclude, such as a certain historical information isWherein | An|=2, it is evident that in set A
Two labels are all present in system label, but the reasoning of historical information is to complete on the server, for the row of these labels
Except needs execute in subsequent gap information reasoning, including server deletes database label and reader sends " ACK "
Make corresponding system label " sleep ".
The relational graph of tag set is described such as Fig. 2.Because database label includes all labels, system label set
Y is the subset of database label set N, and the present invention can efficiently infer in N that there are in Y for which label.
The schematic diagram of gap information reasoning is described such as Fig. 3.Assuming that in a slot, indicate that the tag set of vector is A,
Reader detects that the system label quantity actually replied is b.As shown in Figure 3, there are five types of situations for gap information reasoning:
I. in time slot " 0 ", only one label of A T1, answer time slot is empty slot, i.e., | A |=1 and b=0, then and it can be with
Directly judge T1It is not present, server directly deletes T from database label1；
Ii. in time slot " 1 ", only one label of A T2, replying time slot is single time slot, i.e., | A |=1 and b=1, then and it can be with
Directly judge T2In the presence of server directly deletes T from database label1And T2, while reader transmission " ACK " makes T1And T2
" sleep "；
Iii. in time slot " 2 ", there are two label T by A3And T4, replying time slot is conflict time slot, i.e., | A |=2 and b >=2, by
In the label that the label of A includes reply, it is possible to directly judge T3And T4In the presence of server is directly deleted from database label
Except T3And T4, while reader transmission " ACK " makes T3And T4" sleep "；
Iv. in time slot " 4 ", there are two label T by set A5、T6And T7, replying time slot is single time slot, i.e., | A | > 1 and b=
1, system label uses 10 bit strings information-replies, and reader may determine which label is correspondingly in A, to sentence
Break label presence, and infer remaining all label and be all not present, such as after reader is collected into reply message, detects symbol
The label of conjunction is T5, then T5It must be existing, all T6And T7It is not present, server is deleted from database label
T5、T6And T7, while reader transmission " ACK " makes T5" sleep "；
V. in time slot " 6 ", | A | >=3 and b >=2, this time slot can not immediate reasoning label whether there is, generate history letter
Cease S (T8)+S(T9)+S(T10)+S(T11) >=2, are stored in history information library.
In above-mentioned gap information reasoning, time slot " 0 ", " 1 ", " 2 " and " 4 " can directly be pushed away the label in time slot
Reason judgement, time slot " 6 " can produce historical information.
It is described such as Fig. 4 in time slot label reasoning, label is using 10 bit strings information as KEY value, this method
Using 10 bit KEY values, label calculates according to self ID and generates KEY value, and the KEY value of label T is by H (ID (T)) mod 210It obtains,
The numberical range of 10 bit KEY values is [0,210].Time slot 4 in figure, it is T respectively that there are three label mappings for instruction vector5, T6
And T7, wherein T5And T6KEY value be all " 99 ", T7KEY value be " 100 ", practical reply is single time slot, and reader detects
The KEY value of answer is " 99 ", at this time T5And T6It is likely to be judged as existing, if misjudged, T5And T6It is all false positive
Label.By the way that optimal frame length is arranged, this method can guarantee that the quantity of false positive label is few.Assuming that certain single time slot, indicate to
The label number that amount prediction is replied is k, and it is n that k label, which generates KEY value number,key, the only KEY that generates of each label is different
When be just avoided that the generation of false positive label, the probability of such case is:
PrShould meet needs probability to be achieved:
Pr(nkey=k) > α
The following table 1 reflects the relationship of maximum KEY value quantity and α in time slot:
| α | 0.9 | 0.95 | 0.96 | 0.97 | 0.98 | 0.99 | 0.999 |
| kmax | 16 | 11 | 10 | 9 | 7 | 6 | 3 |
The maximum quantity k of table 1:KEY valuemaxWith the relationship of α
According to table 1, the probability that false positive label occurs is smaller, i.e., α is bigger, the maximum quantity k of KEY value in time slotmaxMore
It is small, guarantee the minimum frame length calculation formula that α is required:
fmin=N/kmax.
Wherein N indicates the quantity of each round database label.
In the time slot label reasoning stage, such as Fig. 3, indicate the database label quantity that maps in vector be " 1 " and " 2 " when
Gap can by immediate reasoning, so, the setting of frame length should meet both time slots appearance maximum probability, function formula are as follows:
Wherein P indicates the probability that two kinds of time slots occur in instruction vector.
Optimum length of frame f*It should be set as fminAnd f1 *Maximum value, in experimenting, we find out that f1 *Much larger than fmin, especially
It is in the case where number of labels is larger, so optimum length of frame is set as f1 *。
The schematic diagram of historical time slot storage is described such as Fig. 5, for the ease of operation, we use Mathematical inequalities
Form.If a label t exists, it is denoted as S (t)=1, if it does not, being denoted as S (t)=0.Such as historical information S in figure
(T8)+S(T9)+S(T10)+S(T11) >=2 are indicated in label T8, T9, T10, T11In at least there are two depositing in systems, the history
The inference method of information are as follows:
(1) for S (T8)+S(T9)+S(T10)+S(T11) >=2, if having inferred S (T8)=1, then historical information is more
New S (T9)+S(T10)+S(T11) >=1, if obtaining S (T in subsequent rationale9)=1, then historical information is updated to S (T10)+S
(T11) >=0, this information is nonsensical, can directly delete from history information library；
(2) for S (T8)+S(T9)+S(T10)+S(T11) >=2, if gap information reasoning obtains S (T8)=0, then history
Information update is S (T9)+S(T10)+S(T11) >=2, if obtaining S (T in subsequent rationale9)=0, then historical information is updated to S
(T10)+S(T11) >=2 can infer T10And T11It is judged as presence, S (T10)=1 and S (T11)=1；
Illustrate a specific embodiment of the invention below by way of the mode of emulation experiment, and by receiving with basic label
Set method Collection is compared, this method be denoted as THIR (Tag inventory based on HistoricalInformation Reasoning)。
We program realization above method using Java and carry out emulation experiment under identical scene and experimental setup,
Compare the time efficiency of two kinds of checking methods.Clocking scheme follows EPCC1G2 standard criterion, it is assumed that data rate is
62.5Kbps, the duration of empty slot, single time slot and the time slot that conflicts is respectively 0.184ms, 2.4ms and 0.44ms, for this
Method THIR, label sent for 10 bit strings information duration as 0.344ms, it is lasting to transmit ID (96 bit)
Time is 2.42ms, and probability of demand α is set as 0.99.
The experiment of Fig. 6 description is the variation observed with system label quantity, two methods Collection and THIR pairs
The quantity ratio of the realization situation that label is made an inventory, initial setup data library number of labels and system label is 1.2, i.e., | N |=1.2
| Y |, in Fig. 6 (a) and (b) experiment, system label quantity | Y | variation range [500,5000], 6 (a) expression labels are when making an inventory
Between variation, Fig. 6 (b) reflection is THIR generate false positive number of labels.Fig. 6 (c) and (d) experiment increase label rule
Mould, system label quantity | Y | variation range [5000,50000], 6 (c) expression labels make an inventory the variation of time, and Fig. 6 (d) is anti-
What is reflected is the false positive number of labels that THIR is generated.It is observed that the method for the present invention THIR time efficiency is better than
Collection, false positive number of labels are seldom.
The experiment of Fig. 7 description is the ratio that observation changes database label and system label, two methods Collection
The realization situation made an inventory with THIR label, the quantity of initial setting up system label are 10000.In Fig. 7 (a) and (b) experiment, than
Value variation range is [1.1,2], and the variation range of database label quantity is [11000,20000], and Fig. 7 (a) describes label disk
The variation of point time, what Fig. 7 (b) reflected is the false positive number of labels that THIR is generated.Fig. 7 (c) and (d) experiment increase data
The quantity ratio of library label and system label, ratio variation range are [2,11], and the variation range of database label quantity is
[20000,110000] observe the method for the present invention THIR time efficiency better than Collection, and false positive number of labels is seldom.
In fact, if it is necessary, can completely avoid the generation of false positive label.For example, server can in certain single time slot
Whether multiple labels that detection is mapped to the time slot in advance have duplicate KEY value, and reader can directly be collected in this time slot should
The ID of system label collects time effects very little used in ID since false positive number of labels is relative to system label sum very little,
Institute still has very high efficiency in the process of the present invention.
Simulation result shows the label checking method proposed by the present invention based on historical information reasoning, can effectively improve
The time efficiency that RFID label tag is made an inventory.
The embodiment of the present invention is described with above attached drawing, but the invention is not limited to above-mentioned specific
Embodiment, the above mentioned embodiment is only schematical, rather than limitation, those skilled in the art
Under the inspiration of the present invention, without breaking away from the scope protected by the purposes and claims of the present invention, it can also make very much
Form, within these are all belonged to the scope of protection of the present invention.
Claims (3)
1. a kind of efficient label checking method based on historical information reasoning, which is characterized in that including following methods:
Before collecting the reply of label, according to use tag ID number Hash in database as a result, when reader prediction is each
The label condition replied in gap and the corresponding expecting state of the time slot, the expecting state are empty slot, single time slot or punching
Prominent time slot；
After receiving reader inquiry message, each label replys one 10 according to oneself ID Hash result in corresponding time slot
Bit strings information；In each time slot, reader by combine time slot expecting state and virtual condition comparative information, with
And the tag return information received determines the specific label replied in the time slot: if receiving the reply of some label, by this
Corresponding tag state is set as 1；If not receiving the reply of some label, 0 is set by the corresponding tag state；If
It can not determine reply label condition, then the state of the time slot and associated possible one history of label generation of replying be waited for into reasoning
Information preservation enables S (t) indicate the state of label t, S (t)={ 0,1 }, if S (t)=0, then it represents that t is not into history information library
In the presence of；If S (t)=1, then it represents that t exists；
Determining tag state is brought into history information library and searches whether that there are history associated with it to wait for inferencing information, is used
To infer the label of other states to be determined.
2. the efficient label checking method based on historical information reasoning as described in claim 1, which is characterized in that including following
Step:
Step 1, reader first calculates optimum length of frame, and database label is calculated according to parameter using hash function each in database
The mapping time slot of label establishes instruction vector, the corresponding map tags in number time slot of each object inside vector；Together
When, reader broadcasts the querying command comprising parameter, and system label replies time slot, the frame length according to parameter, selection are as follows:
Wherein f1For frame length；N is the set of database label；K is the number of database label in time slot；
Step 2, during collecting label, reader is that parameter value A and b: set A expression instruction vector is arranged in each time slot
Corresponding database label, b indicate the system label quantity actually replied；
Step 3, the reasoning that time slot label is carried out according to tag set A and b, there is following several situations:
If i. gap information are as follows: | A | > 0 and b=0 then judge that the label in set A is all not present, delete from database label
0 is both configured to except A, and by the state value of label in A；
If ii. gap information are as follows: | A |=1 and b=1, or | A |=2 and b >=2 then judge that the label in set A all exists,
A is deleted from database label, reader, which sends " ACK ", at the end of time slot makes corresponding system label " sleep ", after being no longer participate in
Continuous activity；And the state value of label in A is both configured to 1；
If iii. gap information are as follows: | A | > 1 and b=1 detect label in set A according to the 10 bit label information received,
If some label in A is consistent with 10 bit informations after hash function is handled, it may determine that the label exists, by it
State is set as 1；Determine that other labels in A are not present simultaneously, sets 0 for its state；Database label deletes set A,
Reader sends " ACK " at the end of time slot, makes existing label " sleep "；
If iv. gap information are as follows: | A | >=3 and b >=2 then regard set A label and answer state value " 2 " as historical information, note
ForIt is stored in history information library；
Step 4, after the reasoning of time slot label, if there is new label to be inferred in a slot, after time slot,
It needs to carry out historical information reasoning, for the historical information in history information libraryA indicates tag set, the value of a
For " 2 " or " 1 ", reasoning process are as follows:
I. if certain label t in AjIt has been judged as being not present, i.e. S (tj)=0, then A deletes tj, a is constant, and historical information is more
Newly it is
Ii. if certain label t in AjIt has been judged as existing, i.e. S (tj)=1, then A deletes tj, a subtracts one, and historical information updates
For
Iii. each historical information is eventually updated to two kinds of forms, it is assumed that set A is finally A after n times updaten, then
A kind of form is S (AnThe information is deleted in) >=0 from history information library；Second of form is S (An)≥|An|, then by AnIn
Tag state is set as 1, and this historical information is deleted from history information library；
Step 5, step 1 is repeated to step 4, until all labels are judged.
3. the efficient label checking method based on historical information reasoning as claimed in claim 2, which is characterized in that infer
Label cannot be deleted directly, need to be deleted and " ACK " in subsequent gap information reasoning.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910162097.9A CN109902784A (en) | 2019-03-05 | 2019-03-05 | A kind of efficient label checking method based on historical information reasoning |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910162097.9A CN109902784A (en) | 2019-03-05 | 2019-03-05 | A kind of efficient label checking method based on historical information reasoning |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109902784A true CN109902784A (en) | 2019-06-18 |
Family
ID=66946353
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910162097.9A Pending CN109902784A (en) | 2019-03-05 | 2019-03-05 | A kind of efficient label checking method based on historical information reasoning |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109902784A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110852129A (en) * | 2019-11-11 | 2020-02-28 | 湖南大学 | Dynamic label estimation method |
| CN114757315A (en) * | 2022-06-15 | 2022-07-15 | 深圳市成为信息股份有限公司 | Method for reader-writer to rapidly output tag data, reader-writer and receiving terminal |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007150045A9 (en) * | 2006-06-22 | 2008-08-14 | Sirit Technologies Inc | Interrogating radio frequency tags |
| CN101685495A (en) * | 2008-09-28 | 2010-03-31 | 华为技术有限公司 | Label identification method and reader and radio frequency identification system |
| KR101220025B1 (en) * | 2011-12-19 | 2013-01-09 | 엘에스산전 주식회사 | Tag anti-collision method of rfid system |
| US20130222118A1 (en) * | 2012-02-28 | 2013-08-29 | Umm Al-Qura University | Method of predicting tag detection probability for rfid framed slotted aloha anti-collision protocols |
| CN103366143A (en) * | 2013-07-03 | 2013-10-23 | 清华大学 | Methods for quickly identifying lost tag in large-scale radio-frequency identification system |
| CN103455783A (en) * | 2013-09-16 | 2013-12-18 | 重庆邮电大学 | Label collision prevention method based on low-redundancy search tree |
| CN106384067A (en) * | 2016-08-31 | 2017-02-08 | 吉林大学 | RFID unknown label identification system and identification method thereof |
| CN107239809A (en) * | 2017-05-31 | 2017-10-10 | 武汉大学 | A kind of quick counting method that read write line is recognized based on hand-held radio frequency |
-
2019
- 2019-03-05 CN CN201910162097.9A patent/CN109902784A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2007150045A9 (en) * | 2006-06-22 | 2008-08-14 | Sirit Technologies Inc | Interrogating radio frequency tags |
| CN101685495A (en) * | 2008-09-28 | 2010-03-31 | 华为技术有限公司 | Label identification method and reader and radio frequency identification system |
| KR101220025B1 (en) * | 2011-12-19 | 2013-01-09 | 엘에스산전 주식회사 | Tag anti-collision method of rfid system |
| US20130222118A1 (en) * | 2012-02-28 | 2013-08-29 | Umm Al-Qura University | Method of predicting tag detection probability for rfid framed slotted aloha anti-collision protocols |
| CN103366143A (en) * | 2013-07-03 | 2013-10-23 | 清华大学 | Methods for quickly identifying lost tag in large-scale radio-frequency identification system |
| CN103455783A (en) * | 2013-09-16 | 2013-12-18 | 重庆邮电大学 | Label collision prevention method based on low-redundancy search tree |
| CN106384067A (en) * | 2016-08-31 | 2017-02-08 | 吉林大学 | RFID unknown label identification system and identification method thereof |
| CN107239809A (en) * | 2017-05-31 | 2017-10-10 | 武汉大学 | A kind of quick counting method that read write line is recognized based on hand-held radio frequency |
Non-Patent Citations (2)
| Title |
|---|
| F. ZHU, B. XIAO, J. LIU, B. WANG, Q. PAN AND L. CHEN: "Exploring Tag Distribution in Multi-Reader RFID Systems", 《IEEE TRANSACTIONS ON MOBILE COMPUTING》 * |
| F. ZHU, B. XIAO, J. LIU, X. LIU AND L. CHEN: "PLAT: A Physical-Layer Tag Searching Protocol in Large RFID Systems", 《2016 13TH ANNUAL IEEE INTERNATIONAL CONFERENCE ON SENSING, COMMUNICATION, AND NETWORKING (SECON)》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110852129A (en) * | 2019-11-11 | 2020-02-28 | 湖南大学 | Dynamic label estimation method |
| CN110852129B (en) * | 2019-11-11 | 2021-12-10 | 湖南大学 | Dynamic label estimation method |
| CN114757315A (en) * | 2022-06-15 | 2022-07-15 | 深圳市成为信息股份有限公司 | Method for reader-writer to rapidly output tag data, reader-writer and receiving terminal |
| CN114757315B (en) * | 2022-06-15 | 2022-08-26 | 深圳市成为信息股份有限公司 | Method for reader-writer to rapidly output label data, reader-writer and receiving terminal |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | Revisiting unknown RFID tag identification in large-scale internet of things | |
| JP4542509B2 (en) | Identifier recognition method, identifier transmission method, and identifier recognition system | |
| CN106384067B (en) | A kind of RFID Unknown Label identifying system and recognition methods | |
| CN105913682A (en) | RFID technology-based intelligent reverse car locating method and RFID technology-based intelligent reverse car locating system | |
| CN109902784A (en) | A kind of efficient label checking method based on historical information reasoning | |
| CN102750638B (en) | RFID (Radio Frequency Identification Device)-based product anti-channel conflict checking system and realization method thereof | |
| CN111066040A (en) | Inventory management system | |
| Kumar et al. | A novel and efficient reader-to-reader and tag-to-tag anti-collision protocol | |
| Han et al. | A protocol for detecting missing target tags in RFID systems | |
| CN111754140A (en) | Personnel management system and method based on RFID | |
| Liu et al. | Pinpointing anomaly RFID tags: Situation and opportunities | |
| CN203012788U (en) | Intelligent storage control system | |
| CN205581966U (en) | Smart storage management system based on RFID | |
| Wang | A fast hybrid strategy-based RFID tag identification protocol | |
| CN103049719B (en) | The system and method for extensive label is read in radio-frequency recognition system | |
| CN101231686A (en) | Method for recognizing contrary collision of inquiry tree radio frequency labels of amalgamation database | |
| CN105677478A (en) | Method and apparatus for resources management | |
| CN103793362B (en) | Static reader dispatching method based on reader priority | |
| Su et al. | Unknown tag identification protocol based on collision slot resolution in large-scale and battery-less RFID system | |
| Yi | Data center management technology based on RFID automatic radio frequency identification technology | |
| Zu et al. | Development of a monitoring and management system for nonheritage tourist attractions based on mobile GIS and multisensor technology | |
| Lin et al. | Efficiently Identifying Unknown COTS RFID Tags for Intelligent Transportation Systems | |
| Papatheocharous et al. | eTracer: An innovative near-real time track-and-trace platform | |
| Han et al. | A new model of intelligent nursing based on 5G network architecture and RFID technology | |
| Liu et al. | Design of Logistics Intelligent Warehouse Management System Based on Radio Frequency Identification Technology for 5G |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190618 |