Mobile RFID System Research Articles

A Near-Optimal Protocol for Continuous Tag Recognition in Mobile RFID Systems

A Near-Optimal Protocol for Continuous Tag Recognition in Mobile RFID Systems

The usage of RFID robots in logistics process management

The aim of this post is to point out the use of RFID robots in the management of logistics processes. RFID technology is defined first. RFID technology represents identification using radio frequency waves. The principle is to store the necessary data in radio frequency memory chips and then repeatedly read or write the data using a reader. We divide RFID chips into active and passive. Active RFID chips use energy from a battery, while passive RFID chips are a technology without an internal power source. Passive RFID is the most common form of RFID in warehouses, using which inventory is taken using RFID robots or hand-held RFID readers. Nowadays, many RFID robots from different manufacturers are available on the market. When choosing, I must consider where we want to use the RFID robot and choose the one that suits us based on its specific characteristics. The RFID robot is a mobile and autonomous RFID system that performs an inventory of the given space based on our initial setup. The RFID robot locates each item in 2 dimensions (x and y). Most robots can move in all directions because they can rotate without shifting. The accuracy of the inventory using the RFID robot ranges from 95-99%, while the accuracy of the inventory performed by employees using handheld RFID readers ranges from 85-95%. As for speed, it is on average 10 times faster compared to manual RFID readers.

Efficient Mobile RFID Authentication Protocol for Smart Logistics Targets Tracking

Target tracking is one of the problems existing in the supply chain management. The use of radio frequency identification (RFID) in target tracking helps improve the monitoring accuracy and status visibility of the tracked target. For mobile RFID system, its three entities have to authenticate each other’s identity in order to guarantee the data transmission security. The mobile RFID authentication protocol cannot achieve both high security and low complexity at the same time. For this problem, a new efficiency mobile RFID authentication protocol is proposed in this paper, which implements secure authentication among different communication entities by different operation modes. For example, the protocol adopts Hash Function between reader and cloud server, and exchange-cross bitwise operation between tag and cloud server, to achieve low computing cost at tag-end while improving the security of mobile communication data. At the cloud server end, the protocol proposed in this paper adopts index data table as the storage mode, which further improves the could server efficiency in retrieving the authentication of tags and readers, and reduces the risks of sensitive data disclosure. According to the security analysis, this protocol can resist impersonation attack, replay attack, trace attack and other attacks launched by attackers. Its security performance is further proved by BAN logic, proverif tool and random oracle model. On the other hand, the simple operation at the tag-end of the protocol lowers the tag cost to a larger extent.

Super lightweight mobile RFID authentication protocol for bit replacement operation

In the traditional RFID (Radio Frequency IDentification) system, a secure wired channel communication is used between the reader and the server. The newly produced mobile RFID system is different from the traditional RFID system, the communication between the reader and the server is based on a wireless channel, and the authentication protocol is suitable for traditional RFID systems, but it cannot be used in mobile RFID systems. To solve this problem, a mutual authentication protocol MSB (Most Significant Bit) for super lightweight mobile radio frequency identification system is proposed based on bit replacement operation. MSB is a bitwise operation to encrypt information and reduce the computational load of communication entities. Label, readers, and servers authenticate first and then communicate, MSB may be used to resistant to common attacks. The security analysis of the protocol shows that the protocol has high security properties, the performance analysis of the protocol shows that the protocol has the characteristics of low computational complexity, the formal analysis of the protocol based on GNY logic Gong et al. (1990) provides a rigorous reasoning proof process for the protocol.

Super Lightweight Mobile RFID Authentication Protocol for Bit Replacement Operation

In the traditional RFID system, the secure wired channel communication is used between the reader and the server, and the new mobile RFID system is different from the traditional RFID system. The reader and the server communicate based on the wireless channel. This makes authentication protocols applicable to traditional RFID systems not applicable to mobile RFID systems. To solve this defect, a two-way authentication protocol MSB is proposed for ultra-lightweight mobile radio frequency identification system based on bit replacement operation. MSB (most significant bit) encrypts information based on bitwise operations, and the amount of computation of the communication entity is reduced. Tags, readers, and servers first authenticate and then communicate. MSB can be resistant to common attacks. The security analysis of the protocol shows that the protocol has high security attributes, and the performance analysis of the protocol shows that the protocol has the characteristics of low calculation volume. The formal analysis of the protocol is given based on GNY logic.

