CN105447430B - A kind of label and the method using the HARN protocol identifications label - Google Patents
A kind of label and the method using the HARN protocol identifications label Download PDFInfo
- Publication number
- CN105447430B CN105447430B CN201510812584.7A CN201510812584A CN105447430B CN 105447430 B CN105447430 B CN 105447430B CN 201510812584 A CN201510812584 A CN 201510812584A CN 105447430 B CN105447430 B CN 105447430B
- Authority
- CN
- China
- Prior art keywords
- label
- reader
- harn
- new
- ack
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/10009—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves
- G06K7/10297—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves arrangements for handling protocols designed for non-contact record carriers such as RFIDs NFCs, e.g. ISO/IEC 14443 and 18092
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K7/00—Methods or arrangements for sensing record carriers, e.g. for reading patterns
- G06K7/10—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation
- G06K7/10009—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves
- G06K7/10019—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers.
- G06K7/10029—Methods or arrangements for sensing record carriers, e.g. for reading patterns by electromagnetic radiation, e.g. optical sensing; by corpuscular radiation sensing by radiation using wavelengths larger than 0.1 mm, e.g. radio-waves or microwaves resolving collision on the communication channels between simultaneously or concurrently interrogated record carriers. the collision being resolved in the time domain, e.g. using binary tree search or RFID responses allocated to a random time slot
Abstract
The invention discloses a kind of label and using the method for the HARN protocol identifications label, label includes the first RN fields RNtWith the 2nd RN fields RNt’；Wherein, RNt=H (IDt) mod 216, IDtRepresent label t ID, RNt'=H (IDt T)mod 216；IDt TIt is IDtLiteral retrography；If RNtWith RNt' equal, then make RNt'=RNt+1；H is one to reader and the disclosed hash function of label.The label of the present invention is also provided to the extra information of reader to judge that whether the label replied is the label collected, and may help in determining whether label loss in addition to it can be used for competitive channel and access.The recognition methods of the present invention can extract useful information in multiple label simultaneous transmissions from collision alarm, effectively increase the performance of HARN agreements.
Description
Technical field
The present invention relates to wireless recognition technique, particularly a kind of label and the method using the HARN protocol identifications label.
Background technology
In recent years, radio frequency identification (Radio Frequency Identification, RFID) technology is wide
It is applied to generally in many fields, for example logistics monitoring and tracking, bulk storage plant management, storage controlling etc..In such applications,
The object or object to be monitored can be assembled with active or passive RFID tags.Each label comprising a unique ID and with it is appended
The relevant information of the object.These information of storage in the label, it is possible to use RFID reader is carried out by wireless channel
Read, and be sent to the management that background server is automated.According to IDTechEx (R.Das and P.Harrop.RFID
Forecasts,Players and Opportunities 2014-2024,2013.http://
Www.centrenationalrfid.com/docs/users/file/RFID Forecasts 20142024.pdf) nearest
Prediction address, by 2024, RFID total market value was up to 30.24 hundred million dollars.
In RFID system, the problem of tag recognition is most basic, it, which is related in the read range to reader, owns
The ID of label access.RFID tag identification work before focuses primarily upon the collection to label, can be divided into two classes：It is based on
ALOHA agreements and based on tree agreement.In (V.Namboodiri and L.Gao.Energy-Aware Tag
Anticollision Protocols for RFID Systems.IEEE Transactions on Mobile
Computing,pages 44–59,2009；Vinod Namboodiri and Lixin Gao.Energy-Aware Tag
Anti-Collision Protocols for RFID Systems.In Proc.of PerCom,pages 23–36,2007)
In, author is by adjusting the size based on frame in ALOHA tag identification protocols come the optimization of search time performance and energy efficiency.
In (Muhammad Shahzad and Alex X.Liu.Probabilistic optimal tree hopping for
RFID identification.In Proc.of SIGMETRICS, pages 293-304,2013) in, author proposes one
Individual adaptive tree traversal method improves the time efficiency in the tag identification protocol based on tree construction.DDC agreements (Lei
Kang,Kaishun Wu,Jin Zhang,Haoyu Tan,and Lionel M.Ni.DDC:A Novel Scheme to
Directly Decode the Collisions in UHF RFID Systems.IEEE Transactions on
Parallel and Distributed Systems,23(2):263-270,2012) a specific RN designs mould has been used
Formula so that the RN signals of two conflicts are separated, so as to improve tag recognition handling capacity." Ming Zhang, Tao Li,
Shigang Chen,and Bo Li.Using Analog Network Coding to Improve the RFID
The FCAT agreements proposed in Reading Throughput.In Proc.of ICDCS, pages 547-556,2010 " are used
Analog network coding (ANC) (Sachin Katti, Shyamnath Gollakota, and Dina Katabi.Embracing
wireless interference:analog network coding.In Proc.of SIGCOMM,pages 397–408,
2007) come separate conflict time slot received by mixed signal in tag ID.DDC agreements and FCAT agreements all cannot distinguish between
Know label and new label, and in the case of only needing identification division tag ID in RFID system, performance can be reduced.
In EPC C1G2 standard agreements (EPCglobal.EPC Radio-Frequency Identity Protocols
Class-1Gen-2UHF RFID Protocol for Communications at 860MHz-960MHz, 2008) in, read
Reading device needs some frame lengths (being referred to as inquiry times) to recognize label.One frame includes several synchronous time slots, and often
The time slot that individual label randomly chooses a frame is replied to reader.
Before a frame starts, reader can broadcast a querying command for including parameter q, it is meant that this frame is included
2qIndividual time slot.According to the querying command of reception, each label can be [0,2q- 1] value is randomly choosed in the range of and is sent to it
Slot counter.Its slot counter will be subtracted 1 when the repetition querying command of each label reader of reception.
At the same time, each label will produce the random number of one 16 by random generator, and this random number is represented with RN.
When a tag responses querying command or repetition querying command, if now its when slot value is 0, then it will return to its
RN fields obtain access channel.
There are three kinds of different time slots in this agreement, as shown in Figure 1.In a time slot, when only one of which label to
When reader returns to its RN signals, reader can successfully receive RN.Such time slot is referred to as single time slot.In single time slot
In, reader directly broadcasts one and includes the ACK orders for receiving RN information.Corresponding label in ACK orders just, it can be seen that add
The RN information of load is equal to the RN information of itself, and then it will pass its id information and CRC (CRC)
Give reader.Now this label will be marked as identification state and cannot participate in current identification operation.If
There are multiple labels in a time slot while transmitting their RN information, reader will detect conflict situations, when such
Groove is referred to as the time slot that conflicts, and also a kind of time slot that will not receive information is referred to as space-time groove.Tag recognition operation only can be
Carried out in single time slot.
In standard agreement, only single time slot could gather the id information of label, and this can undoubtedly limit its identification and handle up
Amount.In research work before, have and proposed many signal processing technologies to extract the useful letter in collision signal
Breath, such as analog network coding (ANC) (Ming Zhang, Tao Li, Shigang Chen, and Bo Li.Using
Analog Network Coding to Improve the RFID Reading Throughput.In Proc.of
ICDCS,pages 547–556,2010；Sachin Katti,Shyamnath Gollakota,and Dina
Katabi.Embracing wireless interference:analog network coding.In Proc.of
SIGCOMM,pages 397–408,2007；Shyamnath Gollakota and Dina Katabi.Zigzag
decoding:combating hidden terminals in wireless networks.In Proc.of SIGCOMM,
Pages 159-170,2008) and cross-correlation technique.It is assumed that receiver have received the mixed signal in k unlike signal source, such as
Fruit receiver knows any k-1 signal in k collision signal, and it will be decoded using ANC to remaining signal.Remove
Outside this, if reader knows that received signal is necessarily from candidate signal, it will be examined by cross-correlation technique
Survey which candidate signal contains collision signal.We will improve the performance of our agreements using these technologies.
In recent years, the technology for carrying out parallel tag recognition using multiple readers has caused numerous research workers'
Concern.RASPberry(S.J.Tang,J.Yuan,X.Y.Li,G.Chen,Y.Liu,and J.Z.Zhao.Raspberry:A
stable reader activation scheduling protocol in multi-reader RFID systems.In
Proc.of ICNP, pages 304-313,2009) attempt to make the arrival rate of new label in the range of capacity that reader works
When ensure that the long-term steady operation of system.In " Lei Yang, Yong Qi, Jinsong Han, Cheng Wang, and
Yunhao Liu.Shelving Interference and Joint Identification in Large-Scale RFID
Systems.IEEE Transactions on Parallel and Distributed Systems,pp(99):1–11,
In 2014 ", author, which proposes one, can consider the agreement of reader height and tag recognition jointly.
In EPC C1G2 standard agreements, RN main purpose is that, in order to fight for channel access, and RN field values are random
Produce, do not constrained by the ID of label.Although reader knows the ID of known label, it can not also judge received by it
RN signals belong to known label or new label, then may proceed to gather its ID.Also, EPC C1G2 standard agreements are only
Tag ID can be gathered in single time slot, will so limit the handling capacity of tag recognition.
More also on the research work for the identification handling capacity for improving new label.Continuous scanning (Bo Sheng, Qun
Li,and Weizhen Mao.Efficient Continuous Scanning in RFID Systems.In Proc.of
Infocom, pages 1010-1018,2010) it is to be used to prevent the response of known label to improve new tag identification speed earliest
Work.However, it needs to change standard agreement, and COTS labels can not be used easily.MUIP(James Waldrop,
Daniel W.Engels,and Sanjay E.Sarma.Colorwave:an anticollision algorithm for
The reader collision problem.In Proc.Of ICC, pages 1206-1210,2003) collection can be accomplished
All new labels, but it depends on the indicator vector that current COTS labels are not supported.In (Haoxiang Liu, Wei
Gong,Xin Miao,Kebin Liu,and Wenbo He.Towards Adaptive Continuous Scanning in
Large-Scale RFID Systems.In Proc.of Infocom, pages 486-494,2014) in, author proposes
One adaptation scheme improves the tag recognition handling capacity during change of new number of tags, and it similarly depends on mark sense
Amount technology.It is emphasized that these solutions will ensure that current system is not in ability in the case that label is lost
It can carry out.Therefore, they are required for using label loss detection algorithm (Yuanqing Zheng and in advance before agreement starts
Mo Li.P-MTI:Physical-layer Missing Tag Identification via compressive
sensing.In Proc.of Infocom,pages 917–925,2013；Tao Li,Shigang Chen,and Yibei
Ling.Efficient Protocols for Identifying the Missing Tags in a Large RFID
System.IEEE/ACM Transactions on Networking,21(6):1974–1987,2013；Wen Luo,
Shigang Chen,Tao Li,and Yan Qiao.Probabilistic missingtag detection and
energy-time tradeoff in large-scale RFID systems.In Proc.of Mobihoc,pages 95–
104,2012) label of loss is found.However, label loss detection protocol requirement current system does not have new label to add
Can normal work.
The content of the invention
The technical problems to be solved by the invention are, in view of the shortcomings of the prior art, providing a kind of label and utilizing HARN associations
The method that view recognizes the label.
In order to solve the above technical problems, the technical solution adopted in the present invention is：A kind of label, including the first RN fields
RNtWith the 2nd RN fields RNt’；Wherein, RNt=H (IDt) mod 216, IDtRepresent label t ID, RNt'=H (IDt T)mod
216；IDt TIt is IDtLiteral retrography；If RNtWith RNt' equal, then make RNt'=RNt+1；H be one to reader and label all
Disclosed hash function.
Present invention also offers a kind of method of the above-mentioned label of utilization HARN protocol identifications, it is characterised in that in HARN associations
In the first frame of view, reader and label are proceeded as follows respectively：
The operation of reader includes：
Operation in empty slot is expected is as follows：In empty slot is expected, the ID of the new label of a reader identification part, such as
Fruit reader have received the reply from new label, then the reply is from new unidentified label, and now, reader broadcasts one
The random field value RN of new label including just having receivedtACK confirm；Otherwise, if the time slot is sky or is conflicted, read
Read device and only send a QueryRep order；
Operation in non-empty slot is expected is as follows：Reader suppresses the reply of all overlapping tags, it is assumed that had k
Know that label have selected the non-empty slot of expectation, then reader is successively by their second random field value RNt' be broadcasted；
The operation of label includes：
If the time slot counter for receiving Query the or QueryRep orders from reader and label itself is 0,
Label is by oneself first random field value RNtReader is sent to, otherwise the time slot counter value of oneself is subtracted 1；
If label receives an ACK reply, and the random field value included in ACK replies is just equal to the label and sent out
To the random field value of reader, then the ID of oneself is sent to reader by the label, and exits this identification operation；
If the random field value that the ACK that label is received is included in replying is equal to the RN of the labelt' value, then the label be
Overlapping tags, label directly exits this identification operation.
Relation between the length f of HARN agreements head frames and the continuous working period T of first frame is：
T=Tid*Ns+Te(Ne-Ns)+N*Tack+(f-Ne)*Tqrn；
Wherein, TidAnd TeSingle time slot is represented respectively and expects the working time of empty slot；TackRepresent that sending one includes
RNtThe ACK subcommand times of information；TqrnRepresent to need to send inquiry and RNtThe time of information；NeRepresent the expectation space-time in first frame
Gap number, NsRepresent the number of time slot that new label is successfully recognized；N is number of labels.
Compared with prior art, the advantageous effect of present invention is that：The label of the present invention is except can be used for competition
Outside channel access, it is also provided to the extra information of reader to judge whether the label replied is to have collected
Label, and may help in determining whether label loss.The recognition methods of the present invention can be in multiple label simultaneous transmissions
When useful information is extracted from collision alarm, effectively increase the performance of HARN agreements.
Brief description of the drawings
Fig. 1 is EPC C1G2 standard identification protocol exemplary plots；
Fig. 2 recognizes that label schematic diagram is lost in new label and detection for the present invention in HARN agreements；
Fig. 3 is HARN-ANC protocol theory figures；
Fig. 4 is different in the first frame of HARN agreementsOptimal ρΚ；
Fig. 5 (a) and Fig. 5 (b) are respectively new average time of tag recognition in HARN head frames in the case of small η values and big η values；
Fig. 6 is the optimal ρ corresponding to different η in the first frame of HARN-ANC agreementsΚValue；
Fig. 7 (a) and Fig. 7 (b) respectively headed by frame small η values and big η values average recognition time；
Fig. 8 is the tag recognition time of the difference RN extractabilities in HARN-ANC agreements；
Fig. 9 (a) and Fig. 9 (b) is respectively the average recognition time that small η values and big η values are produced in first frame；
When Figure 10 (a) and Figure 10 (b) is respectively small η values and big η values, IFUTI identification probability is corresponding each for 0.99
Label is identified the required time in different agreements；
Figure 11 is HARN protocol specification figures.
Embodiment
1st, RN is produced based on hash method
It is [0,2 that HARN agreements produce a scope by salted hash Salted16- 1] label RN fields.Label t RNt=H
(IDt)mod 216,IDtRepresent label t ID, H be one to reader and all disclosed Hash formula of label (for example, H (x)
=(a*x+b), wherein a and b are two selected numerals, or H (x)=MD5 (x), wherein MD5 represent MD5 functions).Pass through
This mode, reader just can predict the label RN information that can be received when a known label transmission.So, when reader connects
When receiving a RN for being different from known label, it will know that the RN now received is necessarily from a new label, in
It is that will directly gather the ID of this label.
In addition to the RN for fighting for access channel, we also use second RN and quickly to prevent answering for known label
Answer.(RN is used for label t, its second RNt' represent) by formula H (IDt T)mod 216Obtain, wherein IDt TIt is IDtWord
Face retrography (i.e. all numerals write obtained numeral in turn).In order to meet standard agreement, it is assumed that RNt≠RNt’.If
As the RN of generationtWith RNt' it is equal when, it should so that RNt'=RNt+1.Reader is to utilize RNt' information prevents known mark
The response of label.
2nd, the description of HARN agreements
HARN includes multiple frames.First frame has specific function, and it is in addition to it can recognize new label, moreover it is possible to by institute
Some known labels are set as known state and detect the label of loss.First frame is referred to as first frame by us, will except first frame it
Outer frame is referred to as subsequent frame.The function of first frame is to be recognized to operate the tag ID read to mark some label according to last time
It is overlapping tags, loses label or new label, and avoids the repetition of overlapping tags from recognizing and collect a part of new label
ID.Subsequent frame may have multiple, and its function is the ID for collecting new label.
Before agreement starts execution, reader was recognized according to last time first operates the tag ID set read to calculate
(identified mistake) label of message will be sent in first frame in each time slot to reader, and calculate corresponding RN16 values.
So reader is just it is anticipated that the value for the RN16 fields that may be received in each time slot, as shown in Figure 2.Tied according to calculating
Really, reader may determine that the expectation state of each time slot：Expect single time slot, expectation conflict time slot and expect empty slot.Such as Fig. 2
In, time slot 1,2 is to expect conflict time slot, and time slot 3 is to expect empty slot, and time slot 4,5 is to expect single time slot.
After the completion of calculating, the concrete operations in first frame are as follows：
Operation in terms of reader is as follows：
Operation in empty slot is expected is as follows：In empty slot is expected, reader attempts to recognize the new label of a part
ID.Because there is no any label being collected into its random field value (i.e. RN16) can be sent into reading in empty slot
Device, if reader have received the reply from label, the reply is from new unidentified label certainly.Such case
Under, the ACK that reader broadcasts a RN16 including just having received confirms.Otherwise, if this when to be empty or conflicted, read
Read device and only simply send a QueryRep order.
Operation in non-empty slot is expected is as follows：In non-empty slot, reader suppresses returning for all overlapping tags
It is multiple to avoid carrying out them repeating identification.Assuming that there is k known label to have selected the time slot, then reader successively by they
Second random field value (RN16 ') is broadcasted.
Operation in terms of label is as follows：
, will if 1) receive Query the or QueryRep orders from reader and the time slot counter of oneself is 0
The random field value RN16 of oneself first is sent to reader.Otherwise the time slot counter value of oneself is subtracted 1.
If 2) label receives an ACK reply, and the random field value included in the ACK is just equal to oneself just hair
To the random field value of reader, then the ID of oneself is sent to reader and exits this by the label recognizes operation.(identification is new
Label).
If 3) the random field value included in the ACK orders that label is received is equal to the RN16 ' values of the label, the label
For overlapping tags, label directly exits this identification operation.(avoiding recognizing overlapping tags)
Compatibility analysis：In HARN agreements, label can take three kinds of different action and receive order to respond.Preceding two
The behavior of kind is identical with EPC standard agreements.The third action is that in original EPC protocol, label can keep ready state and participate in
The work of next frame.HARN inherits this operation, but it has increased a flow newly, exactly when the RN information that label is received
Known state will be entered when equal with its RN '.This does not change any logic and and standard agreement of original agreement
It is consistent.
Label is lost in detection
Label is lost in detection：In non-empty slot is expected, reader can still detect label loss situation.Each label
Select after time slot, reader can carry out cross-correlation operation [23] to detect reception by the signal and the RN signals of label received
The signal arrived whether there is the RN signals of label, and this may be recorded either when using RN values when recognizing label at this
Ground is generated.Illustrate if RN has peak value it be in reception signal in, otherwise just think label lost and
It is removed in the range of known label and is then labeled as having lost label.
Fig. 2 illustrates how HARN recognizes that label is lost in new label and detection in first frame.
The operation of subsequent frame
Subsequent frame is used to be operated with existing EPC C1G2 agreements identical.Useful all labels of identification are in head
Marked in frame, therefore recognized in subsequent frame is new label entirely.
The description of 3.HARN enhancing agreement
In the first frame of HARN agreements, new label can only be identified in empty slot is expected.Therefore, we are based on mould
On the basis of intending network code (ANC), it is proposed that one new label is recognized in non-empty slot is expected method, so can be
Largely improve the identification handling capacity of new label.
A, the extraction RN information in non-empty slot is expected
In HARN first frame, non-empty slot will not be used for recognizing new label, and this just limits its performance.In view of one
Label t may have been recognized in individual time slot in the presence of one1With a new label u1Their RN information is returned to simultaneously, reader is just
Collision signal can be received.However, when reader knows label t1RN signals after, it can be by t1RN signals from receiving
Collision signal in remove so as to obtaining label u1RN signals, this part work can be realized by analog network coding.
How simple introduction is separated the RN information of new label (in [6] and [21] by us from collision signal now
There is more detailed introduction).Label t1RN values can be expressed as follows：
Sk[n]=Ak[n]eiθ[n] (16)
Wherein, AkIt is signal RN amplitude, θk[n] is the phase of n rank sample signals.Correspondingly, label u1Transmission signal
RN is：
Wherein, AuWithLabel u is represented respectively1N rank RN sample signals amplitude and phase.
Due to channel response and the influence of phase shift, received t1And u1The RN signals of label will change, and be received
Signal it is as follows：
hk(hu) refer to reader and t1(u1) between channel response, γk(γu) it is to represent phase shift, it depends on readding
Read device and t1(u1The distance between).
As label t1And u1When transmitting their RN signals simultaneously, what reader was received is the mixing of two kinds of signals, is represented
It is as follows：
Y [n]=yk[n]+yu[n] (19)
Due to ykIt is known, reader just can extract y from signal ykSo as to obtain yu, then to yuDecoded
To obtain the RN signals of new label transmission.After the RN that reader obtains new label, just broadcast one and include RN decoded informations
ACK orders gather the ID of new label.Assuming that reader, which is known, all has recognized the RN signals of label and the letter of mixed signal
Make an uproar more sufficiently high than (SNR), then when more than one has recognized that label transmits their RN, the RN of new label be also can by into
What work(was extracted.
However, when reader can not know whether that new label transmits their RN signals, it is only blindly separated
RN values assume that RN is sent by new label, will produce some invalid RN.For example, when the new label of more than two is same
When time slot sends their RN, the RN of extraction possibly can not or by mistake be used for gather new tag ID.Another situation is, most
The new label of pipe only one of which carries out information transmission, but some identified labels lost or RN information extraction mistakes.So
And, this point will not also reduce the correctness of our agreements.
B, agreement introduction
Enhanced HARN agreements are referred to as HARN-ANC by us.Label in HARN-ANC is read as in HARN
Device can after current time slots forbid identified label, the Last call one of the non-empty slot of each expection it is extra include RN
Extract the ACK orders of information.For example, as shown in figure 3, reader is received after RN1 and RN2 mixed signal, it first can be by
RN2 signals are extracted from mixed signal, then forbid label t by broadcasting an ACK order comprising RN1 signals1
Carry out response.However, from unlike HARN agreements, in HARN-ANC agreements, reader broadcast another comprising separation RN2
The ACK orders of information, for recognizing a new label in current time slots.In this example, reader can be properly separated
RN2 signals and successfully identification label u1。
In order to separate RN2 in mixed signal, reader needs to know RN2 signals.Therefore, when reader successfully connects
Corresponding RN will be recorded when receiving the tag ID of time slot.As the example in Fig. 6, when reader is properly received label u1ID
When, it can be by separation information record into database and labeled as u1RN information.On the contrary, when reader be not received by it is any
During effective ID, it is invalid just to mean extracted RN signals, then it ignores that response and will not record any
Information.By this method, reader just can correctly record the RN signals for having recognized label received.
Invalid RN does not interfere with the correctness of agreement.First, if label u1Have received one it is different with its own
RN values, it will immediately neglect this order and carry out tag recognition again in next frame.Secondly, if in a time slot
In have multiple new labels while sending their RN information, then the RN signals extracted will be with the RN in two new label RN
Signal is different, will then ignore ensuing ACK orders.So, it will not also reduce agreement when extracting invalid RN
Correctness.
In order to minimize the recognition time of each label, it is necessary to discuss the length for how setting frame.
1) first frame：In addition to recognizing new label, the major function of first frame is to prevent the response of known label.It is assumed that frame
Length is f.We use NeTo represent the expectation empty slot number in this frame, and for NsRepresent that new label successfully recognizes when
Gap number.The continuous working period of so this frame is：
T=Tid*Ns+Te(Ne-Ns)+N*Tack+(f-Ne)*Tqrn (1)
Wherein, f represents the length (comprising how many time slots i.e. in the frame) of frame, TidAnd TeSingle time slot and space-time are represented respectively
The working time of gap, TackRepresent to send an ACK subcommand time for including RN information, TqrnRepresent to need to send inquiry and RN letters
The time of breath.Section 3 in formula (1) represents the time for preventing a known label from sending ACK orders, and Section 4 is represented
Be label receive RN information time.
When having N number of known label and M new labels, NsAnd NeBe calculated as follows：
Therefore, the average time of one new label of identification is：
The ratio of new number of tags in known label is defined as η=M/N by us, and define the load of known label because
Son is ρΚ, and ρΚ=N/f.Therefore：We can obtain
In order to minimize Tf, we makeMinimum T is just can obtain by below equationf：
Time specification in EPC C1G2 standard agreements as can be seen from Figure 4, different η make TfValue reaches minimum
Optimal ρΚValue.The ρ from figure it can be found that when η increasesΚValue can diminish, and this means that new labels will when having in system more
A longer frame is may require that when identified.
5 (a) and Fig. 5 (b) are by the T of first frame in HARN agreementsfValue with ordinary circumstance and ideally is contrasted.
The T when η values increasefIt can reduce, and may require that using a longer frame to recognize more new labels.Then, suppressed
The expense for having recognized label can be used in the identification of new label, therefore the recognition time of each label can be reduced.By result
Generally it is compared it can be found that HARN is likely to reduced for up to 69% tag recognition time.What we to be pointed out
It is, only the new label of sub-fractionCan be identified in first frame, other new labels will not be by having recognized label
Influence and can be identified in residue frame.
Maximized for being tried in subsequent frame, and existing solution unlike single time slot ratio in frame, we
Attempt to minimize the recognition time of each label, because the working time of each time slot is different.We use TcTo represent conflict
The continuous working period of time slot, uses Ne, Ns, NcThe empty slot of frame, single time slot and conflict number of time slots are represented, M is usedaTo represent
Remaining active new number of tags.Then, the working time of this time frame is：
T=Ne*Te+Ns*Tid+Nc*Tc (7)
Now,
Make ρ=Ma/ f, then the average time of tag recognition be
Minimum value can be obtained when following condition is set up：
According to EPC C1G2 standard agreements, Te/Tc=0.184/0.44=0.4182.Therefore, ρ optimal value is 0.7155,
Then the average time of new tag recognition is about 2.86ms.So, ideally, the average recognition time of new label
For 2.86ms.
B) optimized parameter of HARN agreements is set
What we were now discussed with is the size for how setting the first frame of HARN-ANC agreements so that recognizing the mean time of new label
Between it is minimum.The size of subsequent frame is used and HARN identicals are set.In discussion below, we can assume a new label
The RN signals of transmission successfully can always be separated from mixed signal.
We willSingle number of time slots of the new label of respective frame is set to, the ratio of single time slot in frame is madeBy using defined symbol before, then the total time of frame be
In above-mentioned formula, last represents to expect to broadcast what an invalid RN was wasted in non-empty slot at one
Time.rs fWithIt is calculated as follows：
Identification one new label average time be：
In order that TfValue is minimum, Wo MenlingThe T of minimum just can be obtained when following condition is set upf,
Fig. 6 is given in the first frame of HARN-ANC agreements, the optimal ρ corresponding to different ηΚValue.As we can see from the figure
ρΚIt can increase with η increase, when η value is close to 1, ρΚMaximum is reached, then the ρ when η continues to increaseΚAgain can be progressively
Reduce.In order that new label hides probability is both less than 10 under any circumstance-5, ρΚValue can be consistently less than 2.
Correspondingly, by Fig. 7 (a) and Fig. 7 (b) it may be seen that in the first frame of HARN-ANC agreements, new label
Average recognition time is different and different because η's, and recognizes that new label can effectively reduce the knowledge of label by non-empty slot
The other time.But when η is close to 1, the recognition time of label will be sharply increased, because working as ρΚDuring more than 1, in first frame
The label that can be identified is seldom, therefore each identified label will need to share more expenses.Nevertheless,
In HARN-ANC agreements, when the recognition time of new label exceedes average recognition time, for HARN agreements, its time
Still reduce a lot.So, for first frame, HARN-ANC agreements are all better than HARN agreements under many circumstances.With mark
Quasi- agreement is compared with HARN agreements, and HARN-ANC agreements can reduce 87%, 58% respectively on the tag recognition time.Moreover,
When η is close to 1, HARN-ANC performance nearly reaches ideal situation, is demonstrated by it absolute excellent on new tag capabilities are recognized
Gesture.
We assess HARN and HARN-ANC performance by using Matlab simulators.We are from ordinary circumstance and reason
Think the performance of the IFUTI agreements [20] based on indicator vector that two aspects of situation compare our agreement and proposed,
Calculated not according to EPC C1G2UHF Label specifications [13] when data rate between reader and label is set to 62.5Kbps
With the agreement implementation time.
A, HARN-ANC extract RN different abilities
It is assumed that how many known label to transmit their RN information in identical time slot regardless of, the RN of new label can
Successfully it is extracted (under actual conditions, when there are many known labels while when transmitting, RN may not be extracted smoothly).Fig. 8 is said
Understand that HARN-ANC extracts several different abilities of new label, HARN-ANC (k) represent ought be up to k known label enter simultaneously
During row transmission, the situation that the RN of new label can be extracted.From HARN-ANC (2) as can be seen that its performance and HARN-ANC
About the same, reason is due to the setting of frame sign, and conflict is caused by two known labels mostly.According to [6] and [21]
Report result, when having 3 or 4 signals while when transmitting, RN can be separated.Therefore, HARN-ANC is likely to be breached ratio
Comparatively ideal result.
B, new label ratio influence
We discuss the ratio of the new label in known label nowIt is how to influence HARN and HARN-ANC performance
's.In first frame, the only new label of small part can be identified, performance meeting and reason that remaining new label is finally identified
Think that situation is the same, because all identified labels can be prohibited in first frame.
Fig. 9 (a) and Fig. 9 (b) describe each new label identified average time in different agreement.When η very littles,
The advantage of HARN and HARN-ANC agreements is apparent.Compared with ordinary circumstance, HARN can at most reduce by 79% time,
And HARN-ANC can then reach 90%, and it can each improve in handling capacity 3.8x and 11x.HARN-ANC is than HARN's
More excellent performance is given the credit in the non-empty slot of expectation of first frame, and it recognizes that the ability of new label is stronger.In addition, when η >=
When 0.7, HARN-ANC performance has reached perfect condition, has fully demonstrated the superiority in height RFID dynamical systems.
HARN and HARN-ANC agreements and existing service index vector techniques are also entered Mobile state RFID system by us
The new label of middle identification agreement IFUTI (Xiulong Liu, Keqiu Li, Geyong Min, Kai Lin, Bin Xiao,
Yanming Shen,andWenyu Qu.Efficient Unknown Tag Identification Protocols in
Large-Scale RFID Systems.IEEE Transactions on Parallel and Distributed
Systems,pp(99):1-12,2014.) compare.IFUTI is the mode that a probability recognizes new label, and it is by readding
Read device and respond and broadcasted using a vector filtering to prevent identified label from sending.Figure 10 (a) describe when η very
When small and IFUTI identification probability is 0.99, each label is identified the required time in different agreements.When η very
Hour, HARN is simply slightly better than IFUTI agreements, and when η is very big, its performance will be apparently higher than IFUTI agreements.By with
IFUTI protocol comparisons find that HARN can at least reduce by 8% tag recognition time, 41% is can reach at its best,
Tag recognition handling capacity can increase by 9% to 70%, in addition, can see from superincumbent situation, no matter in what condition
Lower HARN-ANC performance will be higher, and it can averagely improve tag recognition handling capacity to 3.1x and 1.7x.It is more important
, we it can be found that HARN-ANC performance has nearly reached perfect condition, and when η than it is larger when, IFUTI agreements are still
The long time is so needed to recognize label.
Embodiment
Before a frame starts, reader can first calculate the expectation shape of each time slot of frame according to the ID of known label
State, then remembers that it, by the time slot of selection, finally estimates the RN information that each time slot can be received again according to known label ID.Read
Read device as shown in figure 11 in the work of each time slot.
1) in pre- empty slot (refer to without any known label by the time slot of transmission), if reader can be properly received
To a RN, then it is considered that what is read is a new label, reader will broadcast one and confirm comprising the ACK for receiving RN
Number.Otherwise, when reader is not received by any information or detects the presence of time slot collision, it will broadcast a repetition and look into life
Order requires to work in next time slot.
2) if at least one known label of some time slot is transmitted (this time slot is referred to as expecting non-empty slot), read
A series of ACK orders can be sent and known label is mapped into current time slots by reading device.It is assumed that K known label { t1..., tkChoosing
This time slot is selected, for each label ti(1<i<K), reader can broadcast second random digit for including it
The ACK orders of (RN ') prevent it from participating in current tag recognition operation.It should be noted that when label receives reader
During the ACK orders comprising label RN information sent, it will send its ID to reader.Here it is why we need
A RN ≠ RN ' condition is set to label, because if without such a qualifications, it is known that label will be to reading
Device sends its id information again.
Order according to transmitted by reader, correspondingly, label can be worked as follows：
If 1) label t receives inquiry or repeats querying command and its time slot counter when response receives order
When being zero, it will return to its RN information to reader.
2) if RN is equal with its RN in the ACK orders that label is received, it can send its label to reader
Id information and CRC (repeated and redundant check code) are simultaneously set to known state.
3) if the RN in the ACK orders that label is received is equal with its RN ', it will be set to known label.
Claims (2)
1. a kind of method of utilization HARN protocol identification labels, the label includes the first RN fields RNtWith the 2nd RN fields
RNt’；Wherein, RNt=H (IDt) mod 216, IDtRepresent label t ID, RNt'=H (IDt T)mod 216；IDt TIt is IDtWord
Face retrography；If RNtWith RNt' equal, then make RNt'=RNt+1；H is one to reader and the disclosed hash function of label；
Characterized in that, in the first frame of HARN agreements, reader and label are proceeded as follows respectively：
The operation of reader includes：
Operation in empty slot is expected is as follows：In empty slot is expected, the ID of the new label of a reader identification part, if read
Read device and have received the reply from new label, then the reply is from new unidentified label, and now, reader, which broadcasts one, to be included
The random field value RN of new label just receivedtACK confirm；Otherwise, if the time slot is sky or is conflicted, reader
Only send a QueryRep order；
Operation in non-empty slot is expected is as follows：Reader suppresses the reply of all overlapping tags, it is assumed that have k known marks
Label have selected the non-empty slot of expectation, then reader is successively by their second random field value RNt' be broadcasted；
The operation of label includes：
If the time slot counter for receiving Query the or QueryRep orders from reader and label itself is 0, label
By oneself first random field value RNtReader is sent to, otherwise the time slot counter value of oneself is subtracted 1；
If label receives an ACK reply, and the random field value included in ACK replies is just issued equal to the label and read
The random field value of device is read, then the ID of oneself is sent to reader by the label, and exits this identification operation；
If the random field value that the ACK that label is received is included in replying is equal to the RN of the labelt' value, then the label is overlapping mark
Label, label directly exits this identification operation.
2. according to the method described in claim 1, it is characterised in that the length f of HARN agreements head frames and the continuous firing of first frame
Relation between time T is：
T=Tid*Ns+Te(Ne-Ns)+N*Tack+(f-Ne)*Tqrn；
Wherein, TidAnd TeSingle time slot is represented respectively and expects the working time of empty slot；TackRepresent that sending one includes RNtInformation
ACK subcommand times；TqrnRepresent to need to send inquiry and RNtThe time of information；NeThe expectation empty slot number in first frame is represented,
NsRepresent the number of time slot that new label is successfully recognized；N is number of labels.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510812584.7A CN105447430B (en) | 2015-11-19 | 2015-11-19 | A kind of label and the method using the HARN protocol identifications label |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510812584.7A CN105447430B (en) | 2015-11-19 | 2015-11-19 | A kind of label and the method using the HARN protocol identifications label |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105447430A CN105447430A (en) | 2016-03-30 |
| CN105447430B true CN105447430B (en) | 2017-10-03 |
Family
ID=55557592
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510812584.7A Active CN105447430B (en) | 2015-11-19 | 2015-11-19 | A kind of label and the method using the HARN protocol identifications label |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105447430B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109241803B (en) * | 2018-09-28 | 2019-05-10 | 中石化石油工程设计有限公司 | The loss label Iceberg queries method of extensive grouping RFID system based on SZE |
| CN109960952B (en) * | 2019-03-04 | 2022-03-29 | 东南大学 | Tag anti-collision method based on EDFSA in dynamic RFID system |
| CN110852129B (en) * | 2019-11-11 | 2021-12-10 | 湖南大学 | Dynamic label estimation method |
| WO2022147831A1 (en) * | 2021-01-11 | 2022-07-14 | 华为技术有限公司 | Communication method and communication apparatus |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103870781A (en) * | 2014-03-19 | 2014-06-18 | 大连理工大学 | Unknown radio frequency label detection method based on Bloom filter |
| CN103870780A (en) * | 2014-03-19 | 2014-06-18 | 大连理工大学 | Method for recognizing missing labels based on time slot state change |
| CN104115442A (en) * | 2013-06-20 | 2014-10-22 | 华北电力大学（保定） | RFID bidirectional authentication method based on asymmetric secret key and Hash function |
-
2015
- 2015-11-19 CN CN201510812584.7A patent/CN105447430B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104115442A (en) * | 2013-06-20 | 2014-10-22 | 华北电力大学（保定） | RFID bidirectional authentication method based on asymmetric secret key and Hash function |
| CN103870781A (en) * | 2014-03-19 | 2014-06-18 | 大连理工大学 | Unknown radio frequency label detection method based on Bloom filter |
| CN103870780A (en) * | 2014-03-19 | 2014-06-18 | 大连理工大学 | Method for recognizing missing labels based on time slot state change |
Non-Patent Citations (1)
| Title |
|---|
| 《大规模RFID系统中一种能量有效的丢失标签快速检测方法》;张士庚等;《计算机学报》;20140228;第37卷(第2期);第434-444页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105447430A (en) | 2016-03-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Yue et al. | A time-efficient information collection protocol for large-scale RFID systems | |
| Liu et al. | Unknown tag identification in large RFID systems: An efficient and complete solution | |
| Myung et al. | An adaptive memoryless tag anti-collision protocol for RFID networks | |
| KR100842958B1 (en) | Query tree based tag identification method in rfid systems | |
| CN105447430B (en) | A kind of label and the method using the HARN protocol identifications label | |
| Liu et al. | Efficient information sampling in multi-category RFID systems | |
| Liu et al. | Category information collection in RFID systems | |
| CN100592321C (en) | Method for recognizing contrary collision of inquiry tree radio frequency labels of amalgamation database | |
| Choi et al. | Enhanced binary search with time-divided responses for efficient rfid tag anti-collision | |
| Shakiba et al. | Fitted dynamic framed slotted ALOHA anti-collision algorithm in RFID systems | |
| Gong et al. | Fast and adaptive continuous scanning in large-scale RFID systems | |
| Liu et al. | One more hash is enough: Efficient tag stocktaking in highly dynamic RFID systems | |
| CN111444735B (en) | Code scanning identification method and system for a large number of articles in short time | |
| Hakeem et al. | Novel modulo based Aloha anti-collision algorithm for RFID systems | |
| Fu et al. | Fast unknown tag identification in large-scale RFID systems | |
| Bonuccelli et al. | Perfect tag identification protocol in RFID networks | |
| Rennane et al. | A comparative performance evaluation study of the basic binary tree and aloha based anti-collision protocols for passive RFID system | |
| Liang et al. | A pre-detection query tree tag anti-collision scheme in RFID systems | |
| Tripathi et al. | Performance analysis of adaptive tree-based anti-collision protocol using M-ary splitting in RFID | |
| Mokhtari et al. | Using capture effect in DFSA anti-collision protocol in RFID systems according to ISO18000-6C standard | |
| Zhang | High efficient tag identification protocols for large-scale RFID systems | |
| HajMirzaei et al. | 2 Conditional tag estimation method for DFSA algorithms in RFID systems | |
| Nguyen et al. | Tweaked binary tree algorithm to cope with capture effect and detection error in RFID systems | |
| Rezaie et al. | A sift distribution multi-channel reader anti-collision for RFID systems | |
| Yeo et al. | Efficient anti-collision algorithm using variable length ID in RFID systems |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |