CN105095806B - RFID tag quantity survey method in Emergency Logistics management system - Google Patents
RFID tag quantity survey method in Emergency Logistics management system Download PDFInfo
- Publication number
- CN105095806B CN105095806B CN201410211131.4A CN201410211131A CN105095806B CN 105095806 B CN105095806 B CN 105095806B CN 201410211131 A CN201410211131 A CN 201410211131A CN 105095806 B CN105095806 B CN 105095806B
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- msup
- mfrac
- mtr
- 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
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses the estimation that RFID tag quantity survey method label method of estimation in a kind of Emergency Logistics management system realizes number of labels using least square method, using the quadratic power characteristic of least square method, it can preferably ensure that evaluated error has less average and variance.And the quantity for the label being read quickly is estimated in reading process, the size for reading window is adjusted according to the quantity of label in time, realizes that tag reader speed is maximized, effectively shortens read access time, provide powerful support for disaster relief process.
Description
Technical field
The present invention relates to signal transacting and field of radio frequency identification, logistics system radio frequency under a kind of case of emergency is related specifically to
Recognize the method for estimation of number of labels.
Background technology
China is the country that a natural calamity takes place frequently, and then needs to provide large quantities of disaster relief supplies during disaster assistance.Due to providing
Efficiency is low, the phenomenon for disaster relief supplies accumulation often occur.Penetrated to solve this problem, it is necessary to be sticked for each disaster relief article
Frequency identification tag, it is possible to achieve remote, high-volume reads tag number, realizes quick storage to goods yard goods and materials, outbound, shortens
The Time Of Release of disaster relief supplies.
The method that current REID reads label mainly has the tag reading method based on Aloha, based on y-bend
The tag reading method of tree.Read method based on binary tree needs repeatedly interaction to complete batch reading, and read access time is long,
Reading rate is low.Thus often rescue work is caused to be made slow progress.
The content of the invention
To solve the above problems, it is an object of the invention to provide RFID tag in a kind of Emergency Logistics management system
Quantity survey method.
To achieve the above object, RFID tag quantity survey method bag in a kind of Emergency Logistics management system of the invention
Include following steps：
1) all labels of the label reader into the reader coverage send reading order；These labels are ordered to exist
One time slot response of random selection in setting time length or time frame length；
2) in one time slot, if without tag responses, the time slot is free timeslot；If only one label should
It is Successful transmissions time slot to answer the then gap；If two or more labels will be clashed in a time slot response simultaneously,
Failure is read, the time slot is conflict time slot；
3) quantity and the quantity of Successful transmissions time slot of the free timeslot occurred after once reading are calculated；
4) in the time slot of conflict, the number of the bit clashed using Manchester's code；According to binary system
Difference one, two, three and the quantity of the conflict time slot of multidigit that searching algorithm is respectively obtained；
5) information above is based on, the quantity of remaining label after one read cycle of Least Square Method is employed；
With remaining number of labels after one read cycle of Least Square Method, we have done defined below：It is assumed that xi
It is the number of tags conflicted in i-th of time slot, and xi≥2。
Make ptag(xi) represent xiThe probability that individual label collides in one time slot, makes S represent what a time frame was included
Number of timeslots, and make T represent whole number of labels.So as to obtain equation below：
Because each bit of tag number is represented with 0 or 1, then xiIndividual label is general in same bit numerical value identical
Rate is
Make pid(yk) it is xiThe y in same time slot collision of individual labelkThe different probability of the bit value of individual bit, makes the I be
The bit length of tag number.Obtain formula：
Make p (xi,yk) it is x in i-th of time slotiIndividual label is clashed, and ykThe different probability of individual bit, wherein xi≥
2。
Work as xi=0, expression does not have label response, thus the generation that do not conflict in a time slot, so as to obtain yk=0, then：
Work as xi=1, indicate that a label is read in a slot, do not conflict equally generation yet, obtains yk=0, then：
Work as xi>=2, there are multiple labels to be read in a time slot, there is conflict, therefore ykMay be 1,2 ... in I
Any one number.ykThe different probability of bit can be expressed as：
Make n0,0To respond the quantity of time slot without label, then a frame in contains n0,0It is individual to respond the general of time slot without label
Rate is as follows：
Make n1,0For the timeslot number responded without bit bit swiping only one of which label, that is, succeed the timeslot number read, then may be used
To obtain including n in a frame in1,0The probability of individual time slot can be expressed as：
OrderTo include ykThe x of different bitsiThe number of timeslots of individual label response, then go out in a frame in
Existing number of timeslotsProbability be：
Then the average probability of all kinds of situations appearance is：
Least Square Method formula is
When LSQ (T) reaches minimum in Least Square Method formula, corresponding T is exactly the radio frequency identification marking estimated
The quantity of label, is expressed as T', i.e.,：
Then remaining number of labels T after a read cycle can be obtainedleftIt is as follows：
Tleft=T'-n1,0 (13)
The quantity for the label being read can accurately be estimated by the number of labels algorithm for estimating of this patent, effectively improved
The tag reader speed of radio-frequency recognition system based on Aloha.Label method of estimation realizes number of labels using least square method
Estimation, using the quadratic power characteristic of least square method, can preferably ensure that evaluated error has less average and variance.
And the quantity for the label being read quickly is estimated in reading process, adjusted according to the quantity of label read the big of window in time
It is small, realize that tag reader speed is maximized, effectively shorten read access time, provide powerful support for disaster relief process.
Brief description of the drawings
Embodiment
Presently in connection with embodiment, the present invention will be described.
The present invention gives a kind of RFID tag quantity survey method based on Aloha, radio-frequency identification reader/writer can
So that after once label is read, remaining number of labels is accurately estimated using reading situation, then the length of frame is rationally set,
Realize that reading rate is maximized.
RFID tag quantity survey method comprises the following steps in a kind of Emergency Logistics management system of the present invention：
1) all labels of the label reader into the reader coverage send reading order；These labels are ordered to exist
One time slot response of random selection in setting time length or time frame length；
2) in one time slot, if without tag responses, the time slot is free timeslot；If only one label should
It is Successful transmissions time slot to answer the then gap；If two or more labels will be clashed in a time slot response simultaneously,
Failure is read, the time slot is conflict time slot；
3) quantity and the quantity of Successful transmissions time slot of the free timeslot occurred after once reading are calculated；
4) in the time slot of conflict, the number of the bit clashed using Manchester's code；According to binary system
Difference one, two, three and the quantity of the conflict time slot of multidigit that searching algorithm is respectively obtained；
5) information above is based on, the quantity of remaining label after one read cycle of Least Square Method is employed；
With remaining number of labels after one read cycle of Least Square Method, we have done defined below：It is assumed that xi
It is the number of tags conflicted in i-th of time slot, and xi≥2。
Make ptag(xi) represent xiThe probability that individual label collides in one time slot, makes S represent what a time frame was included
Number of timeslots, and make T represent whole number of labels.So as to obtain equation below：
Because each bit of tag number is represented with 0 or 1, then xiIndividual label is general in same bit numerical value identical
Rate is
Make pid(yk) it is xiThe y in same time slot collision of individual labelkThe different probability of the bit value of individual bit, makes the I be
The bit length of tag number.Obtain formula：
Make p (xi,yk) it is x in i-th of time slotiIndividual label is clashed, and ykThe different probability of individual bit, wherein xi≥
2。
Work as xi=0, expression does not have label response, thus the generation that do not conflict in a time slot, so as to obtain yk=0, then：
Work as xi=1, indicate that a label is read in a slot, do not conflict equally generation yet, obtains yk=0, then：
Work as xi>=2, there are multiple labels to be read in a time slot, there is conflict, therefore ykMay be 1,2 ... in I
Any one number.ykThe different probability of bit can be expressed as：
Make n0,0For the quantity of the free timeslot responded without label, then a frame in contains n0,0The probability of individual free timeslot is such as
Under：
Make n1,0For the timeslot number responded without bit bit swiping only one of which label, that is, succeed the timeslot number read, then may be used
To obtain including n in a frame in1,0The probability of individual time slot can be expressed as：
OrderTo include ykThe x of different bitsiThe number of timeslots of individual label response, then go out in a frame in
Existing number of timeslotsProbability be：
Then the average probability of all kinds of situations appearance is：
Least Square Method formula is
When LSQ (T) reaches minimum in Least Square Method formula, corresponding T is exactly the radio frequency identification marking estimated
The quantity of label, is expressed as T', i.e.,：
Then remaining number of labels T after a read cycle can be obtainedleftIt is as follows：
Tleft=T'-n1,0 (13)
Radio-frequency recognition system includes：Server (or common computer, intelligent terminal etc.), RFID tag reader, radio frequency
Recognize label.Server is connected with RFID tag reader, control RFID tag reader work.RFID tag reader passes through
Wireless mode completes the reading writing working to RFID tag.One RFID tag reader can be completed to multiple radio frequency identifications
The reading writing working of label.Specific implementation is as follows：
Server sends reading order to RFID reader, and RFID reader is received after order by wireless parties
Formula to RFID tag send reading tag number order, notified tag randomly choose in a frame length one time slot make answer
Answer；
RFID tag receives reading order, the frame length in order, produces one and uniformly divides in the range of frame length
The random number of cloth starts countdown as response time；
Countdown terminates rear RFID tag and the tag number controlled oneself is sent to RFID tag reader；
RFID tag reader statistics receives the situation of RFID tag response in an each time slot of frame in, and unites
Count n0,0、n1,0、nXi≥2,yk(wherein, xiMinimum value is 2, and maximum is tag number bit wide, ykMinimum value is 1, and maximum is frame length
Degree) quantity；
Radio-frequency identification reader/writer does not read the quantity of the RFID tag of tag number using formula (12), (13) estimation
T'；
RFID tag reader is according to the remaining number of labels T for not reading tag numberleftFrame length is set, frame length etc. is made
In Tleft, then repeat the above steps, finished until all RFID tags are read.
Claims (3)
1. a kind of RFID tag quantity survey method in Emergency Logistics management system, it is characterised in that comprise the following steps：
1) all labels of the label reader into the reader coverage send reading order；These labels are ordered in setting
One time slot response of random selection in time span or time frame length；
2) in one time slot, if without tag responses, the time slot is free timeslot；If only one tag responses
Gap is Successful transmissions time slot；If two or more labels will be clashed in a time slot response simultaneously, read and lose
Lose, the time slot is conflict time slot；
3) quantity and the quantity of Successful transmissions time slot of the free timeslot occurred after once reading are calculated；
4) in the time slot of conflict, the number of the bit clashed using Manchester's code；According to binary search
Difference one, two, three and the quantity of the conflict time slot of multidigit that algorithm is respectively obtained；
5) be based on the step 1), the step 2), the step 3), the step 4) information, employ a following most young waiter in a wineshop or an inn
Multiplication estimates the quantity of RFID tag；
Set xiIt is the number of tags conflicted in i-th of time slot, and xi≥2；
Make ptag(xi) represent xiThe probability that individual label collides in one time slot, makes S represent the time slot that a time frame is included
Quantity, and make T represent whole number of labels；So as to obtain equation below (1)：
<mrow>
<msub>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mi>a</mi>
<mi>g</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "(" close = ")">
<mtable>
<mtr>
<mtd>
<mi>T</mi>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
</mtd>
</mtr>
</mtable>
</mfenced>
<msup>
<mrow>
<mo>(</mo>
<mfrac>
<mn>1</mn>
<mi>S</mi>
</mfrac>
<mo>)</mo>
</mrow>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
</msup>
<msup>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<mfrac>
<mn>1</mn>
<mi>S</mi>
</mfrac>
<mo>)</mo>
</mrow>
<mrow>
<mi>T</mi>
<mo>-</mo>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
</mrow>
</msup>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>)</mo>
</mrow>
</mrow>
Make pid (yk) it is xiThe y in same time slot collision of individual labelkThe different probability of the bit value of individual bit, it is mark to make I
The bit length of sign, obtains formula (2)：
<mrow>
<msub>
<mi>p</mi>
<mrow>
<mi>i</mi>
<mi>d</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "(" close = ")">
<mtable>
<mtr>
<mtd>
<mi>I</mi>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
</mtd>
</mtr>
</mtable>
</mfenced>
<msup>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<mfrac>
<mn>1</mn>
<msup>
<mn>2</mn>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
</msup>
</mfrac>
<mo>)</mo>
</mrow>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
</msup>
<msup>
<mrow>
<mo>(</mo>
<mfrac>
<mn>1</mn>
<msup>
<mn>2</mn>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
</msup>
</mfrac>
<mo>)</mo>
</mrow>
<mrow>
<mi>I</mi>
<mo>-</mo>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
</mrow>
</msup>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>2</mn>
<mo>)</mo>
</mrow>
</mrow>
Make p (xi,yk) it is x in i-th of time slotiIndividual label is clashed, and ykThe different probability of individual bit, wherein xi>=2, then
Obtain below equation (3)：
<mrow>
<mi>p</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
<mo>,</mo>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msub>
<mi>p</mi>
<mrow>
<mi>t</mi>
<mi>a</mi>
<mi>g</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
<mo>)</mo>
</mrow>
<msub>
<mi>p</mi>
<mrow>
<mi>i</mi>
<mi>d</mi>
</mrow>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "(" close = ")">
<mtable>
<mtr>
<mtd>
<mi>T</mi>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
</mtd>
</mtr>
</mtable>
</mfenced>
<msup>
<mrow>
<mo>(</mo>
<mfrac>
<mn>1</mn>
<mi>S</mi>
</mfrac>
<mo>)</mo>
</mrow>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
</msup>
<msup>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<mfrac>
<mn>1</mn>
<mi>S</mi>
</mfrac>
<mo>)</mo>
</mrow>
<mrow>
<mi>T</mi>
<mo>-</mo>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
</mrow>
</msup>
<mfenced open = "(" close = ")">
<mtable>
<mtr>
<mtd>
<mi>I</mi>
</mtd>
</mtr>
<mtr>
<mtd>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
</mtd>
</mtr>
</mtable>
</mfenced>
<msup>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<mfrac>
<mn>1</mn>
<msup>
<mn>2</mn>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
</msup>
</mfrac>
<mo>)</mo>
</mrow>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
</msup>
<msup>
<mrow>
<mo>(</mo>
<mfrac>
<mn>1</mn>
<msup>
<mn>2</mn>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
</msup>
</mfrac>
<mo>)</mo>
</mrow>
<mrow>
<mi>I</mi>
<mo>-</mo>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
</mrow>
</msup>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>3</mn>
<mo>)</mo>
</mrow>
</mrow>
Work as xi=0, expression does not have label response, thus the generation that do not conflict in a time slot, so as to obtain yk=0, then obtain public affairs
Formula (4)：
<mrow>
<mi>p</mi>
<mrow>
<mo>(</mo>
<mn>0</mn>
<mo>,</mo>
<mn>0</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "(" close = ")">
<mtable>
<mtr>
<mtd>
<mi>T</mi>
</mtd>
</mtr>
<mtr>
<mtd>
<mn>0</mn>
</mtd>
</mtr>
</mtable>
</mfenced>
<msup>
<mrow>
<mo>(</mo>
<mfrac>
<mn>1</mn>
<mi>S</mi>
</mfrac>
<mo>)</mo>
</mrow>
<mn>0</mn>
</msup>
<msup>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<mfrac>
<mn>1</mn>
<mi>S</mi>
</mfrac>
<mo>)</mo>
</mrow>
<mi>T</mi>
</msup>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>4</mn>
<mo>)</mo>
</mrow>
</mrow>
Work as xi=1, indicate that a label is read in a slot, do not conflict equally generation yet, obtains yk=0, then obtain following
Formula (5)：
<mrow>
<mi>p</mi>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>,</mo>
<mn>0</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfenced open = "(" close = ")">
<mtable>
<mtr>
<mtd>
<mi>T</mi>
</mtd>
</mtr>
<mtr>
<mtd>
<mn>1</mn>
</mtd>
</mtr>
</mtable>
</mfenced>
<mrow>
<mo>(</mo>
<mfrac>
<mn>1</mn>
<mi>S</mi>
</mfrac>
<mo>)</mo>
</mrow>
<msup>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<mfrac>
<mn>1</mn>
<mi>S</mi>
</mfrac>
<mo>)</mo>
</mrow>
<mrow>
<mi>T</mi>
<mo>-</mo>
<mn>1</mn>
</mrow>
</msup>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>5</mn>
<mo>)</mo>
</mrow>
</mrow>
Work as xi>=2, there are multiple labels to be read in a time slot, there is conflict, therefore ykMay be 1,2 ... it is any in I
One number, then ykThe different probability of bit is expressed as below equation (6)：
<mrow>
<mi>p</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
<mo>&GreaterEqual;</mo>
<mn>2</mn>
<mo>,</mo>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
<mo>=</mo>
<mn>2</mn>
</mrow>
<mi>T</mi>
</munderover>
<mi>p</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
<mo>,</mo>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>6</mn>
<mo>)</mo>
</mrow>
</mrow>
Make n0,0For the quantity of the free timeslot responded without label, then contain n in a time frame0,0The probability of individual free timeslot
Equation below (7)：
<mrow>
<msub>
<mi>p</mi>
<mi>m</mi>
</msub>
<mrow>
<mo>(</mo>
<mn>0</mn>
<mo>,</mo>
<mn>0</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mi>p</mi>
<msup>
<mrow>
<mo>(</mo>
<mn>0</mn>
<mo>,</mo>
<mn>0</mn>
<mo>)</mo>
</mrow>
<msub>
<mi>n</mi>
<mrow>
<mn>0</mn>
<mo>,</mo>
<mn>0</mn>
</mrow>
</msub>
</msup>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>7</mn>
<mo>)</mo>
</mrow>
</mrow>
Make n1,0For the timeslot number responded without bit bit swiping only one of which label, that is, succeed transmission time slot number, then obtain one
Frame in includes n1,0The probability of individual time slot is expressed as formula (8)：
<mrow>
<msub>
<mi>p</mi>
<mi>m</mi>
</msub>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>,</mo>
<mn>0</mn>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mi>p</mi>
<msup>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>,</mo>
<mn>0</mn>
<mo>)</mo>
</mrow>
<msub>
<mi>n</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>0</mn>
</mrow>
</msub>
</msup>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>8</mn>
<mo>)</mo>
</mrow>
</mrow>
OrderTo include ykThe x of different bitsiThe number of timeslots of individual label response, then when a frame in occurs
Gap quantityProbability be below equation (9)：
<mrow>
<msub>
<mi>p</mi>
<mi>m</mi>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
<mo>&GreaterEqual;</mo>
<mn>2</mn>
<mo>,</mo>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mi>p</mi>
<msup>
<mrow>
<mo>(</mo>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
<mo>&GreaterEqual;</mo>
<mn>2</mn>
<mo>,</mo>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
<mo>)</mo>
</mrow>
<msub>
<mi>n</mi>
<mrow>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
<mo>></mo>
<mn>2</mn>
<mo>,</mo>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
</mrow>
</msub>
</msup>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>9</mn>
<mo>)</mo>
</mrow>
</mrow>
The average probability that then all kinds of situations occur is expressed as below equation (10)：
<mrow>
<mover>
<msub>
<mi>p</mi>
<mi>m</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<mo>=</mo>
<mfrac>
<mrow>
<msub>
<mi>n</mi>
<mrow>
<mn>0</mn>
<mo>,</mo>
<mn>0</mn>
</mrow>
</msub>
<msub>
<mi>p</mi>
<mi>m</mi>
</msub>
<mrow>
<mo>(</mo>
<mn>0</mn>
<mo>,</mo>
<mn>0</mn>
<mo>)</mo>
</mrow>
<mo>+</mo>
<msub>
<mi>n</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>0</mn>
</mrow>
</msub>
<msub>
<mi>p</mi>
<mi>m</mi>
</msub>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>,</mo>
<mn>0</mn>
<mo>)</mo>
</mrow>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>I</mi>
</munderover>
<msub>
<mi>n</mi>
<mrow>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
<mo>&GreaterEqual;</mo>
<mn>2</mn>
<mo>,</mo>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
</mrow>
</msub>
<msub>
<mi>p</mi>
<mi>m</mi>
</msub>
<mrow>
<mo>(</mo>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
<mo>&GreaterEqual;</mo>
<mn>2</mn>
<mo>,</mo>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<msub>
<mi>n</mi>
<mrow>
<mn>0</mn>
<mo>,</mo>
<mn>0</mn>
</mrow>
</msub>
<mo>+</mo>
<msub>
<mi>n</mi>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>0</mn>
</mrow>
</msub>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>I</mi>
</munderover>
<msub>
<mi>n</mi>
<mrow>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
<mo>&GreaterEqual;</mo>
<mn>2</mn>
<mo>,</mo>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
</mrow>
</msub>
</mrow>
</mfrac>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>10</mn>
<mo>)</mo>
</mrow>
</mrow>
Set up Least Square Method formula (11) as follows：
<mrow>
<mi>L</mi>
<mi>S</mi>
<mi>Q</mi>
<mrow>
<mo>(</mo>
<mi>T</mi>
<mo>)</mo>
</mrow>
<mo>=</mo>
<msup>
<mrow>
<mo>(</mo>
<msub>
<mi>p</mi>
<mi>m</mi>
</msub>
<mo>(</mo>
<mrow>
<mn>0</mn>
<mo>,</mo>
<mn>0</mn>
</mrow>
<mo>)</mo>
<mo>-</mo>
<mover>
<msub>
<mi>p</mi>
<mi>m</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<mo>)</mo>
</mrow>
<mn>2</mn>
</msup>
<mo>+</mo>
<msup>
<mrow>
<mo>(</mo>
<msub>
<mi>p</mi>
<mi>m</mi>
</msub>
<mo>(</mo>
<mrow>
<mn>1</mn>
<mo>,</mo>
<mn>0</mn>
</mrow>
<mo>)</mo>
<mo>-</mo>
<mover>
<msub>
<mi>p</mi>
<mi>m</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<mo>)</mo>
</mrow>
<mn>2</mn>
</msup>
<mo>+</mo>
<munderover>
<mo>&Sigma;</mo>
<mrow>
<mi>k</mi>
<mo>=</mo>
<mn>1</mn>
</mrow>
<mi>I</mi>
</munderover>
<msup>
<mrow>
<mo>(</mo>
<msub>
<mi>p</mi>
<mi>m</mi>
</msub>
<mo>(</mo>
<mrow>
<msub>
<mi>x</mi>
<mi>i</mi>
</msub>
<mo>&GreaterEqual;</mo>
<mn>2</mn>
<mo>,</mo>
<msub>
<mi>y</mi>
<mi>k</mi>
</msub>
</mrow>
<mo>)</mo>
<mo>-</mo>
<mover>
<msub>
<mi>p</mi>
<mi>m</mi>
</msub>
<mo>&OverBar;</mo>
</mover>
<mo>)</mo>
</mrow>
<mn>2</mn>
</msup>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>11</mn>
<mo>)</mo>
</mrow>
</mrow>
When LSQ (T) reaches minimum in Least Square Method formula, corresponding T estimate T' is then RFID tag
Quantity, i.e.,：
<mrow>
<mi>L</mi>
<mi>S</mi>
<mi>Q</mi>
<mrow>
<mo>(</mo>
<msup>
<mi>T</mi>
<mo>&prime;</mo>
</msup>
<mo>)</mo>
</mrow>
<mo>=</mo>
<munder>
<mi>min</mi>
<mrow>
<mi>T</mi>
<mo>&Element;</mo>
<mo>(</mo>
<mn>0</mn>
<mo>,</mo>
<mi>I</mi>
<mo>&rsqb;</mo>
</mrow>
</munder>
<mi>L</mi>
<mi>S</mi>
<mi>Q</mi>
<mrow>
<mo>(</mo>
<mi>T</mi>
<mo>)</mo>
</mrow>
<mo>-</mo>
<mo>-</mo>
<mo>-</mo>
<mrow>
<mo>(</mo>
<mn>12</mn>
<mo>)</mo>
</mrow>
<mo>.</mo>
</mrow>
2. RFID tag quantity survey method in Emergency Logistics management system as claimed in claim 1, it is characterised in that
Further comprising the steps of (6)：Remaining number of labels after one read cycle is estimated by below equation (13),
Tleft=T'-n1,0 (13)
Wherein, TleftFor remaining number of labels.
3. number of labels method of estimation as claimed in claim 2, it is characterised in that the RFID tag reader is not according to reading
Take the remaining number of labels T of tag numberleftFrame length is set, makes frame length be equal to Tleft, then repeat the above steps (1) extremely
(6), until the reading of all RFID tags is finished.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410211131.4A CN105095806B (en) | 2014-05-19 | 2014-05-19 | RFID tag quantity survey method in Emergency Logistics management system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410211131.4A CN105095806B (en) | 2014-05-19 | 2014-05-19 | RFID tag quantity survey method in Emergency Logistics management system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105095806A CN105095806A (en) | 2015-11-25 |
| CN105095806B true CN105095806B (en) | 2017-10-10 |
Family
ID=54576203
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410211131.4A Active CN105095806B (en) | 2014-05-19 | 2014-05-19 | RFID tag quantity survey method in Emergency Logistics management system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105095806B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111444734B (en) * | 2020-03-18 | 2023-08-15 | 杭州电子科技大学 | RFID tag number estimation method and system |
| CN113836961B (en) * | 2021-11-26 | 2022-02-11 | 广州优刻谷科技有限公司 | Method and system for estimating quantity of passive ultrahigh frequency RFID tags |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101620661A (en) * | 2008-07-04 | 2010-01-06 | 广州香港科大研究开发有限公司 | High-efficiency label counting method in radio frequency recognition system |
| CN101650770A (en) * | 2009-08-27 | 2010-02-17 | 华南理工大学 | Binary search anti-collision method with unknown label quantity estimation function |
| CN103020569A (en) * | 2012-12-27 | 2013-04-03 | 南京三宝科技股份有限公司 | Radio-frequency identification multi-label anti-collision method |
-
2014
- 2014-05-19 CN CN201410211131.4A patent/CN105095806B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101620661A (en) * | 2008-07-04 | 2010-01-06 | 广州香港科大研究开发有限公司 | High-efficiency label counting method in radio frequency recognition system |
| CN101650770A (en) * | 2009-08-27 | 2010-02-17 | 华南理工大学 | Binary search anti-collision method with unknown label quantity estimation function |
| CN103020569A (en) * | 2012-12-27 | 2013-04-03 | 南京三宝科技股份有限公司 | Radio-frequency identification multi-label anti-collision method |
Non-Patent Citations (2)
| Title |
|---|
| 动态估计标签数量的RFID防碰撞算法研究;赵瑞思等;《计算机工程》;20120430;第249-251页 * |
| 基于RFID技术的智能物流***研究与设计;张惠琳等;《网络与信息化》;20130331;第445-448页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105095806A (en) | 2015-11-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102024134A (en) | High-efficiency multi-tag anti-collision radio frequency identification (RFID) method | |
| CN100412879C (en) | Radio frequency identification reader, radio frequency identification tag, system and method for identifying rfid tags | |
| CN103761494A (en) | Method and system for identifying lost tag of RFID system | |
| CN103955657B (en) | A kind of frame slot ultrahigh frequency RFID system anti-collision method based on blind separation | |
| JP2010507877A (en) | Method for recognizing tag and RFID tag using the same | |
| CN105095806B (en) | RFID tag quantity survey method in Emergency Logistics management system | |
| CN104331679B (en) | A kind of RFID tag anti-collision method based on physical-layer network coding | |
| CN103559597A (en) | Storage monitoring method mixed with multi-dimensional factor commodity bar code technology | |
| CN104573593B (en) | A kind of deficient based on frame slot determines blind separation RFID anti-collision method | |
| CN103268465A (en) | Fast identifying method of tag type in radio frequency identification system | |
| KR101297863B1 (en) | Missing protection system and method available for checking location and information with real-time through setting location information | |
| CN106997479A (en) | A kind of inventory management system based on RFID technique | |
| CN103996059A (en) | Informatization system and method for article tags | |
| CN103366143A (en) | Methods for quickly identifying lost tag in large-scale radio-frequency identification system | |
| KR20160104246A (en) | Unmanned inventory actual inspection system using arerial vehicle and the method thereof | |
| CN104063627B (en) | A kind of optimal Q determination method for parameter and device | |
| WO2014151935A4 (en) | Systems and methods for radio frequency identification device management | |
| CN107239809B (en) | Rapid checking method based on handheld radio frequency identification reader-writer | |
| CN105095926B (en) | A kind of stagewise distant range active electronic tag and its recognition methods | |
| CN109272085B (en) | RFID intelligent tool management system based on cloud data | |
| WO2014150531A4 (en) | Merchandise event monitoring via wireless tracking | |
| CN103544459B (en) | The evaluation method of a kind of RFID tag sum and system | |
| CN204374995U (en) | Multi-frequency band radio-frequency smart card, reader device and multi-frequency band radio-frequency card number integrated system | |
| WO2016166660A3 (en) | System and method for real time emergency mustering | |
| CN206557848U (en) | Printing progress queries system based on Internet of Things |
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 | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210309 Address after: No.69 Yongding Road, Haidian District, Beijing 100089 Patentee after: Third Medical Center, General Hospital of the Chinese PLA Address before: 100039 No. 69, Yongding Road, Beijing, Haidian District Patentee before: Zheng Jingchen Patentee before: Li Ming Patentee before: Chen Jinhong Patentee before: Hao Yuwen Patentee before: Yang Yu |