A tags’ arrival rate estimation method using weighted grey model(1,1) and sliding window in mobile radio frequency identification systems

In order to guarantee the tag identification accuracy and efficiency in mobile radio frequency identification system, it is necessary to estimate the tags’ arrival rate before performing identification. This research aims to develop a novel estimation method based on improved grey model(1,1) and sliding window mechanism. By establishing tags’ dynamic arrival model, this article emphasizes the importance of tags’ arrival rate estimation in mobile radio frequency identification system. Using sliding window mechanism and weighted coefficients method, weighted grey model(1,1) with sliding window (WGMSW(1,1)) is proposed based on traditional grey model(1,1). For experimental verification, three kinds of data are used as original data in WGMSW(1,1). The experimental results show that the proposed method has lower estimation error rate, lower computation complexity, and high system stability.

Evaluation of Centralized Reader Anti-Collision Protocols for Mobile RFID System Based on Maximum Independent Set: A Simulation Study

Radio Frequency IDentification (RFID) systems often encounter reader collisions when multiple readers interrogate tags at the same time. Especially in the mobile RFID system, the mobility of readers leads to more reader collisions. To reduce reader collisions, some centralized reader anti-collision protocols have been developed through Time Division Multiple Access (TDMA), which allows readers to interrogate tags at different time slots. As an important branch of centralized reader anti-collision protocols, the Neighbor-Friendly Reader Anti-collision (NFRA) family is able to improve the throughput of mobile RFID networks with the assistance of the polling server. This paper explores the throughput (the number of readers interrogating tags simultaneously) of five NFRA protocols including the basic NFRA protocol and four variants by using the maximum independent set. Following the classical interference model, the interference between readers can be modeled as an undirected graph in which each maximum independent vertex set corresponds to one optimal reader anti-collision solution. The contribution of this paper is to establish an evaluation framework based on maximum independent set to evaluate the performance of reader anti-collision protocols. By considering the effect of the density of readers (low, medium and high density), three groups of simulations are arranged to test the effectiveness of the evaluation framework. In addition, the performances of five NFRA protocols in different dense reader environments are studied. Simulation results indicate that the proposed evaluation method based on the maximum independent set is effective and potential in evaluating different centralized reader collision protocols.

An Energy-Aware Offloading Framework for Edge-Augmented Mobile RFID Systems

Internet of Things (IoT) have been widely used in many fields including smart city, industry Internet and automatic driving. Because IoT end devices usually have only limited capability in computation and power supply, they are not suitable to execute energy-consuming computational tasks. In many cases, we need to offload computational tasks from IoT end devices to edge servers in order to save energy consumption on the end devices. This process is usually termed as computing offloading. In this paper, we study computing offloading in radio frequency identification (RFID) systems built with mobile readers. We analyze the energy consumption characteristics of different components in mobile RFID systems, based on which we propose a framework to perform energy-aware offloading for such systems. By using tag searching as an example, we illustrate how our framework can help offload computational intensive tasks to edge servers to save energy consumption on mobile readers while satisfying the constraint on total execution time. Simulation results shown that the energy consumption of mobile readers can be greatly reduced by using our offloading framework.

Round-priority-based anti-collision tag identification method in a mobile radio-frequency identification system

In the mobile radio-frequency identification system, the accuracy and rapidity of tag recognition are undergoing great challenges. In this article, we proposed a novel tag anti-collision identification method based on tags’ priority called RPA in the mobile radio-frequency identification system. The algorithm sets the priority of recognition according to the sequence of tag entering the recognition area. The reader does not recognize the tags with low priority until the ones with high priority have been identified totally. The experimental results show that when the tags’ moving speed is lower than 4 m/s, the system can identify the total tags without loss, and the efficiency and identification speed can reach 73.7% and 762 tags per unit, respectively.

An Efficient Dynamic Anti-Collision Protocol for Mobile RFID Tags Identification

Traditional anti-collision protocols for RFID tags identification assume that the tags and reader are stationary, i.e., no tag is coming in or leaving during tags identification. If not, the reader cannot ensure that the tags are all identified. However, in the mobile RFID system, the reader or tags or all of them are moving continuously, and the tags dynamically enter and leave the reading area. Therefore, traditional protocols are not suitable for the mobile RFID system. This letter presents a dynamic anti-collision protocol, called dynamic collision tree protocol, to be used in the mobile RFID identification system to identify RFID tags that dynamically move into and leave the reading area.

