Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Multi-tree anti-collision algorithm suitable for rfid system

A multi-fork tree and anti-collision technology, which is applied in the field of tag anti-collision, can solve the problems of large data transmission, slow search speed, and long identification time of collision tags, so as to improve recognition efficiency, reduce overhead, and overcome the problem of slow splitting speed Effect

Inactive Publication Date: 2015-11-04
广西优居科技有限公司
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] The purpose of the present invention is to overcome the shortcomings of the existing anti-collision algorithm, such as slow search speed, large amount of data transmission, and long identification time of collision tags, and provide a multi-tree anti-collision algorithm suitable for RFID systems

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
  • Multi-tree anti-collision algorithm suitable for rfid system
  • Multi-tree anti-collision algorithm suitable for rfid system
  • Multi-tree anti-collision algorithm suitable for rfid system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0057] The following example illustrates a specific implementation process of the algorithm. The process is as follows: figure 1 As shown, assuming that there are 7 tags within the scope of the reader, the tag length is 8, tag1 is 0000 1000, tag2 is 0100 0100, tag3 is 0010 0100, tag4 is 0100 0001, tag5 is 1110 0001, and tag6 is 0000 1001 , tag7 is 0000 0101. In this group of tag ID numbers, the left is the high bit, the highest bit is the seventh bit, and the lowest bit is the 0th bit. Use Di to represent the data of the i-th bit, such as D7 to represent the data of the 7th bit, and use "?" to represent the collision bit.

[0058] Step 1) Initialize the prefix stack: The reader initializes the prefix stack to make it empty. Initially, the sleep level counter S=0, the response counter C=0, the response flag bit TSC=8, the sleep level counter S=0, and 8 means the tag The length of the ID, and then send the request command Request(NULL) to request all tags to respond, the proce...

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 invention relates to a label collision prevention technology in radio frequency identification and particularly relates to a multi-way tree anti-collision algorithm applicable to an RFID system. The algorithm comprises the steps of appointing the algorithm, initializing prefix stacks, detecting collisions, selecting search modes, determining prefixes, judging prefix stacks, enabling prefix stacks to be null finally, and ending the algorithm. According to the algorithm, a reader-writer is used for judging numbers of adjacent collision bits, an octree search mode, a quadtree search mode or a binary tree search mode free of free timeslots is selected adaptively, the search speed is accelerated, transmission of subsequent data is cut off immediately when three adjacent collision bits are judged, and a counter is used for feeding back the lowest bits in adjacent collision bits within transmission time of a plurality of bits, so that the transmission of the data is reduced, the energy consumption is reduced, free time slots are eliminated, and the identification time is shortened.

Description

technical field [0001] The invention relates to a tag anti-collision technology in radio frequency identification, in particular to a multi-tree anti-collision algorithm suitable for an RFID system. Background technique [0002] With the development of communication and computer technology, the Internet of Things technology has become more and more closely related to people's life, work and entertainment. Radio frequency identification (RFID) technology, as a key technology in the identification link of the Internet of Things, has also become a hot topic of attention of many experts and scholars in recent years. RFID is an automatic identification technology for non-contact identification through radio frequency signals. This enables automatic coupling of the identified objects. [0003] In the RFID system, there may be multiple readers around the tag at the same time, so the tag may receive commands sent by different readers at the same time, and a collision between the r...

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
Patent Type & Authority Patents(China)
IPC IPC(8): G06K17/00
Inventor 郑嘉利韦冬雪
Owner 广西优居科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com