CN103955657B - A kind of frame slot ultrahigh frequency RFID system anti-collision method based on blind separation - Google Patents
A kind of frame slot ultrahigh frequency RFID system anti-collision method based on blind separation Download PDFInfo
- Publication number
- CN103955657B CN103955657B CN201410219110.7A CN201410219110A CN103955657B CN 103955657 B CN103955657 B CN 103955657B CN 201410219110 A CN201410219110 A CN 201410219110A CN 103955657 B CN103955657 B CN 103955657B
- Authority
- CN
- China
- Prior art keywords
- label
- signal
- time slot
- reader
- 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
Landscapes
- Near-Field Transmission Systems (AREA)
- Radar Systems Or Details Thereof (AREA)
Abstract
A kind of frame slot ultrahigh frequency RFID system anti-collision method based on blind separation.Hyperfrequency (UHF) radiofrequency signal for frequency range in 860 960MHz, proposes a kind of rfid system anti-collision algorithm based on independent component analysis (ICA) and frame slot.Antenna system model by analyzing the ICA algorithm step in rfid system and set up blind source separating of the invention, the antenna number of the number of tags no more than reader made in each time slot is chosen using specific frame slot number, meet the condition that blind source separating recognizes label, and then recognized while realizing multi-tag using ICA algorithm.Simulation result shows, with traditional label anti-collision algorithm and compared with the blind separation multi-label anti-collision algorithm based on position gap Dynamic Packet, the present invention has obvious advantage in terms of tag recognition rate, and the recognition time of algorithm is less, the feasibility and high efficiency that blind source separate technology is applied to tag recognition are further demonstrated, there is potential application value in the engineering field of high efficiency and intelligent management is needed.
Description
Technical field
Technology is read the invention belongs to the multi-tag in the communications field, is related to the collision-proof method of label.
Background technology
Radio frequency identification (Radio Frequency Identification, RFID) is a kind of contactless automatic identification skill
Art, compared with traditional RM, it can complete information input in the case of noncontact, non-optical visual, no manual intervention
And treatment, have the advantages that big easy to operate, amount of storage, good confidentiality, reaction time are short, strong to environmental suitability, extensively
It is general to be applied to the fields such as gate inhibition, traffic, food security and logistics.It is past in the sphere of action of reader in RFID communication system
Toward there are multiple labels to coexist, if reader sends querying command, multiple labels can be caused to respond simultaneously, cause the response of label to believe
Number can not quickly be recognized by reader, result in the reduction of the recognition efficiency of rfid system.The anti-collision algorithm of label can be real
Proper communication between existing multiple label and reader, and the quality of algorithm is closely related with the label throughput of reader.Often
The rfid system anti-collision algorithm seen can be divided into two kinds of certainty and uncertainty.ALOHA anticollisions based on probability statistics
Algorithm be it is non-deterministic, label by randomly choose transmission information time slot reduce collision, and only number of labels and when
When gap number is suitable, algorithm could keep discrimination higher, and maximum is 36.8%.Even follow-on can self-adaptative adjustment
The maximum discrimination score of the dynamic Frame Slotted Aloha algorithm of frame length is also only 58%；In deterministic algorithm discrimination it is higher based on
The maximum discrimination score of the great-jump-forward binary anti-collision algorithm of grouping mechanism is also just above 50%.EPC Gen2 specify
Q algorithms based on dynamic frame slotted random algorithm are used to solve the problems, such as tag-collision, with certain adaptivity and show
Go out good throughput performance.Q algorithms can change timeslot number in an any time for taking inventory the cycle by adjusting Q values, make
Unrecognized label reselects the time slot of response, into the response of next frame, but the change meeting repeatedly that Q values may occur
The recognition efficiency of algorithm is influenceed, tag recognition rate also maintains essentially in 50% or so.Therefore, calculated to further improve anticollision
The tag recognition rate of method, it is necessary to seek a kind of New Algorithm that multiple labels can be recognized in synchronization, thus this algorithm should
Transport and give birth to.
The blind source separating (Blind Source Separation, BSS) of signal refers to from some mixed signals for observing
In recover the primary signal that cannot directly observe.Because primary signal is respectively from different signal sources, it can be considered that
It is separate between primary signal.Independent component analysis (Independent Component Analysis, ICA) are 20
A kind of statistics and computer technology of the development eighties in century, are one of the most popular methods in current blind source separating.
The content of the invention
The present invention is directed to hyperfrequency (UHF) rfid system of frequency range in 860-960MHz, with reference to Frame Slotted Aloha
Algorithm, by setting up the blind source separating antenna system model of reader, with simple but effective FastICA algorithms, (quick ICA is calculated
Method) blind source separating is carried out to label mixed signal, it is proposed that a kind of frame slot ultrahigh frequency RFID system anti-collision based on blind separation
Algorithm (Blind Separation and Framed-slot Algorithm, BSFA) is hit, synchronization identification has been reached many
The purpose of individual label.The present invention has tag recognition rate higher compared to existing label anti-collision algorithm and the used time is less,
Excellent performance, has stronger application value in the warehouse of medium-and-large-sized enterprise, logistics.
1.RFID systems are combined with blind source separate technology
The FastICA algorithm steps analysis of 1.1RFID systems
If there is n label in the sphere of action of reader, the response signal (primary signal) that label sends to reader is S
=[s1,s2,…,sn]T, wherein sj=[sj1,sj2,…,sjL], 1≤j≤n is j-th sampled value of label sending signal, sampling
Number is L.Reader has m antenna, and the mixed signal that antenna is received is X=[x1,x2,…,xm]T, wherein xi=[xi1,
xi2,…,xiL], 1≤i≤m is i-th sampled value of antenna, and mixed signal is with the relation of label signal：
Wherein i=1,2 ..., m.aijIt is mixed coefficint, niIt is observation noise.The formula can be with vector representation：
X=AS+N (2)
When ignoring noise, the FastICA algorithm models of rfid system are as shown in Figure 1.
The blind source separating problem of label signal is exactly using the statistics between the mixed signal X and primary signal S for observing
Independence, while recovering primary signal by means of the priori of primary signal probability distribution.In order that blind source separating is asked
Topic can be solved, and generally required and met following two conditions：
(1) more than or equal to primary signal number n, i.e. A is m × n rank sequency spectrum random matrixes to mixed signal number m.
(2) it is gaussian signal more than two signals to be not allow in primary signal S.
The probability distribution of RFID signal is super-Gaussian distribution, and the non-Gaussian system of its signal is estimated from function G (u).
G (u)=G ' (u) (4)
Wherein α ≈ 1, after reader antenna receives label signal, pre-process to observation signal X first, remove it
Average simultaneously carries out albefaction, makes its covariance matrix for unit matrix, obtains new signal Z.If the mixed matrix of solution is W=[w1,
w2,…,wn]T, wherein wi=[wi1,wi2,…,wim]T, 0≤i≤n is output estimation signal Y=[y1,y2,…,yn]TSolution mix
Coefficient vector.
To vector wiIt is orthogonalized, if wiConvergence, is calculated by formula (6) and estimates signal Y.If wiDo not restrain, then
Repetitive operation formula (5) is until algorithmic statement.
Y=WX (6)
In order to smoothly carry out blind source separating to label signal, it is desirable to which the number of label signal is less than or equal to reader
The number of antenna.When the number of reader working range interior label is more, select to make often by rational frame slot number
The number of tags of response meets this requirement in one time slot.
The antenna system model of 1.2 blind source separatings
The antenna system of blind source separating constitutes (as shown in Figure 2) by population of tags, multiple antennas reader and computer system, reads
Read the label in device sphere of action to send id signal to reader and received by multiple antennas, at the blind source separating in reader
Reason unit recognizes these labels and stores its relevant information, finally enters information feeding computer system by antenna mixed signal
The relevant data processing of row.
2. the inventive method description
The relation of 2.1 tag-collisions and time slot
If number of tags is n, timeslot number is fs, and antenna number is A, then the probability containing k label is in a time slot：
The probability of number of tags in one time slot less than or equal to antenna number A is：
Then probability of the number of tags in a time slot more than antenna number A is：
p3(fs, n, k)=1-p2(fs, n, k) (k ＞ A) (9)
The timeslot number selection of 2.2 the inventive method
BSFA algorithms are less than or equal to the number of tags k in each time slot and read according to number of tags n dynamic select timeslot number fs
Read the antenna number A of device, the timeslot number fs of selection is：
Wherein α ≈ 10, β ≈ 0.8, γ ≈ 0.66, round () represent round.
As Fig. 3, Fig. 4 it is visible, when number of tags n=50~500, antenna number A=8 and A=12, BSFA algorithms selections when
Gap number makes the number of tags in a time slot more than the Probability p of antenna number3(fs, n, k) is in close proximity to 0, therefore algorithm timeslot number
Selection be rational.Table 1 is p3(fs, n, k) stabilization when probable value with antenna number situation of change, it can be seen that p3(fs,
N, k) reduce with the increase of antenna number, further demonstrate the correct selection of algorithm timeslot number.
Table 1p3(fs, n, k) with antenna number situation of change
The flow of 2.3 the inventive method
(S1), reader sends Query orders to label
First, reader sends order Query to the label entered in identification range, and (two continuous to start the cycle of taking inventory
Time interval between Query orders), label enters ready state.
(S2), label responds the Query orders of reader
(1) each label is performed both by 16 digit time slot counters, all unidentified label (number of tags during tag recognition
After n) receiving Query orders, from 0~round (n (A+ α)/(β A2+ γ A)) time slot is randomly choosed in individual time slot it is stored in
In respective time slot counter, label enters responsive state, and time slot counter is 0 label response.
(2) responsive tags produce the random sequence RN16 of 16 by randomly or pseudo-randomly number generator (RNG)
(it is 10000 population of tags to total number of labels, there are two or more labels to produce the probability of identical RN16 sequences to be less than
0.1%, therefore be feasible using RN16 sequences as the primary signal of mutual statistical independence between label), and by respective RN16
Sequence is sent to reader, and the number according to responsive tags is divided into following two situations：
1. when the number of responsive tags is 0, show that time slot is idle, go to (S5).
2. the number of responsive tags is equal to or more than 1, goes to (S3) and performs FastICA algorithms.
(S3), reader realizes Signal separator using FastICA algorithms
(1) signal that reader antenna is received is the mixed signal of label primary signal, by the number to primary signal
Purpose estimates that more accurately blind source separating can be carried out to mixed signal：
1. rfid system can be determined when there is noise by observing the dominant eigenvalue number of the correlation matrix of mixed signal X
The primary signal number that label sends；
2. can be determined by observing the order of mixed signal X during noiseless.
(2) it is using FastICA algorithms that mixed signal X solutions is mixed, by selection mixed coefficient matrix W (the random squares of rational solution
Battle array), make the estimation signal Y for observing clear and legible, contacted by estimating that signal Y=WX readers are set up with responsive tags, mark
Label enter acknowledgement state, go to (S4).
(S4), reader sends ACK and instructs to responsive tags
Responsive tags into acknowledgement state send PC, EPC and CRC-16 information of oneself after ACK instructions are received,
Reader utilizes the mixed coefficient matrix W of the solution of (S3) to continue to separate and store the identification information of these labels, and now label is succeeded
Identification, the label for finally recognizing success is removed, and is gone to (S5).
(S5), reader sends QueryRep orders to label
Reader sends QueryRep orders, and the time slot counter value into ready state and unrecognized label subtracts 1, jumps
Go to (S2) and proceed tag recognition, untill all tag recognitions are completed.
The number of tags in a time slot can be made antenna number is less than or equal to due to the timeslot number selected by BSFA algorithms
Probability close to 0%, and label can be properly separated by FastICA algorithms, therefore influence of the algorithm performance to simulation result is very weak,
Properly separating for label in BSFA algorithms is not interfered with.
3. the discrimination of the inventive method
The Probability p that the number of tags in a time slot is 0 is known by arthmetic statement4(fs, n, k) is：
Number of tags is for 0 probability is not p in so one time slot5(fs,n,k)：
Total inquiry times N required for separating these labels is：
Wherein "+1 " is only to have carried out 1 selection of timeslot number.Then the tag recognition rate of n label is：
Assuming that number of tags n=50~500, timeslot number, the tag recognition rate of antenna number A=8, BSFA algorithm picks are with label
As shown in Figure 5, Figure 6, Fig. 7 is BSFA algorithms and the blind separation multiple labels anti-collision based on position gap Dynamic Packet to several situations of change
Algorithm (Blind Separation and Dynamic Bit-slot Grouping, BSDBG) is at antenna number A=2~32
Tag recognition rate compare, Fig. 8, Fig. 9 are number of tags n=50~256, BSFA algorithms and BSDBG algorithms antenna number A=2~
Total inquiry number when 32 compares, and Figure 10 is the situation of change of timeslot number during Q algorithm performs.
Although from fig. 5, it can be seen that the timeslot number of BSFA algorithms increases with the increase of number of tags, compared to tradition
Anti-collision algorithm there is obvious advantage.From Fig. 6 and Fig. 7, with the increase of antenna number, BSFA algorithms compared to
BSDBG algorithms, the advantage of tag recognition rate is more obvious.It is proposed by the invention with the increase of antenna number from Fig. 8, Fig. 9
BSFA algorithms needed for total inquiry times be less than BSDBG algorithms, because the recognition time of algorithm is directly proportional to total inquiry times
Relation, therefore the recognition time of BSFA algorithms is again smaller than BSDBG algorithms, in multi-antenna systems with recognition rate faster.Figure
10 show, the timeslot number of Q algorithm picks not only occurs increase and decrease repeatedly, but also can often occur more than BSFA algorithm time slots
Several situations, causes the waste of time interval resource, substantially reduces the performance of system.
The present invention is selected by rational timeslot number, makes the number of tags collided in each time slot less than or equal to reading
The antenna number of device, meets and uses the condition of FastICA algorithms.Simulation result shows that the method can be effectively increased the identification of label
The stability of rate and algorithm.
Brief description of the drawings
Fig. 1 is the FastICA algorithm models of rfid system.
Fig. 2 is the antenna system model of blind source separating.
Fig. 3 be inventive antenna number A be 8 when, in a time slot number of tags more than antenna number probability.
Fig. 4 be inventive antenna number A be 12 when, in a time slot number of tags more than antenna number probability.
Fig. 5 is situation of change of inventive algorithm (BSFA) timeslot number with number of tags.
Fig. 6 is situation of change of inventive algorithm (BSFA) tag recognition rate with number of tags.
Fig. 7 is inventive algorithm (BSFA) and the blind separation multi-label anti-collision algorithm (Blind based on position gap Dynamic Packet
Separation and Dynamic Bit-slot Grouping, BSDBG) tag recognition rate at antenna number A=2~32
Compare.
Fig. 8 is the total inquiry times of (BSFA) algorithm of the invention.
Fig. 9 is the total inquiry times of BSDBG algorithms.
Figure 10 is the change of timeslot number during Q algorithm performs.
Specific embodiment
The present invention will be described further by following examples.
(1) reader sends Query orders to label
The RFID label tag collision avoidance system of BSFA algorithms is made up of a reader and multiple labels, first, reader hair
Lose one's life and make Query to the label entered in identification range, start the cycle of taking inventory, label enters ready state.
(2) label responds the Query orders of reader
Each label is performed both by 16 digit time slot counters during tag recognition, and the label of all entrance ready states is received
After Query orders, from 0~round (n (A+ α)/(β A2+ γ A)) when randomly choosing a time slot in individual time slot and being stored in respective
In gap counter, label enters responsive state, and time slot counter is 0 label response.Then, responsive tags are by random or pseudo-
Random data generator (RNG) produces the random sequence RN16 of 16, and respective RN16 sequences are sent into reader,
Number according to responsive tags can be divided into following two situations：
1. when the number of responsive tags is 0, show that time slot is idle, go to (5).
2. the number of responsive tags is equal to or more than 1, goes to (3) and performs FastICA algorithms.
(3) reader realizes Signal separator using FastICA algorithms
The signal that reader antenna is received is the mixed signal of label primary signal, in order to accurately believe mixing
Number carry out blind source separating, it is necessary first to estimate the number of primary signal, rfid system can mix when there is noise by observing
The dominant eigenvalue number of the correlation matrix of signal X determines the primary signal number that label sends, and then will using FastICA algorithms
Mixed signal X solutions are mixed, by the selection mixed coefficient matrix W of rational solution, make the estimation signal Y for observing clearly variable, by estimating
Meter signal Y=WX readers are set up with responsive tags and are contacted, and label enters acknowledgement state, goes to (4).
(4) reader sends ACK and instructs to responsive tags
Responsive tags into acknowledgement state send PC, EPC and CRC-16 information of oneself after ACK instructions are received,
Reader utilizes the mixed coefficient matrix W of the solution of (3) to continue to separate and store the identification information of these labels, and now label is successfully known
Not, the label for finally recognizing success is removed, and is gone to (5).
(5) reader sends QueryRep orders to label
Reader sends QueryRep orders, and the time slot counter value into ready state and unrecognized label subtracts 1, jumps
Go to (2) and proceed tag recognition, untill all tag recognitions are completed.
Claims (1)
1. a kind of frame slot ultrahigh frequency RFID system anti-collision method based on blind separation, it is characterized in that passing through following steps reality
It is existing：
(S1), reader sends Query orders to the label entered in identification range, starts the cycle of taking inventory, and label enters ready
State；
(S2), label responds the Query orders of reader, and randomly chooses time slot and be stored in respective time slot counter；Specifically
According to the following steps：
(1) each label is performed both by 16 digit time slot counters during tag recognition, and all unidentified labels receive Query lives
After order, from 0~round (n (A+ α)/(β A2+ γ A)) time slot is randomly choosed in individual time slot it is stored in respective time slot counter
In, label enters responsive state, and time slot counter is 0 label response；Wherein A is antenna number, and n is number of tags, α ≈ 10, β ≈
0.8, γ ≈ 0.66, round () are round function；
(2) responsive tags produce the random sequence RN16 of 16 by randomly or pseudo-randomly number generator, and will be respective
RN16 sequences be sent to reader, the number according to responsive tags is divided into following two situations：
1. when the number of responsive tags is 0, show that time slot is idle, go to (S5)；
2. the number of responsive tags is equal to or more than 1, goes to (S3) and performs FastICA algorithms；
(S3), reader utilizes FastICA algorithm separation tags mixed signals, while set up estimating signal and label primary signal
Between corresponding relation, label enters acknowledgement state；Specifically according to the following steps：
(1) signal that reader antenna is received is label mixed signal, in order to accurately carry out blind source to mixed signal
Separate, it is necessary first to estimate the number of primary signal, be divided into following two situations：
When 1. having noise can by observe mixed signal X correlation matrix dominant eigenvalue number come determine label send it is original
Signal number；
2. can be by the number of observing the order of mixed signal X to determine primary signal during noiseless；
(2) it is using FastICA algorithms that mixed signal X solutions is mixed, by the selection mixed coefficient matrix W of rational solution, make what is observed
Estimate that signal Y is clear and legible, contacted by estimating that signal Y=WX readers are set up with responsive tags, label enters acknowledgement state；
(S4), reader send ACK instruct to the label under acknowledgement state, label receive ACK instruction after, send oneself PC,
EPC and CRC-16 information, reader utilizes the mixed coefficient matrix of solution in (S3) to continue to separate and store the mark letter of these labels
Breath, now label is successfully identified, and goes to (S5)；
(S5), reader sends QueryRep orders to label, into ready state and the time slot counter of unrecognized label
Value subtracts 1, jumps to (S2) and proceeds tag recognition, untill all tag recognitions are completed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410219110.7A CN103955657B (en) | 2014-05-22 | 2014-05-22 | A kind of frame slot ultrahigh frequency RFID system anti-collision method based on blind separation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410219110.7A CN103955657B (en) | 2014-05-22 | 2014-05-22 | A kind of frame slot ultrahigh frequency RFID system anti-collision method based on blind separation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103955657A CN103955657A (en) | 2014-07-30 |
| CN103955657B true CN103955657B (en) | 2017-06-06 |
Family
ID=51332932
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410219110.7A Expired - Fee Related CN103955657B (en) | 2014-05-22 | 2014-05-22 | A kind of frame slot ultrahigh frequency RFID system anti-collision method based on blind separation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103955657B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104573593B (en) * | 2015-01-20 | 2017-05-31 | 江西理工大学 | A kind of deficient based on frame slot determines blind separation RFID anti-collision method |
| CN104866790B (en) * | 2015-06-02 | 2017-07-18 | 江西理工大学 | A kind of RFID system collision-proof method for owing to determine the tree-like packet of self adaptation of blind separation |
| CN105049134B (en) * | 2015-09-02 | 2017-03-22 | 电子科技大学 | Method for detecting received signal frequency collision in single channel blind separation of frequency-hopping communication |
| CN106778425B (en) * | 2017-01-10 | 2018-11-23 | 合肥工业大学 | A kind of label anti-collision algorithm based on RFID |
| CN108052849A (en) * | 2017-12-25 | 2018-05-18 | 江西理工大学 | A kind of frame slot RFID system collision-proof method of force zero precoding |
| CN109409150B (en) * | 2018-09-17 | 2020-09-25 | 北京科技大学 | Method and device for reading label, storage medium and processor |
| CN109325558B (en) * | 2018-09-17 | 2021-02-12 | 北京科技大学 | Method and system for allocating metal building material templates for warehouse entry and exit |
| US11048890B2 (en) * | 2019-01-11 | 2021-06-29 | Nec Corporation | Walk-through checkout station |
| WO2020214984A1 (en) * | 2019-04-18 | 2020-10-22 | Abbott Diabetes Care Inc. | Systems, devices, and methods for handling wireless communications in an analyte monitoring environment |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20020017846A (en) * | 2000-08-31 | 2002-03-07 | 박종섭 | Radio frequency identification tag system for preventing collision and collision preventing method thereof |
| CN202134035U (en) * | 2011-07-22 | 2012-02-01 | 扬州稻源微电子有限公司 | Radio frequency identification (RFID) tag and RFID system including the same |
| CN102609672A (en) * | 2012-02-22 | 2012-07-25 | 南京邮电大学 | Anti-collision method of radio frequency identification (RFID) system |
-
2014
- 2014-05-22 CN CN201410219110.7A patent/CN103955657B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20020017846A (en) * | 2000-08-31 | 2002-03-07 | 박종섭 | Radio frequency identification tag system for preventing collision and collision preventing method thereof |
| CN202134035U (en) * | 2011-07-22 | 2012-02-01 | 扬州稻源微电子有限公司 | Radio frequency identification (RFID) tag and RFID system including the same |
| CN102609672A (en) * | 2012-02-22 | 2012-07-25 | 南京邮电大学 | Anti-collision method of radio frequency identification (RFID) system |
Non-Patent Citations (1)
| Title |
|---|
| 一种基于盲分离的帧时隙超高频RFID系统防碰撞方法;栗华 等;《通信学报》;20120430;第33卷(第4期);第48页、第49页、第50页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103955657A (en) | 2014-07-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103955657B (en) | A kind of frame slot ultrahigh frequency RFID system anti-collision method based on blind separation | |
| US8981909B2 (en) | RFID group selection method | |
| Cheng et al. | Analysis and simulation of RFID anti-collision algorithms | |
| He et al. | An ALOHA-based improved anti-collision algorithm for RFID systems | |
| Farooq et al. | Optimal adjustment parameters for EPC global RFID anti-collision Q-algorithm in different traffic scenarios | |
| CN104573593B (en) | A kind of deficient based on frame slot determines blind separation RFID anti-collision method | |
| CN103679099A (en) | Anti-collision method applied to mass-RFID-label system | |
| CN103778461B (en) | Method applied to ultrahigh frequency reader for efficiently identifying tag | |
| Chen et al. | Study on Anti-collision Q Algorithm for UHF RFID | |
| Park et al. | Identification of RFID tags in framed-slotted ALOHA with tag estimation and binary splitting | |
| CN112446448A (en) | Method for identifying RFID (radio frequency identification) label by single reader combining DFSA (distributed feedback system) and binary algorithm | |
| Fraj et al. | An evaluation of UHF RFID anti-collision protocols with NS2 | |
| CN110135208A (en) | A kind of RFID label tag collision-proof method estimated based on grouped frequency and label | |
| CN104866790B (en) | A kind of RFID system collision-proof method for owing to determine the tree-like packet of self adaptation of blind separation | |
| Fu et al. | Collision recovery receiver for EPC Gen2 RFID systems | |
| Cui | System efficiency of collision recover binary tree algorithm in RFID | |
| Han et al. | Rfid anti-collision protocol for monitoring system of tags in motion | |
| Wang et al. | A stack-like optimal Q-algorithm for the ISO 18000-6C in RFID system | |
| Dacuña et al. | Multi-tag spatial multiplexing in UHF RFID systems | |
| Lv et al. | An improved RFID anti-collision algorithm based on the standard EPCglobal class-1 generation-2 | |
| Jin et al. | Persistent Q anti-collision algorithm for RFID | |
| Pudasaini et al. | Optimum Tag Reading Efficiency of Multi-Packet Reception Capable RFID Readers | |
| Arjona et al. | Experimental Validation of Anti-Collision Protocols for RFID Sensor Networks | |
| Kalache et al. | New Semi Blind Tag Separation Method for Efficient Tags to Reader Collision Recovery in RFID Systems | |
| Liu et al. | A fast and stable anti-collision algorithm for the EPCglobal UHF Class 1 Generation 2 standard |
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: 20170606 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |