CN101430755A - Label recognition anti-collision processing method in radio frequency recognition technology - Google Patents
Label recognition anti-collision processing method in radio frequency recognition technology Download PDFInfo
- Publication number
- CN101430755A CN101430755A CNA2008102190950A CN200810219095A CN101430755A CN 101430755 A CN101430755 A CN 101430755A CN A2008102190950 A CNA2008102190950 A CN A2008102190950A CN 200810219095 A CN200810219095 A CN 200810219095A CN 101430755 A CN101430755 A CN 101430755A
- Authority
- CN
- China
- Prior art keywords
- label
- prefix
- quasiprefix
- read write
- write line
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a tag identification anti-collision processing method of an RF identification technology. The method comprises the following steps: establishing a prefix library, performing prefix segment matching; updating the prefix library by a reader-writer and returning to the previous step; and checking again when all the matching prefixes are tried, and exiting. The method has the following advantages: the 'prefix segment matching' is employed so that the reader-writer can be matched with the prefix library which is collected by the reader-writer while searching tag ID, which causes the read-writer to match the identified tag ID, greatly reduces the research times of the reader-writer, and enhances the tag identification speed of the reader-writer, and can reduce the rate of reading missing when the reader-writer identifies a plurality of tags at the same time. Correspondingly, the response times of the tags are greatly reduced, and the power consumption of the tags is greatly reduced. The service life of the tags are calculated by the times of responding to the reader-writer, so the reduction of the tag identification response times at each time greatly prolongs the service life of the tags.
Description
Technical field
The present invention relates to a kind of label identification method, relate in particular to the label recognition anti-collision processing method in a kind of REID.
Background technology
REID generally includes three ingredients in the prior art when work: label, read write line and background computer.In read write line when work, a plurality of labels occur through regular meeting and be in situation in the effective identification range of read write line simultaneously, and this moment, communication form can be divided into radio broadcasting again and many labels respond two kinds simultaneously.
Radio broadcasting is the data transmission from the read write line to the label, and the data stream of transmission is received by all labels simultaneously.It is that many labels send response signal to read write line simultaneously in the effective identification range of read write line that many labels respond simultaneously, must guarantee that read write line can correctly receive and identify the response signal that each label sends this moment, avoid the mutual interference of a plurality of label phase, thereby reach the purpose that read write line is discerned each label identity.
Therefore, the conflict between the label is meant: a plurality of labels respond the order of read write line simultaneously, cause between the label signal conflict mutually, cause the read write line can't identification label.
Anti-collision is handled most important to the recognition capability of rfid system, if the anti-collision Treatment Design is unreasonable, will cause label collision frequently to take place, make that the label power consumption increases, the lost of life (number of times that can respond the read write line order in the lifetime with label calculates usually), read write line search speed slow down, when serious even can label skip rate significantly be risen because of can't correctly discerning for a long time.
(author is C.Law to document Efficient memoryless protocol for tag identification, K.Lee, K.Y.Siu, the source is 4th International Workshop on Discrete Algorithms and Methodsfor Mobile Computing and Communications, discloses a kind of QT algorithm in 2000:75-84).The QT algorithm basic principle can be described as:
Order
Expression length is all set of 0 to kbit binary string, and k is the total length of label ID.Inquiry formation Q=＜q
1, q
2..., q
l, q wherein
i∈ Ω, q1＜q2＜...＜q
lThe Q formation was sky, i.e. Q=＜null when algorithm began 〉, null represents empty binary string.When read write line utilizes the null search, the label in the effective identification range of all read write lines all will send the ID of oneself as responding.
Suppose to carve at a time search queue Q=＜q
1, q
2..., q
l, then the QT algorithm was made up of following three steps:
Step1: from formation Q, choose first binary string, even q=q
1, and send search command.
Step2: the Q formation is updated to Q=＜q
2..., q
l, and to the binary string among the formation Q again since 1 the ordering.After each label receives orders with L (q) bits and q before its ID relatively, if identical then this label sends its ID in response.Wherein the function of binary string length is asked in function L () expression.
Step3: according to the response of label, read write line divides following three kinds of situations to handle respectively:
The conflict search, promptly many label responses: read write line makes Q=＜q
2..., q
n, q
1‖ 0, q
1‖ 1〉and to the subscript of each binary string since 1 assignment again, return Step1 then, wherein " ‖ " expression is with the operation of two binary strings series connection.
Identification search, i.e. only label response: read write line will be discerned this label.If Q this moment is empty, then finishes search procedure, otherwise return Step1.
Blank search does not promptly have the label response: if Q this moment is empty, then finishes search procedure, otherwise return Step1.
Because the QT algorithm is when search label ID, the mode of taking step-by-step progressively to advance is searched for entire I D space.Label ID with the EPC-96-I standard is an example, ID is divided into the segment of four different implications: version number (EPCVersion), domain name supervising (EPC Manager, storage is production firm's coding usually), classification (ObjectClass) and sequence number (Item ID).
Suppose that read write line searching for the EPC Manager segment of 28bits, when search ibit label ID runs into conflict, the QT algorithm is taked the mode that advances by turn, earlier hypothesis i+1bit 0 searches for, suppose that again i+1bit 1 searches for, after 28 EPC Manager segments all search for, begin to search for by turn after the same method Object Class section and Item ID section again.Because the QT algorithm can only search out 1bit label ID when search at every turn, read write line all will be searched for each ID position, has increased searching times greatly, makes label response times, label power consumption increase greatly.And the increase of label response times directly causes the shortening in label life-span.So it is slow that the disadvantage of QT algorithm is a search speed, the label response times is many, and power consumption is big, and the life-span is short.The number of labels that need read simultaneously when read write line causes the serious consequence of label skip more easily.
Summary of the invention
The object of the invention is to provide a kind of label recognition anti-collision processing method that can improve search speed, reduce the label skip.
Purpose of the present invention can realize by following scheme: the label recognition anti-collision processing method in a kind of REID, and step comprises:
A, read write line set up prefix library according to the prefix of the identification label ID of institute;
B, prefix segmentation coupling: when each segment of identification label ID, read write line is judged the quantity v of known ID position and prefix matching continuously, when the quantity v of prefix coupling then skips this section remaining bit during less than matching threshold, directly attempting with the coupling prefix is this section ID, and then searches for the ID of next segment;
If c coupling prefix does not have the label response when attempting, illustrate that corresponding ID position and this prefix of all labels in the read write line identification range is all unequal, attempt failure; If label response explanation trial and success is arranged when attempting, read write line is ignored this segment remaining bit and is leapt to next segment and discern and mate, and read write line upgrades prefix library and returns step b then;
After d, all coupling prefixes attempt finishing, return the state before attempting,, confirm not have to finish coupling behind the skip label and withdraw to guarantee not having label by skip.
Prefix ID of the present invention divides three classifications:
The E quasiprefix: comprise version number's segment, length is 8bits;
EM quasiprefix: comprise version number's segment and domain name supervising segment length is 36bits;
The EMO quasiprefix: comprise version number's segment, domain name supervising segment and classification segment, length is 60bits.
The present invention's each prefix record in prefix library comprises two parts, the one, and prefix itself, the 2nd, from the time span t that has experienced to the current time since this prefix identification label of the last use of read write line.
The present invention upgrades E quasiprefix, EM quasiprefix and EMO quasiprefix in the prefix library according to preceding 8 of label ID, preceding 36 and preceding 60 respectively behind label of the new identification of read write line.
If preceding 8 of this label ID equate with certain E quasiprefix in the prefix library, illustrate that then this E quasiprefix just was used, should be with its time span t zero setting; If this label ID preceding 8 with prefix library in any one E quasiprefix all unequal, then utilize the prefixes of time span t maximum in preceding 8 will be in the prefix library existing E quasiprefixs of this label ID to replace, and with its time span t zero setting.
If preceding 36 of this label ID equate with certain EM quasiprefix in the prefix library, illustrate that then this EM quasiprefix just was used, should be with its time span t zero setting; If this label ID preceding 36 with prefix library in any one EM quasiprefix all unequal, then utilize the prefixes of time span t maximum in preceding 36 will be in the prefix library existing EM quasiprefixs of this label ID to replace, and with its time span t zero setting.
If preceding 60 of this label ID equate with certain EMO quasiprefix in the prefix library, illustrate that then this EMO quasiprefix just was used, should be with its time span t zero setting; If this label ID preceding 60 with prefix library in any one EMO quasiprefix all unequal, then utilize the prefixes of time span t maximum in preceding 60 will be in the prefix library existing EMO quasiprefixs of this label ID to replace, and with its time span t zero setting.
Read write line of the present invention utilizes the coupling of identification label ID and prefix library when search label ID; When preceding 8 of search label ID, read write line utilizes the E quasiprefix to mate; When 8 to 36 of search label ID, read write line utilizes the EM quasiprefix to mate; When 36 to 60 of search label ID, read write line utilizes the EMO quasiprefix to mate.
In the matching process of the present invention, if prefix matching quantity less than matching threshold, then read write line will mate prefix and q ‖ 0, q ‖ 1 put into search queue Q; Otherwise, if, mating prefix greater than matching threshold, prefix matching quantity v will be left in the basket, read write line is only put into search queue Q to q ‖ 0, q ‖ 1; Wherein " ‖ " expression is with the operation of two binary string series connection.
The present invention is relative, and the prior art advantage is: because the present invention has used " prefix segmentation coupling ", make read write line when search label ID, the prefix library that can collect with read write line in search is mated, read write line mates the label ID that has discerned when search like this, shortened the searching times of read write line greatly, and then improved the speed of read write line identification label, when read write line is discerned a large amount of label simultaneously, can reduce the skip rate.Correspondingly the response times of label also significantly reduces, so the label power consumption reduces greatly.Because the label life-span is to calculate with response read write line number of times, label at every turn when identification the minimizing of response times can greatly prolong the label life-span.
Description of drawings
Fig. 1 is a particular flow sheet of the present invention;
Fig. 2 is various EPC coding structure tables in the embodiments of the invention;
Fig. 3 is the classification synoptic diagram of label ID prefix in the EPC standard in the embodiments of the invention;
Fig. 4 is the list of values of E quasiprefix in the embodiments of the invention;
Fig. 5 is the result of variations synoptic diagram (a) of E quasiprefix in the embodiments of the invention;
Fig. 6 is the result of variations synoptic diagram (b) of E quasiprefix in the embodiments of the invention.
Embodiment
As shown in Figure 1, treatment scheme of the present invention may further comprise the steps:
According to the prefix of the identification label ID of read write line institute, set up prefix library earlier; From binary queue Q, choose first binary string q and the search, simultaneously from formation Q the deletion this binary string q and to the binary string among the formation Q again since 1 the ordering.Judge the status recognition (conflict/identification/nothing response) of label,, then upgrade prefix library and judge further whether formation Q is empty if if status recognition is " identification ".
If status recognition is not for " have response " then skip and upgrade the prefix library step and judge directly whether formation Q is empty; If formation Q is sky then finishes coupling and termination routine, if formation Q non-NULL then return is chosen first binary string q and search again from formation Q.
If status recognition is " conflict ", promptly have a plurality of labels to respond the search command of read write line simultaneously, then q ‖ 0 and q ‖ 1 are inserted formation Q front, and the length L (q) of inquiry binary string q whether to satisfy L (q) be 8 or 36 or more than or equal to 60.If Query Result, is then skipped the prefix matching process for being and is returned choose first binary string q and search again from formation Q; If Query Result then carries out prefix matching for not, whether match query prefix number is smaller or equal to matching threshold again.If Query Result then returns and choose first binary string q and search again from formation Q for not; If Query Result is for being, then will puts into formation Q and return again and choose first binary string q and search with the prefix w1～w2 of binary string q coupling is ascending from formation Q.
By above-mentioned flow process, thus identification and matching responding tags apace just, and do not have skip.
Concrete operations flow process of the present invention is:
Order
Expression length is all set of 0 to kbit binary string, and k is the total length of label ID.Inquiry formation Q=＜q
1, q
2..., q
l, q wherein
i∈ Ω, q
1＜q
2＜...＜q
lThe Q formation was for empty when algorithm began, i.e. Q=＜null 〉, null is empty binary string, when read write line utilizes the null search all not the dormancy label all will respond.Suppose to carve at a time search queue Q=＜q
1, q
2..., q
l, wherein
q
i∈ Ω and q
1＜q
2＜...＜q
l, operating process then of the present invention was made up of following three steps:
Step1: from formation Q, choose first binary string, even q=q
1, and send search command.
Step2: read write line is with q
1Deletion and sort again since 1 from Q, the Q formation is Q=＜q at this moment
1..., q
L-1.
For the label of not dormancy (that is: current in the read write line recognizable set, and unrecognized), each label of back that receives orders with its ID before L (q) bits and q comparison, if identical then this label sends its ID in response.
Step3: according to the response of label, read write line divides following three kinds of situations to upgrade Q formation and prefix library:
Conflict search: promptly many labels responses: read write line is carried out the prefix matching operation and prefix matching quantity v and matching threshold λ is compared: if v≤λ then make Q=＜w
1, w
2..., w
v, q ‖ 0, q ‖ 1, q
2..., q
1, return Step1 then, wherein w
1..., w
vFor with the prefix of q coupling, and w
1＜w
2...＜w
v, " ‖ " expression is with the operation of two binary string series connection; If v〉λ then make Q=＜q ‖ 0, q ‖ 1, q
2..., q
1And return Step1.
The identification search: i.e. only label response: read write line is discerned this label of back dormancy, and upgrades prefix library according to being identified label ID.If Q this moment is empty, then finishes entire identification process, otherwise return Step1.
Blank search: promptly do not have the label response: if Q then finishes entire identification process, otherwise returns Step1 for empty.
In the series standard of EPC global, multiple different EPC coding structure is arranged, but every kind of coding all is divided into four segments: version number (EPCVersion), domain name supervising (EPC Manager), classification (ObjectClass) and sequence number (Item ID).Various EPC coding structures as shown in Figure 2.
With wherein EPC-96-I standard is example, the prefix of three kinds is arranged, as shown in Figure 3 in the prefix library.
The E quasiprefix: comprise version number's segment, length is 8bits, in order to control prefix quantity in the prefix library, can set E quasiprefix quantity and mostly be m most
1Individual, represent that the version number of certain specific read write line institute identification id is at most m
1Individual.
The EM quasiprefix: comprise version number's segment and domain name supervising segment length is 36bits, quantity can be set at m at most
2Individual.
The EMO quasiprefix: comprise version number's segment, domain name supervising segment and classification segment, length is 60bits, and quantity can be set at m at most
3Individual.
The concrete operations of prefix matching of the present invention are that the conflict search in the Step3 of QT algorithm improves: when read write line utilized binary string q to search for and run into the conflict search, read write line at first selected corresponding interval prefix to mate according to the length of command parameter binary string q:
If 0＜L (q)＜8, the ID that the expression read write line is being searched for the version number interval should select E quasiprefix and q to mate, and wherein the function of binary string q length is asked in L (q) expression.
If 8＜L (q)＜36, the expression read write line is being searched for the ID between the domain name directorial area, should select EM quasiprefix and q to mate.
If 36＜L (q)＜60, the expression read write line should select EMO quasiprefix and q to mate just at the ID in search category interval.
For each the bar record in the prefix library,, think that then this prefix and q coupling, read write line are taken out the prefix of all couplings and the prefix quantity of statistical match if L (q) bits is identical with q before this prefix.
Prefix library renewal process of the present invention: each prefix comprises a visit field and be used for writing down the time t that this prefix has been experienced since last visit, and as shown in Figure 4, the ID that has discerned certain label when search is q
Tag, with the f among this label ID
1,8(q
Tag), f
1,36(q
Tag) and f
1,60(q
Tag) upgrade E quasiprefix, EM quasiprefix and EMO quasiprefix, wherein f respectively
M, n(q
Tag) represent from q
TagThe middle function that extracts m to n bits.The concrete steps that three quasiprefixs are upgraded are:
Upgrade the E quasiprefix: if f
1,8(q
Tag) and certain E quasiprefix E
iEquate, illustrate that read write line uses prefix E
iDiscerned label, prefix E
iJust be used, make t according to lru algorithm
Ei=0, and i ∈ [1, m
1]; If in the E quasiprefix without any a prefix and f
1,8(q
Tag) equate, then use f
1,8(q
Tag) replace the prefix that is not used at most in the E quasiprefix, i.e. the prefix of t maximum in the E quasiprefix, and make t=0.Wherein, f
M, n(q
Tag) represent from binary string q
TagThe middle function that extracts m to n bits.
Upgrade the EM quasiprefix: if f
1,36(q
Tag) and certain EM quasiprefix EM
iEquate, illustrate that read write line uses prefix EM
iDiscerned label, prefix EM
iJust be used, make t according to lru algorithm
EMi=0, and i ∈ [1, m
2]; If in the EM quasiprefix without any a prefix and f
1,36(q
Tag) equate that then use f1,36 (qtag) replace the prefix that is not used at most in the EM quasiprefix, i.e. the prefix of t maximum in the E quasiprefix, and make t=0.
Upgrade the EMO quasiprefix: if f
1,60(q
Tag) and certain EMO quasiprefix EMO
iEquate, illustrate that read write line uses prefix EMO
iDiscerned label, prefix EMO
iJust be used, make t according to lru algorithm
EMOi=0, and i ∈ [1, m
3]; If in the EMO quasiprefix without any a prefix and f
1,60(q
Tag) equate, then use f
1,60(q
Tag) replace the prefix that is not used at most in the EMO quasiprefix, i.e. the prefix of t maximum in the EMO quasiprefix, and make t=0.
In said process, time t can be the real time, also can be with each identifying of read write line as a basic time unit.For example, when read write line triggered an identifying, all prefix time t of prefix library increased a unit so.
For example certain read write line uses q=1001 to search for when once searching for and conflict has taken place, because 0＜L (q)＜8, the expression read write line is being searched for the interval ID of version number, should mate in the E quasiprefix.Suppose that this read write line discerns the version number of goods ID and be at most 5, numbering as shown in Figure 4.As can be seen, P
E1And P
E4Preceding 4bits and q coupling, be 2 therefore with q coupling prefix quantity, i.e. v=2.If setting matching threshold is 4, because prefix matching quantity is less than matching threshold, so read write line will be coupling prefix P
E1And P
E4And q ‖ 0, q ‖ 1 put into search queue Q; Otherwise, if, mating prefix greater than matching threshold, prefix matching quantity will be left in the basket, read write line is only put into search queue Q to q ‖ 0, q ‖ 1.
If read write line utilizes P
E1Discerned certain label during search, and its f
1,8(q
Tag)=10011100.Because f
1,8(q
Tag)=P
E1So, make t
E1=0, E quasiprefix result of variations as shown in Figure 5 at this moment.
F else if
1,8(q
TagF will be used in)=10011110
1,8(q
Tag) replacement t the maximum P
E5E quasiprefix result of variations as shown in Figure 6 at this moment.
Because anti-collision method of the present invention has used " prefix segmentation coupling ", make read write line when search label ID, the prefix library that can collect with read write line in search is mated, by reducing label ID position to be searched, search speed quickening (and then label skip rate is descended), the reduction of label power consumption, the label life-span of read write line are prolonged.
Claims (9)
1, the label recognition anti-collision processing method in a kind of REID is characterized in that step comprises:
A, read write line set up prefix library according to the prefix of the identification label ID of institute;
B, prefix segmentation coupling: when each segment of identification label ID, read write line is judged the quantity v of known ID position and prefix matching continuously, when the quantity v of prefix coupling then skips this section remaining bit during less than matching threshold, directly attempting with the coupling prefix is this section ID, and then searches for the ID of next segment;
If c coupling prefix does not have the label response when attempting, illustrate that corresponding ID position and this prefix of all labels in the read write line identification range is all unequal, attempt failure; If label response explanation trial and success is arranged when attempting, read write line is ignored this segment remaining bit and is leapt to next segment and discern and mate, and read write line upgrades prefix library and returns step b then;
After d, all coupling prefixes attempt finishing, return the state before attempting,, confirm not have to finish coupling behind the skip label and withdraw to guarantee not having label by skip.
2, the label recognition anti-collision processing method in a kind of REID according to claim 1 is characterized in that, described prefix ID divides three classifications:
The E quasiprefix: comprise version number's segment, length is 8bits;
EM quasiprefix: comprise version number's segment and domain name supervising segment length is 36bits;
The EMO quasiprefix: comprise version number's segment, domain name supervising segment and classification segment, length is 60bits.
3, the label recognition anti-collision processing method in a kind of REID according to claim 1, it is characterized in that, each prefix record comprises two parts in prefix library, the one, prefix itself, the 2nd, from the time span t that has experienced to the current time since this prefix identification label of the last use of read write line.
4, the label recognition anti-collision processing method in a kind of REID according to claim 1 and 2, it is characterized in that, behind label of the new identification of read write line, according to preceding 8 of label ID, preceding 36 and preceding 60 E quasiprefix, EM quasiprefix and EMO quasiprefix in the prefix library upgraded respectively.
5, the label recognition anti-collision processing method in a kind of REID according to claim 4, it is characterized in that, if preceding 8 of this label ID equate with certain E quasiprefix in the prefix library, illustrate that then this E quasiprefix just was used, should be with its time span t zero setting; If this label ID preceding 8 with prefix library in any one E quasiprefix all unequal, then utilize the prefixes of time span t maximum in preceding 8 will be in the prefix library existing E quasiprefixs of this label ID to replace, and with its time span t zero setting.
6, the label recognition anti-collision processing method in a kind of REID according to claim 4, it is characterized in that, if preceding 36 of this label ID equate with certain EM quasiprefix in the prefix library, illustrate that then this EM quasiprefix just was used, should be with its time span t zero setting; If this label ID preceding 36 with prefix library in any one EM quasiprefix all unequal, then utilize the prefixes of time span t maximum in preceding 36 will be in the prefix library existing EM quasiprefixs of this label ID to replace, and with its time span t zero setting.
7, the label recognition anti-collision processing method in a kind of REID according to claim 4, it is characterized in that, if preceding 60 of this label ID equate with certain EMO quasiprefix in the prefix library, illustrate that then this EMO quasiprefix just was used, should be with its time span t zero setting; If this label ID preceding 60 with prefix library in any one EMO quasiprefix all unequal, then utilize the prefixes of time span t maximum in preceding 60 will be in the prefix library existing EMO quasiprefixs of this label ID to replace, and with its time span t zero setting.
8, the label recognition anti-collision processing method in a kind of REID according to claim 1 and 2 is characterized in that, read write line utilizes the coupling of identification label ID and prefix library when search label ID; When preceding 8 of search label ID, read write line utilizes the E quasiprefix to mate; When 8 to 36 of search label ID, read write line utilizes the EM quasiprefix to mate; When 36 to 60 of search label ID, read write line utilizes the EMO quasiprefix to mate.
9, the label recognition anti-collision processing method in a kind of REID according to claim 8, it is characterized in that, in the described matching process, if prefix matching quantity less than matching threshold, then read write line will mate prefix and q ‖ 0, q ‖ 1 put into search queue Q; Otherwise, if, mating prefix greater than matching threshold, prefix matching quantity v will be left in the basket, read write line is only put into search queue Q to q ‖ 0, q ‖ 1; Wherein " ‖ " expression is with the operation of two binary string series connection.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008102190950A CN101430755A (en) | 2008-11-13 | 2008-11-13 | Label recognition anti-collision processing method in radio frequency recognition technology |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008102190950A CN101430755A (en) | 2008-11-13 | 2008-11-13 | Label recognition anti-collision processing method in radio frequency recognition technology |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101430755A true CN101430755A (en) | 2009-05-13 |
Family
ID=40646140
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2008102190950A Pending CN101430755A (en) | 2008-11-13 | 2008-11-13 | Label recognition anti-collision processing method in radio frequency recognition technology |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101430755A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103902944A (en) * | 2014-03-31 | 2014-07-02 | 上海电机学院 | Multi-tag collision prevention method of internet of things |
| CN108521646A (en) * | 2018-03-30 | 2018-09-11 | 纳思达股份有限公司 | A kind of near field communication method, device and computer readable storage medium |
| CN109815225A (en) * | 2018-12-11 | 2019-05-28 | 中国科学院计算技术研究所 | Parallelization prefix data search method and system based on prefix tree construction |
| CN110490277A (en) * | 2019-07-16 | 2019-11-22 | 视联动力信息技术股份有限公司 | A kind of monitoring device quantity statistics method, system, electronic equipment and storage medium |
-
2008
- 2008-11-13 CN CNA2008102190950A patent/CN101430755A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103902944A (en) * | 2014-03-31 | 2014-07-02 | 上海电机学院 | Multi-tag collision prevention method of internet of things |
| CN108521646A (en) * | 2018-03-30 | 2018-09-11 | 纳思达股份有限公司 | A kind of near field communication method, device and computer readable storage medium |
| CN109815225A (en) * | 2018-12-11 | 2019-05-28 | 中国科学院计算技术研究所 | Parallelization prefix data search method and system based on prefix tree construction |
| CN110490277A (en) * | 2019-07-16 | 2019-11-22 | 视联动力信息技术股份有限公司 | A kind of monitoring device quantity statistics method, system, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100378732C (en) | Anti-collision method and system using optimized binary search tree | |
| Myung et al. | An adaptive memoryless protocol for RFID tag collision arbitration | |
| CN101866413B (en) | Multi-label anti-collision method based on grouping mechanism and jumping dynamic binary recognition | |
| CN103020568B (en) | Based on the pretreated RFID anti-collision method of label ID | |
| EP1929433A1 (en) | Method for identifying tags using adafitve binary tree splitting technique in rfid system and rfid system therefor | |
| CN104517087A (en) | RFID multi-label identification anti-collision method | |
| CN103473524A (en) | RFID multi-tag identification method, reader and tags | |
| Bhandari et al. | Intelligent query tree (IQT) protocol to improve RFID tag read efficiency | |
| CN108491741B (en) | Bit arbitration query tree anti-collision method based on quadtree | |
| CN101430755A (en) | Label recognition anti-collision processing method in radio frequency recognition technology | |
| CN109241802B (en) | Multi-label identification method for mobile RFID system | |
| CN105046181A (en) | Deterministic anti-collision algorithm based on multi-prefix matching of query tree method | |
| CN101324916B (en) | Label recognition anti-collision method for RFID system | |
| CN103870782A (en) | Anti-collision method based on label confliction IDs | |
| Huang et al. | Efficient dynamic framed slotted aloha for rfid passive tags | |
| CN105654010B (en) | A kind of RFID tag collision-proof method based on adaptive search strategies | |
| CN100592321C (en) | Method for recognizing contrary collision of inquiry tree radio frequency labels of amalgamation database | |
| CN102479316A (en) | Binary anti-collision identification method for serial numbers of RFID tags | |
| CN101324917B (en) | RFID label reverse collision control method | |
| KR20080010277A (en) | Multiple moving tag identification method with multiple reader | |
| CN101697194A (en) | Data processing system and method for improving reliability of RFID application | |
| CN208752652U (en) | A kind of luggage far field vision patch system | |
| CN101661549B (en) | Electronic tag and answering method thereof, and method, device and system for identifying electronic tag | |
| CN103077417B (en) | RFID tag read method towards mass data | |
| Dong et al. | An Improved Binary Search Anti-Collision Protocol for RFID Tag Identification. |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20090513 |