scholarly journals The research of the application of the binary search algorithm of RFID system in the supermarket shopping information identification

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Ling Wu ◽  
Sheng Liu ◽  
Baoling Zhao ◽  
Weinan Wu ◽  
Baozhong Zhu
Keyword(s):  
Search Algorithm ◽  
Binary Search ◽  
Rfid System ◽  
Binary Search Algorithm

A Simulation Research of Binary Anti-Collision Algorithms in RFID System

2013 ◽  
Vol 427-429 ◽  
pp. 1013-1016 ◽  
Author(s):  
Jin Hua Liu ◽  
Cha Sheng Jian
Keyword(s):  
Search Algorithm ◽  
Binary Search ◽  
Simulation Research ◽  
Usual Type ◽  
Rfid System ◽  
Binary Search Algorithm

An Anti - collision Algorithms technique would be required in RFID system to reduce conflicts and identify several tabs very quickly and accurately.Binary Search algorithm in a TDMA system is the most usual type of Anti - collision Algorithms in RFID System. This paper puts forward programming and simulating by using MATLAB based on EPCs Binary Search algorithm .Finally the results are compared and analyzed at the end of the paper and the author gives some pieces of advice.

Research on Anti-Collision Technology with Multiple Tags for RFID System

2011 ◽  
Vol 130-134 ◽  
pp. 2124-2127
Author(s):  
Zhang Hong ◽  
Xing Hui Zhang ◽  
Jian Li Guo
Keyword(s):  
Search Algorithm ◽  
Binary Search ◽  
Line Form ◽  
Rfid System ◽  
Binary Search Algorithm

ALOHA algorithm can’t prevent collision much effectively, the process of anti-collision is longer while the amount of tags plunged collision is numerous, and sometimes the problem about estimating mistakenly arises. Binary search algorithm, which identification efficiency is higher, the problem about estimating mistakenly can’t arise, but its delay tima is more longer, security is short. The amelioration algorithm, return binary search algorithm can identify tag more effectively and rapidly, identifying time and the amount of tags is the relation of line form. The significance is very momentous that vast goods are identified, traced and managed by this amelioration algorithm.

scholarly journals Practical Implementation of an Indoor Robot Localization and Identification System using an Array of Anchor Nodes

2020 ◽  
Vol 16 (1) ◽  
pp. 1-8 ◽  
Author(s):  
Israa AL-Forati ◽  
Abdulmuttalib Rashid
Keyword(s):  
Search Algorithm ◽  
Low Cost ◽  
Binary Search ◽  
Practical Implementation ◽  
Identification System ◽  
Robot Localization ◽  
Light Emitting ◽  
The Matrix ◽  
Anchor Nodes ◽  
Binary Search Algorithm

This paper proposes a low-cost Light Emitting Diodes (LED) system with a novel arrangement that allows an indoor multi-robot localization. The proposed system uses only a matrix of low-cost LED installed uniformly on the ground of an environment and low-cost Light Dependent Resistor (LDR), each equipped on bottom of the robot for detection. The matrix of LEDs which are driven by a modified binary search algorithm are used as active beacons. The robot localizes itself based on the signals it receives from a group of neighbor LEDs. The minimum bounded circle algorithm is used to draw a virtual circle from the information collected from the neighbor LEDs and the center of this circle represents the robot’s location. The propose system is practically implemented on an environment with (16*16) matrix of LEDs. The experimental results show good performance in the localization process.

Routing Lookup Algorithm Performance Analysis and Research

2011 ◽  
Vol 181-182 ◽  
pp. 109-112
Author(s):  
Xian Min Wei
Keyword(s):  
Performance Analysis ◽  
Search Algorithm ◽  
Binary Search ◽  
Algorithm Performance ◽  
Practical Performance ◽  
Binary Search Algorithm ◽  
Routing Lookup ◽  
Searching Performance

This paper describes several current routing lookup algorithms, to study and analysize the complexity and operating practical performance of these routing lookup algorithms. The results show that although the binary search algorithm is not greatly improved in the searching performance, but in IPv6 environment, because searching performance of multi-branch Trie tree will decrease greatly, thus the superiority of binary search algorithm will be reflected better.

Sign in / Sign up

Export Citation Format

Share Document