Design and analysis of an ID-updated mutual authentication protocol for mobile RFID system

With comprehensive applications of radio-frequency identification (RFID) technology in Internet of things, more and more mobile reader devices are utilized. However, in mobile RFID system the reade...

A Novel Authentication Management RFID Protocol Based on Elliptic Curve Cryptography

The existing RFID (Radio Frequency Identification) security protocol lacks the key establishment mechanism, assuming only that both parties of the authentication protocol have shared their respective session keys. However, key establishment is an integral part of the RFID security system. This article first introduces the elliptic curve related mathematical theory foundation. Then we establish the key negotiation mechanism, and analyze the correctness and rationality of the negotiation mechanism. Finally, we design the authentication protocol based on elliptic curve in mobile RFID system, analyze the protocol authentication process, and compare the security and performance with other protocols, which shows that the authentication protocol has more efficient performance and the ability to resist all kinds of attacks.

An Efficient Bit-Detecting Protocol for Continuous Tag Recognition in Mobile RFID Systems

In a mobile RFID system, a large number of tags move in and out of the system continuously, so that the reader has very limited time to recognize all the tags. As a result, the effective and efficient identification of tags in mobile environments is a more challenging problem compared to conventional static RFID systems. In this paper, we propose an efficient bit-detecting (EBD) protocol to accelerate the reading process of large-scale mobile RFID systems. In these systems, some previously recognized tags, i.e., known tags, may stay in the reader's reading range for two consecutive reading cycles, and some unknown tags may newly participate in the current reading cycle. In the proposed EBD protocol, a new bit monitoring method is proposed to detect the presence of known tags using a small number of slots, and to retrieve their IDs from the back-end database. Next, an $M$ -ary bit-detecting tree recognition method is proposed to rapidly recognize unknown tags without generating any idle slots. This new protocol is shown to perform better than existing methods reported in the literature. Both theoretic and simulation results are present to demonstrate that the proposed protocol is superior to existing protocols in terms of lower time cost.

An enhanced authentication scheme in mobile RFID system

The popularization of wireless networks and mobile applications has increased the importance of RFID technologies. However, since wireless networks does not guarantee transmission channel security, putting private user information at risk for unintentional disclosure. Previous research has introduced a security mechanism to provide privacy and authentication. This mechanism is based on quadratic residue, does not require a secure channel and fits EPC Class-1 Gen-2 specifications. However, this mechanism cannot resist replay attacks, and lacks an efficient means of its server is not able to find determining validating values, making it difficult to implement. This paper proposes an improvement scheme that uses virtual IDs and time parameters. It does not need a secure channel, fits EPC Class-1 Gen-2 specifications, is resistant to replay attacks, and can efficiently find validation information. The proposed scheme is applied to mobile devices as a proof of concept for use in wireless/mobile RFID systems.

Incorporating GPS and Mobile Radio Frequency Identification to Detect PIT‐Tagged Fish and Evaluate Habitat Utilization in Streams

AbstractThe use of mobile radio frequency identification (RFID) systems to detect PIT tags has increased in support of research on fish movement, population dynamics, and habitat use. We describe the development and application of a mobile RFID system that incorporates GPS to detect PIT‐tagged fish and evaluate habitat utilization in streams. The study was conducted in two distinct phases. First, development and testing of the RFID–GPS system were conducted using georeferenced, PIT‐tagged rocks to evaluate detection probability and GPS accuracy. Second, the system was field deployed to estimate the abundance of PIT‐tagged fish and evaluate habitat utilization. Detection probability was negatively influenced by stream width, distance from the stream center, and water depth, whereas detection probability increased with the number of passes. The GPS error between detected and surveyed positions averaged 4.5 m, with greater error observed in longitude than in latitude. Because of high capture and recapture probabilities, abundance estimation of PIT‐tagged fish was not only possible but also relatively precise. All detections during field deployment were assigned habitat types using the “intersect,” “closest,” and “buffer” methods in ArcGIS. Analysis of habitat utilization was limited to two bedform classes, riffles and pools, because the average area of runs and glides was smaller than the average GPS error. More Brown Trout Salmo trutta were detected in pools (76–80%) than in riffles, and all Rainbow Trout Oncorhynchus mykiss and cutbow trout (Cutthroat Trout O. clarkii × Rainbow Trout) were detected in pools. The detection field covered more cross‐sectional area in pools than in riffles, which could have influenced the analysis of habitat utilization. The influence of GPS error on habitat evaluations will depend on stream size, as erroneous habitat associations should diminish as stream size increases. The flexibility of the RFID–GPS system makes it useful for a variety of studies related to habitat utilization, fish migration, and population trends.Received March 31, 2017; accepted August 19, 2017 Published online October 20, 2017

