Radio Frequency Identification (RFID) is a technology that stores and remotely retrieves data wirelessly between a reader and one or more tags, each containing data about an item. The reader polls a tag and receives data from it, passing the data to a host system for processing. Despite its potential, this technology still faces a number of challenges, one being how to handle collisions, which occur when multiple tags simultaneously respond to the reader, making it impossible for the reader to detect the separate tag identifiers. This is a serious problem since it can disrupt the communication between the reader and tags, potentially bringing the RFID system to a halt.For this purpose, a new algorithm is proposed, called CRA (Collision Resolution Algorithm), which optimizes the binary search algorithm by reducing the number of iterations taken for successful tag identification. This thesis explains the design and implementation of CRA and compares its performance with the binary search algorithm.In order to resolve the collision problem, a number of algorithms have been developed one of the most flexible and efficient is the binary search algorithm. This algorithm consists of a sequence of interactions between a reader and several tags with the objective being able to successfully identify all the tags. But with the rapid growth of RFID technology and its adoption in fields such as transport payment, product tracking, and automatic identification systems, there will be a need of more effective collision-resolution algorithms.
展开▼
