CN103902944A - Multi-tag collision prevention method of internet of things - Google Patents
Multi-tag collision prevention method of internet of things Download PDFInfo
- Publication number
- CN103902944A CN103902944A CN201410127165.5A CN201410127165A CN103902944A CN 103902944 A CN103902944 A CN 103902944A CN 201410127165 A CN201410127165 A CN 201410127165A CN 103902944 A CN103902944 A CN 103902944A
- Authority
- CN
- China
- Prior art keywords
- request
- label
- write line
- read write
- things
- 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 provides a multi-tag collision prevention method of the internet of things. The multi-tag collision prevention method includes the steps of firstly, broadcasting information through a reader-writer, and making a response through tags in the area according to IDs of the tags; secondly, obtaining the length of a request corresponding to a current collision bit through the reader-writer according to the number of the tags in the area and the length information of the IDs of the tags; thirdly, starting the search process, obtaining the prefix of the request of the current collision bit, and compressing the prefix of the request into a stack; fourthly, obtaining the prefix of the current request from the stack when the reader-writer executes the request, broadcasting the prefix, judging whether collision occurs or not, if yes, entering the search process through the reader-writer again, if not, distinguishing the corresponding tags, and repeating the judgment till the stack is empty. According to the method, the number of the tags which are recognized at the same moment is not limited, signals of the reader-writer cover all the tags in the area, all the tags in the area can be recognized, and expandability is high; in addition, system resources occupied by the reader-writer during the reading, writing and tag recognizing process are limited, and the recognizing efficiency of the reader-writer is improved without obviously increasing system loads.
Description
Technical field
The present invention relates to communication technique field, particularly a kind of many label anti-confliction methods of Internet of Things.
Background technology
Existing various anticollision protocol can be divided into two classes: randomness agreement (Aloha quasi-protocol) and determinacy agreement (based on the agreement of tree).When described randomness agreement clashes, label postpones to respond reader after a random time, has formed at present take Aloha as basic randomness protocol family, as pure Aloha, Slot-aloha, frame slot Aloha.In described determinacy agreement, the prefix of the label ID that the continuous transmission of reader will be inquired about, label response reader with prefix matching, reader is according to conflicting information being detected, label to be identified is divided into groups, in group, repeat above-mentioned query script (the inquiry prefix that send next time is revised in identification), until identify a label.All labels in each group are identified, and all labels within the scope of reader are all identified.
Whether described determinacy agreement needs internal storage can be divided into protocol memory according to label in identifying and without protocol memory, form at present take Binary tree search agreement as basic serial protocols, as position arbitration search (BA), query tree search (Q-tree), basic binary search (BS), binary are searched for (DBS), adaptive binary search (ABS), had the binary search (BDBS) and other improved protocols that retreat index.
Agreement based on tree again can Further Division be to realize based on scale-of-two, and based on query tree realization, and scale-of-two is searched for by turn and realized three kinds.In many label anti-conflictions agreement based on tree, great-jump-forward dynamic search algorithm (Jumping and Dynamic Searching Algorithm---JDS) and prefix random challenge tree protocol (Prefix-Randomized Query-Tree Protocol---PRQT) are higher and newer two of current efficiency.For different number of tags, by query tree, PRQT can obtain the label prefix of ideal length.Label of this agreement differentiation is estimated and is needed 2.35 iteration.JDS based on binary search distinguishes conflict label by reusing requested prefix, and its request prefix determines by clashing initial bit.In this case, a required iterations of label of JDS differentiation is probably 2.00.
Aloha quasi-protocol (randomness agreement) is widely used in rfid system, and what 13.56MHz ISM Band Class1, ISO18000-6A and C and EPC C1Gen2 agreement adopted at present is all Aloha quasi-protocol.In many application of RFID, reader need to carry out to some article the identification of repetition.For example, in supply chain management, the article on pallet or travelling belt at warehouse-in, make an inventory of goods in a warehouse and multiple links such as outbound all need to be repeated to read.In this case, if reader can utilize the information of identification label last time, in the time identifying same label next time, some conflict is avoidable so.The people such as Myung proposed two kinds of adaptive anticollision protocol: ABS and AQS, and they have obtained good performance in the time that identification repeats label, but these two kinds of agreements are all based on tree quasi-protocol.At present, it is less that the agreement of report based on Aloha class can reduce the document of conflict in the time that identification repeats label.
In the standard of rfid system ISO/IEC, there are three kinds of determinacy label anti-confliction algorithms: in ISO14443 standard, what TYPE A used is Binary tree search algorithm; In ISO18000-3 standard, that MODE2 uses is FTDMA(Frequenc
ytime Division Multiple Access) algorithm; In ISO18000-6 standard, what TYPE B used is binary search algorithm.Determinacy label anti-confliction algorithm still can be correct when in system, number of tags is more identification label, but it also has self inevitable shortcoming, when as larger in amount of communication data between and label and reader more in number of tags, reading tag time delay is longer.
Compare determinacy agreement, randomness protocol identification speed is fast, but has unstable operation interval, and theoretical throughput is limited in 1/e, can cause " the hungry problem of label ", and specific label may all cannot be correctly validated within a very long time.Determinacy agreement can provide 100% recognition success rate, thereby is widely used.
Summary of the invention
The object of the invention is to overcome the many labels of traditional Internet of Things and read the deficiency in anti-collision method design, by based on scale-of-two, through several times iteration, fast search conflict label; Can from numerous labels, obtain required label prefix; The present invention has further improved search speed in possessing great-jump-forward dynamic search algorithm and prefix random challenge tree protocol advantage, thereby improves greatly search efficiency on the basis that is not significantly increased resource load.
For solving the problems of the technologies described above, the invention provides a kind of many label anti-confliction methods of Internet of Things, comprising:
Read write line broadcast message, region interior label responds according to self ID;
According to region interior label quantity and label self ID length information, read write line obtains the request length of corresponding current conflict bit;
Start query script, obtain the request prefix of current conflict bit, and described request prefix is pressed into stack;
In the time that read write line is carried out request, from described stack, obtain the also broadcast of current request prefix, judge whether that conflict occurs, if having, read write line reenters query script, if do not have, respective labels is made to differentiation, repeats to judge until described stack is sky.
Further, in many label anti-confliction methods of described Internet of Things, also comprise step: all labels in read write line initialization active region.
Further, in many label anti-confliction methods of described Internet of Things, the request length of described current conflict bit is less than total bit number that read write line receives that information clashes.
Further, in many label anti-confliction methods of described Internet of Things, described read write line is in the process of search label, and region interior label quantity is constant.
Further, in many label anti-confliction methods of described Internet of Things, in the time of query script original state, the request length of described current conflict bit is default length.
Further, in many label anti-confliction methods of described Internet of Things, when state after query script original state, the request length of described current conflict bit is l=log
2l; Wherein, l represents the request length of current conflict bit, and L represents label self ID length.
Many label anti-confliction methods and the system of Internet of Things provided by the invention, have following beneficial effect: number of tags the do not limit system of the present invention to synchronization identification, and the label in read write line signal cover, can identify that to possess extensibility better; In addition, read write line is in read-write and identification label process, and occupying system resources is limited, in the situation that not being significantly increased system loading, has improved the recognition efficiency of read write line; Further, the information bit number transmitting between read write line and label is extremely low, thereby causes the required communication bandwidth of read write line there is no specific (special) requirements.
Accompanying drawing explanation
Fig. 1 is many label anti-confliction methods schematic diagram of the Internet of Things of the preferred embodiment of the present invention;
Fig. 2 is many label anti-confliction methods schematic diagram of the Internet of Things of the embodiment of the present invention 1.
Embodiment
Many label anti-confliction methods of Internet of Things the present invention being proposed below in conjunction with the drawings and specific embodiments are described in further detail.According to the following describes and claims, advantages and features of the invention will be clearer.It should be noted that, accompanying drawing all adopts very the form of simplifying and all uses non-ratio accurately, only in order to convenient, the object of the aid illustration embodiment of the present invention lucidly.
Please refer to Fig. 1, it is many label anti-confliction methods schematic diagram of the Internet of Things of the preferred embodiment of the present invention.As shown in Figure 1, the invention provides a kind of many label anti-confliction methods of Internet of Things, comprise the following steps:
Step 1: all labels in read write line initialization active region, special, described read write line is in the process of search label, and region interior label quantity is constant.
Step 2: read write line broadcast message, region interior label responds according to self ID;
Step 3: according to region interior label quantity and label self ID length information, read write line obtains the request length of corresponding current conflict bit;
Step 4: start query script, obtain the request prefix of current conflict bit, and described request prefix is pressed into stack;
In the time of query script original state, the request length of described current conflict bit is default length, as shown in table 1; When state after query script original state, the request length of described current conflict bit is l=log
2l; Wherein, l represents the request length of current conflict bit, and L represents label self ID length.And the request length of described current conflict bit is less than total bit number that read write line receives that information clashes, otherwise get conflict bit total length.
| Number of tags | 4-12 | 23-19 20-43 | 44-79 | 80-161 162-319 320-500 |
| Optimize length | 6 | 7 8 | 9 | 10 11 12 |
Table 1
Step 5: in the time that read write line is carried out request, obtain current request prefix broadcast from described stack, judged whether that conflict occurs, if there is read write line to reenter query script, if no, respective labels is made to differentiation, repeat to judge until described stack is sky.Especially, in the time clashing, by Manchester's cde, read write line can be judged the tag bits position clashing accurately.
Suppose the cog region at read write line, have n label to be identified, its tag identifier is expressed as by the binary bit sequence that length is L: q
l-1... q
1, q
0; Req () represents the request that algorithm sends, and it is specifically set: Req (q
l-1q
k+1q
k): read write line broadcast request, request prefix sequence k (0≤k≤L-1) is (q
l-1q
k+1q
k) label; Satisfactory label is activated (other label enters sleep state), and sends the remaining bit (q of this tag identifier
k-1q
1q
0) give read write line as response, undesirable label is kept silent.
For the tag identifier prefix that obtains needing, independently " query script " of the present invention's design, broadcasts the request with the bit clashing, and the label being activated responds with the correct binary sequence of relevant position.First, request Req (q
l-1q
1q
0), if q
i=1(0≤i≤L-1), represent that this position is read write line request position, no person, q
i=0.Thereby read write line contains by broadcast packet the bit position that the request notified tag of this sequence clashes.At this moment, the label that is activated responds Res (q
n-1q
1q
0), N=2
l, l is the length (actual request figure place) of required tag identifier bit sequence.If the decimal value of this sequence is i (0≤i≤N-1), q
i=1, no person is 0.Start from from k bit if tag identifier clashes, read write line will attempt getting the prefix (q that comprises l conflict bit
l-1q
k+1q
k).Because, except the l bit clashing, the value of other bit, read write line is known, as long as it is correctly decoded the response that label is sent, just can obtain by the right value of conflict bit.
[embodiment 1]
Please refer to Fig. 2, it is many label anti-confliction methods schematic diagram of the Internet of Things of the embodiment of the present invention 1.Fig. 2 is that FSBP is for the real case that has five label work in differential threshold.Wherein: tag1 (00111010), tag2 (01001011), tag3 (10000101), tag4 (10011001) and tag5 (10011100).According to flow process noted earlier, at read write line normal request label information, at this moment, all 8 of ID will clash, and cause read write line to enter " query script ".In " query script ", be 8 because number of tags is 5, ID length, thus lF=l=3.Thereby first read write line asks first three bit of ID: Req (11100000) (that is: the 5th, 6,7 bits).For the response (00000010) of Tag1, read write line obtains its front three for (001); For the response (00000100) of tag2, can obtain its front three for (010); The response of tag3-5 is (00010000), because its front three is identical, is (100).At this moment,, in the time of read write line normal request Req (100), conflict, by the 0th, 2,3 and 4 generations at tag3-5 again, causes read write line to enter a new round " query script ".In " query script " by a new round, read write line will obtain respectively three new prefixes: (100001), (100110) and (100111).At this moment, read write line is initiated normal request by new prefix, and tag3-5 is distinguished completely.
To sum up, number of tags the do not limit system of the present invention to synchronization identification, the label in read write line signal cover, can identify that to possess extensibility better; In addition, read write line is in read-write and identification label process, and occupying system resources is limited, in the situation that not being significantly increased system loading, has improved the recognition efficiency of read write line; Further, the information bit number transmitting between read write line and label is extremely low, thereby causes the required communication bandwidth of read write line there is no specific (special) requirements.
Foregoing description is only the description to preferred embodiment of the present invention, the not any restriction to the scope of the invention, and any change, modification that the those of ordinary skill in field of the present invention does according to above-mentioned disclosure, all belong to the protection domain of claims.
Claims (6)
1. many label anti-confliction methods of Internet of Things, is characterized in that, comprising:
Read write line broadcast message, region interior label responds according to self ID;
According to region interior label quantity and label self ID length information, read write line obtains the request length of corresponding current conflict bit;
Start query script, obtain the request prefix of current conflict bit, and described request prefix is pressed into stack;
In the time that read write line is carried out request, from described stack, obtain the also broadcast of current request prefix, judge whether that conflict occurs, if having, read write line reenters query script, if do not have, respective labels is made to differentiation, repeats to judge until described stack is sky.
2. many label anti-confliction methods of Internet of Things as claimed in claim 1, is characterized in that, also comprise step: all labels in read write line initialization active region.
3. many label anti-confliction methods of Internet of Things as claimed in claim 1, is characterized in that, the request length of described current conflict bit is less than total bit number that read write line receives that information clashes.
4. many label anti-confliction methods of Internet of Things as claimed in claim 1, is characterized in that, described read write line is in the process of search label, and region interior label quantity is constant.
5. many label anti-confliction methods of Internet of Things as claimed in claim 1, is characterized in that, in the time of query script original state, the request length of described current conflict bit is default length.
6. many label anti-confliction methods of Internet of Things as claimed in claim 1, is characterized in that, when state after query script original state, the request length of described current conflict bit is l=log
2l; Wherein, l represents the request length of current conflict bit, and L represents label self ID length.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410127165.5A CN103902944A (en) | 2014-03-31 | 2014-03-31 | Multi-tag collision prevention method of internet of things |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410127165.5A CN103902944A (en) | 2014-03-31 | 2014-03-31 | Multi-tag collision prevention method of internet of things |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103902944A true CN103902944A (en) | 2014-07-02 |
Family
ID=50994257
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410127165.5A Pending CN103902944A (en) | 2014-03-31 | 2014-03-31 | Multi-tag collision prevention method of internet of things |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103902944A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105844318A (en) * | 2015-01-14 | 2016-08-10 | 南通格物电子科技有限公司 | Radio frequency identification tag, tag identification method, tag identification device and tag reader |
| CN110135211A (en) * | 2019-04-01 | 2019-08-16 | 山东华翼微电子技术股份有限公司 | A kind of method and device that can quick and precisely take inventory RFID tag quantity |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008082089A1 (en) * | 2006-12-29 | 2008-07-10 | Chung-Ang University Industry-Academy Cooperation Foundation | Radio frequency identification tag and reader, method of identifying tag, anti-collision method for tag |
| CN101324916A (en) * | 2008-07-16 | 2008-12-17 | 华南理工大学 | Label recognition anti-collision method for RFID system |
| CN101430755A (en) * | 2008-11-13 | 2009-05-13 | 王新锋 | Label recognition anti-collision processing method in radio frequency recognition technology |
| CN103208019A (en) * | 2013-04-17 | 2013-07-17 | 广西南宁市东森动力信息科技有限公司 | Multi-way tree anti-collision algorithm applicable to radio frequency identification (RFID) system |
-
2014
- 2014-03-31 CN CN201410127165.5A patent/CN103902944A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008082089A1 (en) * | 2006-12-29 | 2008-07-10 | Chung-Ang University Industry-Academy Cooperation Foundation | Radio frequency identification tag and reader, method of identifying tag, anti-collision method for tag |
| CN101324916A (en) * | 2008-07-16 | 2008-12-17 | 华南理工大学 | Label recognition anti-collision method for RFID system |
| CN101430755A (en) * | 2008-11-13 | 2009-05-13 | 王新锋 | Label recognition anti-collision processing method in radio frequency recognition technology |
| CN103208019A (en) * | 2013-04-17 | 2013-07-17 | 广西南宁市东森动力信息科技有限公司 | Multi-way tree anti-collision algorithm applicable to radio frequency identification (RFID) system |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105844318A (en) * | 2015-01-14 | 2016-08-10 | 南通格物电子科技有限公司 | Radio frequency identification tag, tag identification method, tag identification device and tag reader |
| CN110135211A (en) * | 2019-04-01 | 2019-08-16 | 山东华翼微电子技术股份有限公司 | A kind of method and device that can quick and precisely take inventory RFID tag quantity |
| CN110135211B (en) * | 2019-04-01 | 2022-02-18 | 山东华翼微电子技术股份有限公司 | Method and device capable of rapidly and accurately checking number of RFID radio frequency tags |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8477016B2 (en) | Method for identifying tags using adaptive binary tree splitting technique in RFID system and RFID system therefore | |
| CN105224970B (en) | A kind of RFID anti-collision method | |
| KR100637076B1 (en) | Optimized binary search with anti-collision mathod and system | |
| CN103020568B (en) | Based on the pretreated RFID anti-collision method of label ID | |
| CN102024163B (en) | Anti-collision method with packet previewing mechanism | |
| 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 | |
| Xu et al. | An improved dynamic framed slotted ALOHA anti-collision algorithm based on estimation method for RFID systems | |
| CN104331679B (en) | A kind of RFID tag anti-collision method based on physical-layer network coding | |
| CN105046181B (en) | A kind of certainty anti-collision algorithm of many prefix matchings based on inquiry tree method | |
| Kim et al. | Improved 4-ary query tree algorithm for anti-collision in RFID system | |
| CN103902944A (en) | Multi-tag collision prevention method of internet of things | |
| CN103218635A (en) | RFID (radio frequency identification) anti-collision method based on mixed multiway tree searching | |
| KR100693006B1 (en) | ID anti-collision method using data structure to be applied to RFID system | |
| CN108090386A (en) | A kind of multicycle RFID anti-collision algorithm decomposed based on binary tree | |
| CN101231686A (en) | Method for recognizing contrary collision of inquiry tree radio frequency labels of amalgamation database | |
| Sahoo et al. | Improving rfid system to read tags efficiently | |
| Di et al. | A RFID anti-collision algorithm based on multithread regressive-style binary system | |
| CN106022185A (en) | Continuous-detection-mechanism-based anti-collision algorithm for EPC Gen2 protocol | |
| KR100805034B1 (en) | System and method for rfid tags identification using the grouping | |
| CN102682310B (en) | Method for identifying multiple tags | |
| Wang et al. | Anti-collision algorithm for RFID tag identification using fast query tree | |
| CN101414345B (en) | Method and system for answering radio frequency identification signal, label and reader | |
| CN101436245A (en) | Label anti-collision method in radio frequency recognition system | |
| CN114330393B (en) | Method for identifying lost tag of large RFID system based on balanced collision binary tree |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20140702 |