Mobile RFID System in the Presence of Denial-of-Service Attacking Signals

In a mobile radio-frequency identification (RFID) system, tagged items enter and leave the reader’s field at a constant speed. The possibility of tags leaving the reader’s interrogation zone without being identified is known as tag loss. Minimizing the tag loss ratio in the presence of random denial-of-service (DoS) attacking signals by optimizing the number of frames is investigated in this paper. The results show that the number of frame control is not needed to reduce the tag loss ratio if the tag entering rate is below a critical limit. The number of frames has to abruptly reduce to keep the tag loss ratio lower if the tag entering rate exceeds that critical limit. This critical limit of the tag entering rate is derived analytically. An analytical solution of the optimum number of frames in the presence of attacking signals that also minimize the tag loss ratio is devised. The technique for setting the optimum number of frames is also presented. The presented results in this paper with random DoS attacking signals is so general that those can be converted without DoS attacking signals by setting the DoS attacking signals equal to zero. The results of this paper can be used for mobile RFID system design with and without DoS attacking signals.

Path Optimization and Object Localization Using Hybrid Particle Swarm and Ant Colony Optimization for Mobile RFID Reader

This paper proposes a hybrid approach of Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) for the mobile Radio Frequency Identification System (RFID) reader to get the shortest path for object localization. In this approach, we have adopted the ACO global pheromone updating information of ants to guide the update velocities and position for PSO based on nearest neighbor constraints. The pheromone information is used efficiently to guide the selection of each particle in a search space of its visits. The best path will be used for mobile RFID reader for objects localization in search space. Simulation results show that the method is effective, minimizing the number of visited nodes for a mobile RFID reader.

The construction of mobile RFID authentication mechanism and relative ownership transfer protocols for supply chain

Purpose – The purpose of this paper is to complete the following works: construct RFID integration mechanism in the supply chain; build mutual authentication mechanism; and build the transfer mechanism in supply chain. Design/methodology/approach – In order to transfer RFID tag information to others safely in mobile RFID supply chain circumstances, the authors propose a RFID authentication mechanism which can ensure the identity and make the mutual authentication. Moreover, the authors propose a secure transfer method of ownership for the specific role in different regions under the structure of Mobile RFID. Findings – The task of administrator server is to check the order, store the merchandise information, distribute the authority, certify the security and transfer the ownership. It can make the whole supply chain more mobility, and transfer faster. Originality/value – The goals of this research are to achieve mainly: using mobile RFID system to design secure mutual authentication mechanism, transfer mechanisms with faster transfer and authority distribution. The authors introduce the security authentication and competence transfer mechanism in supply chain.

Modeling Mutual Intraceability of Mobile RFID Systems Using BRS-based Approach

Modeling Mutual Intraceability of Mobile RFID Systems Using BRS-based Approach

Balancing time and energy efficiencies with identification reliability constraint for portable reader in mobile RFID systems

A mobile radio frequency identification (RFID) system consists of passive moving tags and a battery-constrained portable reader. In such a mobile RFID system, massive tags continuously enter the interrogation zone of the reader, which must quickly and reliably identify all the tags before they leave its coverage area. To meet such performance requirement, in the literature, a plethora of research works has been done in the design and optimization of anti-collision protocols, to enhance the system time efficiency and reduce the tag reading time as much as possible. However, as illustrated in this paper, optimizing the time efficiency does not necessarily lead to maximizing the energy efficiency for the reader. In fact, to efficiently utilize the limited battery energy at the reader, tag reading process should be power-aware consuming just enough energy to achieve the required performance.In this paper, we study the tradeoff between the time and energy efficiencies for tag identification. Specifically, we establish the time and energy efficiency metrics for the system and analyze the impact of frame length on the two metrics. We also consider different tag-moving scenarios, with tag density, moving velocity, prescribed identification constraint, etc., taken into consideration. We then analytically derive the most energy-efficient frame length under different tag moving scenarios. Extensive simulation results indicate that, guided by the derived numerical results, we can achieve as much as 11% improvement in energy efficiency, while satisfying the identification reliability constraint at the same time.