CN106354694B - A kind of conflict position anti-collision method based on Type A - Google Patents
A kind of conflict position anti-collision method based on Type A Download PDFInfo
- Publication number
- CN106354694B CN106354694B CN201610812022.7A CN201610812022A CN106354694B CN 106354694 B CN106354694 B CN 106354694B CN 201610812022 A CN201610812022 A CN 201610812022A CN 106354694 B CN106354694 B CN 106354694B
- Authority
- CN
- China
- Prior art keywords
- uid
- order
- sel
- reader
- card
- 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 30
- 230000005540 biological transmission Effects 0.000 claims abstract description 8
- 238000010586 diagram Methods 0.000 description 4
- 229910002056 binary alloy Inorganic materials 0.000 description 2
- 230000007812 deficiency Effects 0.000 description 2
- 101100258315 Neurospora crassa (strain ATCC 24698 / 74-OR23-1A / CBS 708.71 / DSM 1257 / FGSC 987) crc-1 gene Proteins 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000003628 erosive effect Effects 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
- G06F17/141—Discrete Fourier transforms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
- G06F9/30003—Arrangements for executing specific machine instructions
- G06F9/30007—Arrangements for executing specific machine instructions to perform operations on data operands
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Physics (AREA)
- Software Systems (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Analysis (AREA)
- Data Mining & Analysis (AREA)
- Computational Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Algebra (AREA)
- Databases & Information Systems (AREA)
- Discrete Mathematics (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of conflict position anti-collision method based on Type A, wherein after method includes: the SEL+NVB order that card receives reader transmission, card successively sends UID data to reader；Reader receives UID data, while judging UID data with the presence or absence of conflict；If it exists, identification UID conflict position T+1, by low 7 bytes of the value write-in ANTI of T+1；Reader send the order of SEL+ANTI anti-collision to card feedback ANTI low 7 bytes be UID data the position T+1；Card judges T+1 judge whether T+1 is 1 according to SEL+ANTI anti-collision order, if then sending UID since T+1, otherwise enters idle state；If it does not exist, it completes to receive UID data.In the present invention, it is used by the way that an ANTI order and original SEL collocation is added, reduces the transmission of data volume.
Description
Technical field
The present invention relates to radio RF recognition technology field more particularly to a kind of conflict position anti-collision sides based on Type A
Method.
Background technique
When having multiple electronic tags in RFID system while entering reader radiofrequency field, due to interfering with each other for electronic tag
Cause the phenomenon that cannot choosing card to be known as conflicting, in order to also can be carried out read-write operation when clashing, just needs to propose to prevent
Collision method realizes card selecting operation.
The binary system tree-shaped searching algorithm being most widely used in the prior art is 14443 Type A agreement of ISO/IEC,
Type A is by the way that the UID having been received is sent back to card together with the value of the conflict position selected by reader, and card will connect
To UID and conflict position compared with the corresponding part of oneself UID, just send remaining UID to reader to realize if identical
Anti-collision.
When the shortcomings that Type A agreement is that reader receives card UID, in case of collision in card selection again, it can incite somebody to action
The UID and conflict position having been received send back card together to complete card selection, do so and not only increase reader and card
Between the data volume that sends, the data length whether card internal judgment needs to respond reader is also added, when increasing identification
Between.
It is quite widely applied since Type A is stuck in the fields such as finance, logistics and has, so optimization Type A agreement makes
Its more efficient work just becomes necessary.
Summary of the invention
It is an object of the invention to overcome the deficiencies in the prior art, it is anti-that the present invention provides a kind of conflict position based on Type A
Collision method is used by the way that an ANTI order and original SEL collocation is added, reduces and send data volume, reduce card and need
The data volume of judgement, to reduce recognition time.
In order to solve the above-mentioned technical problem, the technical solution of this programme are as follows:
A kind of conflict position anti-collision method based on Type A, which comprises
After card receives the SEL+NVB order of reader transmission, the card successively sends UID number to the reader
According to；
The reader receives UID data, and judges UID data with the presence or absence of conflict；
If it exists, identification UID conflict position T+1, by low 7 bytes of the value write-in ANTI of T+1；
The reader sends the order of SEL+ANTI anti-collision to the card, for feeding back the low of ANTI to the card
7 bytes are the position T+1 of UID data；
The card judges T+1 judge whether the T+1 is 1, if then according to SEL+ANTI anti-collision order
UID is sent since T+1, otherwise enters idle state；
If it does not exist, it completes to receive UID data.
Applied to the existing Type A in binary system tree-shaped searching algorithm after clashing, need to conflict position assignment
Afterwards, then with the UID having been received card, this mode deficiency long there are recognition time, due to card sheet are sent jointly to
The UID of body be for reader it is unknown, set 0 when conflicting position assignment or set 1 and be not different, so directly providing all
It is 1 card that conflict, which just selects conflict position, finally can still choose a card.The technical program needs UID to add for original
Conflict position just can determine which card is selected, be revised as only needing to judge to conflict position can card selection piece, reduce the transmission of data volume, subtract
The data volume that few card needs to judge, to reduce recognition time, (i.e. reader is rushed neither to conflict position assignment without sending
The value of prominent position, it is only necessary to send order and tell card is which bit swiping of UID, the card that conflict position is 1 will be from conflict position
Start to send remaining UID to reader, reader has also just read the value of this conflict position, liquidates since reader reduces
Prominent position assignment and the operation sent naturally also just reduce the time of identification).
Preferably, the method also includes:
The card receives after first byte is SEL order, by judging described in a data determination of second byte
Order is SEL+NVB order or SEL+ANTI anti-collision order.
Preferably, a data by judging second byte determine the order for SEL+NVB order or
SEL+ANTI anti-collision order, comprising:
The a data of second byte is judged for 0, then the order is SEL+NVB order；
The a data of second byte is judged for 1, then the order is the order of SEL+ANTI anti-collision.
Preferably, the identification UID conflict position T+1, comprising:
The reader often receives one of UID data, and the counter in the reader adds one；
When the reader receives UID data transmission collision, the reader stops receiving UID data；
It obtains the counter and counts T, then UID conflict position is T+1.
In the technical scheme, for reader during receiving UID, counter T is just added 1 by every reception a data,
When the conflict occurs, it is T+1 that counter T value+1, which just represents the conflict position of UID, only need to judge that the value of this can be selected
Card operation.
Preferably, it is described into idle state be will conflict judgement after be not selected be placed in idle state；This skill
Not selected card is placed in idle state after each conflict judgement by art scheme, can prevent its quilt when conflicting next time
It chooses.
Compared with prior art, beneficial effects of the present invention:
1) present invention needs UID that conflict position is added just to can determine which is selected block by original, and the position that is changed to only to need to conflict is i.e. optional
Card, can simplify operational order, and an ANTI order is added in original Type A agreement and original SEL collocation uses, subtracts
Data volume is sent less, the data volume that card needs to judge is reduced, to reduce recognition time.
2) present invention is when the conflict occurs, after which bit swiping reader tells to card by SEL+ANTI order,
Card directly selects the card that the conflict position is 1, sends remaining UID to reader since the position that conflicts.In this process
Reader neither to conflict position assignment, does not need the value for the position that conflicts being sent to card yet, it is only necessary to receive conflict position in UID
Location information, reduce reader to the assignment operation of conflict position and the value for the position that conflicts be sent to card by antenna
The step of piece, reduces the transmission of data volume and the energy consumption of antenna, while reducing recognition time.
Detailed description of the invention
Fig. 1 is the flow diagram of the conflict position anti-collision method in the embodiment of the present invention；
Fig. 2 is the flow diagram of the conflict position anti-collision method in further embodiment of this invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that the described embodiment is only a part of the embodiment of the present invention, instead of all the embodiments.Based on this
Embodiment in invention, all other reality obtained by those of ordinary skill in the art without making creative efforts
Example is applied, shall fall within the protection scope of the present invention.
Fig. 1 is the flow diagram of the conflict position anti-collision method in the embodiment of the present invention, as shown in Figure 1, the method
Include:
S11: after card receives the SEL+NVB order of reader transmission, card successively sends UID data to reader；
S12: reader receives UID data, while judging that UID data with the presence or absence of conflict, then enter S13 if it exists；It is no
Then enter S16；
S13: identification UID conflict position T+1, by low 7 bytes of the value write-in ANTI of T+1；
S14: reader sends the order of SEL+ANTI anti-collision to card, for low 7 bytes to card feedback ANTI
For the position T+1 of UID data；
S15: card judges T+1 judge whether T+1 is 1 according to SEL+ANTI anti-collision order, if then from
T+1 start to send UID, otherwise enter idle state；
S16: it completes to receive UID data.
S11 is described further:
Firstly, when card is close to reader, reader sends REQA order, for that will be in the card wake-up of idle state
For READY state, allow to respond the order of reader；Card sends ATQA after being connected to REQA order, to reader,
The anti-collision type of card UID length and card is contained inside ATQA；Reader inspection sends back the ATQA order come, obtains
The length (0-4 byte, 0-7 byte, 0-10 byte) of UID, and determine card is using which kind of anti-collision type in launching site.
Reader sends the SEL+NVB order for reading UID, and SEL order CL1 is first read since UID first part, and SEL has
Three values CL1, CL2, CL3 respectively indicate three parts for reading UID, and UID points are 0 ~ 4 byte of first part, 5 ~ 7 word of second part
Section, 7 ~ 10 byte of Part III.NVB there are two be worth " 20 " and " 70 ", NVB be equal to " 20 " when combined with SEL, expression card from
UID first starts to send to reader；After card is connected to SEL+NVB order, card successively sends UID(card to reader
Piece sequence number).
S12 is described further:
Reader receives the UID data that card is fed back, and is receiving UID data simultaneously, is judging whether the UID data deposit
Conflicting.
S13 is described further:
Reader often receives one of UID data, and the counter in reader adds one；Reader receives UID data hair
When sending conflict, reader stops receiving UID data；It obtains counter and counts T, then UID conflicts position for T+1；Then will conflict position T
Low 7 bytes of+1 value write-in ANTI.
Reader receives the UID data that card is sent back to, and is often connected to a UID data counter and voluntarily adds one, if not sending
Collision, then receive a complete UID data, if colliding, by having received T data known to counter, also
Know it is T+1 bit swiping；Then by low 7 bytes of the value write-in ANTI for the position T+1 that conflicts, the ANTI order such as following table institute
Show:
S14 is described further:
The rows of anti-collision order SEL+ANTI of shape in reader, the reader send SEL+ANTI erosion control to the card
Prominent order, for being the position T+1 of UID data to low 7 bytes of card feedback ANTI.
S15 is described further:
Card automatically carries out T+1 after being connected to SEL+ANTI anti-collision order, according to the order of SEL+ANTI anti-collision
Multilevel iudge judges whether T+1 is 1, if multilevel iudge result T+1 is 1, UID is sent since T+1, if multilevel iudge T
+ 1 is not 1, then the card enters idle (IDLE) state, and the card into idle state no longer responds anti-collision order；Into
Idle state be will conflict judgement after be not selected be placed in idle state.
If occurring conflict situation again in above-mentioned process, S13-S15 step is recycled.
S16 is described further:
If no longer occurring conflict phenomenon in above-mentioned steps, complete to receive UID data.
In above process, card needs to detect a data for receiving second byte that first byte is SEL order
It is SEL+NVB order or SEL+ANTI anti-collision order that order, which could be distinguished, wherein a data of second byte is 0,
Then indicate that order is SEL+NVB order；The a data of second byte is 1, then order is the order of SEL+ANTI anti-collision.
Fig. 2 is the flow diagram of the conflict position anti-collision method in further embodiment of this invention, detailed process are as follows:
What S201:SEL was indicated is which part for reading UID, and the value that when beginning is SEL is 93, represents first for reading UID
Point；
S202: the value of NVB is set as 20；
S203: SEL+NVB order is sent to card；
S204: after card is connected to SEL+NVB, UID is successively sent to reader；
S205: reader successively receives UID, while judging UID with the presence or absence of conflict, if so, into S206, if it is not, then
Into
S206: reader counts received UID according to self-contained counter, and acquisition has received UID
Number T；
S207: having received digit T according to reader, and obtaining conflict position is T+1, by low 7 bytes of T+1 write-in ANTI
In, i.e., it will be in low 7 of T+1 write-in ANTI；
S208: reader sends the order of SEL+ANTI anti-collision to card；
S209: card is connected to SEL+ANTI anti-collision order, judges whether the position T+1 of UID is 1, if 1, into S210,
If not 1, then the card enters idle state；
S210: sending UID since T+1, judge whether to conflict, if so, S206 is returned to, if it is not, into S211；
S211: having received UID, sets 70 for NVB；
S212: reader sends SELECT, and wherein SELECT is made of following table:
| SEL | NVB | UID | CRC |
| 1 byte | 1 byte | 4 bytes | 1 byte |
S213: after card receives SELECT order, SAK is returned to by card, reader is connected to SAK and then illustrates to receive now
The UID arrived is whole UID, if reader is not connected to SAK, then it represents that received UID is imperfect, needs to continue to UID.
In embodiments of the present invention, it needs UID that conflict position is added just to can determine which card selected for original, is changed to only need to conflict
Position can card selection, can simplify operational order, ANTI order and original SEL collocation be added in original Type A agreement
It uses, reduces and send data volume.
Those of ordinary skill in the art will appreciate that all or part of the steps in the various methods of above-described embodiment is can
It is completed with instructing relevant hardware by program, which can store in computer readable storage medium, and storage is situated between
Matter may include: read-only memory (ROM, Read Only Memory), random access memory (RAM, Random Access
Memory), disk or CD etc..
It is carried out in addition, being provided for the embodiments of the invention a kind of conflict position anti-collision method based on Type A above
It is discussed in detail, herein should be using a specific example illustrates the principle and implementation of the invention, above embodiments
Explanation be merely used to help understand method and its core concept of the invention；At the same time, for those skilled in the art,
According to the thought of the present invention, there will be changes in the specific implementation manner and application range, in conclusion in this specification
Appearance should not be construed as limiting the invention.
Claims (5)
1. a kind of conflict position anti-collision method based on Type A, which is characterized in that the method realizes process are as follows: card receives
After the SEL+NVB order sent to reader, the card successively sends UID data to the reader；The reader connects
UID data are received, and judge UID data with the presence or absence of conflict；
If it exists, identification UID conflict position T+1, by low 7 bytes of the value write-in ANTI of T+1；
The reader sends the order of SEL+ANTI anti-collision to the card, for feeding back low 7 of ANTI to the card
Byte is the position T+1 of UID data；
The card judges T+1 judge whether the T+1 is 1, if then from T+ according to SEL+ANTI anti-collision order
1 starts to send UID, otherwise enters idle state；
If it does not exist, it completes to receive UID data.
2. conflict position according to claim 1 anti-collision method, which is characterized in that the method also includes:
The card receives after first byte is SEL order, by judging that a data of second byte determines the order
For SEL+NVB order or SEL+ANTI anti-collision order.
3. conflict position according to claim 2 anti-collision method, which is characterized in that described by judging second byte
A data determines that the order is SEL+NVB order or SEL+ANTI anti-collision order, comprising:
The a data of second byte is judged for 0, then the order is SEL+NVB order；
The a data of second byte is judged for 1, then the order is the order of SEL+ANTI anti-collision.
4. conflict position according to claim 1 anti-collision method, which is characterized in that the identification UID conflict position T+1, packet
It includes:
The reader often receives one of UID data, and the counter in the reader adds one；
When the reader receives UID data transmission collision, the reader stops receiving UID data；
It obtains the counter and counts T, then UID conflict position is T+1.
5. conflict position according to claim 1 anti-collision method, which is characterized in that the idle state that enters is that will conflict
What is be not selected after judgement is placed in idle state.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610812022.7A CN106354694B (en) | 2016-09-09 | 2016-09-09 | A kind of conflict position anti-collision method based on Type A |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610812022.7A CN106354694B (en) | 2016-09-09 | 2016-09-09 | A kind of conflict position anti-collision method based on Type A |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106354694A CN106354694A (en) | 2017-01-25 |
| CN106354694B true CN106354694B (en) | 2019-02-05 |
Family
ID=57859784
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610812022.7A Active CN106354694B (en) | 2016-09-09 | 2016-09-09 | A kind of conflict position anti-collision method based on Type A |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106354694B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110986703B (en) * | 2019-11-08 | 2022-06-17 | 重庆云铭科技股份有限公司 | Electronic detonator network anti-collision method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101350058A (en) * | 2008-05-26 | 2009-01-21 | 北京飞天诚信科技有限公司 | Method for self-adapting double-interface IC card protocol mode |
| CN103761492A (en) * | 2013-12-10 | 2014-04-30 | 上海动联信息技术股份有限公司 | Method of non-contact device for carrying out operation on multiple cards on the basis of 13.56 MHz working frequency |
-
2016
- 2016-09-09 CN CN201610812022.7A patent/CN106354694B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101350058A (en) * | 2008-05-26 | 2009-01-21 | 北京飞天诚信科技有限公司 | Method for self-adapting double-interface IC card protocol mode |
| CN103761492A (en) * | 2013-12-10 | 2014-04-30 | 上海动联信息技术股份有限公司 | Method of non-contact device for carrying out operation on multiple cards on the basis of 13.56 MHz working frequency |
Non-Patent Citations (3)
| Title |
|---|
| Radio frequency identification;C.M.Roberts et al.;《Computers&Security》;20060131;第25卷(第1期);第18-26页 |
| 基于电子标签智能化的二进制树型搜索防冲突算法;胡建国，等;《信号处理》;20101110;第26卷(第11期);第1688-1694页 |
| 智能卡操作系统通讯模块的设计与实现;毕双龙;《中国优秀硕士学位论文全文数据库信息科技辑》;20120415;第I135-279页 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106354694A (en) | 2017-01-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2584281C (en) | Method for identifying tags using adaptive binary tree splitting technique in rfid system and rfid system therefor | |
| KR100717877B1 (en) | Tag Number Estimation Method in Sloted Aloha based RFID Systems | |
| US7626503B2 (en) | Bi-slot tree based tag identification method in RFID systems | |
| EP1914660A1 (en) | Query tree based tag identification method in RFID systems | |
| US20080316001A1 (en) | Detecting a blocker RFID tag | |
| US7429912B2 (en) | Method for multi-reading a plurality of IDs | |
| CN105046181B (en) | A kind of certainty anti-collision algorithm of many prefix matchings based on inquiry tree method | |
| CN101071471A (en) | Multi-label collision-proof method | |
| CN106354694B (en) | A kind of conflict position anti-collision method based on Type A | |
| CN100592321C (en) | Method for recognizing contrary collision of inquiry tree radio frequency labels of amalgamation database | |
| CN103218635A (en) | RFID (radio frequency identification) anti-collision method based on mixed multiway tree searching | |
| US20070028049A1 (en) | ID anti-collision method using data structure applied to RFID system | |
| CN105743826A (en) | Miller subcarrier decoding method | |
| CN114186572A (en) | Unknown label identification method and system based on conflict time slot coordination | |
| Yang et al. | The simulation and analysis of algorithms for redundant reader elimination in RFID system | |
| CN104091139A (en) | Q parameter acquiring method and device | |
| Jianbin et al. | Anti-collision algorithm based on counting mechanism and multi-state binary | |
| CN106503600B (en) | A kind of RFID active anti-collision method based on timing | |
| CN110210266A (en) | Five fork tree search RFID anti-collision method of one kind | |
| Mu et al. | A novel hybrid tag identification protocol for large-scale rfid systems | |
| Choi et al. | An efficient anti-collision protocol for tag identification in RFID systems with capture effect | |
| Yeh et al. | An Efficient Query Tree protocol for RFID tag anti-collision | |
| CN103902944A (en) | Multi-tag collision prevention method of internet of things | |
| Hu et al. | A novel anti-collision algorithm for RFID system | |
| Hui et al. | Improved RFID anti-collision algorithm based on quad-tree |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20170315 Address after: 528300 East Road, Shunde District, Guangdong, Foshan, No. 9 Applicant after: Internation combination research institute of Carnegie Mellon University of Shunde Zhongshan University Applicant after: GUANGZHOU SMART CITY DEVELOPMENT RESEARCH INSTITUTE Applicant after: Sun Yat-sen University Address before: 528300 Guangdong province Foshan city Shunde District Daliang South Road No. 9 Research Institute Applicant before: Internation combination research institute of Carnegie Mellon University of Shunde Zhongshan University Applicant before: GUANGZHOU SMART CITY DEVELOPMENT RESEARCH INSTITUTE |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |