CN110472450B - Missing number-known RFID (radio frequency identification) missing tag identification method - Google Patents

Missing number-known RFID (radio frequency identification) missing tag identification method Download PDF

Info

Publication number
CN110472450B
CN110472450B CN201910565440.4A CN201910565440A CN110472450B CN 110472450 B CN110472450 B CN 110472450B CN 201910565440 A CN201910565440 A CN 201910565440A CN 110472450 B CN110472450 B CN 110472450B
Authority
CN
China
Prior art keywords
tags
missing
time slot
tag
reader
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910565440.4A
Other languages
Chinese (zh)
Other versions
CN110472450A (en
Inventor
朱小军
钟慧
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing University of Aeronautics and Astronautics
Original Assignee
Nanjing University of Aeronautics and Astronautics
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Nanjing University of Aeronautics and Astronautics filed Critical Nanjing University of Aeronautics and Astronautics
Priority to CN201910565440.4A priority Critical patent/CN110472450B/en
Publication of CN110472450A publication Critical patent/CN110472450A/en
Application granted granted Critical
Publication of CN110472450B publication Critical patent/CN110472450B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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

Abstract

The invention discloses a missing number known-oriented RFID (radio frequency identification) missing tag identification method, which comprises the following steps of: (1) a pretreatment stage: the reader distributes unique and continuous index numbers for all the tags, and the tags can calculate the group numbers and the positions in the groups where the tags are located according to the index numbers; (2) and (3) single missing label identification stage: according to the optimal grouping number of single missing tags, finding a time slot with the first response tag number less than the expected tag number, and iteratively grouping and identifying until the tag number in the group is less than or equal to 1; (3) and (3) identifying multiple missing tags: and detecting the number of response tags in each time slot according to the optimal grouping number of the multiple missing tags, finding out all time slots with the number of tags less than the expected number of tags, and iterating grouping identification until the queue is empty. The method can quickly identify the missing tags in the scene with known number of the missing tags.

Description

Missing number-known RFID (radio frequency identification) missing tag identification method
Technical Field
The invention relates to the technical field of RFID, in particular to a missing number known-oriented RFID tag identification method.
Background
The missing tag identification is that the RFID reader finds the ID of the missing tag through some inquiry information. A typical identification method is to have the reader poll each tag's ID. If the tag does not respond, the tag may be deemed to be missing. Although this method can accurately identify missing tags, this identification method is inefficient because the ID length of each tag is 96 bits.
Another method is for the reader to broadcast a polling request consisting of some parameters, waiting for the response of the collecting tag. Each tag selects a slot response based on the hash value. Since the reader knows the IDs of all tags in advance, the reader knows the status of each slot in advance. By comparing the real slot status with the expected slot status, the reader can identify whether the tag is missing.
These methods all assume that the number of missing tags is unknown. In some practical application scenarios, the number of missing tags may be obtained by other means. The existing methods cannot effectively utilize the part of information.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a method for identifying missing RFID tags for the known number of missing tags, which solves the problem of identifying missing RFID tags by using a grouping concept when the number of missing tags is known in the environment of an RFID system.
In order to solve the above technical problem, the present invention provides a missing number-oriented known RFID tag identification method, including the following steps:
(1) in the preprocessing stage, the reader distributes unique and continuous index numbers to all the tags, and the tags can calculate the group numbers and the positions in the groups where the tags are located according to the index numbers; reader obtaining parameters p, Wt、EtWhere p is a parameter of the collision signal detection technique, the technique may deduce the specific number of tags causing collisions, W, when the number of tags causing collisions does not exceed ptValue of interframe space for RFID systems, EtThe length of a single time slot for the RFID system;
(2) in the stage of single missing label identification, the reader identifies according to p and WtAnd EtCalculating the optimal grouping number n of single missing labels1The value is given by the equation xlnx-x ═ Wt/EtThe reader issues a frame, the number of time slots of which is n1The tag replies within the frame; if the reader finds the time slot with the number of the first response tags less than the number of the expected tags, the missing tags exist in the grouped tags corresponding to the time slot; iteratively identifying the tag group until the number in the group is less than or equal to 1, thereby identifying the index number of the missing tag;
(3) in the stage of identifying multiple missing tags, the reader identifies the tags according to p and WtAnd EtCalculating the optimal number of packets n2The value is equation len (x-1)2＝(len-1)(Wt/Et+1) solution, where len is the total number of tags, the reader issues a frame with a number of slots n2The tag replies within the frame; and the reader detects the number of the response tags in each time slot, finds out the time slots with the number of all tags less than the expected number of the tags, iteratively identifies the tag groups until the queue is empty, and outputs the index numbers of all the missing tags.
Preferably, the single missing tag identification stage in the step (2) includes the following steps:
(21) the label end executes the following steps: setting the initial maximum index number and the minimum index number as S and L respectively; let n be1Optimal grouping for single missing tagsNumber, len is the number of tags, i.e., len is L-S +1, let index be the tag index number, and j is index-S + 1; if it is not
Figure BDA0002109452510000021
Then the label should be at
Figure BDA0002109452510000022
Recovering each time slot; if it is not
Figure BDA0002109452510000023
Then the label should be at
Figure BDA0002109452510000024
Figure BDA0002109452510000025
A slot recovery, where mod (x, y) refers to the remainder of x divided by y,
Figure BDA00021094525100000214
taking the integer of x;
(22) the reader divides the tags into groups if
Figure BDA0002109452510000026
Then set the number of groups to
Figure BDA0002109452510000027
Such that each group contains p tags, otherwise the tags are divided into n1The reader broadcasts a frame, and the time slot number of the frame is the same as the tag grouping number;
(23) the reader end is in the identification process, if preceding mod (len, n)1) The number of detected response tags in a time slot is
Figure BDA0002109452510000028
Updating the label interval (S, L) where the missing label is located; if it is at the back n1-mod(len，n1) The number of detected response tags in a time slot is
Figure BDA0002109452510000029
And updating the label interval (S, L) where the missing label is positioned.
Preferably, the multiple missing tag identification step (3) includes the following steps:
(31) and (3) label end: setting the initial maximum index number and the minimum index number as S and L respectively; let n be1The optimal grouping number of the single-missing tags is len, namely len is the number of the tags, namely, len is L-S +1, index is the index number of the tags, and j is index-S + 1; if it is not
Figure BDA00021094525100000210
Then the label is at
Figure BDA00021094525100000211
Recovering each time slot; if it is not
Figure BDA00021094525100000212
Then the label is at
Figure BDA00021094525100000213
A slot recovery, where mod (x, y) refers to the remainder of x divided by y,
Figure BDA0002109452510000031
taking the integer of x;
(32) the reader divides the tags into groups if
Figure BDA0002109452510000032
Number of groups of
Figure BDA0002109452510000033
Such that each group contains p tags, otherwise the tags are divided into n2A group; the reader broadcasts a frame, and the time slot number of the frame is the same as the tag grouping number;
(33) reader in identification process, if preceding mod (len, n)2) The number of detected response tags in one time slot is less than that of the response tags in the other time slot
Figure BDA0002109452510000034
Enqueuing the interval upper and lower limits of the group of tags; if the tags do not respond, the tags in the time slot are all lost, and the interval upper and lower limits of the group of tags are all stored in another queue; if it is at the back n2-mod(len，n2) The number of detected response tags in one time slot is less than that of the response tags in the other time slot
Figure BDA0002109452510000035
Enqueuing the interval upper and lower limits of the group of tags; and if the tags do not respond, the tags in the time slot are all lost, and the interval upper and lower limits of the group of tags are all stored in another queue.
The invention has the beneficial effects that: the invention can fully utilize the information of the number of the missing labels to identify the missing labels at a higher speed.
Drawings
FIG. 1 is a schematic flow chart of the method of the present invention.
Fig. 2 is a schematic view of the operation flow of the single missing tag identification phase of the present invention.
Fig. 3 is a schematic view of the operation flow of the multiple missing tag identification phase of the present invention.
Fig. 4 is a schematic diagram illustrating the operation time of the single missing tag identification method according to the present invention.
FIG. 5 is a schematic diagram of the run time for different p values according to the present invention.
Fig. 6 is a schematic view of the running time of the multiple missing tag identification method according to the present invention, as the missing rate changes.
Fig. 7 is a schematic diagram of the running time of the multiple missing tag identification method according to the present invention, as the number of tags changes.
Detailed Description
As shown in fig. 1, a method for identifying a missing RFID tag with a known missing number includes the following steps:
1. a pretreatment stage;
the purpose of this step is to perform a pre-treatment before identifying missing tags. The reader firstly distributes unique and continuous index numbers for all the tags, and the tags can calculate the group numbers and the positions in the groups where the tags are located according to the index numbers. Using collision signal detection techniques, reader detectionWhen a collision signal is detected, the specific number of tags causing collision can be obtained when the number of tags causing collision does not exceed p. The p-value is entered by the user or obtained by system measurements. WtAnd EtObtained by system measurements, wherein WtIndicates the inter-frame gap, EtIndicating the length of a single slot.
2. A single missing label identification stage;
when a single missing label is identified, the optimal grouping number n of the single missing label needs to be obtained1. Reader according to p, WtAnd EtCalculating the optimal number of packets n1. Let x0Is the equation xlnx-x ═ Wt/EtIs determined. Let len denote the total number of tags. If it is
Figure BDA0002109452510000041
Setting n1Has a value of
Figure BDA0002109452510000042
Such that each group contains p tags. Otherwise, the tag is divided into x0And (4) grouping. The reader issues a frame with the number of time slots of n1The tag replies within the frame.
As shown in fig. 2. S, L, n1Indicating the maximum index number, the minimum index number and the number of packets, len indicating the number of tags and L-S +1, i being a slot variable, and p indicating the maximum recognizable number of collision tags in one slot.
The reader end executes the following processes: dividing the tags into n according to the initial maximum index number and minimum index number of the tags1And grouping the groups, and ensuring that the number of the maximum group and the minimum group is at most 1. And judging the size relationship between the number in the group and the p value. Number of tags in group
Figure BDA0002109452510000043
When n needs to be reset1Has a value of
Figure BDA0002109452510000044
Such that each group contains p tags. Otherwise, the label is divided into n1And (4) grouping. ReadingThe device broadcasts a time frame and associated parameters to all tags. The reader collects the responses of the tags and detects the number of the actual responding tags in each time slot. If the number of the real response tags in a certain time slot is the same as the number of the expected response tags, continuing to execute the next time slot; otherwise, the corresponding packet tag has a missing tag. And finally, when the number in the group is less than or equal to 1, namely S is less than or equal to L, the missing tag can be identified and the index number of the missing tag is returned. In the identification process, due to the fact that the number of the labels corresponding to the time slots is different, the discussion needs to be performed in different situations.
(1) If mod (len, n) before1) The number of detected response tags in a time slot is
Figure BDA0002109452510000045
And updating the label interval (S, L) where the missing label is positioned. The identification process of the single missing tag is repeatedly performed.
(2) If it is at the back n1-mod(len，n1) The number of detected response tags in a time slot is
Figure BDA0002109452510000046
And updating the label interval (S, L) where the missing label is positioned. The identification process of the single missing tag is repeatedly performed.
The label end executes the following process: j denotes index-S +1 of the tag. If it is not
Figure BDA0002109452510000047
Then the label is at
Figure BDA0002109452510000048
And (4) recovering each time slot. If it is not
Figure BDA0002109452510000049
Then the label is at
Figure BDA00021094525100000410
A slot recovery, where mod (x, y) refers to the remainder of x divided by y,
Figure BDA00021094525100000411
to get the integer on x.
3. A multi-missing tag identification stage;
when multiple missing tags are identified, the optimal grouping number n of the multiple missing tags needs to be obtained2. Reader according to p, WtAnd EtCalculating the optimal number of packets n2. Let x0Is equation len (x-1)2＝(len-1)(Wt/Et+1) unique solution. Let len denote the total number of tags. If it is
Figure BDA0002109452510000051
When n is set2Is composed of
Figure BDA0002109452510000052
Such that each group contains p tags. Otherwise, n is set2Is x0. The reader issues a frame with the number of time slots of n2The tag replies within the frame.
As shown in FIG. 3, S, L, n2The index number is the maximum, the index number is the minimum, and the packet number is the minimum, Q represents the interval queue of the missing tags to be polled and detected currently, len represents the number of tags and is L-S +1, i is a time slot variable, p represents the number of the most recognizable collision tags in one time slot, and T represents the queue of the identified missing tags.
The reader end executes the following processes: and the reader enqueues the maximum index number S and the minimum index number L into a queue Q. Dividing the label into n according to S, L2And grouping the groups, and ensuring that the number of the maximum group and the minimum group is at most 1. And judging the size relationship between the number in the group and the p value. Number of tags in group
Figure BDA0002109452510000053
When n needs to be reset2Has a value of
Figure BDA0002109452510000054
Such that each group contains p tags. Dividing the label into n2And (4) grouping. The reader broadcasts a time frame and associated parameters to all tags. The reader collects the responses of the tags and detects the sound in each time slotThe number of labels. If the number of the real response tags in a certain time slot is the same as the number of the expected response tags, continuing to execute the next time slot; otherwise, the corresponding packet tag has a missing tag. And if the number of the real response tags is more than 0, enqueuing the group of tag intervals to Q, and continuing to execute the next time slot. If the tags do not respond, the tags in the time slot are all lost, the index numbers of the group of tags are all output, all the index numbers are enqueued for T, and the next time slot is continuously executed. Finally, when the queue Q is empty, the queue T is output, i.e. the index numbers of all the missing tags. In the identification process, due to the fact that the number of the labels corresponding to the time slots is different, the discussion needs to be performed in different situations.
(1) If mod (len, n) before2) The number of detected response tags in one time slot is less than that of the response tags in the other time slot
Figure BDA0002109452510000055
And enqueuing the interval where the label is positioned into Q. The next slot is continued. And repeating the identification process of the multiple missing tags after the time slots are completely executed.
(2) If it is at the back n2-mod(len，n2(fewer than all responding tags are detected in a time slot
Figure BDA0002109452510000056
And enqueuing the interval where the label is positioned into Q. The next slot is continued. And repeating the identification process of the multiple missing tags after the time slots are completely executed.
The label end executes the following process: j denotes index-S +1 of the tag. If it is not
Figure BDA0002109452510000057
Then the label is at
Figure BDA0002109452510000058
And (4) recovering each time slot. If it is not
Figure BDA0002109452510000059
Then the label is at
Figure BDA0002109452510000061
A slot recovery, where mod (x, y) refers to the remainder of x divided by y,
Figure BDA0002109452510000062
to get the integer on x.
The effects of the present invention can be further illustrated by the following simulation experiments.
In the simulation, time slot Et0.4ms, two time inter-frame overhead WtIs 1.0 ms. Under this condition, we calculate n separately1A value of 5, n2The value is 3. Fig. 4 shows the experimental performance comparison of the single-missing tag identification method proposed by the present invention with the existing method. FIG. 5 shows the effect of different p values on experimental performance, we take p to be 100,200,500 respectively, and it can be seen that the higher p, the shorter the run time. We change the deletion rate and the number of labels respectively, and compare the existing method with the multi-deletion label identification method provided by the invention. The simulation results are shown in FIGS. 6 and 7. In fig. 6, the number of fixed tags is 5000. It can be seen that our protocol requires less runtime when the miss rate is within a certain range. In FIG. 7, the fixed deletion rate is 0.05 and the number of tags varies from 0 to 5000, which shows that our method is superior to the prior art.

Claims (3)

1. A method for identifying a missing RFID tag facing a known missing number is characterized by comprising the following steps:
(1) in the preprocessing stage, the reader distributes unique and continuous index numbers to all the tags, and the tags can calculate the group numbers and the positions in the groups where the tags are located according to the index numbers; reader obtaining parameters p, Wt、EtWhere p is a parameter of the collision signal detection technique, the technique may deduce the specific number of tags causing collisions, W, when the number of tags causing collisions does not exceed ptValue of interframe space for RFID systems, EtThe length of a single time slot for the RFID system;
(2) in the stage of single missing label identification, the reader identifies according to p and WtAnd EtComputingOptimal number of packets n for single missing tag1The value is given by the equation x ln x-x ═ Wt/EtThe reader issues a frame, the number of time slots of which is n1The tag replies within the frame; if the reader finds the time slot with the number of the first response tags less than the number of the expected tags, the missing tags exist in the grouped tags corresponding to the time slot; iteratively identifying the tag group until the number in the group is less than or equal to 1, thereby identifying the index number of the missing tag;
(3) in the stage of identifying multiple missing tags, the reader identifies the tags according to p and WtAnd EtCalculating the optimal number of packets n2The value is equation len (x-1)2＝(len-1)(Wt/Et+1) solution, where len is the total number of tags, the reader issues a frame with a number of slots n2The tag replies within the frame; and the reader detects the number of the response tags in each time slot, finds out the time slots with the number of all tags less than the expected number of the tags, iteratively identifies the tag groups until the queue is empty, and outputs the index numbers of all the missing tags.
2. The method for identifying the missing number of known RFID tags according to claim 1, wherein the single missing tag identification phase in step (2) comprises the following steps:
(21) the label end executes the following steps: setting the initial maximum index number and the minimum index number as S and L respectively; let n be1The optimal grouping number of the single-missing tags is len, namely len is the number of the tags, namely, len is L-S +1, index is the index number of the tags, and j is index-S + 1; if it is not
Figure FDA0002109452500000011
Then the label should be at
Figure FDA0002109452500000012
Recovering each time slot; if it is not
Figure FDA0002109452500000013
Then the label should be at
Figure FDA0002109452500000014
Figure FDA0002109452500000015
A slot recovery, where mod (x, y) refers to the remainder of x divided by y,
Figure FDA0002109452500000016
taking the integer of x;
(22) the reader divides the tags into groups if
Figure FDA0002109452500000017
Then set the number of groups to
Figure FDA0002109452500000018
Such that each group contains p tags, otherwise the tags are divided into n1The reader broadcasts a frame, and the time slot number of the frame is the same as the tag grouping number;
(23) the reader end is in the identification process, if preceding mod (len, n)1) The number of detected response tags in a time slot is
Figure FDA0002109452500000021
Updating the label interval (S, L) where the missing label is located; if it is at the back n1-mod(len，n1) The number of detected response tags in a time slot is
Figure FDA0002109452500000022
And updating the label interval (S, L) where the missing label is positioned.
3. The missing number oriented known RFID tag identification method of claim 1, wherein in the multiple missing tag identification stage of step (3), the method comprises the following steps:
(31) and (3) label end: an initial maximum index number and a minimum index number,respectively setting the two as S and L; let n be1The optimal grouping number of the single-missing tags is len, namely len is the number of the tags, namely, len is L-S +1, index is the index number of the tags, and j is index-S + 1; if it is not
Figure FDA0002109452500000023
Then the label is at
Figure FDA0002109452500000024
Recovering each time slot; if it is not
Figure FDA0002109452500000025
Then the label is at
Figure FDA0002109452500000026
A slot recovery, where mod (x, y) refers to the remainder of x divided by y,
Figure FDA0002109452500000027
taking the integer of x;
(32) the reader divides the tags into groups if
Figure FDA0002109452500000028
Number of groups of
Figure FDA0002109452500000029
Such that each group contains p tags, otherwise the tags are divided into n2A group; the reader broadcasts a frame, and the time slot number of the frame is the same as the tag grouping number;
(33) reader in identification process, if preceding mod (len, n)2) The number of detected response tags in one time slot is less than that of the response tags in the other time slot
Figure FDA00021094525000000210
Enqueuing the interval upper and lower limits of the group of tags; if the tags do not respond, the tags in the time slot are all lost, and the interval upper and lower limits of the group of tags are all stored in another queue; if it is at the back n2-mod(len，n2) The number of detected response tags in one time slot is less than that of the response tags in the other time slot
Figure FDA00021094525000000211
Enqueuing the interval upper and lower limits of the group of tags; and if the tags do not respond, the tags in the time slot are all lost, and the interval upper and lower limits of the group of tags are all stored in another queue.
CN201910565440.4A 2019-06-27 2019-06-27 Missing number-known RFID (radio frequency identification) missing tag identification method Active CN110472450B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910565440.4A CN110472450B (en) 2019-06-27 2019-06-27 Missing number-known RFID (radio frequency identification) missing tag identification method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910565440.4A CN110472450B (en) 2019-06-27 2019-06-27 Missing number-known RFID (radio frequency identification) missing tag identification method

