CN111931531B - RFID label information sampling method - Google Patents
RFID label information sampling method Download PDFInfo
- Publication number
- CN111931531B CN111931531B CN202010631410.1A CN202010631410A CN111931531B CN 111931531 B CN111931531 B CN 111931531B CN 202010631410 A CN202010631410 A CN 202010631410A CN 111931531 B CN111931531 B CN 111931531B
- Authority
- CN
- China
- Prior art keywords
- tags
- tag
- label
- rfid reader
- communication
- 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
- 238000005070 sampling Methods 0.000 title claims abstract description 59
- 238000000034 method Methods 0.000 title claims abstract description 29
- 238000004891 communication Methods 0.000 claims abstract description 86
- 238000012790 confirmation Methods 0.000 claims description 6
- 238000010276 construction Methods 0.000 claims description 6
- 238000004590 computer program Methods 0.000 claims description 5
- 238000012163 sequencing technique Methods 0.000 claims description 5
- 230000007704 transition Effects 0.000 claims 1
- 238000013461 design Methods 0.000 abstract description 7
- 238000004364 calculation method Methods 0.000 abstract description 4
- 239000004576 sand Substances 0.000 abstract description 2
- 230000009466 transformation Effects 0.000 abstract description 2
- 230000006870 function Effects 0.000 description 11
- 230000007613 environmental effect Effects 0.000 description 5
- 230000008569 process Effects 0.000 description 3
- 238000013507 mapping Methods 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Images
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
- G06K17/00—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations
- G06K17/0022—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations arrangements or provisious for transferring data to distant stations, e.g. from a sensing device
- G06K17/0029—Methods or arrangements for effecting co-operative working between equipments covered by two or more of main groups G06K1/00 - G06K15/00, e.g. automatic card files incorporating conveying and reading operations arrangements or provisious for transferring data to distant stations, e.g. from a sensing device the arrangement being specially adapted for wireless interrogation of grouped or bundled articles tagged with wireless record carriers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06K—GRAPHICAL DATA READING; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K19/00—Record carriers for use with machines and with at least a part designed to carry digital markings
- G06K19/06—Record carriers for use with machines and with at least a part designed to carry digital markings characterised by the kind of the digital marking, e.g. shape, nature, code
- G06K19/067—Record carriers with conductive marks, printed circuits or semiconductor circuit elements, e.g. credit or identity cards also with resonating or responding marks without active components
- G06K19/07—Record carriers with conductive marks, printed circuits or semiconductor circuit elements, e.g. credit or identity cards also with resonating or responding marks without active components with integrated circuit chips
- G06K19/077—Constructional details, e.g. mounting of circuits in the carrier
- G06K19/07749—Constructional details, e.g. mounting of circuits in the carrier the record carrier being capable of non-contact communication, e.g. constructional details of the antenna of a non-contact smart card
Abstract
The invention provides an RFID (radio frequency identification) tag information sampling method, relates to the technical field of network information of the Internet of things, and aims to design a protocol P between an RFID reader and tags in a tag total set SSThe problem of tag information sampling in the RFID system is solved; protocol P disclosed by the inventionSComprising two phases in which the state of the tag, i.e. P, is determined separatelyS1, randomly extracting K labels from N different labels in a label population set S to form a label information sampling subset T by adopting a first random seed computing hash function, wherein the probability that any subset with K labels in the label population set S is selected as T is equal; pSAnd 2, determining the state transformation of the tags in multiple communication rounds by adopting a second random seed calculation hash function and combining the characteristics of the RFID reader, and informing any tag in the tag information sampling subset T of the unique sequence of the tag to report the tag information of the tag to the RFID reader.
Description
Technical Field
The invention relates to the technical field of network information of the Internet of things, in particular to a method for sampling RFID label information.
Background
In the past decade, Radio Frequency Identification (RFID) technology has been widely used to track moving objects, manage supply chains, and control warehouse inventory. Conceptually, the RFID system in these applications consists of three components, including an RFID tag, an RFID reader, and a back-end server.
Where each RFID tag carries a unique 96-bit or 128-bit ID, is stored in its chip, is attached to different physical objects, and serves as a unique identifier for those objects. The tag also carries tag information, which may be attribute data of the tag object or sensor data (e.g., environmental data). In many applications, RFID tags achieve monitoring of the state of the tag object or the surrounding environmental conditions by adding sensors. Each RFID reader is deployed at a location of interest to a user for sensing tags within range and collecting ID and tag information from the tags. The back end server is connected to each reader in the RFID system, providing them with the required information storage and calculation.
Tag information sampling is a basic and important function in an RFID system, namely, selecting K subsets T of tag information samples with different tags from a large population S of tags, and informing each tag in T to report tag information in sequence. More specifically, the tag information sampling needs to design a protocol by which all tags in S can be effectively placed into the classification set, and by randomly extracting a tag from the classification set, the next tag T is continuously determined until K tags are selected, so as to form a tag information sampling subset T, and the arrangement order of K tags in any one tag information sampling subset T is informed. Obviously, after the function is implemented, the reader may collect the tag information carried by the tags in the tag information sampling subset T in sequence, and complete the sampling task.
Tag information sampling has wide application in many tag management issues, such as monitoring and collecting tag information. When a tag is attached to a physical object, the class information associated with the object is preloaded into the tag's on-chip memory for real-time querying. However, when a user needs to analyze the state or characteristics of a large-data-volume ensemble S, it is time-consuming and unnecessary to collect tag information from each tag pair in the ensemble S.
For example, for a physical object, the written classification information tagged thereon may be the brand of the shoe, the manufacturer of the clothing, etc. In this scenario, since all tags belonging to a class are loaded with the same information, there is no need to require each tag to report, but instead, a small number of randomly selected digital tags is sufficient to perform robust sampling of class information, and an effect of preventing transmission errors, tag loss, or failure can be achieved. As another example, an RFID tag type enhanced with a sensor, such as a WISP tag. Such tags may feed back their id as well as real-time sensor data related to the tagged object state or ambient environmental conditions. In this case, due to the redundancy of the environmental data, intelligent management and timely analysis must be performed, for example, when sensor data needs to be collected from a large number of tag populations periodically, a small number of tags can be randomly selected at a time and the sensor data thereof can be collected, so as to achieve the purpose of saving the sensor battery.
In order to design a protocol which is low in communication cost and effectively solves the problem of label information sampling, two technical problems exist; first, to obtain the cost of communication at hand, the basic information that must be transmitted between the reader and the tag needs to be analyzed in order to solve the tag information sampling problem, which is very complex and requires an encoding process that converts the protocol of the tag information sampling problem into any subset of tag information samples representing the tag population. In the prior art, there is no lower bound on communication costs that can directly depend on the application. Secondly, we need to design a protocol and prove the validity of the protocol, which is difficult to implement because it is impossible for the user to preset the sampling subsets of the tag information with K tags, and it is also necessary to ensure that each sampling subset of the tag information with K tags from the tag population S has equal probability of being selected. At the same time, it is more difficult that each tag in the subset T of tag information samples must be quickly informed in a unique order in {1, 2.
Disclosure of Invention
The invention aims to provide an RFID label information sampling method, which designs a protocol with short processing time, low communication cost and effective solution to the label information sampling problem, and the protocol can ensure that each label information sampling subset with K labels from a label overall set S has equal probability of being selected, and each label is informed of the unique ordering.
In order to achieve the above purpose, the invention provides the following technical scheme: in an RFID system, a protocol P between an RFID reader and tags in a tag population set S is designedSProtocol PSThe result of (c) satisfies:
C-I: randomly extracting K labels from N different labels in a label overall set S, wherein the probability that any label in the label overall set S is selected is equal, and K is the preset size of a label information sampling subset T;
C-II: any tag in the tag information sampling subset T is informed of the unique sequence of the tags, and tag information of the tags is reported to the RFID reader according to the sequence;
said protocol PSComprises two stages, respectively denoted as PS-1 and PS-2；
The P isS-1 comprises the following steps:
step 1) initializing all tags in the tag population set S to be in an unselected state, and sending a random seed r with a first random seed to all tags in the tag population set S by an RFID reader1To start communication;
step 2) receiving the first random seed r to any one1Tag t ofsCalculating a random number h (t)s)，
h(ts)＝H(ts Info,r1)mod N (1-1)
Wherein, tsIs any label in the label population set S, N is the total number of labels in the label population set S, ts InfoIs a label tsLabel information of H (t)s Info,r1) The method comprises the steps that a hash function shared by all tags in a tag population set S and RFID readers is formed;
step 3) traversing any label t in the label overall set SsIf the label t issCorresponding random number h (t)s)<K, then the label tsRemains in the unselected state, otherwise, tag tsEntering an inactive state;
wherein, is not selectedThe state is whether the tag does not definitely need to report the tag information t of the tag to the RFID readers InfoThe state of (1); inactive State is when a tag explicitly does not need to report its tag information t to the RFID readers InfoThe state of (1);
the P isS-2 comprises the following steps:
step 1) defining a label overall set S at PSThe set of tags that stay in the unselected state in stage 1 is B; if B is not an empty set, the RFID reader sends a random seed r with | B | and a second random seed to all the tags in the set B2Request of<|B|,r2>Starting a new communication round; wherein | B | is the number of tags staying in the unselected state in the set B;
step 2) for any label t in the unselected state in the set BBCalculating a random number f (t)B)，
f(tB)＝H(tB Infomod|B|) (1-2)
Wherein, tBIs any label in the set B, tB InfoIs a label tBLabel information of H (t)B Infomod | B |) is a hash function shared by all tags in the set B and the RFID reader;
step 3), the RFID reader constructs a bit array F for the set B, and the bit array F comprises | B | bits; the bit array F construction rule is: if the label t in the set BBRandom number f (t) ofB) J, j ∈ {0, 1., | B | -1}, only uniquely corresponding to one label in the set B, then each corresponding bit F [ j ] in the bit array F]Value is 1, otherwise, F [ j ]]The value is 0;
step 4), the RFID reader broadcasts a bit array F to the set B;
step 5) after the set B receives the bit array F, each label t in the unselected stateBCheck F (F (t)B) ); if F (F (t)B) 1), then the label tBTake Cnt (f (t)B) + N- | B | enters the acknowledge state in the only order; otherwise, the tag tBRemain in the unselected state;
wherein Cnt (f (t)B) Is a bit array { F (0), F (1) }, F (F (t)B) A number of values 1 in (a) }; confirming the status as tag tBThere is an explicit need to report its tag information t to the RFID readerB InfoThe state of (1);
step 6), the communication round is finished, the RFID reader deletes the tags entering the confirmation state from the set B, and the step 1 is circulated until the set B is an empty set; and the tag information sampling subset T is recorded as a set which is obtained by sequencing all tags in the set B according to the unique sequence for reporting the tag information to the RFID reader.
Further, said PSIn the step 2) of the stage-1, a random number h (t) is e {0,1,. and N-1}, and any integer value of the random number h (t) corresponds to only one label in the label population set S.
Further, said PSIn phase-1, the probability of selecting K tags among the tags remaining in the unselected state in the global set of tags S is K! /NK；
Defining a set of any K selected tags in the tag population set S as { t }1,t2,...,tK1 ≦ K ≦ N, set { t ≦ K ≦ N1,t2,...,tKThe probability that all tags in the list remain in the unselected state is SP { t }1,t2,...,tK}；
For any tag in the population of tags S mapped to a hash integer h (t) e {0, 1.,. N-1} to occur independently and uniformly, assuming that the RFID reader employs a random variable to ensure that the hash integers for the selected K tags are all less than K,
further, the protocol PSIs denoted as | PSI, communication cost | PSL is stage PS-1 and phase PS-2 sum of communication costs;
the P isSThe communication cost of the stage-1 is that the RFID reader sends all the tags in the tag population set SSending a first random seed r1Log is2(N) position;
the P isSThe communication cost of the-2 stage is that the RFID reader sends a signal with | B | and a second random seed r to all tags in the set B2Request of<|B|,r2>Constructing a bit array F until the set B is the communication cost of all communication rounds of the empty set;
in the first round of communication, | B | ═ K, the RFID reader sends requests to all tags in set B<|B|,r2>2log is required2(K) Bits and K bits to construct an array of bits of size | B |, i.e., the communication cost of the RFID reader is 2log on the first round of communication2(K)+K；
If the tags entering the determined state exist in the first round communication round set B, deleting the tags entering the determined state from the set B when the first round communication round is ended, wherein the probability of deleting the tags entering the determined state is
(1-1/|B|)K-1≈e-1；
In the second round of communication, set B includes (1-e)-1) K labels, | B | ═ 1-e-1) K, the RFID reader sends a new request<|B|,r2>To all tags in set B, 2log is required2(K) (1-e) of bit sum construction bit array of size | B |-1) K bits, i.e. the communication cost of the RFID reader in the second round of communication is 2log2(K)+(1-e-1)K；
By analogy to the first round of communication, the communication cost of the RFID reader in the first round of communication is 2 logs2(K)+(1-e-1)l；
The size of set B is reduced by a fixed proportion (1-e) in each communication round-1) Then P isSAfter in (K) round in stage 2, the set B is an empty set;
thus, at PSStage-2, the total communication cost of the RFID reader to send to the tag is:
In(K)×2log2(K)+K+K(1-e-1)+...+K(1-e-1)In(K)
＝In(K)×2log2(K)+K×e(1-(1-e-1)In(K))≤K×e+In(K)×2log2(K)
namely, it is
|PS|≤log2(N)+K×e+In(K)×2log2(K) (1-4)。
Further, the communication cost | PS|＝log2(N)+K×e+In(K)×2log2(K)。
The invention also discloses a computer readable storage medium, which stores a computer program, and when the computer program is executed by a processor, the RFID tag information sampling method is realized.
According to the technical scheme, the RFID tag information sampling method provided by the technical scheme of the invention has the following beneficial effects:
the invention discloses an RFID (radio frequency identification) tag information sampling method, relates to the technical field of network information of the Internet of things, and aims to design a protocol P between an RFID reader and tags in a tag total set SSThe problem of tag information sampling in the RFID system is solved; protocol P disclosed by the inventionSComprising two phases in which the state of the tag, i.e. P, is determined separatelyS1, randomly extracting K labels from N different labels in a label population set S by adopting a first random seed computing hash function to form a label information sampling subset T, wherein the probability that any subset with K labels in the label population set S is selected as T is equal, and label sampling is realized; pSAnd 2, determining the state transformation of the tags under multiple rounds of communication rounds by adopting a second random seed calculation hash function and combining the characteristics of the RFID reader, informing any tag in the tag information sampling subset T of the unique sequence, reporting the tag information of the tag to the RFID reader according to the sequence, and finishing tag sequencing. The RFID label information sampling method disclosed by the invention can fully and effectively solve the problem of label information sampling, and has low communication cost and better performance.
It should be understood that all combinations of the foregoing concepts and additional concepts described in greater detail below can be considered as part of the inventive subject matter of this disclosure unless such concepts are mutually inconsistent.
The foregoing and other aspects, embodiments and features of the present teachings can be more fully understood from the following description taken in conjunction with the accompanying drawings. Additional aspects of the present invention, such as features and/or advantages of exemplary embodiments, will be apparent from the description which follows, or may be learned by practice of specific embodiments in accordance with the teachings of the present invention.
Drawings
The drawings are not intended to be drawn to scale. In the drawings, each identical or nearly identical component that is illustrated in various figures may be represented by a like numeral. For purposes of clarity, not every component may be labeled in every drawing. Embodiments of various aspects of the present invention will now be described, by way of example, with reference to the accompanying drawings, in which:
FIG. 1 is an example of the present invention for the problem of tag information sampling.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the drawings of the embodiments of the present invention. It is to be understood that the embodiments described are only a few embodiments of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the described embodiments of the invention without any inventive step, are within the scope of protection of the invention. Unless defined otherwise, technical or scientific terms used herein shall have the ordinary meaning as understood by one of ordinary skill in the art to which this invention belongs.
The use of "first," "second," and similar terms in the description and claims of the present application do not denote any order, quantity, or importance, but rather the terms are used to distinguish one element from another. Similarly, the singular forms "a," "an," or "the" do not denote a limitation of quantity, but rather denote the presence of at least one, unless the context clearly dictates otherwise. The terms "comprises," "comprising," or the like, mean that the elements or items listed before "comprises" or "comprising" encompass the features, integers, steps, operations, elements, and/or components listed after "comprising" or "comprising," and do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. "upper", "lower", "left", "right", and the like are used only to indicate relative positional relationships, and when the absolute position of the object to be described is changed, the relative positional relationships may also be changed accordingly.
Based on the prior protocol used for the RFID reader and the tags in the tag population set S in the prior art, all the tag information of the tags is generally read, and the technical problems that redundant tag information cannot be removed, so that the tag information collection is time-consuming and unnecessary and the communication cost is high are caused; the invention aims to provide an RFID label information sampling method, which effectively avoids the collection of redundant label information and obviously reduces the communication cost by designing a protocol PS between an RFID reader and labels in a label overall set S.
The following describes the RFID tag information sampling method according to the present invention with reference to the accompanying drawings and embodiments.
As shown in fig. 1, an RFID system is known, which includes an RFID reader, a population S of tags having N tags, and a backend server, where all tags in the population S of tags are within the interrogation range of the RFID reader. Each tag t in the tag population set S carries an ID, which is denoted as tID，tIDUniquely identifying a tagged object, tIDHas been collected by the RFID reader and stored in the back-end server. Each tag t also contains certain information that the user wishes to collect periodically, such as attribute data of an object to which the tag t is associated, or environmental data of a sensor mounted on the tag t, which is denoted tag information of the tag t, denoted tInfo。
For the RFID system, the problem of tag information sampling refers to that K different tags are randomly selected from a tag overall set S to form a tag information sampling subset T, then the unique sequencing of each tag is informed in T, and each tag reports the tag information carried by the tag to an RFID reader according to the sequence.
The invention discloses an RFID label information sampling method, which designs a protocol P between an RFID reader and labels in a label overall set S in an RFID systemSProtocol PSThe result of (c) satisfies:
C-I: randomly extracting K labels from N different labels in a label overall set S, wherein the probability that any subset with the K labels in the label overall set S is selected as T is equal, and K is the preset size of a label information sampling subset T;
C-II: any tag in the tag information sampling subset T is informed of the unique sequence of the tags, and tag information of the tags is reported to the RFID reader according to the sequence;
said protocol PSComprises two stages, respectively denoted as PS-1、PS-2；
The P isS-1 comprises the following steps:
step 1) initializing all tags in the tag population set S to be in an unselected state, and sending a random seed r with a first random seed to all tags in the tag population set S by an RFID reader1To start communication;
step 2) receiving the first random seed r to any one1Tag t ofsCalculating a random number h (t)s)，
h(ts)＝H(ts Info,r1)mod N (1-1)
Wherein, tsIs any label in the label population set S, N is the total number of labels in the label population set S, ts InfoIs a label tsLabel information of H (t)s Info,r1) The method comprises the steps that a hash function shared by all tags in a tag population set S and RFID readers is formed;
step 3) traversing any label t in the label overall set SsIf the label t issCorresponding random number h (t)s)<K, then the label tsRemains in the unselected state, otherwise, tag tsGo inactiveState;
wherein the unselected state is whether the tag is not clear or not to report the tag information t to the RFID readers InfoThe state of (1); inactive State is when a tag explicitly does not need to report its tag information t to the RFID readers InfoThe state of (1).
The hash function H () in the above step 2) can be used to combine any label t in the overall set S of labelssRandomly and uniformly mapping to integer h (t)s) E.g., {0, 1.,. N-1}, i.e., a random number h (t)s) Corresponds to only one tag in the population S of tags. Therefore, K tags in the tag information sampling subset T can be uniformly mapped to integers in the range of {0,1, 2.,. K-1} in step 2). For the first random seed r1Some values of (c) may result in the total number of tags mapped to the integer {0, 1.,. K-1} being more or less than K, but since the tag IDs of all tags in the population S of tags are known based on the RFID reader, the first random seed r may be avoided1Taking the value that the integer quantity which can not meet the mapping is less than K, namely the RFID reader can perform pretest to obtain the first random seed r1And the better value is taken, so that the selected K labels in the label population set S are accurately mapped to be smaller than K. I.e. at PS-1 stage, the RFID reader selects the first random seed r used1It is always ensured that a random, exact K tags from the global set S of tags remain in the unselected state in step 3), and the set of K tags can be used to construct the tag information sample subset T.
In the tag population set S { t1,t2,...,tSThe probability of selecting K tags among the tags remaining in the unselected state is K! /NK(ii) a The specific calculation process is that the set of any K selected labels in the tag population set S is defined as { t1,t2,...,tK1 ≦ K ≦ N, set { t ≦ K ≦ N1,t2,...,tKThe probability that all tags in the list remain in the unselected state is SP { t }1,t2,...,tK}; for any label in the total set S of labels is mapped to oneThe hash integers h (t) e {0,1,. N-1} occur independently and uniformly at random, assuming that the RFID reader employs a random variable to ensure that the hash integers for the selected K tags are all less than K,
the P isS-2 comprises the following steps:
step 1) defining a label overall set S at PSThe set of tags that stay in the unselected state in stage 1 is B; if B is not an empty set, the RFID reader sends a random seed r with | B | and a second random seed to all the tags in the set B2Request of<|B|,r2>Starting a new communication round; wherein | B | is the number of tags staying in the unselected state in the set B;
step 2) for any label t in the unselected state in the set BBCalculating a random number f (t)B)，
f(tB)＝H(tB Infomod|B|) (1-2)
Wherein, tBIs any label in the set B, tB InfoIs a label tBLabel information of H (t)B Infomod | B |) is a hash function shared by all tags in the set B and the RFID reader;
step 3), the RFID reader constructs a bit array F for the set B, and the bit array F comprises | B | bits; the bit array F construction rule is: if the label t in the set BBRandom number f (t) ofB) J, j ∈ {0, 1., | B | -1}, only uniquely corresponding to one label in the set B, then each corresponding bit F [ j ] in the bit array F]Value is 1, otherwise, F [ j ]]The value is 0.
Step 4), the RFID reader broadcasts a bit array F to the set B;
step 5) after the set B receives the bit array F, each label t in the unselected stateBCheck F (F (t)B) ); if F (F (t)B) 1), then the label tBTake Cnt (f (t)B) + N- | B | unique order entryConfirming the state; otherwise, the tag tBRemain in the unselected state;
wherein Cnt (F (t)) is a bit array { F (0), F (1) }, F (F (t))B) A number of values 1 in (a) }; confirming the status as tag tBThere is an explicit need to report its tag information t to the RFID readerB InfoThe state of (1);
step 6), the communication round is finished, the RFID reader deletes the tags entering the confirmation state from the set B, and the step 1 is circulated until the set B is an empty set; and the tag information sampling subset T is recorded as a set which is obtained by sequencing all tags in the set B according to the unique sequence for reporting the tag information to the RFID reader.
To PSStep 2) to step 5) of the-2 stage are specifically described as follows by using an embodiment, assuming that the set B contains 3 tags in an unselected state, t1、t2、t3In the first round of communication, the hash values of the 3 tags are assumed to be f (t) respectively1)＝1、f(t2)＝1、f(t3) If 2, then the RFID reader will build a binary 3-bit array, since tag t1、t2The corresponding random numbers are equal, i.e., do not correspond to only one tag in set B, so the 3-bit array is denoted as F ═ 001, and is broadcast to all tags in set B. After any tag in set B receives the 3-bit array F ═ 001', tag t3Result in F (F (t)3) F (2) ═ 1, so label t3Will take Cnt (f (t)3) In this case, + N- | B | ═ Cnt (2) +3-3 ═ 1 as its unique order, and the confirmation status is entered. In the bit array { F (0), F (1), F (2) } the number of the array with 1 is only 1, so Cnt (F (t) is3) 1, the other two tags t1、t2Still in the unselected state because their corresponding bits in the 3-bit array F ═ 001 "are equal to" 0 ".
At the end of the first round of communication, the RFID reader deletes the tag t from the set B3. In the second round of communication, the hash values of the 2 tags in the unselected state in the set B are assumed to be f (t)1)＝1、f(t2) If 0, then RFID readsThe machine will build a 2-bit array F of "11" and broadcast to all tags in set B. Any tag in set B, upon receiving 2-bit array F ═ 11 ", checks tag t1To obtain F (F (t)1) F (1) equals "1", then tag t is identified1Will take Cnt (f (t)1) In this case, + N- | B | ═ Cnt (1) +3-2 ═ 2+3-2 ═ 3 as its unique order, and the confirmation status is entered. And a label t1Similarly, the label t2Using Cnt (f (t)2) In this case, + N- | B | ═ Cnt (0) +3-2 ═ 1+3-2 ═ 2 as its unique order, and the confirmation status is entered. At the end of the second round of communication, the RFID reader deletes tag t from set B1、t2Set B is an empty set, PS-2 stage completion stop. Recording the set B with all tags sorted according to the unique sequence for reporting tag information to the RFID reader based on the tag information sampling subset T, so that the tag information sampling subset T is { T }3、t2、t1}。
The embodiment fully describes a protocol P designed by adopting the RFID label information sampling method of the inventionSCan effectively solve the problem of label information sampling, and the protocol P designed by the inventionSHas lower communication cost and good performance.
Protocol PSIn the above-mentioned PSStage-1 comprises only one simple communication round, i.e. each tag in the population S of tags uses the first random seed r transmitted from the RFID reader1A random hash function h (t) is calculated in order to determine whether the label should remain in the unselected state or move to the inactive state, i.e. K labels are selected for the overall set S of labels. PSThe goal of stage-2 is at PS-1, after completion, processing the K tags remaining in the unselected state in order to inform each of the K tags of a corresponding one of the sequences {1,2, …, K }, the tags of the determined sequence then entering the acknowledged state in a unique sequence, reporting tag information to the RFID reader. PSThe-2 phase consists of a plurality of communication rounds, each round to have one or more tags with a unique ordering corresponding to the order {1, 2.,. K }, such that the unique ordering is known in the unselected stateThe one or more tags enter an acknowledged state in an ordered manner until no tags are in the unselected state, and the set B is an empty set.
PS-1 stages and PSThe sum of the communication costs of the 2 phases is the protocol PSCommunication cost of, protocol PSIs denoted as | PSThe specific description is as follows:
the P isSThe communication cost of stage-1 is that the RFID reader sends the first random seed r to all tags in the tag population set S12log is required2(N) bits, this communication cost has been disclosed in the paper "how simple hash functions work: using entropy in the data stream ".
The P isSThe communication cost of the-2 stage is that the RFID reader sends a signal with | B | and a second random seed r to all tags in the set B2Request of<|B|,r2>Constructing a bit array F until the set B is the communication cost of all communication rounds of the empty set;
in the first round of communication, | B | ═ K, the RFID reader sends requests to all tags in set B<|B|,r2>2log is required2(K) Bits and K bits to construct a bit array of size | B |, i.e., the communication cost of the RFID reader is 2log on the first round of communication2(K)+K；
If the tags entering the determined state exist in the first round communication round set B, deleting the tags entering the determined state from the set B when the first round communication round is ended, wherein the probability of deleting the tags entering the determined state is
(1-1/|B|)K-1≈e-1；
In the second round of communication, set B includes (1-e)-1) K labels, | B | ═ 1-e-1) K, the RFID reader sends a new request<|B|,r2>To all tags in set B, 2log is required2(K) (1-e) of bit sum construction bit array of size | B |-1) K bits, i.e. the communication cost of the RFID reader in the second round of communication is 2log2(K)+(1-e-1)K；
Analogize to the first round of communication, in the first roundCommunication cost of communication round RFID reader is 2log2(K)+(1-e-1)l；
The size of set B is reduced by a fixed proportion (1-e) in each communication round-1) Then P isSAfter in (K) round in stage 2, the set B is an empty set;
thus in PSStage-2, the total communication cost of the RFID reader to send to the tag is:
In(K)×2log2(K)+K+K(1-e-1)+...+K(1-e-1)In(K)
＝In(K)×2log2(K)+K×e(1-(1-e-1)In(K))≤K×e+In(K)×2log2(K)
namely, it is
|PS|≤log2(N)+K×e+In(K)×2log2(K) (1-4)。
To ensure the protocol PSHaving communication cost satisfying application requirements, practical application | PSThe lower bound value is log2(N)+K×e+In(K)×2log2(K)。
The RFID tag information sampling method disclosed by the invention is realized in the form of a software functional unit of a computer program and can be stored in a computer readable storage medium when being sold or used as an independent product. Based on such understanding, all or part of the processes in the method according to the above embodiments of the present invention may also be implemented by a computer program, which may be stored in a computer-readable storage medium and can be executed by a processor to implement the steps and results of the above method embodiments.
Although the present invention has been described with reference to the preferred embodiments, it is not intended to be limited thereto. Those skilled in the art can make various changes and modifications without departing from the spirit and scope of the invention. Therefore, the protection scope of the present invention should be determined by the appended claims.
Claims (6)
1. An RFID label information sampling method is characterized in that R isIn an FID system, a protocol P between an RFID reader and tags in a population of tags S is designedSProtocol PSThe result of (c) satisfies:
C-I: randomly extracting K labels from N different labels in a label overall set S, wherein the probability that any subset with the K labels in the label overall set S is selected as T is equal, and K is the preset size of a label information sampling subset T;
C-II: any tag in the tag information sampling subset T is informed of the unique sequence of the tags, and tag information of the tags is reported to the RFID reader according to the sequence;
said protocol PSComprises two stages, respectively denoted as PS-1 and PS-2；
The P isS-1 comprises the following steps:
step 1) initializing all tags in the tag population set S to be in an unselected state, and sending a random seed r with a first random seed to all tags in the tag population set S by an RFID reader1To start communication;
step 2) receiving the first random seed r to any one1Tag t ofsCalculating a random number h (t)s)，
h(ts)＝H(ts Info,r1)mod N (1-1)
Wherein, tsIs any label in the label population set S, N is the total number of labels in the label population set S, ts InfoIs a label tsLabel information of H (t)s Info,r1) The method comprises the steps that a hash function shared by all tags in a tag population set S and RFID readers is formed;
step 3) traversing any label t in the label overall set SsIf the label t issCorresponding random number h (t)s)<K, then the label tsRemains in the unselected state, otherwise, tag tsEntering an inactive state;
wherein the unselected state is whether the tag is not clear or not to report the tag information t to the RFID readers InfoThe state of (1); is not aliveThe transition state is that the tag definitely does not need to report its tag information t to the RFID readers InfoThe state of (1);
the P isS-2 comprises the following steps:
step 1) defining a label overall set S at PSThe set of tags that stay in the unselected state in stage 1 is B; if B is not an empty set, the RFID reader sends a random seed r with | B | and a second random seed to all the tags in the set B2Request of<|B|,r2>Starting a new communication round; wherein | B | is the number of tags staying in the unselected state in the set B;
step 2) for any label t in the unselected state in the set BBCalculating a random number f (t)B)，
f(tB)＝H(tB Infomod|B|) (1-2)
Wherein, tBIs any label in the set B, tB InfoIs a label tBLabel information of H (t)B Infomod | B |) is a hash function shared by all tags in the set B and the RFID reader;
step 3), the RFID reader constructs a bit array F for the set B, and the bit array F comprises | B | bits; the bit array F construction rule is: if the label t in the set BBRandom number f (t) ofB) J, j ∈ {0, 1., | B | -1}, only uniquely corresponding to one label in the set B, then each corresponding bit F [ j ] in the bit array F]Value is 1, otherwise, F [ j ]]The value is 0;
step 4), the RFID reader broadcasts a bit array F to the set B;
step 5) after the set B receives the bit array F, each label t in the unselected stateBCheck F (F (t)B) ); if F (F (t)B) 1), then the label tBTake Cnt (f (t)B) + N- | B | enters the acknowledge state in the only order; otherwise, the tag tBRemain in the unselected state;
wherein Cnt (f (t)B) Is a bit array { F [0 ]]，F[1]，...，F(f(tB) A number of values 1 in (a) }; confirming the status as tag tBExplicit need to RFID reader reporting its tag information tB InfoThe state of (1);
step 6), the communication round is finished, the RFID reader deletes the tags entering the confirmation state from the set B, and the step 1 is circulated until the set B is an empty set; and the tag information sampling subset T is recorded as a set which is obtained by sequencing all tags in the set B according to the unique sequence for reporting the tag information to the RFID reader.
2. The RFID tag information sampling method of claim 1, wherein P is PSIn the step 2) of the stage-1, a random number h (t) is e {0,1,. and N-1}, and any integer value of the random number h (t) corresponds to only one label in the label population set S.
3. The RFID tag information sampling method of claim 1, wherein P is PSPhase 1, the probability of selecting K tags from the global set S of tags remaining in the unselected state is K! /NK；
Defining any selected set containing K tags in the tag population set S as { t1,t2,...,tK1 ≦ K ≦ N, set { t ≦ K ≦ N1,t2,...,tKThe probability that all tags in the list remain in the unselected state is SP { t }1,t2,...,tK}；
For any tag in the population of tags S mapped to a hash integer h (t) e {0, 1.,. N-1} to occur independently and uniformly, assuming that the RFID reader employs a random variable to ensure that the hash integers for the selected K tags are all less than K,
4. the RFID tag information sampling method of claim 1, wherein the protocol P isSIs denoted as | PSCommunication cost |, communication cost |PSL is stage PS-1 and phase PS-2 sum of communication costs;
the P isSThe communication cost of stage-1 is that the RFID reader sends the first random seed r to all tags in the tag population set S1Log is2(N) position;
the P isSThe communication cost of the-2 stage is that the RFID reader sends a signal with | B | and a second random seed r to all tags in the set B2Request of<|B|,r2>Constructing a bit array F until the set B is the communication cost of all communication rounds of the empty set;
in the first round of communication, | B | ═ K, the RFID reader sends requests to all tags in set B<|B|,r2>2log is required2(K) Bits and K bits to construct a bit array of size | B |, i.e., the communication cost of the RFID reader is 2log on the first round of communication2(K)+K；
If the tags entering the determined state exist in the first round communication round set B, deleting the tags entering the determined state from the set B when the first round communication round is ended, wherein the probability of deleting the tags entering the determined state is
(1-1/|B|)K-1≈e-1；
In the second round of communication, set B includes (1-e)-1) K labels, | B | ═ 1-e-1) K, the RFID reader sends a new request<|B|,r2>To all tags in set B, 2log is required2(K) (1-e) of bit sum construction bit array of size | B |-1) K bits, i.e. the communication cost of the RFID reader in the second round of communication is 2log2(K)+(1-e-1)K；
By analogy to the first round of communication, the communication cost of the RFID reader in the first round of communication is 2 logs2(K)+(1-e-1)l；
The size of set B is reduced by a fixed proportion (1-e) in each communication round-1) Then P isSAfter in (K) round in stage 2, the set B is an empty set;
thus in PS-2 stages of the total communication assembly transmitted by the RFID reader to the tagThe method comprises the following steps:
In(K)×2log2(K)+K+K(1-e-1)+...+K(1-e-1)In(K)
＝In(K)×2log2(K)+K×e(1-(1-e-1)In(K))≤K×e+In(K)×2log2(K)
namely, it is
|PS|≤log2(N)+K×e+In(K)×2log2(K) (1-4)。
5. The RFID tag information sampling method of claim 4, wherein the communication cost | PS|＝log2(N)+K×e+In(K)×2log2(K)。
6. A computer-readable storage medium, in which a computer program is stored, which, when being executed by a processor, carries out the RFID tag information sampling method according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010631410.1A CN111931531B (en) | 2020-07-03 | 2020-07-03 | RFID label information sampling method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010631410.1A CN111931531B (en) | 2020-07-03 | 2020-07-03 | RFID label information sampling method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111931531A CN111931531A (en) | 2020-11-13 |
| CN111931531B true CN111931531B (en) | 2022-03-29 |
Family
ID=73317227
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010631410.1A Active CN111931531B (en) | 2020-07-03 | 2020-07-03 | RFID label information sampling method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111931531B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112613328B (en) * | 2020-12-15 | 2022-04-29 | 安徽工业大学 | Approximate optimization method for subset selection problem in radio frequency identification system |
| CN113988103B (en) * | 2021-11-16 | 2022-08-19 | 徐州稻源龙芯电子科技有限公司 | RFID identification method based on multiple tags |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106778425A (en) * | 2017-01-10 | 2017-05-31 | 合肥工业大学 | A kind of label anti-collision algorithm based on RFID |
| CN109800832A (en) * | 2018-12-25 | 2019-05-24 | 太原理工大学 | A kind of exception information collection method based on large-scale radio-frequency identification system |
| CN110190965A (en) * | 2019-05-17 | 2019-08-30 | 西安电子科技大学 | A kind of RFID cluster label authentication protocol based on hash function |
| CN110807339A (en) * | 2019-11-04 | 2020-02-18 | 中国石油大学(华东) | Lost label detection method of RFID system |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070046467A1 (en) * | 2005-08-31 | 2007-03-01 | Sayan Chakraborty | System and method for RFID reader to reader communication |
| CN101359357B (en) * | 2007-07-30 | 2012-06-06 | 日电（中国）有限公司 | Label recognizing system, label accessing device and label sequent determining method |
-
2020
- 2020-07-03 CN CN202010631410.1A patent/CN111931531B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106778425A (en) * | 2017-01-10 | 2017-05-31 | 合肥工业大学 | A kind of label anti-collision algorithm based on RFID |
| CN109800832A (en) * | 2018-12-25 | 2019-05-24 | 太原理工大学 | A kind of exception information collection method based on large-scale radio-frequency identification system |
| CN110190965A (en) * | 2019-05-17 | 2019-08-30 | 西安电子科技大学 | A kind of RFID cluster label authentication protocol based on hash function |
| CN110807339A (en) * | 2019-11-04 | 2020-02-18 | 中国石油大学(华东) | Lost label detection method of RFID system |
Non-Patent Citations (2)
| Title |
|---|
| Nico-Paul Bester ; Alwyn Hoffman.Kalman Filter based RFID tag velocity estimation in the presence of frequency hopping.《 2019 IEEE International Conference on RFID Technology and Applications (RFID-TA)》.2019,第488-493页. * |
| 物联网工程RFID课程教学研究与探索;吴宣够 王小林;《安徽工业大学学报(社会科学版)》;20150315;第32卷(第2期);第101-102页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111931531A (en) | 2020-11-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101211409B (en) | System and method for collecting and analyzing multi-field two-dimensional code | |
| CN111931531B (en) | RFID label information sampling method | |
| CN110806954B (en) | Method, device, equipment and storage medium for evaluating cloud host resources | |
| Renold et al. | An internet based RFID library management system | |
| US9275068B2 (en) | De-duplication deployment planning | |
| CN103268465B (en) | The method for quickly identifying of label classification in a kind of radio-frequency recognition system | |
| CN101727604A (en) | Rfid-based data reduction system and techniques | |
| CN114385833A (en) | Method and device for updating knowledge graph | |
| US9715670B2 (en) | Industrial identify encoding and decoding language | |
| CN111367956B (en) | Data statistics method and device | |
| Liu et al. | Time-efficient range detection in commodity RFID systems | |
| Tyagi et al. | Dynamic threshold based sliding-window filtering technique for RFID data | |
| CN108804588A (en) | A kind of mixed data flow data label method | |
| Liu et al. | Pinpointing anomaly RFID tags: Situation and opportunities | |
| CN110134712B (en) | Entity information mark processing method and device, storage medium and terminal | |
| CN106095891A (en) | A kind of magnitude of the operation identification statistical method being applicable to foreground personnel | |
| CN109272085B (en) | RFID intelligent tool management system based on cloud data | |
| CN209965678U (en) | Intelligent bookshelf device of thing networking | |
| Tyagi et al. | RFID Data Management | |
| CN102402420A (en) | Parsing observable collections | |
| Zhu et al. | Research on the Application of RFID in Equipment Management in Universities | |
| JP2005234628A (en) | Physical distribution managing system and physical distribution managing method | |
| Tyagi et al. | Extending Temporal and Event Based Data Modeling for RFID Databases | |
| CN205384609U (en) | System for be used for networking storage biological identification information | |
| Mahdin et al. | An approach to filtering RFID data streams |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231125 Address after: 3427, 4th Floor, Building 3, No. 33 Zique Road, Haidian District, Beijing, 100080 Patentee after: Beijing Lingyi times Communication Technology Co.,Ltd. Address before: Room 1128, 11th Floor, Building 9, No. 18 Zhuoxiu North Street, Fangshan District, Beijing, 102400 Patentee before: Beijing Tiancheng Huipu Information Technology Co.,Ltd. Effective date of registration: 20231125 Address after: Room 1128, 11th Floor, Building 9, No. 18 Zhuoxiu North Street, Fangshan District, Beijing, 102400 Patentee after: Beijing Tiancheng Huipu Information Technology Co.,Ltd. Address before: 243032 Ma'anshan City, Anhui Province, the East District of the new town of Ma Xiang Road Patentee before: ANHUI University OF TECHNOLOGY |
|
| TR01 | Transfer of patent right |