CN102479316A - Binary anti-collision identification method for serial numbers of RFID tags - Google Patents
Binary anti-collision identification method for serial numbers of RFID tags Download PDFInfo
- Publication number
- CN102479316A CN102479316A CN2010105764070A CN201010576407A CN102479316A CN 102479316 A CN102479316 A CN 102479316A CN 2010105764070 A CN2010105764070 A CN 2010105764070A CN 201010576407 A CN201010576407 A CN 201010576407A CN 102479316 A CN102479316 A CN 102479316A
- Authority
- CN
- China
- Prior art keywords
- time slot
- rfid electronic
- fork
- sequence number
- reader
- 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
- Radar Systems Or Details Thereof (AREA)
Abstract
The invention discloses a binary anti-collision identification method for serial numbers of RFID tags. In the method, the conception of taking a bit of the tag serial number of Manchester encoding as a query node to search bit by bit based on stack is provided, and the stack is introduced for storing the number of layers of query time slots so as to perform binary tree division identification segment by segment. On the basis of avoiding input of useless information, the number of time slots in the query process and the data communication traffic in the time slots are reduced so as to improve the identification efficiency of a larger amount of RFID tags. For the binary anti-collision identification method, the serial number of the RFID tag is coded by the Manchester encoding, all data collision bits of the serial numbers of a plurality of RFID tags in a reader are identified, the serial numbers are segmented according to the collision bits, the bit is used as a search node so as to perform searching in each segment of serial number, when a plurality of tags respond in some one time slot, the binary tree division is performed segment by segment, until the serial numbers of all the RFID tags are identified.
Description
Technical field
The present invention relates to a kind of binary-coded serial numbers anti-collision method of discerning several RFID electronic tags simultaneously, belong to electronics manufacturing and information application.
Background technology
Along with the fast development of electronics manufacturing and information application technology, the RFID electronic tag implanted as data message carrier and feedback terminal has become comparatively ripe and feasible technological means in the various product.
As the RFID electronic tag is implanted in the rubber tyre, the tire that has this type of electronic tag from dispatch from the factory, maintenance between the operating period in the whole life of scrapping, all identification codes all intactly are kept in the RFID electronic tag.When product is sent into maintenance or is normally used; Important informations such as above-mentioned identification code can be sent out/receive, read and discern; Therefore the user mode of tire can be monitored in real time; Improved delivery vehicles such as automobile security performance, realized the strange land network management, the RFID electronic tag is equivalent to play the effect of " electronic ID card ".
In existing RFID electronic tag using system, tag serial number anti-collision recognition technology is a key algorithm, also is the precondition of using, discern several labels in the same area simultaneously.So-called anti-collision algorithms comprises label anti-confliction algorithm and reader anti-collision algorithms.
As the algorithm of finalizing the design really in the label anti-confliction algorithm, present binary mode collision-proof algorithm realizes having binary search algorithm, retrusive Index Algorithm and the dynamic tree algorithm of great-jump-forward etc.
When using binary search algorithm; Need set up a virtual address (ID) for each label; Reader in the system can specify the address in the particular range to come reading tag, and these labels must be made the inquiry of reader and being replied, and other labels are then remained silent.If at this moment there are a plurality of labels to upload data simultaneously address conflict will take place, reader can accurately detect the bit that ID clashes, and then finds out corresponding label.The shortcoming of this algorithm is; When having several labels; Need repeatedly carry out the operation that the location, location is confirmed; On average need the individual time slot of log (2N+1) like the single label of identification from N label, identify N the needed time slot of label and add up to N* (log2N+1), adopt this algorithm can expend the long time.When usually RFID electronic tag quantity reaches tens or up to a hundred, wait for that the recognition time of sequence number is insufferable.
Retrusive Index Algorithm, the dynamic tree algorithm of great-jump-forward; In the process of N label of identification, needing the timeslot number of inquiry is 2N-1; Reduced the partial query timeslot number though compare to binary search algorithm; It is longer that but the computing recognition time still shows, and is unfavorable for the identification of larger amt RFID electronic tag in the same area.
Summary of the invention
The binary mode collision-proof recognition methods of RFID electronic tag sequence number according to the invention; Be to solve above-mentioned existing issue and propose a kind of binary mode collision-proof method based on storehouse; Bit with the tag serial number of Manchester's cde is that query node is searched for by turn, and introduces the number of plies that storehouse preserves the inquiry time slot to carry out binary tree division identification piecemeal.
The objective of the invention is to; On the basis of avoiding garbage transmission between RFID electronic tag and the system's reader; Improve the recognition efficiency of larger amt RFID electronic tag in the same area through data traffic in the total timeslot number in the minimizing query script, the minimizing time slot to shorten the information transmission time.
For realizing the foregoing invention purpose, the binary mode collision-proof recognition methods of said RFID electronic tag sequence number is following:
RFID electronic tag sequence number adopts Manchester's cde,
The sequence number of several RFID electronic tags is identified total data conflict position in reader, with the sequence number segmentation, in each section sequence number, is that search node is searched for by bit according to the conflict position in turn,
When inquiring the conflict time slot, carry out the binary tree division piecemeal, up to the sequence number that identifies whole RFID electronic tags.
Like above-mentioned basic scheme; Manchester's cde is concrete collision position in the identification RFID electronic tag sequence number effectively; Therefore can sequence number be carried out segmentation according to each collision position, when having the k position to clash in the sequence number, can be divided into the k section.
In the described method, be that the search/query node is searched for, can reduce total timeslot number of searching for by turn after the segmentation effectively with the bit of sequence number.And; When inquiring the conflict time slot, divide the numerical value that can feed back this conflict position simply through binary tree; Be between RFID electronic tag and the system's reader in whole time slots data traffic be able to simplify and reduce, the time of therefore in every section sequence number, searching for by bit shortens greatly.
For further improving segmentation, the data communication accuracy during search/query by turn, this patent is introduced storehouse in the binary mode collision-proof identification, promptly quotes the number of plies that storehouse is preserved the inquiry time slot.Particularly,
Adopt storehouse to be kept at the sequence number search depth numerical value in all segmentations, promptly preserve the number of plies of inquiry time slot.
The number of plies of inquiry time slot, promptly the number of plies of corresponding node adds 1 in binary tree.
Adopt storehouse to preserve the number of plies of inquiry time slot, can practice thrift the internal memory of reader effectively, significantly, and can guarantee segmentation, search for by turn to be unidirectional, irreversible.
Comparatively preferably improvement project is, sets up a counter to calculate the current search depth value for each RFID electronic tag, in reader, sets up the register as storehouse.
Based on the above-mentioned design concept of this patent, said binary mode collision-proof recognition methods includes following execution in step:
(1) reader sends request instruction to whole RFID electronic tags, and the equal response request instruction of RFID electronic tag also is sent to reader with sequence number separately;
(2) reader is judged to have conflict bit position and quantity through comparative sequences number, according to the conflict position with the sequence number segmentation;
(3) the initial interrogation number of plies and fork number are set the number of plies i=1 that inquires about time slot, and the fork of inquiry time slot is counted j=1;
(4) number of plies of reader inquiry time slot and fork number send reference sequences number, and corresponding binary tree node produces an inquiry time slot;
(5) all whether the reference sequences that sends according to reader of RFID electronic tags number is selected to reply, and the different time-gap state of reader during according to the inquiry time slot adjusted searching route;
When having a plurality of RFID electronic tags to reply during the inquiry time slot, judge the fork number of current inquiry time slot, if full fork (by the binary tree division, j=2 is full fork) makes i=i+1, j=1 return (4); If be not full fork, then the number of plies with current inquiry time slot is saved in the storehouse, makes i=i+1 then, and j=1 returns (4);
When inquiry does not have the RFID electronic tag during time slot and replys, judge the fork number of current inquiry time slot,, return (4), carry out the inquiry of another fork time slot if, then make j=2 for full fork; If full fork is then judged the storehouse situation, during the storehouse non-NULL, the number of plies of the inquiry time slot in the storehouse is popped, return (4), another fork time slot of inquiry last layer; When storehouse is empty, poll-final then, all the sequence number of RFID electronic tags is accomplished for identification;
When having a unique RFID electronic tag to reply during the inquiry time slot, then reader identifies this RFID electronic tag; Judge the fork number of current inquiry time slot,, return (4) if, then make j=2 not for full fork; If full fork is then judged the storehouse situation, if the storehouse non-NULL is popped the number of plies of the inquiry time slot in the storehouse, return (4), another fork time slot of inquiry last layer; When storehouse is empty, then poll-final, all sequence number of RFID electronic tag identification completion.
Content to sum up, the binary mode collision-proof recognition methods of RFID electronic tag sequence number of the present invention has following advantage:
1, described binary mode collision-proof recognition methods has less inquiry number of timeslots, and when the RFID electronic tag in the same area (as reaching more than 300) more for a long time, the inquiry timeslot number of minimizing is more outstanding and obvious;
2, be applied to the RFID electronic labelling system, the volume of transmitted data between reader and the label is less, and no matter how much interior RFID electronic tag quantity of the same area is, its transmission bit rate can be controlled in 2*10 all the time
4Be (2*1024?) within;
Say with regard to the number that successfully transmits the label information bag in the unit time slot that 3, the present invention has the interior RFID electronic tag of higher effective service rate, particularly the same area more for a long time, this type of gap is more obvious.
For example, when RFID electronic tag to be identified reaches 300 when above, the retrusive Index Algorithm rests on effective service rate 0.5, and binary mode collision-proof recognition methods of the present invention is then far above this value.
4, combine above-mentioned advantage, binary mode collision-proof recognition methods of the present invention is particularly useful for using in a large number the place and the field of label, like encased conveying etc.
Description of drawings
Combine accompanying drawing that the present invention is done further explanation at present.
Fig. 1 is the process flow diagram of said binary mode collision-proof recognition methods;
Fig. 2 is total timeslot number synoptic diagram of said binary mode collision-proof recognition methods;
Fig. 3 is a tag segments identification synoptic diagram;
Embodiment
In RFID electronic tag using system, set up a counter to calculate the current search depth value for each RFID electronic tag, in reader, set up register as storehouse.
Adopt storehouse to be kept at the sequence number search depth numerical value in all segmentations, promptly preserve the number of plies of inquiry time slot.
The sequence number of several RFID electronic tags is identified total data conflict position in reader, with the sequence number segmentation, in each section sequence number, is that search node is searched for by bit according to the conflict position in turn,
When inquiring the conflict time slot, carry out the binary tree division piecemeal, up to the sequence number that identifies whole RFID electronic tags.
Like Fig. 1, Fig. 2 and shown in Figure 3; For following 4 RFID electronic tags of the request command that uses simultaneously and all respond reader and sent, its sequence number is respectively Tag1:11001010, Tag2:11001011; Tag3:11101010, Tag4:11101111.
Wherein, the conflict position has 3, lays respectively at the 3rd, the 6th and the 8th of sequence number, therefore sequence number is divided into 3 sections by collision position.
At first be divided into two crowds 110 and 111 by 11X, by that analogy, 01X can be divided into two crowds 010 and 011, and 1X can be divided into two crowds 10 and 11.
Adopt the binary mode collision-proof recognition methods of said RFID electronic tag sequence number, between reader and label, carry out following steps:
Reader sends request instruction to whole RFID electronic tags, and the equal response request instruction of Tag1, Tag2, Tag3 and Tag4 also is sent to reader with sequence number separately;
Reader judges to have conflict bit position and quantity that with the sequence number segmentation, promptly sequence number is divided into three sections 11X 01X 1X (X representes the conflict position) according to the conflict position through comparative sequences number;
The initial interrogation number of plies and fork number are set the number of plies i=1 that inquires about time slot, and the fork of inquiry time slot is counted j=1;
Reader is according to i=1, and the reference sequences that j=1 confirms to send number is 110, and the sequence number front three is 110 tag responses, and promptly Tag1 and Tag2 reply, and their sequence number is sent to reader.This inquires about time slot is the 1st time slot, because 2 tag responses are arranged, judges that current time slots is non-full fork, so the number of plies of time slot (promptly 1) is saved in the storehouse, makes i=i+1, j=1 then;
Reader is according to i=2, and the reference sequences that j=1 confirms to send number is 110010, and the sequence number first six digits is 110010 tag responses, and promptly Tag1 and Tag2 reply, and their sequence number is sent to reader.This inquires about time slot is the 2nd time slot, because two tag responses are arranged, judges that current time slots is non-full fork, so the number of plies of time slot (promptly 2) is saved in the storehouse, makes i=i+1, j=1 then;
Reader is according to i=3, and the reference sequences that j=1 confirms to send number is 11001010, and sequence number is 11001010 tag responses; Be that Tag1 replys; This inquires about time slot is the 3rd time slot, because unique tag responses is arranged, reader identifies Tag1; Judge that current time slots is non-full fork, then makes j=2;
Reader is according to i=3, and the reference sequences that j=2 confirms to send number is 11001011, and sequence number is 11001011 tag responses; Be that Tag2 replys, this inquires about time slot is the 4th time slot, because unique tag responses is arranged; So reader identifies Tag2; Judge that current time slots is full fork, and the storehouse non-NULL, so make i=2 according to the principle of storehouse LIFO;
Reader is according to i=2, and the reference sequences that j=2 confirms to send number is 110011, and the sequence number first six digits is 110011 tag responses; Then do not have tag responses, this inquires about time slot is the 5th time slot, judges that current time slots is full fork; And the storehouse non-NULL, so make i=1 according to the principle of storehouse LIFO;
Reader is according to i=1, and the reference sequences that j=2 confirms to send number is 111, and the sequence number front three is 111 tag responses; Be that Tag3 and Ta4 reply, this inquires about time slot is the 6th time slot, judges that current time slots is full fork; Need not to preserve the time slot number of plies, make i=i+1, j=1;
Reader is according to i=2, and the reference sequences that j=1 confirms to send number is 111010, and the sequence number first six digits is 111010 tag responses; Be that Tag3 replys; This inquires about time slot is the 7th time slot, because unique tag responses is arranged, reader identifies Tag3; Judge that current time slots is non-full fork, then makes j=2;
Reader is according to i=2, and the reference sequences that j=2 confirms to send number is 111011, and the sequence number first six digits is 111011 tag responses; Be that Tag4 replys, this inquires about time slot is the 8th time slot, because unique tag responses is arranged; So reader identifies Tag4, judge that current time slots is full fork, storehouse is empty; Then entire identification process finishes, and reader successfully identifies Tag1, Tag2, Tag3 and Tag4.
Concrete stack manipulation process is referring to as shown in table 1 below,
Claims (4)
1. the binary mode collision-proof recognition methods of a RFID electronic tag sequence number is characterized in that:
RFID electronic tag sequence number adopts Manchester's cde,
The sequence number of several RFID electronic tags is identified total data conflict position in reader, with the sequence number segmentation, in each section sequence number, is that search node is searched for by bit according to the conflict position in turn,
When inquiring certain time slot when a plurality of tag responses is arranged, carry out the binary tree division piecemeal, up to the sequence number that identifies whole RFID electronic tags.
2. the binary mode collision-proof recognition methods of RFID electronic tag sequence number according to claim 1 is characterized in that: adopt storehouse to be kept at the sequence number search depth numerical value in all segmentations, promptly preserve the number of plies of inquiry time slot.
3. the binary mode collision-proof recognition methods of RFID electronic tag sequence number according to claim 2 is characterized in that: for each RFID electronic tag is set up a counter with calculating current search depth value,
In reader, set up register as storehouse.
4. the binary mode collision-proof recognition methods of RFID electronic tag sequence number according to claim 3 is characterized in that: include following execution in step,
(1) reader sends request instruction to whole RFID electronic tags, and the equal response request instruction of RFID electronic tag also is sent to reader with sequence number separately;
(2) reader is judged to have conflict bit position and quantity through comparative sequences number, according to the conflict position with the sequence number segmentation;
(3) the initial interrogation number of plies and fork number are set the number of plies i=1 that inquires about time slot, and the fork of inquiry time slot is counted j=1;
(4) reader sends reference sequences number according to the number of plies of inquiry time slot and fork number, and corresponding binary tree node produces an inquiry time slot;
(5) all whether the reference sequences that sends according to reader of RFID electronic tags number is selected to reply, and the different time-gap state of reader during according to the inquiry time slot adjusted searching route;
When having a plurality of RFID electronic tags to reply during the inquiry time slot, judge the fork number of current inquiry time slot, if full fork (by the binary tree division, j=2 is full fork) makes i=i+1, j=1 returns (4); If be not full fork, then the number of plies with current inquiry time slot is saved in the storehouse, makes i=i+1 then, and j=1 returns (4);
When inquiry does not have the RFID electronic tag during time slot and replys, judge the fork number of current inquiry time slot,, return (4), carry out the inquiry of another fork time slot if, then make j=2 for full fork; If full fork is then judged the storehouse situation, during the storehouse non-NULL, the number of plies of the inquiry time slot in the storehouse is popped, return (4), another fork time slot of inquiry last layer; When storehouse is empty, poll-final then, all the sequence number of RFID electronic tags is accomplished for identification;
When having a unique RFID electronic tag to reply during the inquiry time slot, then reader identifies this RFID electronic tag; Judge the fork number of current inquiry time slot,, return (4) if, then make j=2 not for full fork; If full fork is then judged the storehouse situation, during the storehouse non-NULL, the number of plies of the inquiry time slot in the storehouse is popped, return (4), another fork time slot of inquiry last layer; When storehouse is empty, then poll-final, all sequence number of RFID electronic tag identification completion.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105764070A CN102479316A (en) | 2010-11-25 | 2010-11-25 | Binary anti-collision identification method for serial numbers of RFID tags |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105764070A CN102479316A (en) | 2010-11-25 | 2010-11-25 | Binary anti-collision identification method for serial numbers of RFID tags |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102479316A true CN102479316A (en) | 2012-05-30 |
Family
ID=46091956
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010105764070A Pending CN102479316A (en) | 2010-11-25 | 2010-11-25 | Binary anti-collision identification method for serial numbers of RFID tags |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102479316A (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103020568A (en) * | 2012-12-27 | 2013-04-03 | 南京三宝科技股份有限公司 | RFID (radio frequency identification) anti-collision method based on tag ID preprocessing |
| CN105844318A (en) * | 2015-01-14 | 2016-08-10 | 南通格物电子科技有限公司 | Radio frequency identification tag, tag identification method, tag identification device and tag reader |
| CN108090386A (en) * | 2017-12-23 | 2018-05-29 | 北京邮电大学 | A kind of multicycle RFID anti-collision algorithm decomposed based on binary tree |
| CN113554134A (en) * | 2021-07-23 | 2021-10-26 | 三一石油智能装备有限公司 | Fracturing pump monitoring method and device, storage medium and fracturing pump |
| CN113836961A (en) * | 2021-11-26 | 2021-12-24 | 广州优刻谷科技有限公司 | Method and system for estimating quantity of passive ultrahigh frequency RFID tags |
| CN111523337B (en) * | 2020-04-21 | 2023-06-09 | 中煤科工集团重庆研究院有限公司 | Anti-collision method based on label serial number sliding window iterative grouping |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1924883A (en) * | 2005-08-31 | 2007-03-07 | 中国科学院计算技术研究所 | Solution for multiple labels collision in RF recognition system |
| CN101079096A (en) * | 2007-06-13 | 2007-11-28 | 华南理工大学 | Multiple tag dynamic bit arbitration anti-collision method for RFID system |
| CN101151625A (en) * | 2005-03-10 | 2008-03-26 | Sk电信有限公司 | Tag anti-collision RFID system and method for tag identification |
-
2010
- 2010-11-25 CN CN2010105764070A patent/CN102479316A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101151625A (en) * | 2005-03-10 | 2008-03-26 | Sk电信有限公司 | Tag anti-collision RFID system and method for tag identification |
| CN1924883A (en) * | 2005-08-31 | 2007-03-07 | 中国科学院计算技术研究所 | Solution for multiple labels collision in RF recognition system |
| CN101079096A (en) * | 2007-06-13 | 2007-11-28 | 华南理工大学 | Multiple tag dynamic bit arbitration anti-collision method for RFID system |
Non-Patent Citations (4)
| Title |
|---|
| 《计算机工程与应用》 20070625 姜丽芬，卢桂章，辛运帏 射频识别***中的防碰撞算法研究 29-32 2-3 第43卷, 第15期 * |
| 姜丽芬，卢桂章，辛运帏: "射频识别***中的防碰撞算法研究", 《计算机工程与应用》, vol. 43, no. 15, 25 June 2007 (2007-06-25), pages 29 - 32 * |
| 江岸，伍继雄，黄生叶，李曾妍，何怡刚: "改进的RFID二进制搜索防碰撞算法", 《计算机工程与应用》, vol. 45, no. 5, 3 April 2009 (2009-04-03), pages 229 - 235 * |
| 陈炳才，徐东升，顾国昌，郭黎利: "一种基于堆栈存储的RFID防冲突算法", 《计算机应用》, vol. 29, no. 6, 26 June 2009 (2009-06-26), pages 1483 - 1486 * |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103020568A (en) * | 2012-12-27 | 2013-04-03 | 南京三宝科技股份有限公司 | RFID (radio frequency identification) anti-collision method based on tag ID preprocessing |
| CN103020568B (en) * | 2012-12-27 | 2016-04-20 | 南京三宝科技股份有限公司 | Based on the pretreated RFID anti-collision method of label ID |
| CN105844318A (en) * | 2015-01-14 | 2016-08-10 | 南通格物电子科技有限公司 | Radio frequency identification tag, tag identification method, tag identification device and tag reader |
| CN108090386A (en) * | 2017-12-23 | 2018-05-29 | 北京邮电大学 | A kind of multicycle RFID anti-collision algorithm decomposed based on binary tree |
| CN111523337B (en) * | 2020-04-21 | 2023-06-09 | 中煤科工集团重庆研究院有限公司 | Anti-collision method based on label serial number sliding window iterative grouping |
| CN113554134A (en) * | 2021-07-23 | 2021-10-26 | 三一石油智能装备有限公司 | Fracturing pump monitoring method and device, storage medium and fracturing pump |
| CN113554134B (en) * | 2021-07-23 | 2024-05-31 | 三一石油智能装备有限公司 | Fracturing pump monitoring method and device, storage medium and fracturing pump |
| CN113836961A (en) * | 2021-11-26 | 2021-12-24 | 广州优刻谷科技有限公司 | Method and system for estimating quantity of passive ultrahigh frequency RFID tags |
| CN113836961B (en) * | 2021-11-26 | 2022-02-11 | 广州优刻谷科技有限公司 | Method and system for estimating quantity of passive ultrahigh frequency RFID tags |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101866413B (en) | Multi-label anti-collision method based on grouping mechanism and jumping dynamic binary recognition | |
| Wang | Enhanced binary search with cut-through operation for anti-collision in RFID systems | |
| CN103020568B (en) | Based on the pretreated RFID anti-collision method of label ID | |
| CN102479316A (en) | Binary anti-collision identification method for serial numbers of RFID tags | |
| CN102024163B (en) | Anti-collision method with packet previewing mechanism | |
| CN103020569B (en) | A kind of radio-frequency identification multi-label anti-collision method | |
| CN107609611A (en) | A kind of multiclass formation gathering method based on large-scale radio-frequency identification system | |
| WO2009088153A1 (en) | Tag identification method, tag anti-collision method, rfid tag | |
| Gou et al. | A bit collision detection based query tree protocol for anti-collision in RFID system | |
| CN102622564A (en) | Anti-collision method for identifying multiple radio frequency identification (RFID) tabs | |
| CN103577783A (en) | Efficient self-adaptive RFID (radio frequency identification) anti-collision tracking tree algorithm | |
| CN103065112A (en) | Radio frequency identification (RFID) label anti-collision identification method based on modular arithmetic label classification | |
| CN101071471A (en) | Multi-label collision-proof method | |
| CN104331679A (en) | Radio frequency identification tag anti-collision method based on physical layer network coding | |
| KR100842959B1 (en) | Scanning-based tag identification method in rfid systems | |
| CN101697194B (en) | Data processing system and method for improving reliability of RFID application | |
| CN101324916A (en) | Label recognition anti-collision method for RFID system | |
| CN108460302A (en) | A kind of response recognition methods of RFID tag and its control device | |
| CN103971077A (en) | ALOHA anti-collision method of ultrahigh frequency RFID system based on CRC code grouping | |
| CN101430755A (en) | Label recognition anti-collision processing method in radio frequency recognition technology | |
| CN101661549B (en) | Electronic tag and answering method thereof, and method, device and system for identifying electronic tag | |
| CN102456117A (en) | Multi-tag radio-frequency identification anti-collision algorithm | |
| CN101751539B (en) | Method for estimating number of tags and reader | |
| CN101414345B (en) | Method and system for answering radio frequency identification signal, label and reader | |
| CN109766733B (en) | Radio frequency tag monitoring method based on unique collision set |
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 |
Application publication date: 20120530 |