Publications (2)

Publication Number Publication Date
CN110472450A CN110472450A (en) 2019-11-19
CN110472450B true CN110472450B (en) 2021-04-16

Family

ID=68507035

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910565440.4A Active CN110472450B (en) 2019-06-27 2019-06-27 Missing number-known RFID (radio frequency identification) missing tag identification method

Country Status (1)

Country Link
CN (1) CN110472450B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113688641B (en) * 2020-05-19 2023-09-08 香港理工大学深圳研究院 RFID tag identification method, reader, target tag and computer medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016040919A4 (en) * 2014-09-12 2016-05-06 Deductomix, Inc. Read cycles for identifying rfid tags
CN106096466A (en) * 2015-04-27 2016-11-09 张大强 Large-scale wireless radio system is lost the method for quick of label
CN107644185A (en) * 2017-10-23 2018-01-30 中国石油大学(华东) The recognition methods of loss crucial label of the anonymous radio-frequency recognition system based on vector
CN107688762A (en) * 2016-08-05 2018-02-13 东芝泰格有限公司 RFID label tag reading device and control method, terminal device
CN109117687A (en) * 2018-09-28 2019-01-01 中国石油大学(华东) The loss label Iceberg queries method of extensive grouping RFID system based on HZE

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2016040919A4 (en) * 2014-09-12 2016-05-06 Deductomix, Inc. Read cycles for identifying rfid tags
CN106096466A (en) * 2015-04-27 2016-11-09 张大强 Large-scale wireless radio system is lost the method for quick of label
CN107688762A (en) * 2016-08-05 2018-02-13 东芝泰格有限公司 RFID label tag reading device and control method, terminal device
CN107644185A (en) * 2017-10-23 2018-01-30 中国石油大学(华东) The recognition methods of loss crucial label of the anonymous radio-frequency recognition system based on vector
CN109117687A (en) * 2018-09-28 2019-01-01 中国石油大学(华东) The loss label Iceberg queries method of extensive grouping RFID system based on HZE

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
一种快速检测ＲFID 丢失标签的方法;梁雪萍，等;《计算机工程》;20160131;第132-137页 *

