CN109635611A - A kind of optimization Dynamic Packet collision-proof method based on frame slot - Google Patents
A kind of optimization Dynamic Packet collision-proof method based on frame slot Download PDFInfo
- Publication number
- CN109635611A CN109635611A CN201811553053.0A CN201811553053A CN109635611A CN 109635611 A CN109635611 A CN 109635611A CN 201811553053 A CN201811553053 A CN 201811553053A CN 109635611 A CN109635611 A CN 109635611A
- Authority
- CN
- China
- Prior art keywords
- label
- time slot
- tags
- takes
- frame
- 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.
- 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
A kind of optimization Dynamic Packet collision-proof method based on frame slot of the present invention, pass through experiment simulation, pretreatment is grouped to label, then mixing inquiry is carried out on the basis of labeled packet is pretreated, several parameters such as free timeslot, collision time slot, packet count and optimum frame length are optimized, collision probability is reduced, system identification efficiency is improved, reduces empty slot number and volume of transmitted data, improves the stability of algorithm.
Description
Technical field
The present invention relates to technical field of RFID, and in particular to a kind of optimization Dynamic Packet anticollision side based on frame slot
Method.
Background technique
Petroleum chemical enterprise's product library management is always the basal core content of enterprise.First is that there may be severe for storage environment
Situation may store high toxicity, highly corrosive product；Separately second is that, there may be product category complexity in library, product quantity is huge
Situations such as, artificial treatment effeciency is low and is easy error.Thus, by RFID technique be applied to storage environment it is severe, inventory
In classification complex environment, to solve the above problems.
Internet of Things high speed development, RFID technique have obtained the concern of numerous scholars as the core technology of Internet of Things.RFID
Technology has apparent advantage: can be not directly contacted with object and be identified, can identify multiple labels simultaneously, can identify
The label that fast moves can be used for some other harsh environments, in addition to this its confidentiality also with higher, can be compared with
Safely to carry out data storage and exchange transmission.RFID technique is used to going out for petroleum chemical enterprise's product and replaces bar code in storage
Technology, can effective solution barcode technology the problem of, realize and identify multiple Product labellings simultaneously, reach the identification production of greater efficiency
Product information, while time cost and human cost can be saved.
In the prior art, RFID identification technology is applied to still have following problems when product warehousing and ex-warehouse, on the one hand works as production
When product quantity is more, RFID technique is likely to occur the case where tag-collision causes identification to lag when realizing the identification of multi-product；
On the other hand when label overlapping occurs in multi-product, RFID technique identifies that the accuracy rate of multi-product label can be with the quantity of label
Increase and reduces.
Although the anti-collision algorithm of RFID classics in the prior art comparative maturity, there is also following defects: hitting
Important parameter in algorithm, for example, free timeslot, collision time slot, packet count and optimum frame length setting can be further excellent
Change, algorithm stability has to be optimized；
Related product is not much in the research of petroleum chemicals this toxicity, highly corrosive application scenarios, is badly in need of carrying out related
Application study, to solve the problems, such as RFID product in the applicability of the application scenarios.
The more label algorithm for estimating used has least-squares algorithm, Poisson distribution in FSA, DFSA algorithm in the prior art
Static estimation algorithm and Vogt algorithm.In these algorithms, it is every identified a frame slot after, although can be according to the knowledge of previous frame
Sorrow of separation condition estimates next frame number of tags to be identified, and frame length is made to be equal to number of tags, so that the throughput of system is calculated, but
It is that they only used the collision labels of this inquiry only to be estimated, and coefficient is nearly all constant, is not tested
Card.Frame length is set to be equal to label estimative figure, although system throughput can be made to reach maximum value, collision rate also becomes larger therewith, and
System work cannot be made in the case where stablizing throughput.
Summary of the invention
To solve the above-mentioned problems, the present invention provide a kind of collision probability is few, system identification is high-efficient, empty slot number is few,
Volume of transmitted data is high, and the optimization Dynamic Packet collision-proof method based on frame slot of algorithm high stability includes the following steps,
S1 estimates the number n of label to be identified；
For S2 when number of tags is less than the first preset value, the length M of adjustment identification frame is simultaneously directly entered step S5, when n is big
When the first preset value, label is grouped and obtains packet count g；
S3 is assigned as group # to one several i of random selection between g 1 and records the number of tags data of the group；
The number t that S4 initializes current identification group is 1, is identified since current identification group；
S5 reader sends collision time slot scanning order to each label with the shape broadcasted, and it is backward that each label receives the order
Reader returns to the timeslot number respectively reserved；
Data judge whether time slot can successfully identify to S6 reader based on the received, if it successfully can identify label
Its time slot flag bit Flag is set as 0, its time slot flag bit Flag is set as -1 if it cannot successfully identify label；
The selection data of time slot are sent to each label according to the data of label reserving time slots by S7 reader, each to mark
The time slot of its own is adjusted after label acquisition other labels selection time slot data；
S8 reads label information order since reader is sent, label receive the readings label information order later according to
Time slot adjusted successively sends data to reader；
S9 reader sends the order that subtracts 1 of label time slot counter, and the time slot counter of each label in the group is allowed to subtract 1；
S10 reader, which sends the order of label silence, makes the label being correctly read in this wheel query process enter silence
State makes it be not involved in subsequent inquiry；
After each round end of identification, the number of the remaining unidentified label of estimation weighs S11 if number of tags is not 0
Multiple two steps of s9 and s10 above, until the remaining label of the group has all identified；
After S12 is to group # t execution plus 1 operation, the S5 that gos to step if t≤g carries out next group of identification, if t > g
Then end of identification.
Further, estimate the number n of label to be identified the following steps are included:
It is M for frame length, total number of labels mesh to be identified is the RFID system of n, it is obtained using Chebyshev inequality:
(Te, Ts, Tc) respectively indicate generated free timeslot number in an identification process, success timeslot number and collision
Timeslot number；(T'e, T 's, T 'c) respectively indicate be identification one wheel complete after caused by free timeslot, success time slot and
Collide the desired value of time slot；
The probability of any time slot is expressed as in some one frame of tag responses:
The same time slot has the probability of m label that can indicate are as follows:
Probability without request identification label in the same time slot are as follows:
There is and only have the probability of some label transfer request command in same time slot are as follows:
In same time slot there are two and the above label transfer request command probability:
Pc=1-Pe-Ps (6)
All time slots are all inquired after completion in frame, T 'e, T 's, T 'cIt can be expressed as:
T′c=M*Pc=M-T 'e-T′s (7)
Formula (7) are substituted into formula (1), the number of tags for taking n value when making vector space distance ε minimum to estimate.
Further,
The length M obtaining step of the adjustment identification frame are as follows:
Frame length M takes 4 if number of tags n is 1 to 5；
Frame length M takes 8 if number of tags n is 6 to 11；
Frame length M takes 16 if number of tags n is 12 to 21；
Frame length M takes 32 if number of tags n is 22 to 44；
Frame length M takes 64 if number of tags n is 45 to 89；
Frame length M takes 128 if number of tags n is 90 to 177；
Frame length M takes 256 if number of tags n is 178 to 354；
Frame length M takes 256 if being greater than 354 if number of tags n.
Further,
Label is grouped and obtains packet count g obtaining step and is
If number of tags takes 1 less than 354 packet counts；
Packet count takes 2 if number of tags is 354 to 709；
Packet count takes 4 if number of tags is 710-1420.
The beneficial effects of the present invention are:
1 is more stable using present invention mixing inquiry packets anticollision optimization algorithm performance.
2 can reduce waiting empty slot using present invention mixing inquiry packets anticollision optimization algorithm, shorten recognition time,
The whole recognition efficiency of raising system.
Detailed description of the invention
The simulation result schematic diagram of system throughput when Fig. 1 is different fixed values.
Fig. 2 is optimization Dynamic Packet collision-proof method flow chart of the one embodiment of the invention based on frame slot.
Specific embodiment
The present invention solve the problems, such as the invention thinking in background technique first is that:
The present invention is grouped pre- place to label by experiment simulation using mixing inquiry packets anticollision optimization algorithm
Reason, then carries out mixing inquiry on the basis of labeled packet is pretreated, to free timeslot, collision time slot, packet count and best
Several parameters such as frame length optimize, and reduce collision probability, improve system identification efficiency, reduce empty slot number and number
According to transmission quantity, the stability of algorithm is improved.
Tag-collision question essence is channel contention and superposed signal identification problem, and one's duty invention proposes a kind of thinking, solves
Certainly communication channel resources are limited, in the case where the same wireless channel of multiple label contentions and reader communication, coordinate contention for resources
And data collision, enable reader quickly, correctly obtain label information.
Below by a specific embodiment, the present invention will be described.
As shown in Fig. 2, optimization Dynamic Packet collision-proof method in the present embodiment based on frame slot the following steps are included:
S1 estimates the number n of label to be identified with Vogt algorithm in the identification incipient stage.
S2 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 time slot processing stage.When n is greater than 354, then needs to be grouped label, packet count g is acquired by table 1.
S3 label, to a several i is randomly choosed between g, increases by 1 as the group # of oneself, while the value of C [t] 1,
Record the number of tags of the group.
The number t that S4 initializes current identification group is 1, is identified since current identification group.
S5 is before carrying out data reading, and progress time slot scanning, reader send Query (Q) with the shape broadcasted and order first
To each label.Label receives the order and then returns to the timeslot number respectively reserved to reading.
S6 reader is further according to received data information, to judge which time slot can be identified successfully, which time slot
If will generate collision or free timeslot can successfully identify label, corresponding time slot sign position Flag is just set as 0, other
Flag is just set as -1 by situation.
The case where S7 reader is according to label institute reserving time slots, it is each by ordering Reslot (slots) to be sent to
Label allows label to be also able to know that the case where other labels select time slot, then adjusts corresponding time slot.Member inside slots
Element is exactly the mark value that time slot scanning in front is recorded in the process, and label adjusts corresponding selected according to this array
Timeslot number.
S8. the selection situation for being had been known for each time slot in a upper stage due to reader, is directly divided in cognitive phase
With effective time slot.Following reader sends Collection order, and label receives after this orders, just according to adjustment after
Time slot successively to reader send data.
S9. reader sends Count () order, and the time slot counter of each label in the group is allowed to subtract 1
S10. last reader sends Sleep () order, and the label being correctly read in this wheel query process is just
Silent status can be entered, that is, be not involved in next inquiry.
S11 is after each round end of identification, then estimates the number of remaining unidentified label, if number of tags is not 0,
S9 above, two steps of S10 are repeated, until the remaining label of the group has all been identified.
S12 group # adds 1, i.e. then t=t+1 executes following one of two things.
If t≤g, then it represents that there is the group not identified, then the s5 that gos to step continues next group of identification.Such as
Fruit t > g, i.e., all groups all identify completion, end of identification.
The order in the present embodiment is illustrated below:
Query (Q) order is to collide the order of time slot scanning, and parameter Q therein is the timeslot number of frame.Label is at this Q
A time slot is randomly selected in time slot, and is loaded into counter, while returning to reserving time slots number k to reader, then basis
Selected time slot is delayed accordingly.
Reslot (slots) order, which is reader according to during colliding time slot scanning, by the choosing of time slot
It selects situation and is sent to each label, wherein slots is an array.0 is labeled as if time slot can completely be read, instead
Be then denoted as -1, label receives the order and then carries out time slot adjustment.
Collection () order, the order are to read the order of label information.After label receives this order, meeting
According to the time slot updated in the previous command, the data of itself are finally sent to reader again by Latency response time.
Count () order, the effect of the order is that label time slot counter is allowed to subtract 1, and the label that counter is 0, which responds, to be read
Device.
Sleep () order, the effect of the order is that label is allowed temporarily to be in silent status, it is made to be not involved in subsequent look into
It askes.
Below to being illustrated the step of Vogt algorithm estimation label quantity in the present embodiment
It is M for frame length, total number of labels mesh to be identified is the RFID system of n, available using Chebyshev inequality:
(Te, Ts, Tc) respectively indicate generated free timeslot number in an identification process, success timeslot number and collision
Timeslot number.(T'e, T 's, T 'c) respectively indicate be identification one wheel complete after caused by free timeslot, success time slot and
Collide the desired value of time slot.
Since the probability of time slot any in some one frame of tag responses can be expressed as:
The same time slot has the probability of m label that can indicate again are as follows:
Probability without request identification label in the same time slot are as follows:
So there is and only having the probability of some label transfer request command in same time slot:
And can release in same time slot there are two and the above label transfer request command probability:
Pc=1-Pe-Ps (6)
Then all time slots are all inquired after completion in frame, T 'e, T 's, T 'cIt can be expressed as:
T′c=M*Pc=M-T 'e-T′e (7)
Formula (7) are substituted into formula (1), taking n value when making vector space distance ε minimum is the number of tags estimated.
Signified formula 7 of the invention includes T 'e、T′s、T′cThree formula.
The throughput S of RFID system refers to the number of tags of reader Successful transmissions information within the time of an identification frame length
Ratio shared by mesh, it may be assumed that
The selection of optimal frame length in the present embodiment is illustrated below.
In FSA algorithm, when number of tags is equal with frame length, system can reach maximum throughput, but system is touched
It hits rate also to increase immediately, and if number of labels will be difficult to the attainable frame length maximum value of system collision problem mutually far short of what is expected
It solves.Grouping thought is optimized in this algorithm, the throughput of Lai Tigao system.
Determine optimal frame length, first to formula (8) derivation:
Enabling above formula result is 0, and reaching frame length M and label number n should meet:
Again by Taylor series expansion, then obtain:
When number of tags n is much larger than 1, and n is close to frame length M, the throughput of system reaches maximum.Fig. 1 is different solid
The simulation result of system throughput when definite value.
According to formula (8), the number of the label at the throughput intersections of complex curve of adjacent fixed frame length M1 and M2, as adjustment frame
Long critical point.
WhereinDownward rounding operation is indicated, so that the corresponding relationship of number of tags n and frame length M have been obtained, such as 1 institute of table
Show.The size that frame length is determined by the value range of number of tags, when number of tags is greater than 355, still with maximum frame length 256 difference
It is identified.
1 label number of table table corresponding with frame length selection
Present invention grouping principle is illustrated below.
Due to being limited by label cost, so that frame slot number can not ad infinitum increase with the increase of number of tags
Add, so the case where being directed to a large amount of label can just be such that system keeps only by limiting the number of the label of every secondary response
Relatively high throughput.According to formula (8), 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 substitution above formula can be obtained:
That is n=354 is the critical value that label is divided into one group or two groups, in order to make system keep higher throughput effect
Rate, unidentified number of tags n cannot be greater than 354, when n is greater than 354, need to be grouped unidentified label.It can be counted by formula
Calculation obtains packet count of the number of labels within 1420, as shown in table 2.
The selection of table 2 label number and labeled packet number
Finally, it should be noted that the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although
Present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: it is still
Technical solution documented by foregoing embodiments is modified, or is equally replaced to some or all of the technical features
It changes；And these are modified or replaceed, the model for technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution
It encloses, should all cover within the scope of the claims and the description of the invention.
Claims (4)
1. a kind of optimization Dynamic Packet collision-proof method based on frame slot, which is characterized in that include the following steps,
S1 estimates the number n of label to be identified；
For S2 when number of tags is less than the first preset value, the length M of adjustment identification frame is simultaneously directly entered step S5, when n is greater than the
When one preset value, label is grouped and obtains packet count g；
S3 is assigned as group # to one several i of random selection between g 1 and records the number of tags data of the group；
The number t that S4 initializes current identification group is 1, is identified since current identification group；
S5 reader sends collision time slot scanning order to each label with the shape broadcasted, and each label receives after the order to reading
Device returns to the timeslot number respectively reserved；
Data judge whether time slot can successfully identify to S6 reader based on the received, by it if it can successfully identify label
Time slot sign position Flag is set as 0, its time slot flag bit Flag is set as -1 if it cannot successfully identify label；
The selection data of time slot are sent to each label, each label obtains according to the data of label reserving time slots by S7 reader
The time slot of its own is adjusted after taking other labels to select time slot data；
S8 reads label information order since reader is sent, and label receives the reading label information order later according to adjustment
Time slot afterwards successively sends data to reader；
S9 reader sends the order that subtracts 1 of label time slot counter, and the time slot counter of each label in the group is allowed to subtract 1；
S10 reader, which sends the order of label silence, makes the label being correctly read in this wheel query process enter silent status
It is set to be not involved in subsequent inquiry；
After each round end of identification, the number of the remaining unidentified label of estimation repeats S11 if number of tags is not 0
Two steps of face s9 and s10, until the remaining label of the group has all identified；
After S12 is to group # t execution plus 1 operation, the S5 that gos to step if t≤g carries out next group of identification, if t > g knows
Do not terminate.
2. a kind of optimization Dynamic Packet collision-proof method of time slot as described in claim 1, which is characterized in that estimation is to be identified
The number n of label the following steps are included:
It is M for frame length, total number of labels mesh to be identified is the RFID system of n, it is obtained using Chebyshev inequality:
(Te, Ts, Tc) respectively indicate generated free timeslot number in an identification process, success timeslot number and
Collide timeslot number；(T'e, T 's, T 'c) respectively indicate be after one wheel of identification is completed caused by free timeslot, successfully
Time slot and the desired value for colliding time slot；
The probability of any time slot is expressed as in some one frame of tag responses:
The same time slot has the probability of m label that can indicate are as follows:
Probability without request identification label in the same time slot are as follows:
There is and only have the probability of some label transfer request command in same time slot are as follows:
In same time slot there are two and the above label transfer request command probability:
Pc=1-Pe-Ps (6)
All time slots are all inquired after completion in frame, T 'e, T 's, T 'cIt can be expressed as:
Tc'=M*Pc=M-Te′-Ts′ (7)
Formula (7) are substituted into formula (1), the number of tags for taking n value when making vector space distance ε minimum to estimate.
3. a kind of optimization Dynamic Packet collision-proof method of time slot as described in claim 1, which is characterized in that the adjustment is known
The length M obtaining step of other frame are as follows:
Frame length M takes 4 if number of tags n is 1 to 5；
Frame length M takes 8 if number of tags n is 6 to 11；
Frame length M takes 16 if number of tags n is 12 to 21；
Frame length M takes 32 if number of tags n is 22 to 44；
Frame length M takes 64 if number of tags n is 45 to 89；
Frame length M takes 128 if number of tags n is 90 to 177；
Frame length M takes 256 if number of tags n is 178 to 354；
Frame length M takes 256 if being greater than 354 if number of tags n.
4. a kind of optimization Dynamic Packet collision-proof method of time slot as described in claim 1, which is characterized in that
Label is grouped and obtains packet count g obtaining step and is
If number of tags takes 1 less than 354 packet counts；
Packet count takes 2 if number of tags is 354 to 709；
Packet count takes 4 if number of tags is 710 to 1420.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811553053.0A CN109635611A (en) | 2018-12-19 | 2018-12-19 | A kind of optimization Dynamic Packet collision-proof method based on frame slot |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811553053.0A CN109635611A (en) | 2018-12-19 | 2018-12-19 | A kind of optimization Dynamic Packet collision-proof method based on frame slot |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109635611A true CN109635611A (en) | 2019-04-16 |
Family
ID=66075328
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811553053.0A Pending CN109635611A (en) | 2018-12-19 | 2018-12-19 | A kind of optimization Dynamic Packet collision-proof method based on frame slot |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109635611A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110135208A (en) * | 2019-04-30 | 2019-08-16 | 西北工业大学 | A kind of RFID label tag collision-proof method estimated based on grouped frequency and label |
| CN110309686A (en) * | 2019-07-12 | 2019-10-08 | 长春工业大学 | It is a kind of based on etc. region divisions RFID anti-collision algorithm |
| CN110807341A (en) * | 2019-10-31 | 2020-02-18 | 江苏湛德医疗用品有限公司 | Self-adaptive signal collision prevention tag, tag positioning method and system |
| CN112257476A (en) * | 2020-09-30 | 2021-01-22 | 中国航天系统科学与工程研究院 | Hybrid RFID label anti-collision method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104657693A (en) * | 2015-02-26 | 2015-05-27 | 江西理工大学 | RFID (radio frequency identification) anti-collision method based on GASS (grouped adaptive allocating slots) |
| CN104881693A (en) * | 2015-05-04 | 2015-09-02 | 电子科技大学 | Dynamic frame slot ALOHA anticollision algorithm based on subframe observation |
-
2018
- 2018-12-19 CN CN201811553053.0A patent/CN109635611A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104657693A (en) * | 2015-02-26 | 2015-05-27 | 江西理工大学 | RFID (radio frequency identification) anti-collision method based on GASS (grouped adaptive allocating slots) |
| CN104881693A (en) * | 2015-05-04 | 2015-09-02 | 电子科技大学 | Dynamic frame slot ALOHA anticollision algorithm based on subframe observation |
Non-Patent Citations (1)
| Title |
|---|
| 江建: "RFID中多标签防碰撞技术的研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110135208A (en) * | 2019-04-30 | 2019-08-16 | 西北工业大学 | A kind of RFID label tag collision-proof method estimated based on grouped frequency and label |
| CN110309686A (en) * | 2019-07-12 | 2019-10-08 | 长春工业大学 | It is a kind of based on etc. region divisions RFID anti-collision algorithm |
| CN110309686B (en) * | 2019-07-12 | 2023-05-23 | 长春工业大学 | RFID anti-collision method based on equal area division |
| CN110807341A (en) * | 2019-10-31 | 2020-02-18 | 江苏湛德医疗用品有限公司 | Self-adaptive signal collision prevention tag, tag positioning method and system |
| CN110807341B (en) * | 2019-10-31 | 2022-09-16 | 江苏湛德医疗用品有限公司 | Self-adaptive signal collision prevention tag, tag positioning method and system |
| CN112257476A (en) * | 2020-09-30 | 2021-01-22 | 中国航天系统科学与工程研究院 | Hybrid RFID label anti-collision method |
| CN112257476B (en) * | 2020-09-30 | 2023-04-14 | 中国航天系统科学与工程研究院 | Hybrid RFID label anti-collision method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109635611A (en) | A kind of optimization Dynamic Packet collision-proof method based on frame slot | |
| KR100848354B1 (en) | System for Tag Estimation and Anti-collision, and Method Thereof | |
| Lin et al. | Efficient estimation and collision-group-based anticollision algorithms for dynamic frame-slotted ALOHA in RFID networks | |
| CN108491908B (en) | Visual intelligent warehousing system and method based on radio frequency identification | |
| CN109446869B (en) | Anti-collision method and device for RFID system, computer readable storage medium and equipment | |
| Liu et al. | Fast counting the key tags in anonymous RFID systems | |
| KR101129832B1 (en) | Estimation of the cardinality of a set of wireless devices | |
| CN104573593B (en) | A kind of deficient based on frame slot determines blind separation RFID anti-collision method | |
| 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 | |
| Park et al. | Identification of RFID tags in framed-slotted ALOHA with tag estimation and binary splitting | |
| KR100829794B1 (en) | Method of identifying radio frequency tag in rfid system | |
| CN112446448B (en) | Method for identifying RFID (radio frequency identification) label by single reader combining DFSA (distributed feedback system) and binary algorithm | |
| Ahmed et al. | Time aware closed form frame slotted ALOHA frame length optimization | |
| Shakiba et al. | Cubic spline-based tag estimation method in RFID multi-tags identification process | |
| CN104063627A (en) | Optimal Q parameter determining method and device | |
| Alotaibi et al. | Tag anti-collision algorithms in RFID systems-a new trend | |
| Chen | An RFID anti-collision Q-value algorithm research | |
| Hakeem et al. | Novel modulo based Aloha anti-collision algorithm for RFID systems | |
| Liu et al. | A fast and stable anti-collision algorithm for the EPCglobal UHF Class 1 Generation 2 standard | |
| Li et al. | A Improved Frame Slotted Aloha Protocol with Early End in Mobile RFID Systems | |
| CN115618908B (en) | Article turnover checking method, device and system based on RFID | |
| CN107590408A (en) | ALOHA collision-proof methods based on binary system hash | |
| CN111860009B (en) | Enhanced binary grouping RFID anti-collision method and system | |
| CN102360415B (en) | Radio frequency identifier sorting method and radio frequency identification system |
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 |
Application publication date: 20190416 |
|
| RJ01 | Rejection of invention patent application after publication |