2015•Unpublished venueRequires access

A Binary Anti-collision Algorithm Based on the Grouping for Tags

Yongfeng Dong, Yang-Cong Zhou, Hong-mei Xia, Xiaoxin Cui

Open publisher page 0 citations

Abstract

In order to overcome the shortcomings of the existing binary anti-collision, such as a lot of interaction times, large amount communication data and long communication time, proposed a new anti-collision algorithm. The new algorithm grouped the tags according initial collision bits, until only one tag in each group. Values of every tags in the register formed a continuous sequence of natural numbers starting from zero, and it was just the group number. The simulation analysis and experiments have proved that the algorithm reduces interaction times and communication data, shortens the communication time effectively.

About this research paper

What this paper is about

In order to overcome the shortcomings of the existing binary anti-collision, such as a lot of interaction times, large amount communication data and long communication time, proposed a new anti-collision algorithm. The new algorithm grouped the tags according initial collision bits, until only one tag in each group. Values of every tags in the register formed a continuous sequence of natural numbers starting from zero, and it was just the group number. The simulation analysis and experiments have proved that the algorithm reduces interaction times and communication data, shortens the communication time effectively.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In order to overcome the shortcomings of the existing binary anti-collision, such as a lot of interaction times, large amount communication data and long communication time, proposed a new anti-collision algorithm. The new algorithm grouped the tags according initial collision bits, until only one tag in each group. Values of every tags in the register formed a continuous sequence of natural numbers starting from zero, and it was just the group number. The simulation analysis and experiments have proved that the algorithm reduces interaction times and communication data, shortens the communication time effectively.

Key concepts: Collision, Computer science, Binary number, Binary search algorithm, Algorithm, Sequence (biology), Theoretical computer science, Arithmetic

Related papers

Back to paper searchBrowse research topicsOriginal source
A Binary Anti-collision Algorithm Based on the Grouping for Tags — Research Paper | ScholarLens