1,246 research outputs found
Recommended from our members
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
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
Perfect tag identification protocol in RFID networks
Radio Frequency IDentification (RFID) systems are becoming more and more
popular in the field of ubiquitous computing, in particular for objects
identification. An RFID system is composed by one or more readers and a number
of tags. One of the main issues in an RFID network is the fast and reliable
identification of all tags in the reader range. The reader issues some queries,
and tags properly answer. Then, the reader must identify the tags from such
answers. This is crucial for most applications. Since the transmission medium
is shared, the typical problem to be faced is a MAC-like one, i.e. to avoid or
limit the number of tags transmission collisions. We propose a protocol which,
under some assumptions about transmission techniques, always achieves a 100%
perfomance. It is based on a proper recursive splitting of the concurrent tags
sets, until all tags have been identified. The other approaches present in
literature have performances of about 42% in the average at most. The
counterpart is a more sophisticated hardware to be deployed in the manufacture
of low cost tags.Comment: 12 pages, 1 figur
Recommended from our members
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
Recommended from our members
An effective frame breaking policy for dynamic framed slotted aloha in RFID
The tag collision problem is considered as one of the critical issues in RFID system. To further improve the identification efficiency of an UHF RFID system, a frame breaking policy is proposed with dynamic framed slotted aloha algorithm. Specifically, the reader makes effective use of idle, successful, and collision statistics during the early observation phase to recursively determine the optimal frame size. Then the collided tags in each slot will be resolved by individual frames. Simulation results show that the proposed algorithm achieves a better identification performance compared with the existing Aloha-based algorithms
Critical Management Issues for Implementing RFID in Supply Chain Management
The benefits of radio frequency identification (RFID) technology in the supply chain are fairly compelling. It has the potential to revolutionise the efficiency, accuracy and security of the supply chain with significant impact on overall profitability. A number of companies are actively involved in testing and adopting this technology. It is estimated that the market for RFID products and services will increase significantly in the next few years. Despite this trend, there are major impediments to RFID adoption in supply chain. While RFID systems have been around for several decades, the technology for supply chain management is still emerging. We describe many of the challenges, setbacks and barriers facing RFID implementations in supply chains, discuss the critical issues for management and offer some suggestions. In the process, we take an in-depth look at cost, technology, standards, privacy and security and business process reengineering related issues surrounding RFID technology in supply chains
Goodbye, ALOHA!
©2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.The vision of the Internet of Things (IoT) to interconnect and Internet-connect everyday people, objects, and machines poses new challenges in the design of wireless communication networks. The design of medium access control (MAC) protocols has been traditionally an intense area of research due to their high impact on the overall performance of wireless communications. The majority of research activities in this field deal with different variations of protocols somehow based on ALOHA, either with or without listen before talk, i.e., carrier sensing multiple access. These protocols operate well under low traffic loads and low number of simultaneous devices. However, they suffer from congestion as the traffic load and the number of devices increase. For this reason, unless revisited, the MAC layer can become a bottleneck for the success of the IoT. In this paper, we provide an overview of the existing MAC solutions for the IoT, describing current limitations and envisioned challenges for the near future. Motivated by those, we identify a family of simple algorithms based on distributed queueing (DQ), which can operate for an infinite number of devices generating any traffic load and pattern. A description of the DQ mechanism is provided and most relevant existing studies of DQ applied in different scenarios are described in this paper. In addition, we provide a novel performance evaluation of DQ when applied for the IoT. Finally, a description of the very first demo of DQ for its use in the IoT is also included in this paper.Peer ReviewedPostprint (author's final draft
- …