Deterministic anti-collision algorithm based on multi-prefix matching of query tree method

An anti-collision algorithm and prefix matching technology, applied in computing, computer components, instruments, etc., can solve performance impact and other problems, achieve the effects of reducing system energy consumption, stable algorithm performance, and improving query efficiency

Active Publication Date: 2015-11-11
UNIV OF ELECTRONIC SCI & TECH OF CHINA
View PDF3 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

But their performance is affected by la

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Deterministic anti-collision algorithm based on multi-prefix matching of query tree method
  • Deterministic anti-collision algorithm based on multi-prefix matching of query tree method
  • Deterministic anti-collision algorithm based on multi-prefix matching of query tree method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0030] The present invention will be further elaborated below in conjunction with the accompanying drawings and specific embodiments.

[0031] Such as figure 1 Shown, a kind of deterministic anti-collision algorithm based on the multi-prefix matching of query tree method of the present invention, comprises the following steps:

[0032] Step 1, the reader / writer reads the query prefix prefix from the stack. In the initial state, the query prefix is ​​an empty string, and the query command is sent; the query commands in the step 1 are respectively CMD_INI and PROBE_EQ, and the command bit sent in the initialization phase CMD_INI, followed by PROBE_EQ, returns the complete ID data when the tag receives the CMD_INI command, and returns the remaining matching data when it receives the PROBE_EQ command.

[0033] Step 2, the tag to be identified within the working range of the reader receives the query command sent by the reader, and gives a matching response according to the query ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The present invention discloses a deterministic anti-collision algorithm based on multi-prefix matching of a query tree method. The algorithm comprises the following steps of: reading a query prefix and sending a query command by a reader-writer; receiving the query command and responding matching by a tag; receiving the response by the reader-writer; responding a successful end process, generating collision and going to step 4; detecting response collision positions, and if the highest collision position and the second-highest collision position are continuous collision positions, going to step 5; if the highest collision position and the second-highest collision position are not continuous collision positions, going to step 6; forming a new common prefix, giving a subsequent numerical value, pressing into a stack respectively at last, and going to step 7; forming a new common prefix, giving a subsequent numerical value, pressing into a stack at last, and going to step 7; if the stack is determined to be empty, ending the entire identification process; or otherwise, returning to step 1. The deterministic anti-collision algorithm has the following beneficial effects: a multi-prefix matching and query technology is introduced, the identification of multiple tags by one time slot is realized by virtue of a prefix 1 and a prefix 2, idle time slots of a multi-ary algorithm are completely eliminated, the query times is reduced, and the query efficiency is improved.

Description

technical field [0001] The invention belongs to radio frequency identification (RFID) multi-label identification technology in the field of wireless communication, and in particular relates to a deterministic anti-collision algorithm based on multi-prefix matching of a query tree method. Background technique [0002] Radio Frequency Identification is a promising wireless communication technology for automatic target identification. A typical RFID system usually consists of a reader and multiple low-cost, small-sized electronic tags, each of which has a unique identifier (UID) (for ease of description, hereinafter collectively referred to as ID). The reader / writer wirelessly reads the ID of the tag so that the system can obtain information about the object connected to the tag. However, when multiple tags communicate with the reader at the same time, collisions will occur, causing the reader to fail to identify the tags. In order to solve this collision problem, a time-effe...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06K7/00
Inventor 苏健文光俊李建
Owner UNIV OF ELECTRONIC SCI & TECH OF CHINA
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap