CN103870780A - Method for recognizing missing labels based on time slot state change - Google Patents
Method for recognizing missing labels based on time slot state change Download PDFInfo
- Publication number
- CN103870780A CN103870780A CN201410103076.7A CN201410103076A CN103870780A CN 103870780 A CN103870780 A CN 103870780A CN 201410103076 A CN201410103076 A CN 201410103076A CN 103870780 A CN103870780 A CN 103870780A
- Authority
- CN
- China
- Prior art keywords
- time slot
- label
- reader
- conflict
- time slots
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Abstract
The invention discloses a method for recognizing missing labels based on time slot state change, and belongs to the technical field of wireless communication. All labels in a system are mapped into [0..f] time slots according to H<R1, f> by a reader, and the reader is in the state of each time slot before execution of the time slots; for a conflict time slot, if k labels are simultaneously mapped to the conflict time slot, k conflict time slots are achieved; the labels in the k conflict time slots are Hash-mapped into [0..k-1] time slots again through a random number R2 by the reader; if the Hash results Si of the k labels are not equal to one another, it is shown that the k conflict time slots are successfully degraded; otherwise, degradation fails; k-1 time slots will be added for the k labels in the conflict time slots by the reader; the number of each bit in a vector is detected by the reader, for the k conflict time slots, k is larger than or equal to four, and the numbers corresponding to the k conflict time slots are set as zero by the reader; the time slots corresponding to zero bit in the vector are ignored by the reader, and the time slots are not executed.
Description
Technical field
The present invention relates to a kind of method that changes to identify loss label based on time slot state, belong to wireless communication technology field.
Background technology
Along with the development of modern science and technology, radio-frequency (RF) identification (RFID) technology is more and more widely used in multiple fields such as Internet of Things, storehouse management, object tracking.In REID field, the problems such as the identification of number of labels estimation, tag location, loss label are widely studied.Wherein lose tag identification technologies and can allow storekeeper know rapidly loss of goods situation, for modern storehouse management provides new opportunity to develop.This technology take full advantage of REID without the feature of setting up machinery or optics between recognition system and specific objective and contacting, can bring more facility for supvr.
In current loss tag identification technologies, the most basic method is that reader sends one by one the ID of label and waits for the response of label.If reader has been received the response that label sends, illustrate that this label do not lose, otherwise this label loses from system.But this method needs the ID of all labels in transmitting system one by one, and time cost is huge, and efficiency is not high.In order to overcome above-mentioned shortcoming, a kind of method that loss label is identified in variation with time slot state is suggested.First the method sends <r by reader, and f> is to label, and wherein r is the random random number generating of reader, and f is the size of time frame.Secondly, label is according to the <r receiving, f> is mapped in each time slot of [0..f-1] by H (ID, r).Then the time slot moment that each label is chosen in oneself according to mapping result sends response to reader.Because reader is known the ID of all labels in system, so reader can be known the state of each time slot in time frame.Time slot is divided into three types by reader: empty slot, single time slot and conflict time slot.Wherein, empty slot refers to not receive the time slot of any response.Single time slot refers to have and only have a label to send the time slot of response.Conflict time slot refers to that at least two labels send the time slot of response.Reader is identified loss label by detecting the state of each time slot.If it is single time slot that a certain time slot is supposed to, but actual detect be empty slot reader can conclude that label corresponding to this time slot lose.As shown in figure (2), label t
1should be and be mapped to single time slot by expection, be i.e. second time slot in figure.If but become empty slot in the practical implementation of time slot, show label t
1lose.The method has largely improved the efficiency of losing tag recognition.But in the method, empty slot and conflict time slot are not used effectively.So existing technology is not most effective method.
Summary of the invention
In order to overcome above-mentioned deficiency, the invention provides a kind of method that changes to identify loss label based on time slot state.
Change to identify a method of losing label based on time slot state, the method is to realize by losing label detection system, comprises reader, tally set, background server and has the database of all label ID.Wherein background server is connected with reader by high-speed link, and controls the various operations of reader.Reader operates tally set by wireless signal.
Concrete steps are as follows:
(1) employing is appended time slot method degradable conflict time slot is degraded to single time slot
First reader is according to hash function H<R
1, f> arrives all label mappings in system in [0..f] time slot, the state of reader each time slot before time slot is carried out; For conflict time slot, if there be k label to be mapped to this conflict time slot simultaneously, be the k time slot that heavily conflicts; The label heavily conflicting in time slot for k, reader uses random number R
2carry out again Hash mapping in [0..k-1] time slot, i.e. S
i=H (ID
i, R
2) mod k; If the Hash result S of this k label
irespectively unequally show that this k time slot that heavily conflicts successfully degrades; Otherwise this conflict time slot is degraded unsuccessfully;
(2) label of success being degraded reselects time slot
Reader will be that k label in this conflict time slot increases k-1 time slot; Suppose that α represents the number of double conflict time slot before this time slot, β represents the number of triple conflict time slots, and this k label remaps in the following way so: if 1. S
i=0, this label is still mapped in former time slot and goes; If 2. S
i=b ∈ [1..k-1], this label mapping is in (α × 1+ β × 2)+b time slot;
(3) the conflict time slot of not carrying out empty slot and cannot degrading
Reader detects in vector the numeral of every, for the k time slot that heavily conflicts, and k≤4, the numeral of its correspondence of reader is set to 0; It is the corresponding time slot of 0 that reader is ignored in vector, does not carry out this time slot.
The present invention is for the degraded of double conflict time slot and triple conflict time slots.
Wherein, H<R
1, in f>, H represents hash function, R
1represent random number, f representative frame time slot size; R
2represent difference and R
1another random number; S
irepresent the reader time slot that Hash mapping is selected again; ID
irepresent label i ID; α represents the number of the front double conflict time slot of this time slot; β represents the number of triple conflict time slots.
The method by appending time slot of the invention has the beneficial effects as follows part of degrading is conflicted time slot to appending time slot; Directly skip and do not carry out for empty slot and nondegradable conflict time slot, the identification that makes to lose label is more efficient.By appending time slot, conflict time slot is degraded to single time slot again, has improved the utilization factor of time slot.Further improve loss tag recognition efficiency by not carrying out empty slot and nondegradable conflict time slot simultaneously.Lose label time decreased 45% used with existing best solution than our detection, and the time used is only 1.18 times of minimum spended time.
Accompanying drawing explanation
Fig. 1 is entire system work schematic diagram of the present invention.
Fig. 2 is basic skills schematic diagram of the present invention.
To be the employing of the present invention method of appending time slot be degraded to single time slot schematic diagram the part time slot that conflicts to Fig. 3 (a).
Fig. 3 (b) of the present inventionly reselects time slot method schematic diagram to degradable label.
Fig. 4 is the conflict time slot schematic diagram of not carrying out empty slot and cannot degrading.
Fig. 5 is process flow diagram of the present invention.
In figure:
reader; The label existing in zero system; ● the label of losing in system;
1 background server; 2 store the database of all label ID in system.
Embodiment
Below in conjunction with accompanying drawing, the present invention is further detailed
To be the employing of the present invention method of appending time slot be degraded to single time slot schematic diagram the part time slot that conflicts to Fig. 3 (a).Reader is selected a random number R
1label ID is carried out to Hash mapping.Label t in figure
1be mapped in second time slot, in this time slot, have and only have one piece of label to be mapped to wherein, therefore for can utilize time slot, needn't degrade.T
2and t
4all be mapped in the 3rd time slot, therefore this time slot is double conflict time slot.In like manner, t
3and t
6be mapped in the 5th time slot, this time slot is also double conflict time slot simultaneously.T
5, t
7and t
8totally three pieces of labels are mapped in the 6th time slot simultaneously, therefore be triple conflict time slots.
The method that time slot is appended in employing the part method that time slot is degraded to single time slot of conflicting is: first reader is according to hash function H<r, f> arrives all label mappings in system in [0..f] time slot, therefore reader had been known the state of each time slot before time slot is carried out, this time slot is empty slot, single time slot or conflict time slot; For conflict time slot, if there be k label to be mapped to this time slot simultaneously, we are referred to as the k time slot that heavily conflicts; The label heavily conflicting in time slot for k, reader uses a new random number R
2carry out again Hash mapping in [0..k-1] time slot, i.e. S
i=H (ID
i, R
2) mod k; If the Hash result S of this k label
irespectively unequally show that this k time slot that heavily conflicts successfully degrades; Otherwise this conflict time slot is degraded unsuccessfully; Due to degraded k≤4 heavily conflict time slot and more senior conflict time slot, efficiency sharply declines, therefore the present invention is only directed to double conflict time slot and triple conflict time slot is degraded.
Fig. 3 (b) of the present inventionly reselects time slot method schematic diagram to degradable label.
The method that degradable label is reselected to time slot is: reader will increase k-1 time slot for k label in this conflict time slot; Suppose that α represents the number of double conflict time slot before this time slot, β represents the number of triple conflict time slots, and this k label remaps in the following way so: if 1. S
i=0, this label is still mapped in former time slot and goes; If 2. S
i=b ∈ [1..k-1], this label mapping is in (α × 1+ β × 2)+b time slot.
Reader reselects a random number R as shown in Figure 3 (b)
2the label being mapped in conflict time slot is carried out to Hash mapping again.Label t in figure
3and t
6carry out Hash again, result t
3be remapped to first and append in time slot, and t
6still take former time slot, this double conflict time slot is successfully degraded.And for label t
2and t
4again after Hash, be still mapped in identical time slot and go, therefore cannot degrade, be for further processing.
Label t
5, t
7and t
8through after Hash again, t
5select former time slot, t
7select second and append time slot, t
8select the 3rd to append time slot, this double conflict time slot is successfully degraded.This part is for adopting the method for appending time slot.
Fig. 4 does not carry out conflict with the non-degradable schematic diagram of time slot of empty slot in the present invention.
According to the degradation process of previous step, there is part conflict time slot cannot degrade successfully.As being mapped to the 3rd t in time slot in Fig. 3 (b)
2and t
4label, although utilize new random number R
2carry out Hash again, but still be mapped in same time slot, therefore this conflict time slot is degraded unsuccessfully.For empty slot and the failed conflict time slot of degraded, reader is directly skipped this two classes time slot, and as Fig. 4, reader is directly given up first and third in Fig. 3 (b), four, seven time slots, successfully conflict time slot and append time slot of a fill order one time slot, degraded.In a word: reader detects in vector the numeral of every, for the k time slot that heavily conflicts, described k≤4, reader is set to 0 by the numeral of its correspondence;
Reader is ignored in vector the time slot of the position correspondence that is 0, does not carry out this time slot.
Fig. 5 is process flow diagram of the present invention.Reader is lost when label according to flow process as shown in the figure and is carried out work in identification.First reader carries out Hash mapping in [0..f] time slot the ID of all labels in system, then decides and directly carries out time slot or according to the strategy execution of concrete steps (1) according to each time slot mapping number of labels.If single time slot directly enters concrete steps (3); If lower than triple time slots, the time slot that conflicts degraded operation.If degraded successfully, enter concrete steps (3), carry out next round Hash mapping otherwise return.Directly return and re-start Hash mapping for the conflict time slot higher than triple.In order further to raise the efficiency, next according to concrete steps (3), empty slot and non-degradable time slot are filtered, then start to carry out remaining time slot, if this time slot is confiscated the response of label, prove to be mapped to the label loss of this time slot, otherwise label is not lost.So far whole loss tag recognition process finishes.
Claims (1)
1. change to identify a method of losing label based on time slot state, it is characterized in that:
(1) employing is appended time slot method degradable conflict time slot is degraded to single time slot
Reader is according to hash function H<R
1, f> arrives all label mappings in system in [0..f] time slot, the state of reader each time slot before time slot is carried out; For conflict time slot, if there be k label to be mapped to this conflict time slot simultaneously, be the k time slot that heavily conflicts; The label heavily conflicting in time slot for k, reader uses random number R
2carry out again Hash mapping in [0..k-1] time slot, i.e. S
i=H (ID
i, R
2) mod k; If the Hash result S of this k label
irespectively unequally show that this k time slot that heavily conflicts successfully degrades; Otherwise this conflict time slot is degraded unsuccessfully;
(2) label of success being degraded reselects time slot
Reader will be that k label in this conflict time slot increases k-1 time slot; Suppose that α represents the number of double conflict time slot before this time slot, β represents the number of triple conflict time slots, and this k label remaps in the following way so: if 1. S
i=0, this label is still mapped in former time slot and goes; If 2. S
i=b ∈ [1..k-1], this label mapping is in (α × 1+ β × 2)+b time slot;
(3) the conflict time slot of not carrying out empty slot and cannot degrading
Reader detects in vector the numeral of every, for the k time slot that heavily conflicts, and k≤4, the numeral of its correspondence of reader is set to 0; It is the corresponding time slot of 0 that reader is ignored in vector, does not carry out this time slot;
Wherein, H<R
1, in f>, H represents hash function, R
1represent random number, f representative frame time slot size; R
2represent difference and R
1another random number; S
irepresent the reader time slot that Hash mapping is selected again; ID
irepresent label i ID; α represents the number of the front double conflict time slot of this time slot; β represents the number of triple conflict time slots.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410103076.7A CN103870780A (en) | 2014-03-19 | 2014-03-19 | Method for recognizing missing labels based on time slot state change |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410103076.7A CN103870780A (en) | 2014-03-19 | 2014-03-19 | Method for recognizing missing labels based on time slot state change |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103870780A true CN103870780A (en) | 2014-06-18 |
Family
ID=50909300
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410103076.7A Pending CN103870780A (en) | 2014-03-19 | 2014-03-19 | Method for recognizing missing labels based on time slot state change |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103870780A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105447430A (en) * | 2015-11-19 | 2016-03-30 | 中南大学 | Label and method for recognizing label through employing HARN protocol |
| CN106384067A (en) * | 2016-08-31 | 2017-02-08 | 吉林大学 | RFID unknown label identification system and identification method thereof |
| CN106503759A (en) * | 2016-10-19 | 2017-03-15 | 中国石油大学(华东) | The loss label detection method of anonymous packet RFID system |
| CN109800832A (en) * | 2018-12-25 | 2019-05-24 | 太原理工大学 | A kind of exception information collection method based on large-scale radio-frequency identification system |
| CN113688641A (en) * | 2020-05-19 | 2021-11-23 | 香港理工大学深圳研究院 | RFID tag identification method, reader, target tag and computer medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103345612A (en) * | 2013-07-05 | 2013-10-09 | 清华大学 | Method and system for rapid detection of lost labels |
| CN103366143A (en) * | 2013-07-03 | 2013-10-23 | 清华大学 | Methods for quickly identifying lost tag in large-scale radio-frequency identification system |
-
2014
- 2014-03-19 CN CN201410103076.7A patent/CN103870780A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103366143A (en) * | 2013-07-03 | 2013-10-23 | 清华大学 | Methods for quickly identifying lost tag in large-scale radio-frequency identification system |
| CN103345612A (en) * | 2013-07-05 | 2013-10-09 | 清华大学 | Method and system for rapid detection of lost labels |
Non-Patent Citations (1)
| Title |
|---|
| 张士庚等: "《大规模RFID系统中一种能量有效的丢失标签快速检测算法》", 《计算机学报》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105447430A (en) * | 2015-11-19 | 2016-03-30 | 中南大学 | Label and method for recognizing label through employing HARN protocol |
| CN105447430B (en) * | 2015-11-19 | 2017-10-03 | 中南大学 | A kind of label and the method using the HARN protocol identifications label |
| CN106384067A (en) * | 2016-08-31 | 2017-02-08 | 吉林大学 | RFID unknown label identification system and identification method thereof |
| CN106384067B (en) * | 2016-08-31 | 2019-05-10 | 吉林大学 | A kind of RFID Unknown Label identifying system and recognition methods |
| CN106503759A (en) * | 2016-10-19 | 2017-03-15 | 中国石油大学(华东) | The loss label detection method of anonymous packet RFID system |
| CN109800832A (en) * | 2018-12-25 | 2019-05-24 | 太原理工大学 | A kind of exception information collection method based on large-scale radio-frequency identification system |
| CN113688641A (en) * | 2020-05-19 | 2021-11-23 | 香港理工大学深圳研究院 | RFID tag identification method, reader, target tag and computer medium |
| CN113688641B (en) * | 2020-05-19 | 2023-09-08 | 香港理工大学深圳研究院 | RFID tag identification method, reader, target tag and computer medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103870780A (en) | Method for recognizing missing labels based on time slot state change | |
| CN103761494B (en) | Method and system for identifying lost tag of RFID system | |
| CN103020568B (en) | Based on the pretreated RFID anti-collision method of label ID | |
| CN106650530B (en) | Enhanced quaternary tree anti-collision algorithm suitable for RFID system | |
| CN103020569B (en) | A kind of radio-frequency identification multi-label anti-collision method | |
| CN107609611A (en) | A kind of multiclass formation gathering method based on large-scale radio-frequency identification system | |
| CN104331679B (en) | A kind of RFID tag anti-collision method based on physical-layer network coding | |
| CN102024134A (en) | High-efficiency multi-tag anti-collision radio frequency identification (RFID) method | |
| CN103218591A (en) | Anti-counterfeiting system based on RFID (radio frequency identification), and working method of same | |
| MY181075A (en) | Systems and methods for tracing items | |
| CN103679092B (en) | RFID anti-collision algorithm based on feedback mechanism | |
| CN103366143B (en) | The method for quickly identifying of label is lost in large-scale radio-frequency identification system | |
| CN102479316A (en) | Binary anti-collision identification method for serial numbers of RFID tags | |
| CN103218635A (en) | RFID (radio frequency identification) anti-collision method based on mixed multiway tree searching | |
| US20150256383A1 (en) | Method for transiting operation mode of routing processor | |
| CN103870781A (en) | Unknown radio frequency label detection method based on Bloom filter | |
| CN103345612A (en) | Method and system for rapid detection of lost labels | |
| CN101231686A (en) | Method for recognizing contrary collision of inquiry tree radio frequency labels of amalgamation database | |
| US20050068156A1 (en) | [reliable method of determining tag binary identifications] | |
| KR100776532B1 (en) | Method for identifying rf tags in a radio frequency identification system by advanced query tree based anti-collision algorithm | |
| CN114186572B (en) | Unknown label identification method and system based on conflict time slot coordination | |
| Yang et al. | The simulation and analysis of algorithms for redundant reader elimination in RFID system | |
| CN103605949A (en) | Large-scale RFID (radio frequency identification) anti-collision method based on CDMA (code division multiple access) | |
| CN102208041A (en) | RFID data acquisition method having interruption tolerance capability | |
| CN103077417B (en) | RFID tag read method towards mass data |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20140618 |
|
| WD01 | Invention patent application deemed withdrawn after publication |