CN101393594B - Multi-label anticollision method based on packet dynamic frame and binary tree search for RFID system - Google Patents
Multi-label anticollision method based on packet dynamic frame and binary tree search for RFID system Download PDFInfo
- Publication number
- CN101393594B CN101393594B CN2008102186118A CN200810218611A CN101393594B CN 101393594 B CN101393594 B CN 101393594B CN 2008102186118 A CN2008102186118 A CN 2008102186118A CN 200810218611 A CN200810218611 A CN 200810218611A CN 101393594 B CN101393594 B CN 101393594B
- Authority
- CN
- China
- Prior art keywords
- label
- time slot
- write line
- read write
- labels
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a method for preventing collisions among a plurality of tags based on grouping dynamic frame and binary tree search in an RFID system. The method comprises a tag quantity estimation stage and a tag identification stage, wherein the tag quantity estimation stage is to finish the estimation of the quantity of unidentified tags; the tag identification stage is to select the optimal grouping number and the optimal frame size of each group according to the estimated value of the quantity of the unidentified tags, distribute the tags into a plurality of groups of frame periods for identifications in turn, and identify the tags in each group of time slots where collisions happen through the binary tree search so as to identify all the tags. The method combines the advantages of an ALOHA algorithm and a binary tree algorithm so that the quantities of collision time slots at the early stage of the identification and idle time slots at the late stage of the identification are greatly reduced, and the method has the advantages of simple structure, fast identifying speed and low tag power consumption, thus the method is quite suitable to be applied in the RFID system.
Description
Technical field
The present invention relates to a kind of collision-proof method that is applied in radio-frequency (RF) identification (RFID) system, relate in particular to the multi-label anti-collision method based on packet dynamic frame and binary tree search of a kind of RIFD of being used for system.
Background technology
Radio-frequency (RF) identification (Radio Frequency Identification, RFID) be a kind ofly have in real time, fast, the accurate automatic identification technology of characteristics such as collection.Rfid system is made up of read write line, label and application program three parts, adopts the noncontact mode to communicate by letter between read write line and the label.Label has initiatively, half initiatively and passive three kinds, wherein passive label is because it is simple in structure, cost is lower, thereby is widely used.
The read write line because the simplicity of passive label construction, label can make an immediate response after receiving the read write line instruction.But when a plurality of labels responded certain read write line simultaneously, the phase mutual interference meeting between label data caused read write line can't normally read any one label data, and so-called label collision promptly takes place.Traditional label anti-collision algorithm can be divided into ALOHA algorithm and tree algorithm two big classes.The complexity of ALOHA algorithm is less, and tree algorithm is then relatively large.All there is problem separately in these two kinds of algorithms: though ALOHA algorithm complexity and lower to the requirement of label, but the possibility that exists label can't discern all the time, and the performance of algorithm is not good when number of labels is huge, and this is that the figure place owing to the label internal register is limited causing; The advantage of tree algorithm is that discrimination can reach 100%, but is cost with the complexity that increases algorithm, but this has increased the read write line power consumption and has reduced label maximum decipherment distance.In addition, these two kinds of algorithms also all exist the phenomenon of time slot waste: there is a large amount of idle time slot waste in the ALOHA algorithm in the identifying later stage, and this is because frame length or packet count can not cause in identifying in the identification adjustment in real time along with label; It is more that tree algorithm causes colliding time slot in identifying early stage because of the label that responds read write line simultaneously is more, and that the performance of query tree algorithm wherein also is subjected to the influence of label ID distribution situation is bigger.
Summary of the invention
The purpose of this invention is to provide a kind of multi-label anti-collision method that is used for rfid system based on packet dynamic frame and binary tree search, the collision frequency that this method can effectively avoid label data to take place, and reduce recognition time and power consumption largely.
For reaching above-mentioned purpose, the present invention is achieved by taking following technical scheme:
A kind of multi-label anti-collision method based on packet dynamic frame and binary tree search that is used for rfid system comprises the steps:
(1) read write line is estimated unidentified number of labels, and calculate optimum packet count and optimum frame length under this number of labels: at first, read write line is provided with initial packet and initial frame length, label is assigned in set some groups at random, and every group frame length is set length (being the number of timeslots that comprises in frame period of every group); Then, read write line is successively with the time slot poll in all packet frames cycles one time, and the quantity of adding up idle time slot, single label time slot and collision time slot, estimates unidentified number of tags in view of the above, and calculates optimum packet count and optimum frame length under this number of labels;
(2) read write line is that parameter begins new round poll with optimum packet count and optimum frame length, successively the label in each time slot in current framing cycle is discerned: read write line divides into groups unidentified label random packet again by optimum, every group frame period length is optimum frame length, behind the beginning poll, read write line is judged each time slot state, if idle time slot, then directly enter next time slot, if single label time slot is then discerned this label, enter next time slot then, if collision time slot, then adopt binary tree search to identify all labels in this collision time slot, enter next time slot then, up to current framing end cycle;
(3) read write line successively decreases 1 with optimum packet count, and begins new round poll with the optimum packet count after optimum frame length and the renewal, successively the label in each time slot in current framing cycle is discerned, and is decremented to 0 up to optimum packet count.
The detailed process that optimum packet count under this number of labels that label described in the step (1) calculates after by read write line unidentified number of labels being estimated is divided into groups is: read write line is inserted into modify instruction with set packet count, set frame length and a random number, and send to label, after receiving this instruction, label produces a new random number according to random number in this instruction and label ID, and get surplus to the packet count in the instruction it, having only remainder is that 0 label is just movable in current group frame period, thereby realizes the grouping of label; Label also produces a positive integer that is not more than this frame length as time slot storage under the label at random according to the set frame length in this instruction, and when only being polled to this time slot, this label just allows to respond read write line.
The detailed process of the estimation of the unidentified number of labels described in the step (1) is: calculate under current frame length, the different number of labels, the expectation value of the timeslot number of empty slot number, single label and collision timeslot number, unidentified number of tags when the number of labels with corresponding statistical value when nearest is considered to identifying and begins, deducting single label time slot counting is current unidentified number of tags.
The detailed process of optimum packet count of calculating described in the step (1) and optimum frame length is: when unidentified number of labels is not more than maximum frame length, frame length is set equals unidentified number of labels, and packet count is set is 1; When unidentified number of labels during greater than maximum frame length, labeled packet and every framing length are equaled maximum frame length, wherein packet count is taked the changing mode that doubles or reduce by half, and by k=n
k/ 354 decisions, wherein packet count k gets the integer greater than 0, n
kThe upper limit for the number of labels under this packet count.
The key step of the binary tree search identification in the collision time slot described in the step (2) is:
1) read write line sends the C instruction, and this instruction has comprised the number of plies register value of read write line;
2) read write line is judged number of plies register value, if less than 0, shows that all labels of this binary tree all are identified, then withdraws from this subroutine, if more than or equal to 0, then waits for the label answer;
3) at a time in the crack, the label that read write line receives is replied data following three kinds of situations: if no signal then subtracts 1 with read write line middle level number register value, and send the I instruction, change step 2 over to); If it is effective to reply data, then at this label of identification, and with its state be made as discern after, read write line middle level number register value is subtracted 1, and send the I instruction, change step 2 over to); If it is invalid to reply data, then read write line middle level number register value is added 1, change step 1) over to.
Compared with prior art, the present invention has following advantage and beneficial effect:
(1) proposes first label is divided into fractions batch identification.The present invention divides into groups to label earlier before identification label, is an independently identifying in every group, has improved the system performance when number of labels is huge under the constant prerequisite of frame length.
(2) propose first to embed the identification that the binary tree search algorithm is finished collision labels in this time slot in the time slot inside that bumps.When the present invention bumps in current time slots, call the binary tree search algorithm immediately and finish identification, and then enter next time slot all collision labels in this time slot.The advantage of doing like this is: make discrimination reach 100% under the prerequisite of assurance low complex degree, do not need read write line at current framing extra new frame period of reallocation of all collision labels in the cycle, reduced the collision timeslot number and the idle timeslot number in identification later stage at identification initial stage simultaneously.
(3) the present invention makes full use of the internal memory and the computing power of read write line, described rfid system to label require low, only needing set up in label move to right one ball bearing made using and is used for realizing dividing into groups with door, set up one deck number register and be used to realize binary tree search identification, and if described number of plies register is the N position, the theoretical value that then can discern the number of labels in this collision time slot is
A current time slots register then need be set, an optimum frame length register, a current group register in the read write line, a collision number of plies register, an idle time slot register, a single label time slot register, a collision time slot register, simple in structure, be easy to implement.
(4) improve system throughput, shorten recognition time.Owing to adopted labeled packet and the inner binary tree search that adopts of collision time slot are discerned, reduced the collision timeslot number and the idle timeslot number in identification later stage at identification initial stage, improved system throughput, shortened recognition time.
(5) reduce the label power consumption.Because preceding m position (m is much smaller than label ID figure place) the response read write line that label at first sends its ID is set, just send complete label ID once more after receiving the affirmation information of read write line, greatly reduced the power consumption of label.
On the whole, the present invention combines the advantage of ALOHA algorithm and binary tree algorithm, the collision time slot and the idle number of timeslots of discerning the later stage at identification initial stage have been reduced by strategies such as binary tree search identifications in identification of employing labeled packet and the collision time slot, simple in structure, recognition speed is fast, label is low in energy consumption, be fit to very much be applied in the rfid system.
Description of drawings
Fig. 1 is the inventive method implementation synoptic diagram.
Fig. 2 discerns the process flow diagram of all labels for read write line.
Fig. 3 is an Estimation subroutine synoptic diagram.
Fig. 4 is a BinarySelection subroutine synoptic diagram.
Fig. 5 is label response read write line modify instruction synoptic diagram.
Fig. 6 is label response read write line C instruction synoptic diagram.
Fig. 7 is label response read write line I instruction synoptic diagram.
Embodiment
The present invention is described in further detail below in conjunction with the drawings and specific embodiments.
(1) read write line is discerned the flow process of all labels
As shown in Figure 2, at first, set packet count initial value and frame length initial value, set the packet count initial value here and be 1, the frame length initial value is 64 according to the needs of concrete application.According to above setting, read write line is provided with frame length count value counter=64, current group of number register group=1, and the idle time slot register of zero clearing, single label time slot register and collision time slot register.Read write line sends modify instruction subsequently, has comprised a random number of packet count, frame length and the read write line generation of above setting in this instruction, and sends I instruction beginning current frame period, waits for the label answer then.
In the crack, the label that read write line receives is replied data following three kinds of situations at a time: if no signal shows no label answer, then with idle time slot counting c
0Add 1; If it is invalid to reply data, showing has collision to take place, and then will collide time slot counting c
kAdd 1; If it is effective to reply data, showing has single label to reply, then with single label time slot counting c
1Add 1, and discern this label.
Read write line time slot register value subtracts 1 certainly, and judges whether it is 0, if be not 0, then read write line sends the I instruction and enters next time slot, and waits for the label answer.If read write line time slot register value is 0, think that then current frame period finishes, judge collision time slot counting c
kWhether be 0, if 0, think that then all labels all are identified, the end entire identification process if be not 0, then called the Estimation subroutine and is estimated current unidentified number of tags, and calculates optimum packet count G and optimum frame length L under this number of labels.
Read write line is provided with current time slots register counter=L, and current group register group=G is set, and stores optimum frame length L to optimum frame length register, and then read write line sends modify instruction and I instruction, and the wait label is replied.
In the crack, the label that read write line receives is replied data following three kinds of situations at a time: if no signal, then read write line does not have operation; If it is effective to reply data, then read write line is discerned this label; If it is invalid to reply data, then read write line calls the BinarySelection subroutine and finishes binary tree search identification to all collision labels in this time slot.
Read write line time slot register value subtracts 1 certainly, and judges whether it is 0, if be not 0, then read write line sends the I instruction and enters next time slot, and waits for the label answer.If read write line time slot register value is 0, think that then current group frame period finishes, read write line current group register value is successively decreased, and judge whether it is 0, if be not 0, the current group register value insertion modify instruction of read write line and after upgrading with optimum frame length register value, and send, wait for the label answer then, if 0, the frame period that then shows all groupings all finishes, then finishes entire identification process.
(2) estimation of unidentified number of labels and optimum packet count and optimum frame length chooses
This partial function realized by the Estimation subroutine, the idle count c that obtains according to statistics
0, collision time slot counting c
kAnd single label time slot counting c
1Estimate unidentified number of tags, and calculate optimum packet count and optimum frame length under this number of labels.Its process flow diagram is seen shown in Figure 3.
1) estimates unidentified number of tags
Owing to will directly have influence on thereafter labeled packet number and the determining of frame length to unidentified number of labels accuracy of estimation, and then have influence on the performance index of total system.The definition vector
The timeslot number of the empty slot number of expression statistics respectively, single label and collision timeslot number; Definition
The expectation value of representing the timeslot number and the collision timeslot number of empty slot number, single label respectively.By Chebyshev inequality, the random test result of stochastic variable X always drops near its expectation value, so when vector
With
Reaching apart from ε, the value of hour n can be counted as the number of labels best estimate.
In the formula (1), L, n represent frame length and number of tags respectively, and it is that available following formula obtains that the expectation value of the timeslot number that r label occupy is then arranged:
In the process of search ε minimum value, determine that the span of n is [c
1+ 2c
k, 2 (c
1+ 2c
k)].This is because c is arranged
1Individual single label time slot and c
kAt least there is c in the middle of the system of individual collision time slot
1+ 2c
kIndividual label, promptly the lower limit of n should be c
1+ 2c
kThe upper limit is then determined by Simulation results.
After obtaining ε n hour, it is deducted c
1Just obtain current unidentified number of tags.
2) optimum packet count and optimum frame length chooses
System's maximum throughput rate obtains when frame length equates with unidentified number of tags satisfying, therefore adopt following packet count and frame length to choose strategy: it is 256 time slots that maximum frame length is set, when unidentified number of labels when to be not more than maximum frame length be n≤256, frame length is set equals unidentified number of labels, and packet count is set is 1; When n＞256, labeled packet and every framing length are 256.Considering the multiplication of packet count or reduce by half can be by the data simple realization that moves to left or move to right, so packet count is taked the changing mode that doubles or reduce by half, then packet count is determined by following formula:
The implication of following formula is: along with the increase of number of labels, when the system effectiveness when packet count is k drops to system effectiveness when being 2k with packet count and equates, then in the next read cycle packet count is doubled.Number of labels n in the time of can obtaining packet count by k → 2k thus
kFor:
n
k＝354k (k＝1，2，...) (4)
(3) the binary tree search identification in the collision time slot
This part realizes that by the BinarySelection subroutine its process flow diagram is seen shown in Figure 4, and key step is:
1) read write line sends the C instruction, and this instruction has comprised the number of plies register value of read write line.
2) read write line is judged number of plies register value, if less than 0, shows that all labels of this binary tree all are identified, then withdraws from this subroutine, if more than or equal to 0, then waits for the label answer.
3) at a time in the crack, the label that read write line receives is replied data following three kinds of situations: if no signal then subtracts 1 with read write line middle level number register value, and send the I instruction, and change 2 over to); If it is effective to reply data, then at this label of identification, and with its state be made as discern after, read write line middle level number register value is subtracted 1, and send the I instruction, change 2 over to); If it is invalid to reply data, then read write line middle level number register value is added 1, change 1 over to).
The process of the binary tree search identification in the above-mentioned collision time slot is comparatively complicated, here be illustrated in conjunction with Fig. 1: the 1st group i+6 time slot is the collision time slot among Fig. 1, read write line will be taked splitting operation to three labels of its inside, label is selected 0 or 1 increment at random with time slot register separately, here there is 1 label to select 0, and other 2 selections all is 1, and number of plies register value is separately become 1, and the expression label is in the 1st layer in this binary tree.Read write line is at first investigated left child's node that 0 increment is selected in expression, and therefore this inter-node can successfully be identified because 1 label is only arranged.Then, read write line turns to expression to select the right child's node of 1 increment.Because two label time slot register values in right child's node are still identical, the label collision still exists, therefore read write line will be to these two labels splitting operation once more, this time two labels have selected 0 simultaneously, promptly dropped on simultaneously in left child's node of current node, and number of plies register value becomes 2 separately.Read write line is still at first investigated left child's node of current node, finds still to exist the label collision, so splitting operation for the third time, these two labels have selected 0 and 1 respectively specifically, and its number of plies Counter Value becomes 3, so read write line can successfully be discerned it successively.Then, read write line turns back to promptly the 2nd layer of last layer, continues the label in the right child's node of this layer of identification, finds to turn back to promptly the 1st layer of last layer once more behind the no label, what identification was finished in discovery is right child's node of this layer, so finish the identification to this collision time slot.Among Fig. 1, φ represents no label response in the time slot, the quantity of the interior respective labels of quantitaes time slot.With Fig. 1 is example, and its i time slot of the 1st group is an empty slot, and i+1 time slot is single label time slot, so read write line all can be finished the identification of these two time slots.I+2 time slot is the collision time slot that two labels are arranged, and therefore need collide time slot inside at this adopts the binary tree recursive procedure again.
(4) label responds the flow process of different read write line instructions
The instruction that read write line sends has three kinds: modify instruction, C instruction and I instruction.Modify instruction is used for label by set packet count random packet with produce time slot under the label at random; C instruction be used for the label that will bump will the time slot register value add 0 or 1 at random, the time slot register of the label that do not bump is added 1; The time slot register value that the I instruction is used for the label that all are movable subtracts 1, promptly enters next time slot.
1) flow process of label response read write line modify instruction
As shown in Figure 5, after label receives the read write line modify instruction, produce a new random number, and get surplus to the packet count in the instruction it according to random number in this instruction and label ID, having only remainder is that 0 label just can be movable in current group frame period, has so just realized the grouping of label; Label also select at random in the frame length scope in this instruction a positive integer as label under time slot, and deposit in the time slot register of label.After finishing above operation, label is waited for next read write line instruction.
2) flow process of label response read write line C instruction
As shown in Figure 6, after label receives read write line C instruction, the number of plies register value of the read write line in this instruction and the number of plies register value of label are compared, if equate, show that then this label is in the current collision node of binary tree, then label time slot register value is added 0 or 1 at random, and label layer number register value is added 1, this operation is assigned randomly to label in two child's nodes of current binary tree node; If unequal, illustrate that then this label is in other nodes of binary tree, only its time slot register value is added 1, time slot register is subtracted 1 operation with every other label after offsetting label of correct identification.After finishing above operation, label is waited for next read write line instruction.
3) flow process of label response read write line I instruction
As shown in Figure 7, after label receives read write line I instruction, label time slot register value is successively decreased 1, if 0, then respond read write line, concrete operations are: label sends the preceding m bit test current time slots state of ID earlier, if read write line successfully receives this detecting information, show that current time slots only has this label response read write line, then read write line is beamed back feedback information, label receives and sends complete id information after this information, and tag state is set to discern, and after this label will no longer respond any read write line instruction.If label time slot register value is not 0, show not to be polled to the affiliated time slot of this label that then label is waited for next read write line instruction.
Claims (1)
1. the multi-label anti-collision method based on packet dynamic frame and binary tree search that is used for rfid system is characterized in that comprising the steps:
(1) read write line is estimated unidentified number of labels, and calculate optimum packet count and optimum frame length under this number of labels: at first, read write line is provided with initial packet and initial frame length, and label is assigned in set some groups at random, and every group frame length is set length; Then, read write line is successively with the time slot poll in all packet frames cycles one time, and the quantity of adding up idle time slot, single label time slot and collision time slot, estimates unidentified number of tags in view of the above, and calculates optimum packet count and optimum frame length under this number of labels;
(2) read write line is that parameter begins new round poll with optimum packet count and optimum frame length, successively the label in each time slot in current framing cycle is discerned: read write line divides into groups unidentified label random packet again by optimum, every group frame period length is optimum frame length, behind the beginning poll, read write line is judged each time slot state, if idle time slot, then directly enter next time slot, if single label time slot is then discerned this label, enter next time slot then, if collision time slot, then adopt binary tree search to identify all labels in this collision time slot, enter next time slot then, up to current framing end cycle;
(3) read write line successively decreases 1 with optimum packet count, and begins new round poll with the optimum packet count after optimum frame length and the renewal, successively the label in each time slot in current framing cycle is discerned, and is decremented to 0 up to optimum packet count;
In the above-mentioned steps:
The detailed process that optimum packet count under this number of labels that the described label of step (1) calculates after by read write line unidentified number of labels being estimated is divided into groups is: read write line is inserted into modify instruction with set packet count, set frame length and a random number, and send to label, after receiving this instruction, label produces a new random number according to random number in this instruction and label ID, and get surplus to the packet count in the instruction it, having only remainder is that 0 label is just movable in current group frame period, thereby realizes the grouping of label; Label also produces a positive integer that is not more than this frame length as time slot storage under the label at random according to the set frame length in this instruction, and when only being polled to this time slot, this label just allows to respond read write line;
The detailed process of the estimation of the described unidentified number of labels of step (1) is: calculate under current frame length, the different number of labels, the expectation value of the timeslot number of empty slot number, single label and collision timeslot number, unidentified number of tags when the number of labels with corresponding statistical value when nearest is considered to identifying and begins, deducting single label time slot counting is current unidentified number of tags;
The detailed process of optimum packet count of the described calculating of step (1) and optimum frame length is: when unidentified number of labels is not more than maximum frame length, frame length is set equals unidentified number of labels, and packet count is set is 1; When unidentified number of labels during greater than maximum frame length, labeled packet and every framing length are equaled maximum frame length, wherein packet count is taked the changing mode that doubles or reduce by half, and by k=n
k/ 354 decisions, wherein packet count k gets the integer greater than 0, n
kThe upper limit for the number of labels under this packet count;
The key step of the binary tree search identification in the described collision time slot of step (2) is:
1) read write line sends the C instruction, and this instruction has comprised the number of plies register value of read write line;
2) read write line is judged number of plies register value, if less than 0, shows that all labels of this binary tree all are identified, then withdraws from this subroutine, if more than or equal to 0, then waits for the label answer;
3) at a time in the crack, the label that read write line receives is replied data following three kinds of situations: if no signal then subtracts 1 with read write line middle level number register value, and send the I instruction, change step 2 over to); If it is effective to reply data, then at this label of identification, and with its state be made as discern after, read write line middle level number register value is subtracted 1, and send the I instruction, change step 2 over to); If it is invalid to reply data, then read write line middle level number register value is added 1, change step 1) over to.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008102186118A CN101393594B (en) | 2008-10-24 | 2008-10-24 | Multi-label anticollision method based on packet dynamic frame and binary tree search for RFID system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2008102186118A CN101393594B (en) | 2008-10-24 | 2008-10-24 | Multi-label anticollision method based on packet dynamic frame and binary tree search for RFID system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101393594A CN101393594A (en) | 2009-03-25 |
| CN101393594B true CN101393594B (en) | 2010-06-02 |
Family
ID=40493883
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2008102186118A Expired - Fee Related CN101393594B (en) | 2008-10-24 | 2008-10-24 | Multi-label anticollision method based on packet dynamic frame and binary tree search for RFID system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101393594B (en) |
Families Citing this family (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102024134A (en) * | 2010-10-27 | 2011-04-20 | 北京邮电大学 | High-efficiency multi-tag anti-collision radio frequency identification (RFID) method |
| CN102004895B (en) * | 2010-11-30 | 2012-08-01 | 中国人民解放军国防科学技术大学 | Time slot scanning anti-collision method based on collision precheck |
| CN102024163B (en) * | 2010-12-01 | 2012-09-05 | 中国人民解放军国防科学技术大学 | Anti-collision method with packet previewing mechanism |
| CN102073889B (en) * | 2011-01-14 | 2012-08-01 | 中国人民解放军国防科学技术大学 | Hybrid multi-label anti-collision method |
| CN102073890B (en) * | 2011-01-19 | 2012-08-01 | 中国人民解放军国防科学技术大学 | Label random grouping-based dynamic frame time slot anti-collision method |
| CN102799842B (en) * | 2011-05-25 | 2016-08-24 | 中兴通讯股份有限公司 | Label counting method and system |
| CN102999739B (en) * | 2011-09-16 | 2017-02-08 | 北京邮电大学 | RFID (radio frequency identification) tag and identification method and identification device |
| CN103377356A (en) * | 2012-04-25 | 2013-10-30 | 四川红宇创智信息科技有限责任公司 | RFID anti-conflict identification algorithm |
| CN102999741A (en) * | 2012-11-19 | 2013-03-27 | 浙江工商大学 | ID-BTS tag identification method based on QT protocol |
| CN103020568B (en) * | 2012-12-27 | 2016-04-20 | 南京三宝科技股份有限公司 | Based on the pretreated RFID anti-collision method of label ID |
| CN103268464B (en) * | 2013-05-09 | 2016-09-21 | 清华大学 | Rapid batch radio-frequency (RF) tag number estimation method and device |
| CN103324856B (en) * | 2013-07-01 | 2017-02-08 | 华南理工大学 | Method for quickly estimating number of RFID (radio frequency identification) tags |
| CN104200246B (en) * | 2014-08-13 | 2017-10-17 | 北京邮电大学 | It is grouped N fork tracking tree-shaped RFID anti-collision algorithms |
| CN104200182B (en) * | 2014-08-25 | 2017-03-15 | 重庆邮电大学 | A kind of label anti-collision method based on binary system splay tree |
| CN104680104A (en) * | 2014-12-15 | 2015-06-03 | 天津工业大学 | Dynamic efficient RFID (Radio Frequency Identification Device) tag identification mechanism |
| CN105354522B (en) * | 2015-09-22 | 2018-05-25 | 天津工业大学 | A kind of radio-frequency recognition system tag recognition process optimization algorithm based on queuing theory |
| CN106934311A (en) * | 2015-12-29 | 2017-07-07 | 常州浅湾电子科技有限公司 | A kind of method that efficient RFID label tag histogram is collected |
| CN108416241A (en) * | 2018-03-08 | 2018-08-17 | 成都航空职业技术学院 | A kind of double time slot RFID anti-collision algorithms based on search tree |
| CN109409150B (en) * | 2018-09-17 | 2020-09-25 | 北京科技大学 | Method and device for reading label, storage medium and processor |
| CN109446864A (en) * | 2018-12-11 | 2019-03-08 | 深圳市联智物联网科技有限公司 | A kind of system for realizing quick counting wireless terminal |
| CN111401091B (en) * | 2020-03-18 | 2021-07-13 | 中山大学 | RFID reader anti-collision method considering neighbor detection |
| CN114330393B (en) * | 2021-12-29 | 2023-07-18 | 中山大学 | Method for identifying lost tag of large RFID system based on balanced collision binary tree |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101231686A (en) * | 2008-02-02 | 2008-07-30 | 湖南大学 | Method for recognizing contrary collision of inquiry tree radio frequency labels of amalgamation database |
-
2008
- 2008-10-24 CN CN2008102186118A patent/CN101393594B/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101231686A (en) * | 2008-02-02 | 2008-07-30 | 湖南大学 | Method for recognizing contrary collision of inquiry tree radio frequency labels of amalgamation database |
Non-Patent Citations (2)
| Title |
|---|
| 余松森,詹宜巨,王志平,唐忠平.跳跃式动态树形反碰撞算法及其分析.计算机工程31 9.2005,31(9),19-20,26. |
| 余松森,詹宜巨,王志平,唐忠平.跳跃式动态树形反碰撞算法及其分析.计算机工程31 9.2005,31(9),19-20,26. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101393594A (en) | 2009-03-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101393594B (en) | Multi-label anticollision method based on packet dynamic frame and binary tree search for RFID system | |
| CN102004895B (en) | Time slot scanning anti-collision method based on collision precheck | |
| US8981909B2 (en) | RFID group selection method | |
| Cheng et al. | Analysis and simulation of RFID anti-collision algorithms | |
| CN102999739B (en) | RFID (radio frequency identification) tag and identification method and identification device | |
| CN103020568B (en) | Based on the pretreated RFID anti-collision method of label ID | |
| Wu et al. | Efficient framed slotted Aloha protocol for RFID tag anticollision | |
| CN101944171A (en) | Multi-tag identification method of RFID reader | |
| CN101840489A (en) | Multi-tag identification anti-collision method based on collision tree | |
| CN103473524A (en) | RFID multi-tag identification method, reader and tags | |
| CN102024163A (en) | Anti-collision method with packet previewing mechanism | |
| Hwang et al. | Improved anti-collision scheme for high speed identification in RFID system | |
| CN109446869A (en) | Collision-proof method, device, computer readable storage medium and the equipment of RFID system | |
| CN101178764B (en) | Regulation means of frame dimension based on frames time slot Aloha algorithm | |
| 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 | |
| Shahzad et al. | Fast and accurate tracking of population dynamics in RFID systems | |
| CN109409150A (en) | Method, apparatus, storage medium and the processor that label is read | |
| CN101297303B (en) | Method of reading data from transponders through a reader, a transponder, and a reader | |
| CN104200246A (en) | Grouping N fork tracking tree RFID (radio frequency identification) anti-collision algorithm | |
| Ahmed et al. | Time aware closed form frame slotted ALOHA frame length optimization | |
| Paek et al. | Multiple reader algorithm for sports timing systems and its application at low frequency bandwidth | |
| Hai et al. | A novel RFID anti-collision algorithm based on binary tree | |
| Geng et al. | An improved dynamic framed slotted ALOHA algorithm for RFID anti-collision | |
| CN109344673A (en) | The loss label Iceberg queries method of extensive grouping RFID system based on SSZE |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100602 Termination date: 20141024 |
|
| EXPY | Termination of patent right or utility model |