CN100589113C - Self-adapting binary tree multi- label collision intermediation method for RFID system - Google Patents
Self-adapting binary tree multi- label collision intermediation method for RFID system Download PDFInfo
- Publication number
- CN100589113C CN100589113C CN200810058716A CN200810058716A CN100589113C CN 100589113 C CN100589113 C CN 100589113C CN 200810058716 A CN200810058716 A CN 200810058716A CN 200810058716 A CN200810058716 A CN 200810058716A CN 100589113 C CN100589113 C CN 100589113C
- Authority
- CN
- China
- Prior art keywords
- label
- attitude
- write line
- read write
- count
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 230000003044 adaptive effect Effects 0.000 claims description 7
- 238000004891 communication Methods 0.000 claims description 7
- 230000005540 biological transmission Effects 0.000 claims description 5
- 230000008569 process Effects 0.000 claims description 5
- 230000004913 activation Effects 0.000 claims description 3
- 230000005672 electromagnetic field Effects 0.000 claims description 3
- 238000003860 storage Methods 0.000 abstract description 15
- 230000008859 change Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 235000003642 hunger Nutrition 0.000 description 2
- 238000004519 manufacturing process Methods 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000010380 label transfer Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Images
Abstract
The invention discloses a self-adaptive binary tree multi-label conflict arbitration method used for a RFID system comprising a reader and at least two labels in the coverage area of the reader. The reader sends out an instruction and the labels execute corresponding operation after receiving the instruction. The labels are provided with four states, i.e. close, ready, ID and data exchanging and can adopt a counter and a random number generator to execute the state shifting according to the present time slot state to realize the binary tree method so as to avoid the conflict between labels. The storage of each label stores a priority number which can determine when the label can be communicated with the reader in a reading circle and the priority number in each reading circle can make self-adaptive adjustment according to the present time slot state so as to reduce conflict and idle time slot. The application of the invention to the RFID multi-label conflict can largely reduce conflictarbitration time and avoid the problems of label reading leakage and unlimited extension of the reading circle.
Description
Technical field
The present invention relates to the conflict arbitration method of a kind of adaptive binary tree, particularly can be used for the method for the multi-label collision arbitration of rfid system.
Background technology
Be that multiple access inserts problem in many labels of RFID and the read write line communication nature, label adopts sharing wireless channel to communicate by letter with read write line, and therefore a plurality of labels are communicated by letter with read write line and certainly led to channel contention, thereby label collision takes place.At present, the referee method of RFID label collision is broadly divided into stochastic pattern and definite type by the system model kind.The ALOHA class is a topmost class in the stochastic pattern, and it is based on theory of probability and time division multiple access (TDMA) principle, and the signal of a plurality of labels is sent in a plurality of time slots or frame.Yet the label in system increases in a large number, and label can't be read out in for a long time, so-called " label is suffered from hunger " occur.What determine that type has representative most is inquiry tree and binary-tree method.In the inquiry tree, the label that a read write line prefix Query Information of transmission and this prefix are complementary is made response.Yet the performance of this method distributes very responsive to label ID, the longest inquiry number of times and the shortest comparing, and difference is very big.Binary tree is decomposed into two subclass at random to all labels that clash, and one is transmission, and another decomposes up to running through all labels repeatedly for waiting for.Though binary tree efficiently solves " label is suffered from hunger " and label ID distributed insensitive, it increases on the arbitration time to some extent.
The branch of the not absolute quality of above method, different environment should use diverse ways.For example, less when number of labels, arbitration time requirement is shorter, and the ALOHA class is first-selected; When label ID number shorter, and when less repeats bits is arranged, should consider the inquiry tree; And that binary tree is suitable for number of tags is more, to the not high occasion of arbitration time requirement.Yet, RFID than the conventional barcode technology use one of more wide reason be its efficiently the group read function, and the group to read function inseparable with conflict arbitration, therefore how in the less time the more conflict label of arbitration should be the primary study content of RFID technology.Big and few occasion of arbitration time is avoided the label skip again and be need not that ID is had specific requirement simultaneously for the number of labels that the conflict arbitration method can be applied to conflict, and ALOHA and inquiry tree method will be no longer suitable, so binary tree is first-selected.
The tradition realization means of binary tree are binary tree conflict arbitration (BTree) methods, the air interface protocol ISO18000-6B of international 860-960MHz has adopted BTree, and time slot at random (RS) method that ISO18000-6C and EPC C1G2 adopt is a kind of improvement to BTree.When the difference of RS and BTree was its initialization, label counting device value was a random number but not 0.The self-adaptation bicameral system is separated (ABS) method also based on binary tree, and this method is seen People's Republic of China's patent document, publication number: CN101069193A, open date: on November 7th, 2007.What ABS was different with BTree and RS is its self-adaptation, and it makes label make the self-adaptation adjustment to reduce the arbitration time according to the conflict situation of self in each read cycle.If the front and back read cycle is with a collection of label, ABS will not exist conflict and empty slot.
Because self-adaptation has superperformance in the minimizing conflict arbitration time, therefore can be used for numerous practical field, when particularly number of tags was very big, for example, commercial distribution often need read a collection of goods label repeatedly to obtain the information of commodity at whole logistics supply chain; Manufacture on the line and need to read repeatedly a collection of parts tag with the information of record product in each production link.Yet adaptive ABS only can reduce the conflict arbitration time under the little situation of label variations, when label variations is big, and arbitration time of ABS even surpassed BTree and RS.Especially, ABS also need predict number of labels, when number of tags be changed to the unknown the time label skip can take place or the read cycle infinitely prolongs, these factors have all greatly limited the application of ABS.
Summary of the invention
Purpose of the present invention provides a kind of multi-label collision referee method that is used for the adaptive binary tree of rfid system just for the shortcoming that overcomes above-mentioned prior art, whether no matter it all have the less arbitration time under the vicissitudinous situation at label, and need not to predict the varied number of label, the unlimited phenomenon that prolongs of label skip or time for reading can not take place, and has obtained adaptive performance preferably.
The objective of the invention is to be achieved through the following technical solutions.
The multi-label collision referee method that is used for the adaptive binary tree of rfid system, the rfid system of this method is made of a read write line and two labels in its coverage at least, read write line is given an order earlier, and label is carried out corresponding operation after receiving order, and concrete grammar is:
1. the shared time rule of process that a read write line and at least two labels in its coverage are carried out a full communication is a read cycle, and a read cycle is made of following four-stage:
A, initial: read write line activates the label in its coverage and sends querying command;
B, transmission ID: label sends its ID to read write line, then carries out the conflict arbitration method if plural label is arranged or do not have label to send ID, otherwise enters data exchange phase;
C, exchanges data: only have a label to send ID to read write line this moment, and read write line returns to successfully order of label, carries out exchanges data with read write line after label receives orders;
D, end: the data of read write line and all labels have all exchanged and have finished;
2. a read write line and at least two labels in its coverage are carried out a shared time of full communication and are divided into several slots, send the state of data, time slot is divided into following three types according to each time slot interior label:
A, empty slot: in this time slot, do not have label ID to send;
B, readable time slot: in this time slot, have and only have a label ID to send;
C, conflict time slot: in this time slot, have the label ID more than two to send;
3. the state of communicating by letter with read write line according to label, each label has following four kinds of states:
A, close closed state: read write line un-activation label or carry out exchanges data with read write line at a read cycle interior label;
B, ready attitude: read write line activates label;
C, ID attitude: label sends its ID to read write line;
D, exchanges data attitude: label and read write line carry out exchanges data;
4. each label all has a counter and a random number transmitter, realizes that with them the method for binary tree is to avoid the conflict between label; Whether counter equals 0 has determined that whether label sends ID to read write line, represents with COUNT; The random number transmitter only produces 0 or 1 random number, represents with RND;
5. all store a priority number in the storer of each label, this priority number has determined when label communicates by letter with read write line in the crack, represents with PN, and the initial p N when dispatching from the factory is random integers; PN all can do the self-adaptation adjustment to reduce conflict and empty slot according to the current time slots state in each read cycle, adjusted PN can be deposited in the storer of label before each read cycle finishes again;
6. carry out the multi-label collision arbitration according to the following steps:
A, when initial, read write line is opened the label in its coverage of radio-frequency electromagnetic field activation;
The initial p N that b, the label that is activated will be stored in storer sends among the COUNT, and label enters ready attitude by closing closed state;
C, when each time slot begins, judge whether the label of ready attitude, if the label of ready attitude is arranged, judge COUNT again, the ready attitude label of COUNT=0 becomes the ID attitude, the ready attitude label of COUNT＞0 still is ready attitude; If the label of no ready attitude, then a read cycle finishes;
D, consider from following two aspects according to the situation of ID attitude label: when the label of no ID attitude, current time slots is an empty slot, and at this moment, oneself subtracts 1 the COUNT of all ready attitude labels and PN, and system enters next time slot; When the label of ID attitude, two or more ID attitude labels need have been judged whether, when if two above ID attitude labels are arranged, then showing has plural label to send its ID to read write line, read write line is given all label one orders, to show that current time slots is the conflict time slot, at this moment, for the COUNT of all ready attitude labels and PN from adding 1, for all ID attitude labels, its RND produces random number 0 or 1, random number is 1 ID attitude label, and COUNT and PN are from adding 1, and random number is 0 ID attitude label, COUNT and PN are constant, and system enters next time slot; If have only an ID attitude label, then have only a label to send its ID to read write line, read write line gives all label one orders to show that current time slots is readable time slot, at this moment, from subtracting 1, transfer the exchanges data attitude to for the COUNT of all ready attitude labels for ID attitude label, after exchanges data finishes, this label deposits the PN that upgrades in storer, transfers the pass closed state then to, and system enters next time slot.
The present invention has the following advantages at least:
1. stamping-out time of conflicting is less than BTree and RS method
What the present invention was different with BTree is to have introduced PN, it has been remembered each label and when has communicated by letter with read write line in a read cycle, and can make the self-adaptation adjustment according to the current time slots type, thus in the next read cycle, reduce conflict and empty slot, therefore also reduced the conflict arbitration time.And the initial value of PN is a random number, and it can also reduce the conflict number of times of label in the first read cycle.Therefore, BTree only is equivalent to that all label PN are 0 special case among the present invention, and RS is equivalent to the special case of the present invention in the first read cycle.
2. the conflict arbitration time is less than ABS
ABS has adopted " distribute number " to finish the function that is similar to PN, and be 0 initial " distribute number " of each label in ABS.When label changed, " distribute number " was 0 because initial, and therefore new label can increase initial collision, the label that leaves simultaneously stays more empty slot again, therefore work as label variations more for a long time, total timeslot number increases greatly, even has surpassed BTree and RS.And the initial collision of some labels has not only been avoided in initial p N Random assignment of the present invention, but also can fill up the empty slot that some stays because label leaves, so the conflict arbitration time is less than ABS.
3. can not produce the unlimited problem that prolongs of label skip and read cycle
ABS needs one " stop number " to finish a read cycle.If the skip phenomenon then takes place less than the number of tags that will discern in " stop number "; Then read cycle will be circulated always and can't be stopped if " stop number " is greater than number of tags; Have only " stop number " to equal number of tags, conflict arbitration could be finished smoothly.Therefore, ABS must know the number of tags that will discern in advance, and when the variation number of label was the unknown, ABS can't operate as normal.Decide communicating by letter of label and read write line and whether the ABTree agreement equals 0 according to COUNT, when the label of COUNT=0 and read write line swap data finish just to enter the pass closed state, if all entering, all labels close then just end of read cycle of closed state, therefore ABTree need not to know label variations quantity, also can not produce the unlimited problem that prolongs of label skip and read cycle.
Further set forth content of the present invention below in conjunction with Figure of description.
Description of drawings
Fig. 1 is the rule schema of label state exchange among the present invention;
Fig. 2 is the process flow diagram according to the invention process RFID label collision referee method;
Fig. 3～Fig. 6 is the synoptic diagram of read write line reading tag in continuous four read cycles.
Embodiment
The rfid system of the inventive method is made of a read write line and two labels in its coverage at least, and read write line is given an order earlier, and label is carried out corresponding operation after receiving order, and concrete grammar is:
1. the shared time rule of process that a read write line and at least two labels in its coverage are carried out a full communication is a read cycle, and a read cycle is made of following four-stage:
A, initial: read write line activates the label in its coverage and sends querying command;
B, transmission ID: label sends its ID to read write line, then carries out the conflict arbitration method if plural label is arranged or do not have label to send ID, otherwise enters data exchange phase;
C, exchanges data: only have a label to send ID to read write line this moment, and read write line returns to successfully order of label, carries out exchanges data with read write line after label receives orders;
D, end: the data of read write line and all labels have all exchanged and have finished;
2. a read write line and at least two labels in its coverage are carried out a shared time of full communication and are divided into several slots, send the state of data, time slot is divided into following three types according to each time slot interior label:
A, empty slot: in this time slot, do not have label ID to send;
B, readable time slot: in this time slot, have and only have a label ID to send;
C, conflict time slot: in this time slot, have the label ID more than two to send;
3. the state of communicating by letter with read write line according to label, each label has following four kinds of states:
A, close closed state: read write line un-activation label or carry out exchanges data with read write line at a read cycle interior label;
B, ready attitude: read write line activates label;
C, ID attitude: label sends its ID to read write line;
D, exchanges data attitude: label and read write line carry out exchanges data;
4. each label all has a counter and a randomizer, realizes that with them the method for binary tree is to avoid the conflict between label; Whether equal 0 with counter and determined that whether label sends ID to read write line, represents with COUNT; The random number transmitter only produces 0 or 1 random number, represents with RND.Fig. 1 has provided the rule schema of tag state conversion.As shown in Figure 1, when initial, label is in the pass closed state, activated by read write line and enters ready attitude.The ready attitude label of COUNT ≠ 0 still is in ready attitude when next time slot begins; The ready attitude label of COUNT=0 then enters the ID attitude.Can consider in two kinds of situation for ID attitude label: if current time slots has two above labels to be in the ID attitude, all are in the label of ID attitude and still get back to ready attitude when next time slot begin; If current time slots only has an ID attitude label, this label enters the exchanges data attitude so, gets back to the pass closed state after the data exchanging completed.Be in ready and COUNT computing situation ID attitude label and can see Table 1.From table 1, can see, when the conflict time slot, ID attitude label will be carried out COUNT=COUNT+RND, this makes the conflict label be divided into ready attitude and ID attitude two class labels at random when next time slot begins, after carrying out so repeatedly, will in a time slot, only there be an ID attitude label, thereby avoids a conflict generation.
5. in the storer of each label, store a priority number, this priority number has determined when label with read write line communicates by letter in the crack, represent with PN, the initial p N that dispatches from the factory is random integers, and PN all can do the self-adaptation adjustment to reduce conflict and empty slot according to the current time slots state in each read cycle.The initial value of COUNT is sent into by PN, has determined label whether to send ID to read write line, so when label the crack is communicated by letter with read write line and will be determined by PN because whether COUNT equals 0.We can obtain like this, if plural label has identical PN, the conflict time slot are arranged then; If the difference of the PN of two labels that the PN value is adjacent then is free time slot greater than 1.The PN of each label can do the self-adaptation computing with minimizing conflict and empty slot according to its residing state and current time slots type, thereby reduces total conflict arbitration time.Be in ready and PN computing situation ID attitude label and can see Table 1.Can see by table 1, if current be empty slot, all from subtracting 1, this difference that has guaranteed two label PN that any PN value is adjacent all is not more than 1 to the PN of all ready attitude labels so; If current is the conflict time slot, the PN of all ID attitude labels will add 1 or 0 at random certainly so, and this makes that the last PN of all labels is all unequal.Therefore, through a read cycle, the PN of n label will be by 0,1 ... n-1 distributes successively, if next read cycle interior label does not change, will can not have conflict and empty slot so, and readable time slot is only arranged, and the required total time slot of conflict arbitration this moment only is n.
The PN of table 1 label and the operation table of COUNT
| Readable time slot | Empty slot | The conflict time slot | |
| Ready attitude | The constant COUNT--of PN | PN--， COUNT-- | PN++，COUNT++ |
| The ID attitude | PN, COUNT are all constant | \ | Work as RND=1, PN++, COUNT++; Work as RND=0, PN, COUNT is constant |
6. as shown in Figure 2, carry out the multi-label collision arbitration according to the following steps:
When (1) initial, read write line is opened the label in its coverage of radio-frequency electromagnetic field activation.(step 110)
(2) the initial p N that the label that is activated will be stored in storer sends among the COUNT, and label enters ready attitude.(step 120)
(3) if there is the label of ready attitude, forward step 140 to; If the label of no ready attitude forwards step 250 to.(step 130)
(4) for the label of all ready attitudes,,, still be ready attitude as if COUNT＞0 if COUNT=0 then becomes the ID attitude.(step 140)
(5) if the label of ID attitude is arranged, forward step 160 to; Otherwise, forward step 200 to.(step 150)
(6) if two above ID attitude labels are arranged, forward step 220 to; Otherwise, forward step 170 to.(step 160)
(7) have only a label to send its ID to read write line, read write line gives all label one orders to show that current time slots is readable time slot.(step 170)
(8) for ID attitude label, read write line returns to an order after successfully receiving its ID again, and this label transfers the exchanges data attitude to, and after exchanges data finished, this label deposited the PN that upgrades in storage unit, becomes the pass closed state.(step 180)
(9) if there is ready attitude, its COUNT goes back to step 130 from subtracting 1; Otherwise, directly go back to step 130.(step 190～195)
(10) no label sends ID to read write line, and read write line gives all label one orders to show that current time slots is an empty slot.(step 200)
(11) for all ready attitude labels, its COUNT and PN go back to step 130 from subtracting 1.(step 210)
(12) have the label more than two to send its ID to read write line, read write line gives all label one orders to show that current time slots is the conflict time slot.(step 220)
(13) for all ready attitude labels, its COUNT and PN are from adding 1.(step 230)
(14) for all ID attitude labels, its RND produces random number 0,1: be 1 label, COUNT and PN are from adding 1; Be 0 label, COUNT and PN are constant.Go back to step 130.(step 240)
(15) read cycles finish.(step 250)
Fig. 3～Fig. 6 has represented the situation of read write line identification label in continuous four read cycles.Wherein, Fig. 3 has represented that A, B were arranged in first cycle, three labels of C, and the initial p N of A, B, C all is made as 1; Fig. 4 has represented second period interior label no change; Fig. 5 has represented to have in the 3rd cycle label D to arrive, and the initial p N of D is 1; Fig. 6 has represented that the 4th cycle interior label C, D leave away, and label E arrives, and the initial p N of E is made as 2.Table 2 represented each label in each time slot in each cycle COUNT and the situation of change of PN.
Table 2
The present invention is described in detail below in detail in the performance in this four cycles:
As shown in Figure 3, label A, B, C are arranged in first cycle:
When (1) initial, label A, B, C are activated and enter ready attitude, and its initial p N is 1, sends among the COUNT, and therefore COUNT and the PN of A, B, C is 1 in first time slot.Owing to there is not the label of COUNT=0, therefore not have label and send ID, be empty slot this moment, the COUNT of label A, B, C and PN are all from subtracting 1.
In (2) second time slots, COUNT and the PN of A, B, C become 0.Because the label of COUNT=0 has A, B, C, so current time slots is the conflict time slot.The RND of B produces random number 1, and the RND of A, C produces random number 0.
(3) because the RND of B has produced random number 1, so its COUNT and PN are 1 in the 3rd time slot; In like manner, the RND of A, C has produced random number 0, and its COUNT and PN should be 0 in the 3rd time slot.This moment, the label of COUNT=0 had A, C, had produced two ID attitude labels, so current time slots is the conflict time slot.So the COUNT of B and PN are from adding 1, the RND of A produces random number 1, and the RND of C produces random number 1.
In (4) the 4th time slots, COUNT and the PN of B become 2, and COUNT and the PN of A, C become 1.Do not have the label of COUNT=0 this moment, and current time slots is an empty slot.The COUNT of A, B, C and PN are all from subtracting 1.
In (5) the 5th time slots, COUNT and the PN of B become 1, and COUNT and the PN of A, C become 0.This moment, the label of COUNT=0 had A, C, and current time slots is the conflict time slot, and the COUNT of B and PN are from adding 1, and the RND of A produces random number 0, and the RND of C produces random number 1.
In (6) the 6th time slots, COUNT and the PN of B become 2, and COUNT and the PN of A become 0, and COUNT and the PN of C become 1.This moment, the label of COUNT=0 only had A, and current time slots is readable time slot.The ID of label A is identified by read write line, carry out exchanges data after, deposit its PN=0 in storage unit, and become the pass closed state.In addition, the COUNT of B, C is all from subtracting 1.
In (7) the 7th time slots, the COUNT of B and PN become 1 and 2 respectively, and the COUNT of C and PN become 0 and 1.This moment, the label of COUNT=0 only had C, and current time slots is readable time slot.Label C is identified by read write line, after exchanges data finishes, deposits its PN=1 in storage unit, and becomes the pass closed state.In addition, the COUNT of B is from subtracting 1.
In (8) the 8th time slots, the COUNT of B and PN become 0 and 2 respectively.This moment, the label of COUNT=0 only had B, and current time slots is readable time slot.Label B is identified by read write line, after exchanges data finishes, deposits its PN=2 in storage unit, and becomes the pass closed state.So far, all labels all become the pass closed state, and first read cycle finishes.
As shown in Figure 4, second period interior label no change still has label A, B, C:
When (1) initial, label A, B, C are activated and enter ready state.Its initial p N is respectively 0,2,1 by the decision of read cycle last time, sends among the COUNT, and therefore the COUNT of A, B, C also is respectively 0,2,1 in first time slot.Because the label of COUNT=0 only has A, so current time slots is readable time slot.Label A is identified by read write line, after exchanges data finishes, deposits its PN=0 in storage unit, and becomes the pass closed state.In addition, the COUNT of B, C is from subtracting 1, and the PN of B, C is constant.
In (2) second time slots, the COUNT of B, C becomes 1,0, and the PN of B, C still is 2,1.Because the label of COUNT=0 only has C, so current time slots is readable time slot.Label C is identified by read write line, after exchanges data finishes, deposits its PN=1 in storage unit, and becomes the pass closed state.In addition, the COUNT of B is from subtracting 1, and the PN of B is constant.
In (3) the 3rd time slots, the COUNT of B becomes 1,0, and the PN of B still is 2.Because the label of COUNT=0 only has B, so current time slots is readable time slot.Label B is identified by read write line, after exchanges data finishes, deposits its PN=2 in storage unit, and becomes the pass closed state.Arrive this, all labels all become the pass closed state, and second read cycle finishes.
As shown in Figure 5, the 3rd cycle interior label D arrives:
When (1) initial, label A, B, C, D are activated and enter ready state.The initial p N of A, B, C is respectively 0,2,1 by the decision of read cycle last time, sends among the COUNT, and therefore the COUNT of A, B, C also is respectively 0,2,1 in first time slot.D initial p N is 1, sends into COUNT, and therefore the COUNT of D also is 1 in first time slot.Because the label of COUNT=0 only has A, so current time slots is readable time slot.Label A is identified by read write line, after exchanges data finishes, deposits its PN=0 in storage unit, and becomes the pass closed state.In addition, the COUNT of B, C, D is from subtracting 1, and the PN of B, C, D is constant.
In (2) second time slots, the COUNT of B, C, D becomes 1,0,0, and the PN of B, C, D still is 2,1,1.This moment, the label of COUNT=0 had C, D, and current time slots is the conflict time slot, and the COUNT of B and PN are from adding 1, and the RND of D produces random number 0, and the RND of C produces random number 1.
In (3) the 3rd time slots, the COUNT of B, C, D becomes 2,1,0, and the PN of B, C, D is 3,2,1.Because the label of COUNT=0 only has D, so current time slots is readable time slot.Label D is identified by read write line, after exchanges data finishes, deposits its PN=1 in storage unit, and becomes the pass closed state.In addition, the COUNT of B, C is from subtracting 1, and the PN of B, C is constant.
In (4) the 4th time slots, the COUNT of B, C becomes 1,0, and the PN of B, C still is 3,2.Because the label of COUNT=0 only has C, so current time slots is readable time slot.Label C is identified by read write line, after exchanges data finishes, deposits its PN=2 in storage unit, and becomes the pass closed state.In addition, the COUNT of B is from subtracting 1, and the PN of B is constant.
In (5) the 5th time slots, the COUNT of B becomes 0, and PN still is 3.Because the label of COUNT=0 only has B, so current time slots is readable time slot.Label B is identified by read write line, after exchanges data finishes, deposits its PN=3 in storage unit, and becomes the pass closed state.Arrive this, all labels all become the pass closed state, and the 3rd read cycle finishes.
As shown in Figure 6, the 4th cycle interior label C, D leave away, and E arrives:
When (1) initial, label A, B, E are activated and enter ready state.The initial p N of A, B is respectively 0,3 by the decision of read cycle last time, sends among the COUNT, and therefore the COUNT of A, B also is respectively 0,3 in first time slot.E initial p N is 2, sends into COUNT, and therefore the COUNT of E also is 2 in first time slot.Because the label of COUNT=0 only has A, so current time slots is readable time slot.Label A is identified by read write line, after exchanges data finishes, deposits its PN=0 in storage unit, and becomes the pass closed state.In addition, the COUNT of B, E is from subtracting 1, and the PN of B, E is constant.
In (2) second time slots, the COUNT of B, E becomes 2,1, and the PN of B, E still is 3,2.Not having the label of COUNT=0 this moment, is empty slot therefore, and the COUNT of label B, E and PN are all from subtracting 1.
In (3) the 3rd time slots, the COUNT of B, E becomes 1,0, and the PN of B, E is 2,1.Because the label of COUNT=0 only has E, so current time slots is readable time slot.Label E is identified by read write line, after exchanges data finishes, deposits its PN=1 in storage unit, and becomes the pass closed state.In addition, the COUNT of B is from subtracting 1, and the PN of B is constant.
In (4) the 4th time slots, the COUNT of B becomes 0, and the PN of B still is 2.Because the label of COUNT=0 only has B, so current time slots is readable time slot.Label B is identified by read write line, after exchanges data finishes, deposits its PN=2 in storage unit, and becomes the pass closed state.Arrive this, all labels all become the pass closed state, and the 4th read cycle finishes.
Claims (1)
1, the multi-label collision referee method that is used for the adaptive binary tree of rfid system, it is characterized in that, the rfid system of this method is made of a read write line and two labels in its coverage at least, read write line is given an order earlier, label is carried out corresponding operation after receiving order, and concrete grammar is:
1. the shared time rule of process that a read write line and at least two labels in its coverage are carried out a full communication is a read cycle, and a read cycle is made of following four-stage:
A, initial: read write line activates the label in its coverage and sends querying command;
B, transmission ID: label sends its ID to read write line, then carries out the conflict arbitration method if plural label is arranged or do not have label to send ID, otherwise enters data exchange phase;
C, exchanges data: only have a label to send ID to read write line this moment, and read write line returns to successfully order of label, carries out exchanges data with read write line after label receives orders;
D, end: the data of read write line and all labels have all exchanged and have finished;
2. a read write line and at least two labels in its coverage are carried out a shared time of full communication and are divided into several slots, send the state of data, time slot is divided into following three types according to each time slot interior label:
A, empty slot: in this time slot, do not have label ID to send;
B, readable time slot: in this time slot, have and only have a label ID to send;
C, conflict time slot: in this time slot, have the label ID more than two to send;
3. the state of communicating by letter with read write line according to label, each label has following four kinds of states:
A, close closed state: read write line un-activation label or carry out exchanges data with read write line at a read cycle interior label;
B, ready attitude: read write line activates label;
C, ID attitude: label sends its ID to read write line;
D, exchanges data attitude: label and read write line carry out exchanges data;
4. each label all has a counter and a random number transmitter, realizes that with them the method for binary tree is to avoid the conflict between label; Whether counter equals 0 has determined that whether label sends ID to read write line, represents with COUNT; The random number transmitter only produces 0 or 1 random number, represents with RND;
5. all store a priority number in the storer of each label, this priority number has determined when label communicates by letter with read write line in the crack, represents with PN, and the initial p N when dispatching from the factory is random integers; PN all can do the self-adaptation adjustment to reduce conflict and empty slot according to the current time slots state in each read cycle, adjusted PN can be deposited in the storer of label before each read cycle finishes again;
6. carry out the multi-label collision arbitration according to the following steps:
A, when initial, read write line is opened the label in its coverage of radio-frequency electromagnetic field activation;
The initial p N that b, the label that is activated will be stored in storer sends among the COUNT, and label enters ready attitude by closing closed state;
C, when each time slot begins, judge whether the label of ready attitude, if the label of ready attitude is arranged, judge COUNT again, the ready attitude label of COUNT=0 becomes the ID attitude, the ready attitude label of COUNT＞0 still is ready attitude; If the label of no ready attitude, then a read cycle finishes;
D, consider from following two aspects according to the situation of ID attitude label:
I) when the label of no ID attitude, current time slots is an empty slot, and read write line gives all labels one orders to show that current time slots is an empty slot, and at this moment, the COUNT of all ready attitude labels and PN are from subtracting 1, and these labels still are ready attitude, and system enters next time slot;
Ii) when the label of ID attitude, two or more ID attitude labels need have been judged whether, when if two above ID attitude labels are arranged, then showing has plural label to send its ID to read write line, read write line is given all label one orders, to show that current time slots is the conflict time slot, at this moment, for all ready attitude labels, its COUNT and PN are from adding 1, and these labels are still located ready attitude when following time slot begins, for all ID attitude labels, its RND produces random number 0 or 1, and random number is 1 ID attitude label, and COUNT and PN are from adding 1, random number is 0 ID attitude label, COUNT and PN are constant, and all ID attitude labels are still got back to ready attitude when next time slot begins, and system enters next time slot; If have only an ID attitude label, then have only a label to send its ID to read write line, read write line gives all label one orders to show that current time slots is readable time slot, and at this moment, the COUNT that is in ready attitude label is from subtracting 1, and when beginning, next time slot still is in ready attitude, be in ID attitude label and transfer the exchanges data attitude to, after exchanges data finished, this label deposited the PN that upgrades in storer, transfer the pass closed state then to, system enters next time slot.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810058716A CN100589113C (en) | 2008-07-23 | 2008-07-23 | Self-adapting binary tree multi- label collision intermediation method for RFID system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810058716A CN100589113C (en) | 2008-07-23 | 2008-07-23 | Self-adapting binary tree multi- label collision intermediation method for RFID system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101334830A CN101334830A (en) | 2008-12-31 |
| CN100589113C true CN100589113C (en) | 2010-02-10 |
Family
ID=40197422
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200810058716A Active CN100589113C (en) | 2008-07-23 | 2008-07-23 | Self-adapting binary tree multi- label collision intermediation method for RFID system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100589113C (en) |
Families Citing this family (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101989380B (en) * | 2009-07-31 | 2012-12-05 | 西门子（中国）有限公司 | Method and radio frequency identification label for acquiring traffic information |
| CN102096604B (en) * | 2009-12-11 | 2013-06-12 | 中兴通讯股份有限公司 | Reader and RO (Read Only) rule scheduling method thereof |
| CN102087696B (en) * | 2010-12-31 | 2014-03-26 | 深圳市中兴长天信息技术有限公司 | Method and device for accessing multiple radio frequency identification electronic tags to reader |
| CN102682313B (en) * | 2011-06-10 | 2015-08-19 | 中国人民解放军国防科学技术大学 | The communication means of read write line and label in radio-frequency recognition system |
| CN102663333B (en) * | 2011-12-18 | 2014-06-11 | 西北工业大学 | Tag anti-collision method based on self-adaptive hybrid query tree in RFID (radio frequency identification) system |
| CN103116915B (en) * | 2012-12-11 | 2015-09-30 | 广东侍卫长卫星应用安全股份公司 | A kind of electronic license plate intelligence reading system and efficient communication control method thereof |
| CN103246860B (en) * | 2013-05-20 | 2016-09-07 | 无锡儒安科技有限公司 | A kind of RF tag number estimation method based on free timeslot number and device |
| CN107153802A (en) * | 2017-05-18 | 2017-09-12 | 云南民族大学 | Label collision solution for the posterior probability of RFID system |
| WO2018235018A1 (en) * | 2017-06-23 | 2018-12-27 | 3M Innovative Properties Company | Wireless authentication systems |
| CN107966680B (en) * | 2017-12-18 | 2020-04-21 | 成都佳发安泰教育科技股份有限公司 | Array type space-time multi-dimensional division positioning system and method |
| CN110135211B (en) * | 2019-04-01 | 2022-02-18 | 山东华翼微电子技术股份有限公司 | Method and device capable of rapidly and accurately checking number of RFID radio frequency tags |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5841770A (en) * | 1992-12-15 | 1998-11-24 | Micron Technology, Inc. | Data communication system using indentification protocol |
| CN1804852A (en) * | 2005-01-12 | 2006-07-19 | 三星电机株式会社 | Anti-collision method and system using optimized binary search tree |
| CN1975755A (en) * | 2006-12-01 | 2007-06-06 | 华南理工大学 | Intelligent RFID reading system anticonflict scheduling method |
| CN101047624A (en) * | 2006-04-27 | 2007-10-03 | 华为技术有限公司 | Tag distribution method and tag selling method |
-
2008
- 2008-07-23 CN CN200810058716A patent/CN100589113C/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5841770A (en) * | 1992-12-15 | 1998-11-24 | Micron Technology, Inc. | Data communication system using indentification protocol |
| CN1804852A (en) * | 2005-01-12 | 2006-07-19 | 三星电机株式会社 | Anti-collision method and system using optimized binary search tree |
| CN101047624A (en) * | 2006-04-27 | 2007-10-03 | 华为技术有限公司 | Tag distribution method and tag selling method |
| CN1975755A (en) * | 2006-12-01 | 2007-06-06 | 华南理工大学 | Intelligent RFID reading system anticonflict scheduling method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101334830A (en) | 2008-12-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100589113C (en) | Self-adapting binary tree multi- label collision intermediation method for RFID system | |
| CN105867322B (en) | System and method for the program management in material processing apparatuses | |
| CN104899720A (en) | Warehouse operation execution system and method based on intelligent objects | |
| CN101216875B (en) | An anti-collision method for RFID multi reader/writer based on graph decoration method | |
| CA2296370A1 (en) | Inventory system and control method using articles with rfid tags | |
| CN104598994A (en) | Related logistics transportation optimized dispatching method with time-varying time window | |
| CN101356543A (en) | Enhanced controller utilizing RFID technology | |
| CN101021814A (en) | Storage and polling method and storage controller and polling system | |
| CN1866320A (en) | Anti-counterfeit packaging method and apparatus | |
| CN107609611A (en) | A kind of multiclass formation gathering method based on large-scale radio-frequency identification system | |
| CN102722806B (en) | A kind of Product Management System based on RFID and its implementation | |
| Zhao et al. | The value of information sharing in a two-stage supply chain with production capacity constraints: The infinite horizon case | |
| Zhao et al. | Data mining with clustering algorithms to reduce packaging costs: A case study | |
| CN101702205A (en) | Quick sorting method for order form | |
| CN102799913A (en) | RFID (Radio Frequency Identity) intelligent code giving system for product assembly line and realization method thereof | |
| Kim et al. | Improved 4-ary query tree algorithm for anti-collision in RFID system | |
| CN102479316A (en) | Binary anti-collision identification method for serial numbers of RFID tags | |
| CN107329882A (en) | Obtain method and apparatus, storage medium and the electronic installation of online data | |
| Di et al. | A RFID anti-collision algorithm based on multithread regressive-style binary system | |
| CN104978645A (en) | Novel warehouse management system | |
| Piramuthu | Adaptive framework for collisions in RFID tag identification | |
| CN201807555U (en) | Sorting system based on box array | |
| Dong et al. | Part supply method for mixed-model assembly lines with decentralized supermarkets | |
| CN102521627B (en) | Redundancy eliminating algorithm of RFID (radio frequency identification) system reader based on middleware | |
| CN108876187A (en) | Self-service cargo vending machine based on user's purchase intention dispatches system and method with goods |
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 | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Assignee: YUNNAN KUNCHUAN DIGITAL TECHNOLOGY Co.,Ltd. Assignor: YUNNAN KSEC DESIGN AND RESEARCH INSTITUTE Contract record no.: 2010530000029 Denomination of invention: Self-adapting binary tree multi- label collision intermediation method for RFID system Granted publication date: 20100210 License type: Exclusive License Open date: 20081231 Record date: 20100719 |
|
| CP03 | Change of name, title or address |
Address after: 650051 people middle road, Panlong District, Kunming, Yunnan Province, No. 6 Patentee after: YUNNAN KSEC DESIGN RESEARCH INSTITUTE Co.,Ltd. Address before: No. 6 people middle road, Kunming, Yunnan Province, Yunnan:Kunchuan building Yunnan Kunchuan Design & Research Institute Patentee before: YUNNAN KSEC DESIGN AND RESEARCH INSTITUTE |
|
| CP03 | Change of name, title or address | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20180903 Address after: 650000 No. 29, Shilin street, University Town, Chenggong District, Kunming, Yunnan, China. 9 Patentee after: YUNNAN KUNCHUAN DIGITAL TECHNOLOGY Co.,Ltd. Address before: 650051 people middle road, Panlong District, Kunming, Yunnan Province, No. 6 Patentee before: YUNNAN KSEC DESIGN RESEARCH INSTITUTE Co.,Ltd. |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210727 Address after: 650051, No. 6, Renmin Middle Road, Panlong District, Yunnan, Kunming Patentee after: YUNNAN KSEC DESIGN RESEARCH INSTITUTE Co.,Ltd. Address before: 650000 No. 29, Shilin street, University Town, Chenggong District, Kunming, Yunnan, China. 9 Patentee before: YUNNAN KUNCHUAN DIGITAL TECHNOLOGY Co.,Ltd. |