CN103793362B - Static reader dispatching method based on reader priority - Google Patents
Static reader dispatching method based on reader priority Download PDFInfo
- Publication number
- CN103793362B CN103793362B CN201310639974.XA CN201310639974A CN103793362B CN 103793362 B CN103793362 B CN 103793362B CN 201310639974 A CN201310639974 A CN 201310639974A CN 103793362 B CN103793362 B CN 103793362B
- Authority
- CN
- China
- Prior art keywords
- reader
- scheduling
- parallel
- conflict
- collection
- 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
Abstract
The present invention proposes a kind of static reader scheduling strategy based on reader priority, it is characterised in that the scheduling strategy can be divided into centralized scheduling and distributed scheduling according to the difference of application scenario；According to scheduling whether continuation, static scheduling and dynamic dispatching can be divided into；According to label distributing position information state, the scheduling of known label position and the scheduling of Unknown Label position can be divided into.It is not concurrency relation between every kind of scheduling sorting technique, but inclusion relation.The core algorithm of scheduling strategy is parallel collection dispatching algorithm（Parallel Set Scheduling Algorithm, PSSA）The core concept of the algorithm is to make to have the reader of overlay area conflict not run in same time slot scheduling, the multiple readers not conflicted are run in same time slot scheduling, so as to the operational efficiency for improving system on the premise of reader collision is avoided, tried one's best.The scheduling strategy improves system performance, reduces energy consumption caused by reader collision；Loss of data caused by preventing reader collision, improve the degree of accuracy of system and provide decision support for RFID application systems.
Description
Technical field
The present invention relates to the reader execution sequence under the deployment of the RFID reader of extensive level of confidentiality environment.Read for RFID
Read the design object and design principle of device scheduling, it is proposed that centralized scheduling and distributed scheduling, static scheduling and dynamic dispatching
It is not concurrency relation between every kind of scheduling sorting technique and the scheduling of known label position and Unknown Label position are dispatched, but
Inclusion relation.Realize a kind of comparison and efficiently collect dispatching algorithm parallel（Parallel-Set Scheduling
Algorithm, PSSA）, make to have the reader of overlay area conflict not run in same time slot scheduling, what is do not conflicted is more
Individual reader is run in same time slot scheduling, so as to which on the premise of reader collision is avoided, that tries one's best improves system
Operational efficiency.
Background technology
Internet of Things（Internet of Things）It is the important component of generation information technology, it is the material world
Networking requirement and information world the continuous progressive new generation network expedited the emergence of.As its name suggests, Internet of Things is exactly that thing is connected with thing
Internet.Among these, two layers of meaning is contained：First, the core of Internet of Things and basis are still internet；Secondth, he
User terminal extend to and extend to any article and article in this world between, enter the collection, exchange and communication of row information.Thing
The definition of networking is by information sensing devices such as RFID, sensor, global positioning system, laser scanners, according to given
Agreement, all articles are connected with internet, enter the collection, exchange and communication of row information, reached and intellectuality is carried out to article
A kind of network of identification, tracking, management, monitoring and positioning.
RFID（Radio Frequency Identification）That is radio frequency identification, it is a kind of contactless automatic
Identification technology, it is communicated based on radio frequency signal.RFID technique has that communication distance is remote, identification target is more, label is believed
The features such as ceasing automatic identification, is one of core technology of Internet of Things, but its application and development, is still within the primary stage.Though
So application now is than wide, but the application and management of extensive RFID system, still suffers from some great difficulties
Topic, following as described in some：
（1）The management of extensive RFID system reader, label.In extensive RFID system, have hundreds of
Reader works simultaneously, carries out substantial amounts of data communication and processing.How substantial amounts of reader is disposed effectively to manage concerning security matters
Article；The invalid data in the label of reading how is rejected, obtains valid data and systematic function is provided；
（2）Conflict management between the extensive RFID reader of dense deployment.Do not advise the overlay area of RFID reader
Then, in the RFID system of dense deployment, because the article that ensure monitored is completely in the scanning range of reader, lead
Cause the covering area overlapping between reader inevitable.RFID system is to be carried out based on radio frequency signal at communication and data
Reason, the overlapping conflict meant that between signal of overlay area is can hardly be avoided, thus causes substantial amounts of loss of data and mistake,
The degree of accuracy and the performance of system are had a strong impact on.How to solve the conflict between reader, prevent the loss and mistake of data,
It is urgent problem.
Extensive RFID reader administrative skill is studied, can effectively promote the development of RFID technique, and be extensive
The application of RFID system provides support, following as described in some：
（1）, improve system performance, reduce reader collision caused by energy consumption.In RFID system, reader rushes
It is prominent to not only result in the loss of data, and very big energy consumption can be produced, the research dispatched by reader, system can be reduced
Energy consumption, improve systematic function.
（2）, prevent reader collision caused by loss of data, improve the degree of accuracy of system.Dispatched by RFID reader
Research, on the premise of conflict is inevitable, reduce the conflict between adjacent reader as far as possible, prevent the number caused by conflict
According to loss and mistake.Improve the correctness of system data processing.
（3）, for RFID application systems provide decision support.According to different application scenarios, a variety of reader scheduling are proposed
Strategy, different RFID systems may be referred to different scheduling strategy thinkings to solve reader management.Wherein PSSA algorithms are
One preferable dispatching algorithm, can offer reference meaning for other non-RFID systems.
The content of the invention
The present invention proposes a kind of static reader scheduling strategy based on reader priority, by experimental test, has
Solve the problems, such as to effect the reader collision for solving in extensive RFID system, and collect dispatching algorithm parallel to arbitrary network
Scheduling problem, there is positive reference value.
Core concept is：Allow the reader of overlay area conflict not run in same time slot scheduling, allow and do not rush
Prominent multiple readers are run simultaneously in same time slot scheduling.
As shown in figure 1, in RFID system, due to the overlay area of two readers（That is the overlay area of antenna）In the presence of
It is overlapping, signal conflict is produced, the conflict of signal causes loss of data and mistake.In RFID conflicts, according to the side of conflict generation
Formula is different, can be divided into three classes：Conflicting (Tag-Tag collision, TTc) between label and label, reader and label it
Between conflict (Reader-Tag collision, RTc), (Reader-Reader that conflicts between reader and reader
Collision, RRc).
Such as Fig. 1（a）It is shown, label and label collision：When multiple labels are in the overlay area of same reader
Produce.In the scanning overlay area of same reader, there are multiple labels.When reader sends read-write, Duo Gebiao
Label can receive the order of reader simultaneously, and make the response of oneself.Due to response be in same frequency range, then may be due to signal
Collision cause the loss and mistake of tag response signal；
Such as Fig. 1（b）It is shown, reader and label collision：When some reader coverage another reader with
When between the communication zone of label, reader and label collision occurs.The overlay area of two readers has overlapping.When wherein one
When individual reader needs to be communicated with label, the information returned from label can be disturbed by another reader signal, from
And cause reader normally can not be communicated with label；
Such as Fig. 1（c）It is shown, reader and reader collision：When reader and the overlapping coverage areas for being in two readers
When label in the range of domain is communicated, reader and reader collision are produced.When label is in the covering weight of two readers
In folded region, and when two readers need to access the label simultaneously, visit order signal can be simultaneously emitted by, now, overlapping
Region, signal collide, and then calling-on signal is lost, and the two all can not normally access the label.
The overlay area of RFID reader is irregular elliposoidal, more readers, more marks under typical intensive environment
Sign deployment scenario.Label is randomly distributed in the overlay area of reader, and the radius of reader is not quite similar, deployed position
It is arbitrary.The deployment topologies figure of reader has very strong figure feature.As shown in Fig. 2 when two readers（Or multiple read
Read device）Overlay area when having overlapping, signal will produce interference, it is believed that now two（It is or multiple）Between reader
In the presence of conflict.
For each RFID network topological structure, a simple graph can be abstracted as：Each reader is reduced to one
Individual node, when lap be present between the overlay area of two readers, show that two readers have conflict, in simple graph
In, two reader nodes are connected with straight line；When overlay area is non-overlapping between two readers, not line, such as Fig. 3 institutes
Show.
The scheduling strategy is the static reader scheduling strategy based on reader priority, and core is that parallel collection scheduling is calculated
Method；The generation of this method is based on the collision problem solved between reader and reader；The core concept of the scheduling strategy is to allow
The reader for having overlay area conflict is not run in same time slot scheduling, allows the multiple readers not conflicted same
Run in time slot scheduling.
As shown in figure 4, according to the difference of application scenario, reader scheduling can be divided into centralized scheduling and distributed scheduling；
According to scheduling whether continuation, reader scheduling is divided into static scheduling and dynamic dispatching；According to label distributing position information feelings
Condition, reader can be dispatched and be divided into the scheduling of known label position and the scheduling of Unknown Label position.Between every kind of scheduling sorting technique,
It is not concurrency relation, but inclusion relation.
Distributed scheduling is mainly for extensive RFID system.It is divided into two kinds of control models：Macroscopically, whole system be
Run on distributed platform framework, each management node can be running middleware on a computer, in the process of scheduling
In, it is necessary to rapport and anticollision problem between handling middleware；On microcosmic, on every computer, running centre
The a number of RFID reader of part manager, need inside middleware to handle the coordination between reader and anticollision.
The process that dynamic dispatching refers to scheduling is continuous, during current task is run, has new scheduler task
Addition is come in.It is related to dynamic priority rights management and the multiple division of reader scheduling set.
Static scheduling strategy refers to the scheduling for single task, scheduler task, scheduling requirement, scheduling reader these all
It is that known, all reader has and only once dispatched, was performed if being scheduled in scheduling process above,
It will not dispatched in scheduling afterwards, after treating that all readers are all scheduled, this scheduler task performs completion.Whole
During static scheduling, according to parallel collection dispatching algorithm, optimal schedule sequences are determined.Static scheduling is also referred to as single task scheduling,
A scheduler task is completed every time.
Centralized scheduling refers in whole scheduling process, an only central processing center, manages and distributes and be all
Scheduling resource, control when the scheduling of the execution which reader, when finishing scheduling.Sequential scheduling and parallel collection
Scheduling, is all the category for belonging to centralized scheduling strategy.
The core concept of sequential scheduling is：All it is performed separately between any two RFID reader, and each scheduler task
Only carry out the scheduling of a reader.To given scheduler task, in order to avoid because conflict causes the loss and mistake of data,
Reader in task is ranked up from big to small according to priority, reader scheduling is then carried out according to sequence.
The core concept of collection scheduling is parallel：To the reader in whole RFID system, as long as do not conflict between any two
Reader, be just put into a corresponding scheduling set, then to the reader in same set, when dispatching for one
Between stab the inside, while perform the read write command of the reader inside the set, once visited until all readers are completed
Ask, this time scheduler task terminates, and is then turned on next scheduler task.
Parallel collection scheduling is divided into according to the distribution situation difference of label with reader does not consider label scheduling, known label position
Put scheduling, the scheduling of Unknown Label position, the scheduling of known reading device position and the scheduling of unknown reading device position.Do not consider that label is adjusted
Degree, the scheduling of known label position and the scheduling of Unknown Label position are all in the case where reader distribution is fixed, it is known that reader
The scheduling of position and the scheduling of unknown reading device position are all in the case of known to label distributing position.
（1）Do not consider that label is dispatched, refer to the presence or absence that system label is indifferent in whole scheduling process, whole scheduling
It is only relevant with reader；
（2）Known label position, refer to the positional information for knowing each label in RFID system, can accurately know each mark
Label are in the covering area range of which reader；
（3）The scheduling of Unknown Label position, refer to the more specific location information for not knowing each label, it is complete under the premise of such
Into system scheduling and to ensure not conflict between reader；
（4）The scheduling of known reading device position, refer to the physical location and overlay model for accurately knowing each reader；
（5）The scheduling of unknown reader, refer to the particular location for not knowing each reader distribution, also do not know reader
Overlay model, completes scheduling under such circumstances, and this scheduling mode is most weak with maximum universality, restrictive condition.
Parallel collection dispatching algorithm（Parallel-Set Scheduling Algorithm, PSSA）Purpose be that obtain can
Parallel Scheduling sequence of sets, and sorted from high to low according to the size of set weights, provide dispatching sequence.The core of algorithm is to ask
Going out maximum can parallel collection；The central idea of algorithm is that the classical vertex coloring of graph theory is theoretical.
Parallel collection dispatching algorithm is based on RFID reader overlay area discretization, by deployment region and reader overlay area
Model Abstraction is into grid.Each reader overlay area model can represent that the algorithm core is to obtain most with a matrix
Excellent schedule sequences, on the premise of system zero conflicts, it is scheduled according to weights.
The irregular overlay model discretization of RFID reader is represented, the RFID reader area of coverage is handled using discretization thought
Domain area for cutting and conflict area area for cutting.Deployment region and reader overlay area model are abstracted into grid.Use dot matrix
Form can very easily represent overlay area.In a matrix representation, not by the region of reader covering, represented with 0；Quilt
The region for covering but not conflicting, is represented with 1；The region of conflict, is represented with 2.
The degree of reader refers to the number for having the reader to conflict with the reader, to giving the reading in reader set
Device, be ranked up by degree in the way of from big to small, obtain orderly reader sequence, and according to above-mentioned sequence order to readding
The reader read in device set is numbered.The reader maximum from the number of degrees proceeds by selection, and being put into can be with Parallel Scheduling
It is parallel to concentrate.For reader node follow-up in scheduling system, following operation is performed repeatedly until all nodes are all added
Enter into corresponding Parallel Scheduling set, finally reader set is adjusted according to the sequencing of Parallel Scheduling set
Degree.
Brief description of the drawings
Fig. 1 RFID system conflict graphs；
Fig. 2 reader deployment topologies figures；
Fig. 3 RFID simplify deployment diagram；
Fig. 4 readers dispatch classification chart.
The irregular overlay model discretizations of Fig. 5 represent figure.
Embodiment
Technical scheme is elaborated below in conjunction with the accompanying drawings.
As shown in figure 1, RFID system conflict is reduced to RFID reader deployment topologies figure, as shown in Fig. 2 for Fig. 2's
RFID network topological structure, the simple graph shown in a Fig. 3 can be abstracted as：Each reader is reduced to a node, when two
When lap be present between the overlay area of individual reader, show that two readers have conflict, in simple graph, with straight line by two
Individual reader node is connected；When overlay area is non-overlapping between two readers, not line.
The scheduling strategy is the static reader scheduling strategy based on reader priority, and core is that parallel collection scheduling is calculated
Method；The generation of this method is based on the collision problem solved between reader and reader；The core concept of the scheduling strategy is to allow
The reader for having overlay area conflict is not run in same time slot scheduling, allows the multiple readers not conflicted same
Run in time slot scheduling.
As shown in figure 4, according to the difference of application scenario, reader scheduling can be divided into centralized scheduling and distributed scheduling；
According to scheduling whether continuation, reader scheduling is divided into static scheduling and dynamic dispatching；According to label distributing position information feelings
Condition, reader can be dispatched and be divided into the scheduling of known label position and the scheduling of Unknown Label position.Between every kind of scheduling sorting technique,
It is not concurrency relation, but inclusion relation.
Centralized scheduling strategy, refer in whole RFID reader scheduling process, only a control centre, scheduling is suitable
The determination of sequence, traffic order provide, and are all controlled and are completed by control centre, including sequential scheduling and Parallel Scheduling.
The core concept of sequential scheduling is：All it is performed separately between any two RFID reader, and each scheduler task
Only carry out the scheduling of a reader.To given scheduler task, in order to avoid because conflict causes the loss and mistake of data,
Reader in task is ranked up from big to small according to priority, reader scheduling is then carried out according to sequence.Algorithm
Core concept is exactly to sort, and after being ranked up to the priority of reader, is scheduled by priority in the way of from big to small.
The central idea of collection scheduling is parallel：To the reader in whole RFID system, as long as do not conflict between any two
Reader, we are just put into a corresponding scheduling set, and then to the reader in same set, we are one
Inside individual scheduling time gap, we perform the read write command of the reader inside the set simultaneously, until all readers
It is completed and once accesses, this time scheduler task terminates, and is then turned on next scheduler task.Collection dispatching algorithm core is parallel
PSSA algorithms, the key issue of solution are to reduce the number of scheduling to greatest extent on the premise of ensureing without conflict, are improved
The overall operation efficiency of system.
In PSSA algorithms, we are defined as follows and explained to the term and symbol that need to use in some algorithms：
Define 1 reader scheduling set R：In RFID system, the core of system is constituted by some reader and label
Heart component.Herein, we represent all readers of system with R, that is, have：R={ R1,R2,...,Rn, wherein n is reader
Number.
Define 2 collison matrix M：For collison matrix to represent the conflict relationship between reader, it is a symmetrical matrix.
Matrix element | Mi,j| represent reader RiWith RjBetween conflict relationship weights.|Mi,j|=0, represent RiWith RjBetween do not rush
It is prominent；|Mi,j| ＞ 0 represents RiWith RjBetween exist conflict.
Define 3 reader collision neighborhood D：, whereinExpression and RiThere are the neighbours of conflict
Reader set, i.e.,：Expression and RiThere is the reader number of conflict.Conflicting
In matrix, the i-th row（Or i-th row, 1≤i≤n）Represent RiWith the conflict relationship between other readers, work as Wi,jDuring ＞ 0, table
Show RiWith RjBetween conflict be present, and in the i-th row of collison matrix, non-zero number represents and RiThere is neighbours' number of conflict,
I.e.：
For counting the number of non-zero.When | Mi,j| when=0, represent RiWith RjBetween do not conflict；When | Mi,j| ＞ 0
When, show RiWith RjBetween do not conflict, thereforeSoExpression and RiThere is the reader number of conflict.
Define 4 and collect scheduling set S parallel：Expression can be in the reader set performed at the same time in gap, S=
{S1,S2,...,Sn}。SiIn the reader that can run parallel comprising one or more.SiIn the reader that includes it is at least individual
Number is 1, i.e. Min | S1|,|S2|,...,|Sn|=1, when all readers from each other all conflict, between any two can not be
Set up when being dispatched in same parallel collection；SiMaximum be reader number, i.e. Max | S1|,|S2|,...,|Sn|=n
(n is reader number), when all readers do not conflict between any two, can with same parallel collection in dispatch when set up.|
S | represent the number of parallel collection.The minimum number of Parallel Scheduling set is 1, i.e. Min (| S |)=1, when only one parallel collection
Set up during conjunction；Most numbers of Parallel Scheduling set add 1 for the maximum of the conflict neighbours of reader, i.e.,：
Define 5 subscript value setsRepresent R1-Ri-1In with RiReader that is adjacent and having been allocated for Parallel Scheduling collection
The parallel collection subscript value set at place.Such as R1∈S1, R2∈S2, R3∈S1And R4With R1、R2、R3It is all adjacent, then：
Define 6 total subscript value set C：All subscript values, C=1,2 ..., Max | S | } }.
Define 7 and enter set functionThe function of one execution action, represent selection reader Ri, and corresponding to being put into simultaneously
Row collection set Sx, the node is deleted in remaining reader node.Represent RiWhat should be put into is parallel
Gather subscript value.
Define 8 scheduling times T：Complete the scheduling times needed for a RFID system reader scheduling.
Define 9 reader weightsRepresent reader RiDispatching priority weights.
The central idea of PSSA algorithms is as follows：To giving the reader in reader set R, according to its neighbours' number that conflictsMode from big to small is ranked up, and according toReader in R is numbered order from big to small, i.e.,：
R1,R2,R3...Rn.C initial value is：C=1,2 ..., Max | S | } }.FromMaximum reader R1Proceed by choosing
Select, be put into S1In, corresponding set subscript value is 1, i.e.,：And obtainFor follow-up in scheduling system
Reader node, we perform repeatedly following operation be all added into until all nodes corresponding in scheduling set：Often
Individual reader node RiSubscript value set value be C in value removeSmallest positive integral k afterwards, i.e.,：
RiS should be put intokIn, until all reader nodes are all added in S（Collect corresponding to each reader node
It is that the node needs to be added to S to close subscript value kkIn）.Assuming that h Parallel Scheduling set, i.e. S={ S have been used altogether1,S2,
S3,...,Sh}。
To each parallel collection set in S, its weights sum is obtained, it is assumed that SiIn the reader that includes be Ra, Rb, Rc, thenThen descending sort, ranking results S are carried out to all weights collected parallel1, S2, S3…Sh, then
Complete the scheduling of this RFID system needs h scheduling altogether, and schedule sequences are：S1->S2->S3…->Sh。
PSSA algorithms include following steps：
（1）Initialization（Initialization including reading, the initialization of collison matrix, read the initialization of tolerance, subscript value collection
Close initialization etc.）；
（2）To reader collision neighborhoodSorted according to order from big to small；
（3）Define first parallel collection set S1, the maximum node R of selection conflict neighborhood value1, it is put into first collection
In conjunction；
（4）To remaining reader node, obtainWherein 2 ＜=i ＜=n；
（5）ObtainBy RxParallel collection set corresponding to being put into；
（6）Repeat（4）,（5）Step, until all readers are all added in parallel collection；
（7）Parallel collection set is ranked up according to weights size, provides final schedule sequences；
（8）Algorithm finishes.
Claims (1)
1. a kind of static reader dispatching method based on reader priority, it is characterised in that including amount defined below：
Reader scheduling set R, the reader all for representing system, that is, have R={ R1,R2,...,Rn, wherein n is reading
The number of device；
Collison matrix M, for representing the symmetrical matrix of the conflict relationship between reader, matrix element | Mi,j| represent reader Ri
With RjBetween conflict relationship weights；|Mi,j|=0, represent RiWith RjBetween do not conflict；|Mi,j| ＞ 0 represents RiWith RjBetween deposit
Conflicting；
Reader collision neighborhood D,WhereinExpression and RiThere is neighbours' reader of conflict
Set, i.e.,：,Expression and RiThere is the reader number of conflict；
Parallel collection set S, can be in the reader set performed at the same time in gap, S={ S for expression1,S2,...,
Sn}；SiIn the reader that can run parallel comprising one or more；
Subscript value setFor representing R1-Ri-1In with RiWhere reader that is adjacent and having been allocated for Parallel Scheduling collection
Parallel collection subscript value set；
Total subscript value set C：For representing all subscript values, C=1,2 ..., Max | S | } }；
Enter set functionThe function of one execution action, for representing selection reader Ri, and it is put into corresponding parallel Ji Ji
Close Sx, the node is deleted in remaining reader node；Represent RiUnder the parallel collection that should be put into
Scale value；
Scheduling times T, for representing to complete the scheduling times needed for a RFID system reader scheduling；
Reader weightsFor representing reader RiDispatching priority weights；
The static reader dispatching method based on reader priority, comprises the following steps：
(1) defined amount is initialized；
(2) to the reader scheduling set R, according toOrder sequence from big to small；
(3) first parallel collection set S is defined1, the maximum node R of selection conflict neighborhood value1, it is put into described first simultaneously
Row collection set S1In；
(4) to remaining reader node, obtainWherein 2 ＜=i ＜=n；
(5) obtainBy RxParallel collection set S corresponding to being put intox；
(6) step (4) and step (5) are repeated, until all readers are all added in parallel collection set；
(7) all parallel collection set are ranked up according to reader weights size, provide final schedule sequences.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310639974.XA CN103793362B (en) | 2013-12-02 | 2013-12-02 | Static reader dispatching method based on reader priority |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310639974.XA CN103793362B (en) | 2013-12-02 | 2013-12-02 | Static reader dispatching method based on reader priority |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103793362A CN103793362A (en) | 2014-05-14 |
| CN103793362B true CN103793362B (en) | 2018-01-09 |
Family
ID=50669049
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310639974.XA Active CN103793362B (en) | 2013-12-02 | 2013-12-02 | Static reader dispatching method based on reader priority |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103793362B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108366383A (en) * | 2017-12-29 | 2018-08-03 | 杭州雄伟科技开发股份有限公司 | Conflict scheduling method, apparatus and system |
| CN110113733B (en) * | 2019-03-29 | 2021-06-29 | 硅湾工业互联网工厰(深圳)有限公司 | Two-stage distribution method for coloring anti-collision graph of RFID reader |
| CN111309017B (en) * | 2020-02-27 | 2023-04-07 | 广东博智林机器人有限公司 | Equipment scheduling method and device, electronic equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101216875A (en) * | 2008-01-10 | 2008-07-09 | 复旦大学 | An anti-collision method for RFID multi reader/writer based on graph decoration method |
| CN102467646A (en) * | 2010-11-12 | 2012-05-23 | 华东师范大学 | Dynamic load balancing RFID (radio frequency identification device) system and identification method thereof |
-
2013
- 2013-12-02 CN CN201310639974.XA patent/CN103793362B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101216875A (en) * | 2008-01-10 | 2008-07-09 | 复旦大学 | An anti-collision method for RFID multi reader/writer based on graph decoration method |
| CN102467646A (en) * | 2010-11-12 | 2012-05-23 | 华东师范大学 | Dynamic load balancing RFID (radio frequency identification device) system and identification method thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103793362A (en) | 2014-05-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Chen et al. | A novel anti-collision algorithm in RFID systems for identifying passive tags | |
| JP5490016B2 (en) | Systems, methods, and computer programs (systems and methods) for determining RFID-tagged items contained within a given area | |
| Thiesse et al. | On the value of location information to lot scheduling in complex manufacturing processes | |
| Liu et al. | A maximum-weight-independent-set-based algorithm for reader-coverage collision avoidance arrangement in rfid networks | |
| Zhang et al. | RFID and sensor networks: architectures, protocols, security, and integrations | |
| Shih et al. | Taxonomy and survey of RFID anti-collision protocols | |
| Ahmed | Applications of graph coloring in modern computer science | |
| CN103793362B (en) | Static reader dispatching method based on reader priority | |
| Kumar et al. | A novel and efficient reader-to-reader and tag-to-tag anti-collision protocol | |
| CN103268465B (en) | The method for quickly identifying of label classification in a kind of radio-frequency recognition system | |
| US9552539B2 (en) | Selectively addressing transponders | |
| Zhao et al. | Distributed design of RFID network for large-scale RFID deployment | |
| Chu et al. | A time-efficient protocol for unknown tag identification in large-scale RFID systems | |
| Yan et al. | A machine learning auxiliary approach for the distributed dense RFID readers arrangement algorithm | |
| Wang | A fast hybrid strategy-based RFID tag identification protocol | |
| Anusha et al. | RFIDcover–A Coverage Planning Tool for RFID Networks with Mobile Readers | |
| Piramuthu | Adaptive framework for collisions in RFID tag identification | |
| Maher Abdulzahra | Novel anti-collision algorithm in RFID tag identification process | |
| Astafiev et al. | Dvelopment the algorithm of positioning industrial wares in-plant based on radio frequency identification for the products tracking systems | |
| Chen et al. | Adaptive collision resolution for efficient RFID tag identification | |
| CN109325379A (en) | A kind of label method for quickly querying based on finite memory | |
| Ding et al. | A Multi-channel Anti-collision Algorithm in Multi-reader RFID Networks | |
| Ravilla et al. | Anti-collision policy for RFID systems: Fast predict tags in field algorithm | |
| Munir et al. | Localized load balancing in RFID systems | |
| Zhang et al. | An Improved RFID Localization Algorithm Based on Layer By Layer Exclusion. |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |