Identification efficiency is a key performance metrics to evaluate the ultra high frequency (UHF) based radio frequency identification (RFID) systems. In order to solve the tag collision problem and improve the identification rate in large scale networks, we propose a collision arbitration strategy termed as group-based binary splitting algorithm (GBSA), which is an integration of an efficient tag cardinality estimation method, an optimal grouping strategy and a modified binary splitting. In GBSA, tags are properly divided into multiple subsets according to the tag cardinality estimation and the optimal grouping strategy. In case that multiple tags fall into a same time slot and form a subset, the modified binary splitting strategy will be applied while the rest tags are waiting in the queue and will be identified in the following slots. To evaluate its performance, we first derive the closed-form expression of system throughput for GBSA. Through the theoretical analysis, the optimal grouping factor is further determined. Extensive simulation results supplemented by prototyping tests indicate that the system throughput of our proposed algorithm can reach as much as 0.4835, outperforming the existing anti-collision algorithms for UHF RFID systems.

Radio-frequency identification (RFID) is a major enabler of Internet of Things (IoT), and has been widely applied in tag-intensive environments. Tag collision arbitration is considered as a crucial issue of such RFID system. To enhance the reading performance of RFID, numerous anti-collision algorithms have been presented in previous literatures. However, most of them suffer from the slot efficiency bottleneck of 0.368. In this paper, we revisit the performance of tag identification in Aloha-based RFID anti-collision approaches from the perspective of time efficiency. Based on comprehensive reviews and analysis of the existing algorithms, a novel partitioning approach is proposed to maximize identification performance in framed slotted Aloha based UHF RFID systems. In the proposed approach, the tag set is divided into many groups which only contains a few tags, and then each group is identified in sequence. Benefiting from the optimal partition, the proposed algorithm can achieve a significant performance improvement. Simulation results supplemented by prototyping tests show that the proposed solution achieves an asymptotical slot efficiency up to 0.4348, outperforming the existing UHF RFID solutions.

Radio frequency identification (RFID) is widely applied in massive items tagged domains. Existing medium access control (MAC) solutions primarily focus on improving slot efficiency or reducing the total number of slots. However, with pervasive applications of RFID, the time and energy consumption are increasingly important and should be considered in the new design. In this paper, we re-exam the problem of tag identification in UHF RFID system from the perspective of time and energy consumption. The presented work comprehensively reviews and analyzes the prior tag reading protocols. Based on prior art, we further discuss a novel design of tag reading algorithm to improve both time and energy efficiency of EPC C1 Gen2 UHF RFID standard. By exploring the effectiveness of embedding slot-by-slot mechanism in a sub-frame observation phase and combine the sub-frame and slot-by-slot observation in the proposed algorithm, which can achieve more fine-grained frame size adjustment with time and energy-efficiency. Moreover, the cardinality estimation function of the algorithm is implemented by the look-up tables, which allows dramatically reduction in computational complexity and energy consumption. Both simulation results and experiments show clear performance improvement over the commercial solutions.

Recent research on physical layer cross technology communication (PHY-CTC) brings a timely answer for escalated wireless coexistence and open spectrum movement. PHY-CTC achieves direct communication among heterogeneous wireless technologies (e.g.,WiFi, Bluetooth, and ZigBee) in physical layer and thus brings communication support for coexistence service such as spectrum management and IoT device control. To put PHY-CTC into service, however, there still exists a gap due to its transmission failure and asymmetric link (i.e., one-way PHY-CTC) issues. In this paper, we propose NetCTC the first networking support design for PHY-CTC to establish feedbacks (e.g., ACKs) and thus meet the upper layer networking requirements in heterogeneous unicast, multicast and broadcast. The core design of NetCTC is a real-time interaction mechanism which achieves reliable, transmission efficient and concurrent interactive communication among heterogeneous devices. We implement and evaluate NetCTC on commodity devices and the USRP-N210 platform. Our extensive evaluation demonstrates that NetCTC achieves reliable bidirectional cross technology communication under a full range of wireless configurations including stationary, mobile and duty-cycled settings.