Also Published As

Publication number Publication date
CN110472450A (en) 2019-11-19

Similar Documents

Publication Publication Date Title
Myung et al. Tag-splitting: adaptive collision arbitration protocols for RFID tag identification
CN101958804B (en) Method for promoting warning processing efficiency, server and system
EP3335398B1 (en) Method and apparatus for transmitting and receiving data in communication system
CN110472450B (en) Missing number-known RFID (radio frequency identification) missing tag identification method
CN110856264A (en) Distributed scheduling method for optimizing information age in sensor network
CN109446869B (en) Anti-collision method and device for RFID system, computer readable storage medium and equipment
CN109617649A (en) A kind of ZigBee signal decoding method and device based on WiFi equipment
CN109871270B (en) Scheduling scheme generation method and device
CN103336937A (en) Method for estimating number of radio frequency tags based on geometric distribution
WO2015078270A1 (en) Preamble sequence generation method, and timing synchronization method and device
CN105530196B (en) A kind of dispatching method of the AFDX terminal systems based on fictitious link
CN109800832A (en) A kind of exception information collection method based on large-scale radio-frequency identification system
CN108028824B (en) Method and device for determining time offset
CN109117687B (en) HZE-based lost label iceberg query method for large-scale grouping RFID system
CN113676790B (en) Acquisition scheduling method and device for low-voltage centralized meter reading equipment, concentrator and medium
CN106358271B (en) Positioning method, method for determining identification wireless local area network and related device
CN111698331A (en) Cloud synchronization method for Internet of things management data
CN104200246A (en) Grouping N fork tracking tree RFID (radio frequency identification) anti-collision algorithm
Lee et al. A double blocking dynamic framed slotted ALOHA anti-collision method for mobile RFID systems
CN109344673A (en) The loss label Iceberg queries method of extensive grouping RFID system based on SSZE
Chen et al. Adaptive collision resolution for efficient RFID tag identification
CN109255275B (en) The loss label Iceberg queries method of extensive grouping RFID system based on SHZE
Yeh et al. An adaptive n-resolution anti-collision algorithm for RFID tag identification
CN109241803B (en) The loss label Iceberg queries method of extensive grouping RFID system based on SZE
CN112311885B (en) Data transmission method, system and computer readable storage medium

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