CN104657693B - A kind of RFID anti-collision method based on grouping self-adjusted block time slot - Google Patents
A kind of RFID anti-collision method based on grouping self-adjusted block time slot Download PDFInfo
- Publication number
- CN104657693B CN104657693B CN201510087504.6A CN201510087504A CN104657693B CN 104657693 B CN104657693 B CN 104657693B CN 201510087504 A CN201510087504 A CN 201510087504A CN 104657693 B CN104657693 B CN 104657693B
- Authority
- CN
- China
- Prior art keywords
- label
- time slot
- reader
- algorithm
- tags
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 30
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 95
- 238000012545 processing Methods 0.000 claims abstract description 9
- 230000001965 increasing effect Effects 0.000 abstract description 6
- 238000004088 simulation Methods 0.000 abstract description 3
- 238000004458 analytical method Methods 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 5
- 238000013461 design Methods 0.000 description 4
- 230000003044 adaptive effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000012896 Statistical algorithm Methods 0.000 description 1
- 230000002457 bidirectional effect Effects 0.000 description 1
- 229910002056 binary alloy Inorganic materials 0.000 description 1
- 230000001149 cognitive effect Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 238000009795 derivation Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000035515 penetration Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
- 238000003860 storage Methods 0.000 description 1
- 238000005303 weighing Methods 0.000 description 1
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
A kind of RFID anti-collision method based on grouping self-adjusted block time slot, reader is allowed to be scanned statistics to the random selected time slot of label first, and send it to each label, label carries out correspondingly time slot adjustment again, reader is made to skip free timeslot and collision time slot, adaptively allocative efficiency time slot, and then label is quickly identified, when unidentified number of tags is bigger, algorithm is using the strategies such as grouping and dynamic adjustment frame length, to reduce the time of time slot processing.Simulation result shows：The present invention improves the recognition efficiency and stability of system, reduce transport overhead, particularly when number of tags is more than 1000, the throughput of algorithm remains at more than 71%, 300% and 97.2% has been respectively increased in system effectiveness than traditional 256 algorithm of Frame Slotted Aloha and packet dynamic frame CDMA slotted ALOHA algorithm, and the present invention is to the quick identification of internet label with actual application value.
Description
Technical field
The invention belongs to the multi-tags in technical field of RFID to read technology, is related to the method for multiple labels anti-collision.
Background technology
Radio frequency identification (Radio Frequency Identification, RFID) is a kind of utilization Electromagnetic Wave Propagation mode
Non-contact bidirectional data transfers are carried out between reader and label, and then obtain the identification technology for being identified object information, quilt
It is known as the most with prospects of 21 century and changes the new and high technology of power.The technology have data exchange fast, tracking object and
When, without space limitation, penetration capacity is strong, multi-targets recognition and the advantages that antipollution, in logistics management, communications and transportation, automation
The industries such as production, public information service have a wide range of applications, and can greatly improve management and operational paradigm, reduce cost.
RFID system is by electronic tag (Tag), reader (Reader) and back-end data base (Database) three parts
Composition.In the radio-frequency recognition system of multiple readers and multiple labels, there is the collision of two kinds of forms, i.e. reader collides
And tag-collision.Since the probability of reader collision generation is smaller and the processing capacity of reader in itself is stronger, reader
Collision problem is easier to solve.In terms of the collision problem that scholar both domestic and external communicates in multi-tag with reader device simultaneously
Through having done substantial amounts of research, these methods are generally divided into four classes：Space division multiplexing method, Frequency Division Multiplexing method, Code Division Multiplex method and when
Divide multi path.The features such as due to the low-power consumption of label, low storage capacity and limited computing capability, label anti-collision method is main
Using time-division multiplex method.
In time-division multiplex method, current most common multi-label anti-collision algorithm is divided into two kinds, and one kind is based on binary system
The deterministic type algorithm of tree, main representative algorithm have binary search algorithm, Dynamic binary searching algorithm, great-jump-forward dynamic tree
Algorithm, inquiry tree algorithm etc..Such method is according to the uniqueness of tag ID label to be selected to communicate by reader, so searching
The performance of rope algorithm can drastically deteriorate with the increase of ID digits.Another kind is the statistical algorithm based on ALOHA.It is mainly calculated
Method includes CDMA slotted ALOHA algorithm, Frame Slotted Aloha (Frame-slotted ALOHA, FSA-256) algorithm, dynamic frame slot
ALOHA (Dynamic Frame-slotted ALOHA, DFSA) algorithm, the EPC Class- that in addition also EPCglobal is proposed
1 Generation-2 (EPC) standard, it is using a kind of random frame time slot algorithm based on Q values and has document to carry in the recent period
Go out ALOHA anticollisions (Collision Prediction-ALOHA, CP-ALOAH) algorithm based on prediction of collision etc..These are anti-
Collision algorithm realizes that process is relatively simple, and inside tags are also without the complicated circuit of design, therefore the cost of label
It is relatively low.However, when increasing with the number of label or even is thousands of, the probability to collide also increases therewith, the property of system identification
Can drastically it decline.The identification problem of a large amount of labels is directed to, researchers propose the concept of grouping again, when having the dynamic frame of enhancing
Gap algorithm, packet dynamic frame CDMA slotted ALOHA (Grouped Dynamic Frame-slotted ALOHA, GDFSA) algorithm etc..
Compared with algorithm before, be grouped class anti-collision its to gulp down performance more stable, but as other algorithms, throughput
Than relatively low, only 40%~50% or so.
The content of the invention
The present invention is in order to solve the problems, such as the multiple labels anti-collision in radio-frequency recognition system, in analysis Frame Slotted Aloha algorithm
On the basis of, propose a kind of RFID anti-collision algorithms (Grouped Adaptive based on grouping self-adjusted block time slot
Allocating Slots,GAAS).Reader is allowed to be scanned statistics to the random selected time slot of label first, and is sent out
Each label is given, label carries out correspondingly time slot adjustment again, reader is made to skip free timeslot and collision time slot, adaptively
Ground allocative efficiency time slot, and then label is quickly identified.When unidentified number of tags is bigger, algorithm using grouping and
The strategies such as dynamic adjustment frame length, to reduce the time of time slot processing.Simulation result shows：GAAS algorithms improve the identification of system
Efficiency and stability, reduce transport overhead.Particularly when number of tags is more than 1000, the throughput of the algorithm remains at
More than 71%, the system effectiveness than traditional -256 algorithm of Frame Slotted Aloha and packet dynamic frame CDMA slotted ALOHA algorithm carries respectively
It is high by 300% and 97.2%, there is certain theory and application value.
1st, basic definition
Define 1：Setting the timeslot number in a frame, i.e. frame length is L, when n label is identified, each label
A time slot can be randomly choosed to send the information of identification code of oneself, according to bi-distribution theorem, some label, which is occupied in frame, appoints
The probability of meaning time slot is p=1/L, then the probability for having r label in same time slot can be expressed as：
Work as r=0, is i.e. is known as idle (idle) time slot, probability without request identification label, the time slot in a time slot
For：
Work as r=1, i.e. only there are one tag requests in a time slot to identify label, when which is known as success (success)
Gap, probability are：
When r >=2, i.e. in a time slot there are two and above tag request identification label, the time slot be known as collide
(collision) time slot, probability are：
Pc=1-Ps-Pi (4)
Then after the recognition cycle of a frame, without the desired value a of the timeslot number of label0 L,n, the time slot only there are one label
Several desired value as L,n, generate the desired value a of the timeslot number of collisionc L,nRespectively：
ac L,n=L × Pc=L-a0 L,n-as L,n (7)
Define 2：The throughput S of RFID system refers to reader Successful transmissions information within the time of an identification frame length
Ratio shared by number of tags, i.e.,：
2nd, the method for the present invention describes
2.1 RFID system optimal frame lengths are analyzed
, it is necessary to dynamically be adjusted according to number of tags after number of tags of the reader in its readable range is estimated
Frame length if frame length value will generate greatly very much substantial amounts of free timeslot, otherwise can cause collision time slot to steeply rise, finally all
It will influence system identification efficiency.Therefore to the higher throughput efficiency of acquirement, it is necessary to which it is right between frame length and number of tags to find out
It should be related to, that is, determine optimal frame length.To (8) formula derivation：
(9) formula is made to be equal to 0, reaching the number n of frame length L and label should meet：
It is obtained again by Taylor series expansion
According to (8) formula, adjacent fixed frame length L1And L2Throughput intersections of complex curve at label number, as adjust frame
Long critical point.
WhereinDownward rounding operation is represented, so as to obtain the correspondence of number of tags n and frame length L, such as 1 institute of table
Show.The size of frame length is determined by the value range of number of tags, when number of tags is more than 354, is still distinguished with maximum frame length 256
It is identified.
1 frame length of table and number of tags correspondence
| Frame length | 8 | 16 | 32 | 64 | 128 | 256 | 256 |
| The number of minimum label | 1 | 12 | 23 | 45 | 89 | 178 | 355 |
| The number of maximum label | 11 | 22 | 44 | 88 | 177 | 354 | ≥355 |
2.2 labeled packet principles
Due to being limited be subject to label cost so that frame slot number can not ad infinitum increase with the increase of number of tags
Add, so being directed to the situation of substantial amounts of label, only by limiting the number of the label per secondary response, can just keep system
Relatively high throughput.According to (8) formula, the critical value being grouped to label is chosen, i.e. the performance curve of two consecutive frames is handed over
Point Pa=PbThe label numerical value at place.
Wherein, a, b are the adjacent packets number of label, such as when taking a=1, b=2 substitutes into (15) Shi Ke get：
That is n=354 is the critical value that label is divided into one group or two groups, for the throughput effect that system is made to keep higher
Rate, unidentified number of tags n should not exceed 354, when n be more than 354 when, it is necessary to be grouped to unidentified label.By (15) formula
Packet count of the number of labels within 2283 can be calculated, as shown in table 2.
The correspondence of 2 total number of labels of table and packet count
| Packet count | 1 | 2 | 4 | 6 | 8 | …… |
| Minimum number of tags | 1 | 355 | 710 | 1246 | 1767 | …… |
| Maximum number of tags | 354 | 709 | 1245 | 1766 | 2283 | …… |
Packet count 1,2,4,6,8 in table 2 is autonomous Design, and the minimum number of tags in each group is with maximum number of tags
(15) threshold value come out in formula by a, b numerical computations.With the increase of number of tags, packet count also constantly increases.
2.3 the method for the present invention are specifically as follows：
(S01)：Before digital independent is carried out, the number n of label to be identified is estimated with Vogt algorithms first；Work as number of tags
When mesh is less than 354, using dynamic frame slot strategy, the length M of dynamic adjustment identification frame is directly entered time slot processing stage；
When n is more than 354, then needs to be grouped label, packet count g is acquired by table 2；
(S02)：Label, to a number i is randomly choosed between g, increases 1 as the group # of oneself, while the value of s [i]
Add 1, record the number of tags of the group；When identifying for the first time, the group # t=1 currently identified is initialized, starts to know t groups
Not；
(S03)：Then time slot scanning is carried out, reader sends Query (M) in the form of broadcasting and orders to each label；
Label receives the order and then the timeslot number each preengage to reader return.Reader is further according to received number
It is believed that breath, to judge whether each time slot can successfully identify；If label can be identified successfully, just by corresponding time slot sign position
Flag is set to 0, and Flag is just set to -1 by other situations；
(S04)：Reader is according to the situations of label institute reserving time slots, by it by ordering Refresh_slot (Slots)
Each label is sent to, allows each label that can also obtain the situation of other labels selection time slot, then adjusts corresponding time slot；
Element inside Slots is then the mark value that time slot scanning in front is recorded in the process, and label is adjusted according to this array
Whole corresponding selected timeslot number；
(S05)：Reader sends Collection () and orders, after each label receives this order, just according to adjustment
Time slot afterwards sends data to reader successively；Last reader sends S1eep () and orders, the quilt in this wheel query process
The label correctly read will enter silent status, that is, be not involved in next inquiry；Meanwhile allow each label in the group
Time slot counter subtracts 1；
(S06)：After each round end of identification, then the number of remaining unidentified label is estimated, if number of tags is not
0, then (S03) is returned to, until the remaining label of the group has all been identified；
(S07)：Group # adds 1, i.e. t=t+1, then performs following one of two things：
If 1) t≤g, then it represents that there are still the group of no identification, continue next group of identification, return (S03)；
If 2) t ＞ g, i.e., all groups all identify completion, end of identification.
The core of GAAS algorithms is exactly before tag recognition is carried out, and carries out time slot scanning operation first, records label
The situation of institute's reserving time slots then in the tag recognition stage, allows reader to skip collision time slot and free timeslot, and directly distributes
Effective time slot, the label preengage success is directly identified, so as to improve the utilization rate of time slot.Specific algorithm flow is as schemed
Shown in 1.
The method have the characteristics that：
(1) tag circuit analysis of complexity.
Assuming that label randomly selects the random number of time slot as R, then needPosition random number, since this algorithm is taken point
The method of group, R maximums are set to 256, it is only necessary to and 8, so label only needs 8 random number generation circuits.And EPC anticollisions
For agreement in addition to generating the random number of selection time slot and needing 4, also requirement generates 16 RN16 random numbers, needs 16+4=20 altogether
Position random number generation circuit.Therefore, this algorithm is significantly lower than EPC labels to label design random number circuit complexity.In addition, mark
Also have based on the controller of state machine to perform life in label, EPC labels need to perform primary commands have 5 (Query,
QueryAdjust, QueryRep, Ack, RN16), label also needs to perform 5 (Query, Refresh- in agreement of the present invention
Slot, Count, Collection, Sleep), therefore the controller circuitry complexity of GAAS protocol labels is also suitable with EPC protocol.
In conclusion GAAS protocol label circuit designs are simpler than EPC protocol, so as to reduce the cost of label.
(2) transport overhead is analyzed.
Transport overhead is the important indicator for assessing an algorithm, including reader expense and label expense two parts.Point
It is other in self-adjusted block time slot (Adaptive Allocating Slots, AAS) algorithm, GAAS algorithms and EPC standards
Transport overhead of the algorithm during tag recognition is emulated, the GAAS orders used in emulation and parameter length such as 3 institute of table
Show.
Order and parameter length involved in 3 GAAS algorithms of table
| Order, parameter | Function | Length/bit |
| Query | Adjust frame length | 8 |
| Refresh-slot | Adjust timeslot number | 32 |
| Count | Slot count | 8 |
| Collection | Confirm communication | 18 |
| Sleep | Into silent status | 2 |
1) expense of reader.
If number of labels variation in section [0,2000], the bit number of reader transmission is as shown in Fig. 2, with number of tags
Purpose increases, and the expense of reader also constantly increases.When the number of label is less than 1300, AAS algorithms are read with GAAS algorithms
Device expense is suitable, and when the number of label is more than 1300, the advantage of GAAS algorithms starts to highlight.This is because AAS is calculated
Label is not grouped processing by method, and with the increase of number of tags, the probability of tag-collision steeply rises, and reader is sent
Instruction can also increase therewith.When number of tags is 2000, reader bit number is 66790bit in AAS algorithms, EPC standards
Algorithm is respectively 60527bit, and GAAS algorithms are 54245bit, and the expense than AAS algorithm has dropped 18.8%, than ECP standard
Algorithm has dropped 10.4%.
2) expense of label.
Fig. 3 shows the expense of three kinds of algorithm labels, and with the increase of number of tags, label transmits bit in AAS algorithms
Number is close to exponential increase, and GAAS algorithms and EPC canonical algorithms approximately linear increase, and wherein GAAS increases the slowest.Work as mark
When the number of label is 2000, reader bit number is 422135bit in AAS algorithms, and EPC canonical algorithms are respectively 121545bit,
And GAAS algorithms are only 39601bit, the expense than AAS algorithm labels has dropped 96.1%, is had dropped than ECP canonical algorithm
67.4%.
(3) total timeslot number analysis.
Total time slot is a key factor of decision systems efficiency, and total timeslot number is fewer, and the performance of system is better.From above
Analysis understands that entire algorithm, which reads data period, can be divided into two stages：Time slot scanning stage and tag recognition stage, so looking into
It is also the sum of the two discrete consuming time slots to ask total time slot.
Total timeslot number of FSA-256 algorithms, DFSA algorithms, GDFSA algorithms and GAAS algorithms is emulated, emulation knot
Fruit is as shown in Figure 4.Number of labels is from during 0 changes to 1500, FSA-256 algorithms and the required total time slot of DFSA algorithms
Number is exponentially increased with the increase of number of labels, and GDFSA algorithms and GAAS algorithms linearly increase, and wherein FSA-256 algorithms increase
Length is fastest, and GAAS algorithms are most slow, followed by GDFSA algorithms.Particularly when number of tags is larger, GAAS algorithms it is excellent
Gesture is more obvious.When number of tags is 1000, GAAS algorithms only need about 1400 time slots, and about 4165 are reduced than FSA-256,
About 3727 are reduced than DFSA, about 1366 are reduced than GDFS.
(4) throughput analysis.
System throughput is also an important indicator for weighing system performance.From fig. 5, it can be seen that when label is less than 354
When, GDFSA is identical with DFSA throughputs, and FSA-256 algorithms are minimum, only 0.2 or so, and GAAS algorithm highests, up to 0.7 with
On.GDFSA, DFSA, GAAS algorithm can be according to physical tags numbers, and adaptively allocative efficiency time slot is identified, and
FSA-256 algorithms are using fixed frame length 256.When number of tags is more than 354, the throughput of FSA-256, DFSA algorithm drastically under
Drop, and GDFSA, GAAS algorithm label is divided into it is multigroup, by dynamic adjustment frame length each group label is identified so that gulp down
Rate is spat to stablize within the specific limits.The system throughput of inventive algorithm is obviously more much greater than other three kinds of algorithms, FSA-256
The throughput of algorithm is between 0.1~0.25, and for DFSA algorithms between 0.2-0.36, it is left that GDFSA algorithms only maintain 0.36
The right side, and GAAS algorithms will be high than them.When the number of label reaches 1000, compared with FSA-256 and GDFSA, GAAS is calculated
300% and 97.2% has been respectively increased in the system effectiveness of method.
The present invention proposes self-adjusted block time slot (AAS) method, with the increase of number of tags to be identified, and adds in and divides
The concept of group is grouped self-adjusted block time slot (GAAS) algorithm.The algorithm combines traditional GDFSA and CP-ALOHA algorithms
Feature is optimized and is improved on the basis of them.Estimation label quantity first, then using grouping, dynamic adjustment frame
The strategy such as long, time slot reservation and self-adjusted block time slot quickly identifies label.
Description of the drawings
Fig. 1 proposes GAAS algorithm flow charts for the present invention.
Fig. 2 is that the present invention and the expense of other algorithm readers compare.
Fig. 3 is that the present invention and the expense of other algorithm labels compare.
Fig. 4 present invention is with the total timeslot number of other algorithms with the situation of change of number of tags.
Fig. 5 present invention is compared with the throughput of other algorithms.
Specific embodiment
The present invention includes being number of tags estimation and is grouped the stage, time slot processing stage, tag recognition stage three phases,
Detailed process is as follows：
(1) number of tags estimation and grouping stage
I is identifying the incipient stage, and the number n of label to be identified is estimated with Vogt algorithms；
Ii is when number of tags is less than 354, and using dynamic frame slot strategy, dynamic adjustment identifies the length M of frame, directly
Into input time slot processing stage；When n is more than 354, then needs to be grouped label, packet count g is acquired by table 2；
Iii labels, to a number i is randomly choosed between g, increase 1 as the group # of oneself, while the value of s [t]
1, record the number of tags of the group；
The group # t=1 that iv initialization currently identifies, starts that t groups are identified.
(2) time slot processing stage
I carries out time slot scanning first before digital independent is carried out, and reader sends Query (M) lives in the form of broadcasting
It makes to each label；Label receives the order and then the timeslot number each preengage to reader return；
Ii readers are further according to received data message, to judge which time slot can be identified successfully, which time slot
Collision or free timeslot will be generated；If label can be identified successfully, corresponding time slot sign position Flag is just set to 0, other
Flag is just set to -1 by situation；
Iii readers are according to the situations of label institute reserving time slots, by it by the way that Refresh_slot (Slots) is ordered to send
To each label, label is allowed also to be able to know that the situation of other labels selection time slot, then adjusts corresponding time slot；In Slots
The element in face is then the mark value that time slot scanning in front is recorded in the process, and label adjusts corresponding institute according to this array
The timeslot number of selection.
(3) the tag recognition stage
I had been known in a upper stage selection situation of each time slot due to reader, was directly distributed in cognitive phase
Effective time slot；Following reader sends Collection () and orders, after label receives this order, just according to adjustment
Time slot afterwards sends data to reader successively；
Ii readers send S1eep () and order, and the label being correctly read in this wheel query process will enter
Silent status is not involved in next inquiry；
Iii is last, and the time slot counter of each label in the group is allowed to subtract 1；
Iv is after each round end of identification, then estimates the number of remaining unidentified label, if number of tags is not 0,
It repeats above (2), (3) two stages, until the remaining label of the group has all been identified；
V group # adds 1, i.e. t=t+1, then performs following one of two things：
If 1) t≤g, then it represents that there are still the group of no identification, continue next group of identification；
If 2) t ＞ g, i.e., all groups all identify completion, end of identification.
The present invention proposes a kind of grouping self-adjusted block time slot RFID anticollisions (GAAS) algorithm, by number of labels
Estimation and grouping, the strategy such as time slot reservation and self-adjusted block time slot quickly identifies label.Simulation result shows
With being continuously increased for number of labels, particularly when the number of label is more than 1000, the throughput of GAAS algorithms maintains
More than 0.71, than the throughput raising all by a relatively large margin of the traditional algorithm based on ALOHA, when entire identification process is required
Gap sum and transport overhead almost maintain linearly increasing.The work efficiency of RFID system can be effectively improved, adds system
The stability of throughput reduces the cost of label.The identification of substantial amounts of label is directed to, the advantage of GAAS algorithms is particularly aobvious
It writes, has broad application prospects.
Claims (1)
1. a kind of RFID anti-collision method based on grouping self-adjusted block time slot, it is characterized in that according to the following steps：
(S01)：Before digital independent is carried out, estimate the number n of label to be identified with Vogt algorithms first and be grouped place
Reason；When identifying for the first time, the group # t=1 currently identified is initialized, starts that t groups are identified；
The packet transaction, according to the following steps：
(1) when number of tags is less than 354, then using dynamic frame slot strategy, the length M of dynamic adjustment identification frame, directly into
Input time slot processing stage；When n is more than 354, then needs to be grouped label, acquire packet count g；
(2) label increases by 1, note 1 to a number i is randomly choosed between g as the group # of oneself, while the value of s [i]
Record the number of tags of the group；
(S02)：Then time slot scanning is carried out, reader sends Query (M) in the form of broadcasting and orders to each label；Label
Receive the order and then the timeslot number each preengage to reader return；Reader according to received data message,
To judge whether each time slot can successfully identify；If label can be identified successfully, just corresponding time slot sign position Flag is set to
0, Flag is just set to -1 by other situations；
(S03)：Reader is according to the situations of label institute reserving time slots, by it by the way that Refresh_slot (Slots) is ordered to send
To each label, allow each label that can also obtain the situation of other labels selection time slot, then adjust corresponding time slot；In Slots
The element in face is then the mark value that time slot scanning in front is recorded in the process, and label adjusts corresponding institute according to this array
The timeslot number of selection；
(S04)：Reader send Collection () order, each label receive this order after, just according to adjustment after
Time slot sends data to reader successively；Last reader sends S1eep () and orders, correct in this wheel query process
The label read will enter silent status, that is, be not involved in next inquiry；Meanwhile allow the time slot of each label in the group
Counter subtracts 1；
(S05)：After each round end of identification, then estimate the number of remaining unidentified label, if number of tags is not 0,
It returns (S02), until the remaining label of the group has all been identified；
(S06)：Group # adds 1, i.e. t=t+1, then performs following one of two things：
(1) if t≤g, then it represents that there are still the group of no identification, continue next group of identification, return (S02)；
(2) if t ＞ g, i.e., all groups all identify completion, end of identification.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510087504.6A CN104657693B (en) | 2015-02-26 | 2015-02-26 | A kind of RFID anti-collision method based on grouping self-adjusted block time slot |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510087504.6A CN104657693B (en) | 2015-02-26 | 2015-02-26 | A kind of RFID anti-collision method based on grouping self-adjusted block time slot |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104657693A CN104657693A (en) | 2015-05-27 |
| CN104657693B true CN104657693B (en) | 2018-05-29 |
Family
ID=53248797
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510087504.6A Expired - Fee Related CN104657693B (en) | 2015-02-26 | 2015-02-26 | A kind of RFID anti-collision method based on grouping self-adjusted block time slot |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104657693B (en) |
Families Citing this family (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106934311A (en) * | 2015-12-29 | 2017-07-07 | 常州浅湾电子科技有限公司 | A kind of method that efficient RFID label tag histogram is collected |
| CN106203212B (en) * | 2016-07-05 | 2019-07-19 | 江西理工大学 | A kind of binary tree RFID anti-collision method based on dynamic frame slot |
| CN106599958A (en) * | 2016-12-23 | 2017-04-26 | 西京学院 | RFID-based agricultural product tracing batch tag information acquisition method |
| CN107153802A (en) * | 2017-05-18 | 2017-09-12 | 云南民族大学 | Label collision solution for the posterior probability of RFID system |
| CN108052855A (en) * | 2018-01-08 | 2018-05-18 | 广西大学 | Suitable for the new Q values anti-collision algorithm of RFID system |
| CN108280377B (en) * | 2018-02-10 | 2021-01-26 | 沈阳理工大学 | Anti-collision reading method for multiple labels in material warehousing management system |
| CN108446577B (en) * | 2018-02-28 | 2022-04-08 | 北京宏诚创新科技有限公司 | Multi-label anti-collision method in high-frequency/ultrahigh-frequency RFID (radio frequency identification) system |
| CN108959993A (en) * | 2018-05-17 | 2018-12-07 | 吉林大学 | A kind of RFID tag mixing anti-collision algorithm suitable for the cultivation of intelligent flock of sheep |
| CN108804964B (en) * | 2018-06-13 | 2021-04-27 | 内蒙古大学 | Logistics express registration method and system and handheld reader |
| CN109635885B (en) * | 2018-10-31 | 2021-08-06 | 昆明理工大学 | Mountain transformer substation signal parallel identification method for improving ALOHA algorithm optimization |
| CN109635611A (en) * | 2018-12-19 | 2019-04-16 | 重庆科技学院 | A kind of optimization Dynamic Packet collision-proof method based on frame slot |
| CN109446869B (en) * | 2018-12-29 | 2021-09-10 | 山东建筑大学 | Anti-collision method and device for RFID system, computer readable storage medium and equipment |
| CN110113733B (en) * | 2019-03-29 | 2021-06-29 | 硅湾工业互联网工厰(深圳)有限公司 | Two-stage distribution method for coloring anti-collision graph of RFID reader |
| CN110135208A (en) * | 2019-04-30 | 2019-08-16 | 西北工业大学 | A kind of RFID label tag collision-proof method estimated based on grouped frequency and label |
| CN110287745A (en) * | 2019-06-19 | 2019-09-27 | 西安邮电大学 | A kind of RFID multi-tag method for quickly identifying for dynamic scene |
| CN110309686B (en) * | 2019-07-12 | 2023-05-23 | 长春工业大学 | RFID anti-collision method based on equal area division |
| CN113808390A (en) * | 2021-08-13 | 2021-12-17 | 上海市城市建设设计研究总院（集团）有限公司 | Radio frequency identification road traffic big data traceability analysis system and analysis method |
| CN113658434A (en) * | 2021-08-24 | 2021-11-16 | 上海市城市建设设计研究总院（集团）有限公司 | Radio frequency identification dynamic visualization intersection monitoring management system and detection method |
| CN114786172B (en) * | 2022-04-14 | 2023-03-24 | 广州计量检测技术研究院 | Automatic upgrading method and system for electronic tag and electronic tag |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102004895A (en) * | 2010-11-30 | 2011-04-06 | 中国人民解放军国防科学技术大学 | Time slot scanning anti-collision method based on collision precheck |
| CN102024163A (en) * | 2010-12-01 | 2011-04-20 | 中国人民解放军国防科学技术大学 | Anti-collision method with packet previewing mechanism |
| CN102073890A (en) * | 2011-01-19 | 2011-05-25 | 中国人民解放军国防科学技术大学 | Label random grouping-based dynamic frame time slot anti-collision method |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6963270B1 (en) * | 1999-10-27 | 2005-11-08 | Checkpoint Systems, Inc. | Anticollision protocol with fast read request and additional schemes for reading multiple transponders in an RFID system |
| KR100922393B1 (en) * | 2007-11-23 | 2009-10-19 | 성균관대학교산학협력단 | Tag estimation method and tag identification method for rfid system |
-
2015
- 2015-02-26 CN CN201510087504.6A patent/CN104657693B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102004895A (en) * | 2010-11-30 | 2011-04-06 | 中国人民解放军国防科学技术大学 | Time slot scanning anti-collision method based on collision precheck |
| CN102024163A (en) * | 2010-12-01 | 2011-04-20 | 中国人民解放军国防科学技术大学 | Anti-collision method with packet previewing mechanism |
| CN102073890A (en) * | 2011-01-19 | 2011-05-25 | 中国人民解放军国防科学技术大学 | Label random grouping-based dynamic frame time slot anti-collision method |
Non-Patent Citations (2)
| Title |
|---|
| 一种433MHz有源RFID标签的设计与实现;龚冰青;《中国优秀硕士学位论文全文数据库 信息科技辑》;20140115;第37-52页 * |
| 基于分组动态帧时隙的射频识别防碰撞算法;庞宇 等;《物理学报》;20130731;第62卷(第14期);第1-6页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104657693A (en) | 2015-05-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104657693B (en) | A kind of RFID anti-collision method based on grouping self-adjusted block time slot | |
| Shahzad et al. | Probabilistic optimal tree hopping for RFID identification | |
| KR100637076B1 (en) | Optimized binary search with anti-collision mathod and system | |
| KR100922393B1 (en) | Tag estimation method and tag identification method for rfid system | |
| CN105224970B (en) | A kind of RFID anti-collision method | |
| Zhang et al. | Assigned tree slotted aloha RFID tag anti-collision protocols | |
| Deng et al. | Optimal dynamic framed slotted ALOHA based anti-collision algorithm for RFID systems | |
| CN103020569B (en) | A kind of radio-frequency identification multi-label anti-collision method | |
| CN102708341A (en) | Label anti-collision method for radio frequency identification (RFID) system | |
| Yihong et al. | Multiple-bits-slot reservation aloha protocol for tag identification | |
| Xu et al. | An improved dynamic framed slotted ALOHA anti-collision algorithm based on estimation method for RFID systems | |
| CN102622564A (en) | Anti-collision method for identifying multiple radio frequency identification (RFID) tabs | |
| Chen et al. | A novel q-algorithm for epcglobal class-1 generation-2 anti-collision protocol | |
| CN104680104A (en) | Dynamic efficient RFID (Radio Frequency Identification Device) tag identification mechanism | |
| Chen | A new RFID anti-collision algorithm for the EPCglobal UHF class-1 generation-2 standard | |
| CN101650770A (en) | Binary search anti-collision method with unknown label quantity estimation function | |
| CN103971077A (en) | ALOHA anti-collision method of ultrahigh frequency RFID system based on CRC code grouping | |
| Sahoo et al. | Improving rfid system to read tags efficiently | |
| Yeh et al. | A novel RFID tag identification protocol: adaptive n-resolution and k-collision arbitration | |
| Jia et al. | Analysis of anti-collision protocols for RFID tag identification | |
| Tsao et al. | Runtime optimization of framed slotted ALOHA based RFID Systems | |
| Chen | An RFID anti-collision Q-value algorithm research | |
| CN101414345B (en) | Method and system for answering radio frequency identification signal, label and reader | |
| Liu et al. | A fast and stable anti-collision algorithm for the EPCglobal UHF Class 1 Generation 2 standard | |
| Yaacob et al. | A review of deterministic anti-collision algorithm of passive 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20180529 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |