Fast identification is an urgent demand for modern RFID systems. In this paper, we propose a novel algorithm, access probability adjustment based fine-grained Q-algorithm (APAFQ), to enhance the efficiency of RFID identification with low computation overhead. Specifically, instead of estimation accuracy, the target of most proposed anti-collision algorithms, the APAFQ scheme is driven by updating Q value with two different weights, slot by slot. To achieve higher identification efficiency, the reader adopts fine-grained access probability during the identification process. Moreover, based on the responses from tags, APAFQ adjusts the access probability adaptively. Simulations show the superiority of APAFQ over existing Aloha-based algorithms.

Tag collision has a negative impact on the performance of RFID systems. In this letter, we propose an algorithm termed anti-collision protocol based on improved collision detection (ACP-ICD). In this protocol, dual prefixes matching and collision bit detection technique are employed to reduce the number of queries and promptly identify tags. According to the dual prefixes matching method and collision bit detection in the process of collision arbitration, idle slots are eliminated. Moreover, the reader makes full use of collision to improve identification efficiency. Both analytical and simulation results are presented to show that the performance of ACP-ICD outperforms existing anti-collision algorithms.

Routing efficiency is the critical issue when constructing peer-to-peer overlay. However, Chord has often been criticized on its careless of routing locality. A routing efficiency enhancement protocol on top of Chord is illustrated in this paper, which is called PChord. PChord aims to achieve better routing efficiency than Chord by exploiting proximity of the underlying network topology. The simulation shows that PChord has achieved lower RDP per message routing.