An Incremental Splitting Scheme for Efficient Tag Identification

In recent year, RFID automatic identification has become very popular in many service industries, manufacturing companies and material flow systems. One of the challenges in designing modern RFID systems is that when more than one tag exists in an RFID environment, it may occurs collisions so that the whole system becomes inefficient and increases the time for identifying RFID tags. In order to simultaneously recognize multiple tags within a reader interrogation zone, tag anti-collision algorithm should be applied. In this paper, we present an incremental splitting scheme (ISS), which is an enhanced technique based on the query tree protocol, for tag identification. The main idea of the proposed technique is that the ISS can dynamically adjust length of inquiry message to avoid unnecessary interrogation. To evaluate performance of the proposed technique, we have implemented the ISS along with other query tree based protocols. The experimental results show that the ISS outperforms other tree based approaches in terms of efficiency and identification overheads.