Multi-way tree anti-collision algorithm applicable to radio frequency identification (RFID) system

An anti-collision algorithm and multi-tree technology, applied in the field of tag anti-collision, can solve the problems of large data transmission, long recognition time of collision tags, slow search speed, etc., to improve recognition efficiency, overcome slow splitting speed, and reduce overhead. Effect

Inactive Publication Date: 2013-07-17
广西优居科技有限公司
View PDF3 Cites 25 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

This technology allows for faster searching times while maintaining accurate collisions detection based on multiple factors such as timing differences and space limitations. It uses counters instead of just counting spaces, allowing for quicker division rates compared to traditional methods like binary trees. Additionally, this technique helps reduce signal processing latency and improve identifying performance. Overall, these technical improvements enhance the overall functionality and effectiveness of the algorithms used in wireless communication systems.

Problems solved by technology

This patented technical solution describes how to prevent collisions caused by wireless devices like radios used in industrial applications. These collptions cause errors in transmitting messages sent over these networks due to their inherently limited resources. To address this issue, some proposals involve implementing both static and dynamic techniques called Anti-Collision Interval Analysis ("ACI"). ACI involves selecting which tags belong to another network while avoiding colliding them.

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-way tree anti-collision algorithm applicable to radio frequency identification (RFID) system
  • Multi-way tree anti-collision algorithm applicable to radio frequency identification (RFID) system
  • Multi-way tree anti-collision algorithm applicable to radio frequency identification (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

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

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
Owner 广西优居科技有限公司
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