Least and Most significant Bit Arbitration algorithm in uniform distributed passive RFID tags

Tag Collisions in RFID systems is a prime issue which causes identification delay and data loss. This paper presents an efficient algorithm called Least and Most significant Bit Arbitration (LaMSBA) to reduce idle and collision slots. The algorithm makes the reader to take full advantage when ever a collision occurs by constructing a partial tree for multiple tags, which in turn prevents redundancy of querying the same bit. The least and most significant bits are queried to singulate the tag at a faster pace, instead of querying either from the left or from the right. Simulation results show that the proposed algorithm effectively reduces the identification delay, thereby increasing the system efficiency as a result.