From M-ary Query to Bit Query: a new strategy for efficient large-scale RFID identification

The tag collision avoidance has been viewed as one of the most important research problems in RFID communications and bit tracking technology has been widely embedded in query tree (QT) based algorithms to tackle such challenge. Existing solutions show further opportunity to greatly improve the reading performance because collision queries and empty queries are not fully explored. In this paper, a bit query (BQ) strategy based Mary query tree protocol (BQMT) is presented, which can not only eliminate idle queries but also separate collided tags into many small subsets and make full use of the collided bits. To further optimize the reading performance, a modified dual prefixes matching (MDPM) mechanism is presented to allow multiple tags to respond in the same slot and thus significantly reduce the number of queries. Theoretical analysis and simulations are supplemented to validate the effectiveness of the proposed BQMT and MDPM, which outperform the existing QT-based algorithms. Also, the BQMT and MDPM can be combined to BQMDPM to improve the reading performance in system efficiency, total identification time, communication complexity and average energy cost

A partitioning approach to RFID identification

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

A group-based binary splitting algorithm For UHF RFID anti-collision systems

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

Capture-aware identification of mobile RFID tags with unreliable channels

Radio frequency identification (RFID) has been widely applied in large-scale applications such as logistics, merchandise and transportation. However, it is still a technical challenge to effectively estimate the number of tags in complex mobile environments. Most of existing tag identification protocols assume that readers and tags remain stationary throughout the whole identification process and ideal channel assumptions are typically considered between them. Hence, conventional algorithms may fail in mobile scenarios with unreliable channels. In this paper, we propose a novel RFID anti-collision algorithm for tag identification considering path loss. Based on a probabilistic identification model, we derive the collision, empty and success probabilities in a mobile RFID environment, which will be used to define the cardinality estimation method and the optimal frame length. Both simulation and experimental results of the proposed solution show noticeable performance improvement over the commercial solutions

Metagenomic Profiling of the Bacterial Community Changes from Koji to Mash Stage in the Brewing of Soy Sauce

The improvement of soy sauce fermentation is restricted by the insufficient information on bacterial community. In this study, bacterial communities in the koji and mash stage were compared based on next-generation sequencing technology. A total of 29 genera were identi­fied in the koji stage, while 34 in the mash stage. After koji stage, 7 genera disappeared and 12 new genera appeared in the mash stage. The dominant bacteria were Kurthia, Weissella and Staphylococcus in the koji stage and Staphylococcus, Kurthia, Enterococcus and Leuconostoc in the mash stage. The results provided insights into the microbial communities involved in soy sauce fermentation

Long-read sequencing reveals genomic structural variations that underlie creation of quality protein maize

Mutation of o2 doubles maize endosperm lysine content, but it causes an inferior kernel phenotype. Developing quality protein maize (QPM) by introgressing o2 modifiers (Mo2s) into the o2 mutant benefits millions of people in developing countries where maize is a primary protein source. Here, we report genome sequence and annotation of a South African QPM line K0326Y, which is assembled from single-molecule, real-time shotgun sequencing reads collinear with an optical map. We achieve a N50 contig length of 7.7 million bases (Mb) directly from long-read assembly, compared to those of 1.04 Mb for B73 and 1.48 Mb for Mo17. To characterize Mo2s, we map QTLs to chromosomes 1, 6, 7, and 9 using an F2 population derived from crossing K0326Y and W64Ao2. RNA-seq analysis of QPM and o2 endosperms reveals a group of differentially expressed genes that coincide with Mo2 QTLs, suggesting a potential role in vitreous endosperm formation.Open access journalThis item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at [email protected]