CN108052855A - Suitable for the new Q values anti-collision algorithm of RFID system - Google Patents
Suitable for the new Q values anti-collision algorithm of RFID system Download PDFInfo
- Publication number
- CN108052855A CN108052855A CN201810014098.4A CN201810014098A CN108052855A CN 108052855 A CN108052855 A CN 108052855A CN 201810014098 A CN201810014098 A CN 201810014098A CN 108052855 A CN108052855 A CN 108052855A
- Authority
- CN
- China
- Prior art keywords
- label
- value
- reader
- tags
- values
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/10009—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves
- G06K7/10019—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers.
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/10009—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves
- G06K7/10019—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers.
- G06K7/10029—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers. the collision being resolved in the time domain, e.g. using binary tree search or RFID responses allocated to a random time slot
Landscapes
- Engineering & Computer Science (AREA)
- Health & Medical Sciences (AREA)
- Toxicology (AREA)
- Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Electromagnetism (AREA)
- General Health & Medical Sciences (AREA)
- Artificial Intelligence (AREA)
- Computer Vision & Pattern Recognition (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates in radio RF recognition technology field, Q value anti-collision algorithms that EPC C1G2 are proposed specifically apply to the new Q values anti-collision algorithm of RFID system.In order to solve the problem of in Q value-based algorithms that frame length variation is excessive and as the throughput that number of labels increases system cannot be maintained compared with maintenance level, it is proposed that a kind of novel algorithm.Algorithm mainly includes the following aspects：It estimates number of labels, judges whether to be grouped, judge the responsive state of label, judge threshold value, change frame length, finally so that all labels are successfully identified, algorithm terminates.The present invention is by estimating the quantity of label, carry out suitable grouping, every group of label is identified using improved Q value-based algorithms again, the present invention can effectively save the timeslot number needed for identification, frame length is enable to rapidly converge to optimum length, the number of communications between reader and label has been saved, and has been able to maintain that stable throughput.
Description
Technical field
It is specifically a kind of to be suitable for RFID system the present invention relates to the label collision prevention technology in radio frequency identification
New Q values anti-collision algorithm.
Background technology
Internet of Things is on the basis of internet, extends and expands to any article by its user terminal, carry out information exchange
With a kind of network of communication.The key technology of Internet of Things, radio frequency identification（Radio Frequency Identification,
RFID）Technology is a kind of automatic identification technology that non contact angle measurement is carried out by radiofrequency signal, and identified object can be carried out
Identification.
In the RFID systems of multiple readers and multiple labels, there is the bumping method of two kinds of forms, Yi Zhongshi
One label receives the order that multiple readers are sent simultaneously, is known as reader collision；Another kind is that a reader is received simultaneously
The data returned to multiple labels, are known as tag-collision.In practical applications, it is easiest to tag-collision occur, solves label and touch
The algorithm for hitting problem is known as label anti-collision algorithm.In RFID system, most widely used two classes anti-collision algorithm is respectively
Randomness anti-collision algorithm based on ALOHA and based on binary certainty anti-collision algorithm.Both algorithms are all based on
Time division multiple acess（TDMA）Anti-collision algorithm, the tag recognition rate of Binary tree search algorithm can reach 100%, but algorithm
Complex, convergence rate is slow, and recognition time is long.The complexity of ALOHA algorithms is relatively low, and recognition speed is fast, label in by system
Number influence is smaller, but recognition efficiency is not high.
Q value anti-collision algorithms are taken in the EPC-C1G2 standards that EPC global are proposed.The algorithm is identified by counting
Idle and collision time slot number inside frame, to regulate and control the length of next identification frame, makes system under different number of tags,
Preferable recognition performance can be kept.
By literature search, we retrieved following pertinent literature, such as：
Chinese patent CN201410132821.0, new E PC-C1G2 label anti-collision algorithms, patentee：It is southwestern national big
It learns, which disclose a kind of new E PC-C1G2 label anti-collision algorithms：The algorithm is declined and efficiency suboptimum for efficiency
Label to be supported persistently to reach with based on EPC-C1G2 standard architectures, strategy is determined to number of tags estimation strategy, frame length for problem
Strategy is terminated with frame to be studied, based on these research conclusions, proposes more efficient anti-collision algorithm, to solve Q algorithms dynamic
Efficiency declines problem and determines efficiency suboptimal problems caused by frame length and Abort Frame based on experience value in state environment.
Chinese patent CN201210135894.6, a kind of RFID system label anti-collision method, patentee：It is big in Guangzhou
Microtronics A/S which disclose a kind of RFID system label anti-collision method, using the Q for meeting EPCC1G2 standards
Algorithm introduces auxiliary parameter K, and dynamically adjusts the parameter Q, the auxiliary parameter K in Q algorithms with reference to the parameter C in Q algorithms
For collision time slot and the ratio of free timeslot.
Chinese patent CN201310665471.5, a kind of anticollision innovatory algorithm of radio frequency identification, patentee：In Beijing
Electric Hua Da Electronic Design Co., Ltd, the invention provide a kind of anticollision innovatory algorithm that can be used for realizing, main purpose
It is on the basis of original anticollision management method, rational initial value is set, so as to improves the intervention efficiency of label.It is main former
Reader substantially estimates the number of tags currently to be accessed according to RSSI during reason, so as to quickly set rational initial value, afterwards
Anti-collision algorithm access is carried out, improves the access efficiency of multi-tag.
The content of the invention
It is an object of the invention to provide a kind of new Q values anti-collision algorithms suitable for RFID system.The algorithm is reduced
Timeslot number, improves slot efficiency and maintains preferable system throughput.
The technical solution adopted by the present invention is as follows：
A kind of new Q values anti-collision algorithm suitable for RFID system, it is unique to arrange each tag ID number, and each label contains
Corresponding randomizer R, time slot counter S, comprise the following steps：
Step 1）Number of tags is grouped：Due in practical application, the optimal time slot counter that label can be provided is
8bit, that is, it is 2 to take frame length maximum8=256 be optimum length of frame（The application mainly in the more situation of number of labels, and
Due to the limitation of hardware condition, it is impossible to infinitely increase frame length, therefore select the frame length maximum that can reach in practice）, and
When frame length is 256, reader can at most identify 354 labels, therefore if number of tags is less than 354, it need not be divided
Group；If number of tags is more than 354, less than 610, then it is divided into two groups：A group of labels number is 256, and another group is remaining label；If
Number of tags is more than 610, less than 866, is then divided into three groups：Two groups of number of tags are 256, and another group is remaining label, and so on；
Step 2）Every group of label is subjected to following algorithm：Initialize Q values, i.e. reader setting label initialization parameter command, Q values
Scope be（0,15）；Then the order Query (Q) of request response is sent to all labels, Query starts one and takes inventory week
Phase, and determine which label participates in this and takes inventory the cycle that (" taking inventory the cycle " is the time being separated by between continuous Query orders）；
Step 3）Response process：Label responds after receiving the Query orders of reader transmission, and returning to reader one should
Signal is answered, if the number of tags of response is 1 or without tag responses, performs step 11）；If the number of tags of response is more than 1, perform
Step 4）；
Step 4）The label of Query orders is received [0,2Q- 1] in the range of randomly choose a data be stored in itself when
In gap counter S；
Step 5）The label that the value of time slot counter S is 0 responds reader, remaining label is kept silent state；
Step 6）When one and only one label random number is 0, label communicates with reader foundation, exits this wheel and knows
Not；
Step 7）When no label random number is 0, reader is adjusted accordingly using step-length C, Q '=Q-C；It is more when having
When a label random number is 0, reader is adjusted accordingly using step-length C, Q '=Q+C, performs step 8）；
Step 8）Calculate new 2Q′Value and original 2QThe absolute value of the difference of value, if absolute value has been more than corresponding to current label number
Threshold value performs step 9）；Otherwise, step 10 is performed）；
Step 9）Terminate present frame, by Query Adjust orders adjustment Q values, Query Adjust orders can be from pervious
Q values are changed in Query orders, make Q plus or minus ones, the label for receiving this order will be again [0,2Q- 1] selected in the range of
Random number is stored in the time slot counter S of itself, return to step 5）；
Step 10）Reader sends Query Rep orders, after label receives the Query Rep orders that reader is sent, should make it
The value of time slot counter S subtracts 1, return to step 5）；
Step 11）Tag recognition is completed, algorithm terminates.
The present invention further illustrates, the time slot counter S is for storing the selected random number of label, during S=0, mark
Label communicate with reader foundation；S>When 0, label is in non-responsive state.
The present invention further illustrates that the foundation of labeled packet is in the case where frame length is 256, and maximum number of tags is 354,
It is just grouped in the case where total number of tags is more than 354, and every group of number of tags is maximum no more than 256, minimum is not less than
99.The critical value being grouped required for label is 354, optimum length of frame 256, when label is grouped according to the situation
When, preferable system throughput can be maintained.
The present invention further illustrates, in step 8）It is middle by new 2Q′Value and original 2QValue is compared, by table lookup operations, if
The absolute value of its difference is more than threshold value, then frame length is adjusted, i.e., 2Q′With 2QDifference absolute value be more than threshold value
Under conditions of, when Q ' is more than Q, Q values plus 1；When Q ' is less than Q, Q values subtract 1.
The beneficial effects of the invention are as follows：
The label anti-collision algorithm of the present invention, is improved, it is contemplated that work as number of tags on the basis of traditional Q value-based algorithms
When larger, caused frame length is not suitable with problem and is changed when identification is grouped to it, and traditional Q value-based algorithms being changed
Into to 2Q′Value and original 2QValue is compared so as to adjust frame length, is reduced the dynamic adjustment number of Q values, is maintained relatively stable
RFID system throughput and improve the performance of tag recognition.
Description of the drawings
The anti-collision algorithm flow chart of Fig. 1 present invention；
The step flow chart of the example of Fig. 2 present invention；
Fig. 3 prior art Q algorithms, the algorithm of fixed frame length and the time slot of algorithm in the present invention consume comparison diagram；
The system effectiveness comparison diagram of algorithm in Fig. 4 prior art Q algorithms, the algorithm of fixed frame length and the present invention.
Specific embodiment
The present invention is further described below in conjunction with the accompanying drawings.
Embodiment：
The new Q values anti-collision algorithm suitable for RFID system of the present invention is the Q value-based algorithms for meeting EPC-C1G2 standards.EPC-
C1G2 standards define the passive backscattering operated in the frequency range of 860MHz-960MHz, inquisitor speech preferentially
(ITF) and radio frequency identification (RFID) system requirements.The standard mainly includes following order：Select（Need based on user
Seek the corresponding population of tags of selection）、Inventory（Identify the process of label）、Access（The label definite to some carries out reading behaviour
Work or write operation）.Select is operated and Access operations can determine order length or required time, thus the mark of RFID system
Label recognition performance is heavily dependent on the algorithm design of Inventory operations.
Inventory operations mainly include the instructions such as Query, Query Adjust, Query Rep, ACK, NAK.
Query is the initialization command of Inventory, and main function is to be sent to parameter Q all to be chosen by Select
Label, each label will be [0,2Q- 1] random number is generated between, and is stored in the time slot counter of label, if generate
It is 0, then label returns to a RN16（The random number of 16）If reader can receive this RN16, reader represents
It has been acknowledged and communicates with the label, the label being identified sends the EPC of oneself（Electronic Product Code）.
Query Adjust orders refer on the premise of Inventory other instructions are not changed, the value of change parameter Q（Q
+ 1, Q-1）, all labels of this order are received again [0,2Q- 1] random number is generated in the range of, if what is generated is 0,
Label returns to a RN16.
Query Rep are by random number caused by all labels from subtracting, if the random number for having label is kept to 0, label returns
Return a RN16.If the random number for having multiple labels is 0, reader can receive multiple RN16 in same time slot, that is, generate
Collision, reader will be unable to correctly identify each label.
Number of labels variation very greatly in the case of, can Q algorithms realize system high efficiency rate, depend primarily upon parameter C's
Value condition.C too conferences cause frame length frequently to adjust, and increase power consumption and recognition time；The too small selections that can increase optimal frames of C
Time reduces recognition efficiency.Under desired communication state, any time slot collide and idle probability be it is different, simultaneously
The time of collision time slot and free timeslot consumption is also different, system can not be made to be operated in most only with single parameter C adjustment
Excellent state causes to identify that label rate declines rapidly, and system effectiveness can also reduce.
Suggest the value of C in EPC C1G2 standards as [0.1,0.5], in the case where Q values are larger, C takes smaller value, Q
Be worth it is smaller in the case of, C takes larger value.
Q algorithms adjust present frame progress Mobile state after each time slot by parameter C.Number of tags is 0 in time slot,
As free timeslot, Q subtract C；Number of tags is equal to 1 in time slot, as successful time slot, and Q is constant；Number of tags is more than 1 in time slot, is
Time slot is collided, Q increases C, when Q changes more than 1, to Q progress roundings to get to new Q values.
With reference to Fig. 1, the new Q values anti-collision algorithm suitable for RFID system of the invention is marked using EPC-C1G2 is met
Label, is grouped by accurate Q value-based algorithms in advance first on this basis, then to new 2Q′Value and original 2QValue is compared judgement,
Including following steps：
Label is grouped in advance first；
Reader judges the time slot state of current time slots, including free timeslot, success time slot and collision time slot；
Reader judges the time slot state in each frame, and if free timeslot, then Q subtracts C；If success time slot；Then Q is constant, if
To collide time slot, then Q increases C；
Judge new 2Q′With 2QDifference absolute value whether be more than threshold value（Threshold value is not unique, is determined by number of tags）Or
Judge whether current time slots are the last one time slot, if so, reader is to being assigned to Q after new Q ' roundings and sending Q algorithms
Query Adjust instruction；If it is not, then send the Query Rep instructions in Q algorithms.
Embodiments of the present invention are further used as, required threshold value is determined by the following formula in the present invention：
Wherein, parameter a is represented when Q ' ＜ Q, the parameter selected by threshold value, and parameter b is represented when Q ' ＞ Q, door
Parameter selected by limit value.Two parameters are related to unread tags number, obtained by emulation experiment.Threshold value is as shown in the table：
| Number of tags scope | Parameter a（Average value） | Parameter b（Average value） | System effectiveness |
| 0-100 | 0.76 | 1.44 | 0.34 |
| 101-200 | 0.83 | 1.43 | 0.34 |
| 201-300 | 0.85 | 1.51 | 0.36 |
| 301-400 | 0.85 | 1.51 | 0.36 |
| 401-500 | 0.85 | 1.50 | 0.33 |
| 501-600 | 0.86 | 1.53 | 0.33 |
| 601-700 | 0.85 | 1.53 | 0.33 |
| 701-800 | 0.87 | 1.52 | 0.33 |
| 801-900 | 0.85 | 1.50 | 0.32 |
| 901-1000 | 0.86 | 1.53 | 0.32 |
Fig. 2 is the step flow chart of the preferred embodiment of the present invention, with reference to Fig. 2, including following steps：
S1. judge whether label needs to be grouped operation, if desired, be then grouped according to the packet mode；Described
Packet mode is：If number of tags is less than 354, need not be grouped；If number of tags is more than 354, less than 610, then divide
For two groups：A group of labels number is 256, and another group is remaining label；If number of tags is more than 610, less than 866, then it is divided into three groups：
Two groups of number of tags are 256, and another group is remaining label, and so on；
S2. following algorithm is carried out to every group of label：Set Q values scope be（0,15）,；
S3. reader sends Query；
S4. the number of tags in wake-up states is 1 or is waken up without label, performs step S13；Number of tags in wake-up states
More than 1, step S5 is performed；
S5. label startup randomizer each generates one in [0,2Q- 1] random number between, and be deposited into
In the time slot counter of itself；
S6. the label that the value of time slot counter is 0 responds reader；
S7. the number of labels responded in current time slots is judged：Quantity is 0, performs step S8；Quantity is 1, performs step S9；Number
Amount is more than 1, performs step S10；
S8. the value of Q ' is set to perform step S11 for Q-C；
S9. Q is constant, successfully identifies a label, jumps to step S12；
S10. the value of Q ' is set to perform step S11 for Q+C；
S11. 2 are judgedQ′Value and 2QDifference absolute value whether be more than threshold value, if so, being instructed by Query Adjust
Q is modified, jumps to step S4；Otherwise, step S12 is performed；
S12. reader sends Query Rep instructions, and the value of the time slot counter of all labels is made to subtract 1, jumps to step S6；
S13. all labels are identified, and algorithm terminates.
In order to check improve after algorithm performance, we are emulated to improving front and rear algorithm, emulate acquired mark
It is 1000 to sign number, and all results are all the average value required by the emulation by 1000 times.Since EPC C1G2 standards are only given
The suggested range [0.1,0.5] of C is gone out, in this experiment, the value of C is determined by the following formula：
We can be found that labeled packet algorithm proposed by the present invention is a length of compared to traditional Q value-based algorithms and anchor-frame in figure 3
128 and 256 frame slot algorithm, under conditions of same label number is identified, the total timeslot number consumed is less.And compared to
Traditional Q value-based algorithms, total timeslot number that this algorithm is consumed is relatively stable and reduces 17.3%.
From Fig. 4 we it can be found that compared to other algorithms, this algorithm in terms of system effectiveness compared with other algorithms
It improves, compared to traditional Q value-based algorithms, this algorithm, which improves 21.4% in terms of system effectiveness and can have, relatively stable is
System efficiency.
It should be noted last that the above embodiments are merely illustrative of the technical solutions of the present invention and it is unrestricted.Although ginseng
The present invention is described in detail according to embodiment, it will be understood by those of ordinary skill in the art that, to the technical side of the present invention
Case is modified or replaced equivalently, and without departure from the spirit and scope of technical solution of the present invention, should all be covered in the present invention
Claim in.
Claims (4)
1. a kind of new Q values anti-collision algorithm suitable for RFID system, it is unique to arrange each tag ID number, and each label contains
There are corresponding randomizer R, time slot counter S, it is characterised in that comprise the following steps：
Step 1）Number of tags is grouped：The optimal time slot counter that label can be provided is 8bit, that is, takes frame length maximum
It is worth for 28=256 be optimum length of frame, and when frame length is 256, reader can at most identify 354 labels, therefore if label
Number is less than 354, then need not be grouped；If number of tags is more than 354, less than 610, then it is divided into two groups：A group of labels number is
256, another group is remaining label；If number of tags is more than 610, less than 866, then it is divided into three groups：Two groups of number of tags are 256, separately
One group is remaining label, and so on；
Step 2）Every group of label is subjected to following algorithm：Initialize Q values, i.e. reader setting label initialization parameter command, Q values
Scope be（0,15）；Then the order Query (Q) of request response is sent to all labels, Query starts one and takes inventory week
It is phase, and determine which label participates in this and takes inventory the cycle, described to take inventory the time that the cycle is separated by between continuous Query orders；
Step 3）Response process：Label responds after receiving the Query orders of reader transmission, and returning to reader one should
Signal is answered, if the number of tags of response is 1 or without tag responses, performs step 11）；If the number of tags of response is more than 1, perform
Step 4）；
Step 4）The label of Query orders is received [0,2Q- 1] in the range of randomly choose a data be stored in itself when
In gap counter S；
Step 5）The label that the value of time slot counter S is 0 responds reader, remaining label is kept silent state；
Step 6）When the random number of one and only one label is 0, label communicates with reader foundation, exits this wheel and knows
Not；
Step 7）When the random number of no label is 0, reader is adjusted accordingly using step-length C, Q '=Q-C；When having
When the random number of multiple labels is 0, reader is adjusted accordingly using step-length C, Q '=Q+C, performs step 8）；
Step 8）Calculate new 2Q′Value and original 2QThe absolute value of the difference of value, if absolute value has been more than corresponding to current label number
Threshold value performs step 9）；Otherwise, step 10 is performed）；
Step 9）Terminate present frame, by Query Adjust orders adjustment Q values, Query Adjust orders can be from pervious
Q values are changed in Query orders, make Q plus or minus ones, the label for receiving this order will be again [0,2Q- 1] selected in the range of
Random number is stored in the time slot counter S of itself, return to step 5）；
Step 10）Reader sends Query Rep orders, after label receives the Query Rep orders that reader is sent, should make it
The value of time slot counter S subtracts 1, return to step 5）；
Step 11）Tag recognition is completed, algorithm terminates.
2. the new Q values anti-collision algorithm according to claim 1 suitable for RFID system, it is characterised in that：Described
Time slot counter S is for storing the selected random number of label, and during S=0, label is established with reader and communicated；S>When 0, at label
In non-responsive state.
3. the new Q values anti-collision algorithm according to claim 1 or 2 suitable for RFID system, it is characterised in that：Label
The foundation of grouping be in frame length in the case of 256, maximum number of tags is 354, in the case where total number of tags is more than 354 just into
Row grouping, and every group of number of tags is maximum no more than 256, minimum is not less than 99.
4. the new Q values anti-collision algorithm according to claim 1 suitable for RFID system, it is characterised in that：In step
8）It is middle by new 2Q′Value and original 2QValue is compared, by table lookup operations, if the absolute value of its difference is more than threshold value, to frame
Length is adjusted, i.e., 2Q′With 2QDifference absolute value be more than threshold value under conditions of, Q ' be more than Q when, Q values add 1；Q ' is less than
During Q, Q values subtract 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810014098.4A CN108052855A (en) | 2018-01-08 | 2018-01-08 | Suitable for the new Q values anti-collision algorithm of RFID system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810014098.4A CN108052855A (en) | 2018-01-08 | 2018-01-08 | Suitable for the new Q values anti-collision algorithm of RFID system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108052855A true CN108052855A (en) | 2018-05-18 |
Family
ID=62126689
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810014098.4A Pending CN108052855A (en) | 2018-01-08 | 2018-01-08 | Suitable for the new Q values anti-collision algorithm of RFID system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108052855A (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108804964A (en) * | 2018-06-13 | 2018-11-13 | 内蒙古大学 | A kind of register method, system and the handheld reader of logistics express delivery |
| CN109409150A (en) * | 2018-09-17 | 2019-03-01 | 北京科技大学 | Method, apparatus, storage medium and the processor that label is read |
| CN109446857A (en) * | 2018-09-30 | 2019-03-08 | 中国农业大学 | Label anti-collision method and system based on quick dynamic frame slot |
| CN109446869A (en) * | 2018-12-29 | 2019-03-08 | 山东建筑大学 | Collision-proof method, device, computer readable storage medium and the equipment of RFID system |
| CN109635885A (en) * | 2018-10-31 | 2019-04-16 | 昆明理工大学 | A kind of mountainous region transformer station's signal parallelism recognition method for improving ALOHA algorithm optimization |
| CN110211257A (en) * | 2019-07-16 | 2019-09-06 | 天津工业大学 | A kind of vehicle-mounted monitoring and recording system of tread life based on RFID technique |
| CN112749572A (en) * | 2020-12-29 | 2021-05-04 | 南京邮电大学 | Method for reducing label loss rate |
| WO2023226844A1 (en) * | 2022-05-24 | 2023-11-30 | 维沃移动通信有限公司 | Backscatter signal transmission method and apparatus, communication device and readable storage medium |
| WO2024082967A1 (en) * | 2022-10-21 | 2024-04-25 | 华为技术有限公司 | Communication method and apparatus |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103870785A (en) * | 2014-04-03 | 2014-06-18 | 西南民族大学 | Novel EPC-C1G2 label anti-collision algorithm |
| US20140307871A1 (en) * | 2013-04-15 | 2014-10-16 | Electronics And Telecommunications Research Institute | Method for key establishment using anti-collision algorithm |
| CN104411018A (en) * | 2014-11-03 | 2015-03-11 | 天津工业大学 | Dynamic grouping variable-time slot algorithm-based data transmission method |
| CN104657693A (en) * | 2015-02-26 | 2015-05-27 | 江西理工大学 | RFID (radio frequency identification) anti-collision method based on GASS (grouped adaptive allocating slots) |
| CN104680104A (en) * | 2014-12-15 | 2015-06-03 | 天津工业大学 | Dynamic efficient RFID (Radio Frequency Identification Device) tag identification mechanism |
| CN107506674A (en) * | 2017-08-01 | 2017-12-22 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | ALOHA collision-proof methods based on slot prediction |
-
2018
- 2018-01-08 CN CN201810014098.4A patent/CN108052855A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140307871A1 (en) * | 2013-04-15 | 2014-10-16 | Electronics And Telecommunications Research Institute | Method for key establishment using anti-collision algorithm |
| CN103870785A (en) * | 2014-04-03 | 2014-06-18 | 西南民族大学 | Novel EPC-C1G2 label anti-collision algorithm |
| CN104411018A (en) * | 2014-11-03 | 2015-03-11 | 天津工业大学 | Dynamic grouping variable-time slot algorithm-based data transmission method |
| CN104680104A (en) * | 2014-12-15 | 2015-06-03 | 天津工业大学 | Dynamic efficient RFID (Radio Frequency Identification Device) tag identification mechanism |
| CN104657693A (en) * | 2015-02-26 | 2015-05-27 | 江西理工大学 | RFID (radio frequency identification) anti-collision method based on GASS (grouped adaptive allocating slots) |
| CN107506674A (en) * | 2017-08-01 | 2017-12-22 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | ALOHA collision-proof methods based on slot prediction |
Non-Patent Citations (1)
| Title |
|---|
| 朱泊远、曾桂根: "《新型RFID防碰撞Q值算法研究》", 《计算机工程与应用》 * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108804964A (en) * | 2018-06-13 | 2018-11-13 | 内蒙古大学 | A kind of register method, system and the handheld reader of logistics express delivery |
| CN108804964B (en) * | 2018-06-13 | 2021-04-27 | 内蒙古大学 | Logistics express registration method and system and handheld reader |
| CN109409150B (en) * | 2018-09-17 | 2020-09-25 | 北京科技大学 | Method and device for reading label, storage medium and processor |
| CN109409150A (en) * | 2018-09-17 | 2019-03-01 | 北京科技大学 | Method, apparatus, storage medium and the processor that label is read |
| CN109446857A (en) * | 2018-09-30 | 2019-03-08 | 中国农业大学 | Label anti-collision method and system based on quick dynamic frame slot |
| CN109635885B (en) * | 2018-10-31 | 2021-08-06 | 昆明理工大学 | Mountain transformer substation signal parallel identification method for improving ALOHA algorithm optimization |
| CN109635885A (en) * | 2018-10-31 | 2019-04-16 | 昆明理工大学 | A kind of mountainous region transformer station's signal parallelism recognition method for improving ALOHA algorithm optimization |
| CN109446869A (en) * | 2018-12-29 | 2019-03-08 | 山东建筑大学 | Collision-proof method, device, computer readable storage medium and the equipment of RFID system |
| CN109446869B (en) * | 2018-12-29 | 2021-09-10 | 山东建筑大学 | Anti-collision method and device for RFID system, computer readable storage medium and equipment |
| CN110211257A (en) * | 2019-07-16 | 2019-09-06 | 天津工业大学 | A kind of vehicle-mounted monitoring and recording system of tread life based on RFID technique |
| CN112749572A (en) * | 2020-12-29 | 2021-05-04 | 南京邮电大学 | Method for reducing label loss rate |
| CN112749572B (en) * | 2020-12-29 | 2024-02-20 | 南京邮电大学 | Method for reducing label loss rate |
| WO2023226844A1 (en) * | 2022-05-24 | 2023-11-30 | 维沃移动通信有限公司 | Backscatter signal transmission method and apparatus, communication device and readable storage medium |
| WO2024082967A1 (en) * | 2022-10-21 | 2024-04-25 | 华为技术有限公司 | Communication method and apparatus |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108052855A (en) | Suitable for the new Q values anti-collision algorithm of RFID system | |
| Floerkemeier | Transmission control scheme for fast RFID object identification | |
| Cui et al. | Performance evaluation of a multi-branch tree algorithm in RFID | |
| CN102004895B (en) | Time slot scanning anti-collision method based on collision precheck | |
| Chen et al. | A novel time-aware frame adjustment strategy for RFID anti-collision | |
| CN109002743B (en) | Anti-collision method for label checking and reader-writer | |
| CN102024163B (en) | Anti-collision method with packet previewing mechanism | |
| CN105184342B (en) | A kind of raising UHF RFID anti-collision algorithms make an inventory terminate threshold value accuracy method | |
| Yeh et al. | Adaptive splitting and pre-signaling for RFID tag anti-collision | |
| Arjona et al. | Timing-aware RFID anti-collision protocol to increase the tag identification rate | |
| CN108520190A (en) | The recognition methods of the grouping of RFID card reader time slot or mapping multiple target label based on Hash functions | |
| Lai et al. | An RFID anti-collision algorithm with dynamic condensation and ordering binary tree | |
| CN104680104A (en) | Dynamic efficient RFID (Radio Frequency Identification Device) tag identification mechanism | |
| Alsalih et al. | Optimal distance-based clustering for tag anti-collision in RFID systems | |
| CN102682314A (en) | Method for judging end of checking up | |
| KR100964782B1 (en) | Method, reader that optimizing a framesize using Q-algorithm in RFID system | |
| CN110135208A (en) | A kind of RFID label tag collision-proof method estimated based on grouped frequency and label | |
| Wang et al. | A novel anti-collision algorithm for EPC Gen2 RFID systems | |
| Alotaibi et al. | Tag anti-collision algorithms in RFID systems-a new trend | |
| CN105205511B (en) | A kind of binary system splitting method eliminated based on free timeslot | |
| KR100769688B1 (en) | Method for reading tag with multiple threshold, recording medium and apparatus thereof | |
| CN102682310A (en) | Method for identifying multiple tags | |
| Yeh et al. | Parallel Splitting for RFID tag anti-collision | |
| Tsao et al. | Runtime optimization of framed slotted ALOHA based RFID Systems | |
| Simon et al. | Speed adjustment algorithm for an RFID reader and conveyor belt system performing dynamic framed slotted aloha |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180518 |