Raad

A Survey and Tutorial of RFID Anti-Collision Protocols

RFID technologies have revolutionized the asset tracking industry, with applications ranging from automated checkout to monitoring the medication intakes of elderlies. In all these applications, fast, and in some cases energy efficient, tag reading is desirable, especially with increasing tag numbers. In practice, tag reading protocols face many problems. A key one being tag collision, which occurs when multiple tags reply simultaneously to a reader. As a result, an RFID reader experiences low tag reading performance, and wastes valuable energy. Therefore, it is important that RFID application developers are aware of current tag reading protocols. To this end, this paper surveys, classifies, and compares state-of-the-art tag reading protocols. Moreover, it presents research directions for existing and future tag reading protocols.

On the energy consumption of Pure and Slotted Aloha based RFID anti-collision protocols

A recent development in wireless sensor networks (WSNs) research is to equip sensor nodes with an RFID reader so that they can be used to track animate or in-animate RFID tagged objects. A key problem in such networks, however, is the energy efficiency of current RFID anti-collision protocols. Specifically, the energy cost incurred by a RFID reader to read and monitor n tags.This paper, therefore, aims to identify the most energy efficient variant among 12 Pure and Slotted Aloha based RFID anti-collision protocols. We present an analytical methodology that evaluates the energy consumed in the following phases: (i) success, (ii) collision, and (iii) idle listening. We first calculate the delay of each phase and then use it to formulate the energy consumption, battery lifetime, and battery wastage of all variants. We found that the Pure Aloha with fast mode consumes the lowest energy and is suitable for tag identification. However, none of the protocols promises energy efficient monitoring of identified tags. In other words, the reader is required to re-read all tags every time to sense their presence; a process that consumes a significant amount of energy.

An Investigation into thie Energy Eficiency of Pure and Slotted Aloha Based REID Anti-Collision Protocols

This paper investigates the energy efficiency of RFID anti-collision protocols and their suitability for use in RFID-enhanced wireless sensor networks (WSNs). We present a detailed analytical methodology and an in-depth qualitative and quantitative energy consumption analysis of Pure and Slotted Aloha anti-collision protocols and their variants. We find that Slotted Aloha variants that employ muting with early-end are the most energy efficient, but are computationally expensive. Overall, for all Aloha variants we investigated, if the offered load is very high, tag responses cause a bottleneck at the reader. Thereby, resulting in no tags being identified and incur significant identification delays ¿ thus severely impacting a sensor nodes battery life.

On the Suitability of Framed Slotted Aloha based RFID Anti-collision Protocols for Use in RFID-Enhanced WSNs

This paper studies the energy consumption of frame slotted Aloha (FSA) based anti-collision protocols. Specifically, we investigate twelve FSA variants using a detailed qualitative and quantitative methodology to evaluate their energy efficiency with varying tag population. Our results show that the variant that adjusts its frame size in accordance with tag population and incorporates the muting and early-end feature has the lowest energy consumption, hence most suited for RFID-enhanced WSNs.

On the Accuracy of RFID Tag Estimation Functions

Dynamic framed slotted Aloha (DFSA) based tag reading protocols rely on a tag estimation function to calculate the best frame size to use for a given tag set. An inaccurate estimate results in high identification delays and unnecessary energy wastage. This is particularly serious when DFSA based tag reading protocols are used in RFID-enhanced wireless sensor networks (WSNs), where nodes are battery constrained. To this end, this paper presents qualitative and quantitative analysis of five tag estimation functions using Monte Carlo simulations. We iteratively estimate a given set of tags and evaluate the mean error, variability, skew and Kurtosis of each functions error distribution. Lastly, we compare and identify the most efficient tag estimation function that is suitable for RFID-enhanced WSNs.

Review: Securing DSR against wormhole attacks in multirate ad hoc networks

A wormhole attack is one of the hardest problems to detect whereas it can be easily implanted in any type of wireless ad hoc network. A wormhole attack can easily be launched by the attacker without having knowledge of the network or compromising any legitimate nodes. Most existing solutions either require special hardware devices or make strong assumptions in order to detect wormhole attacks which limit the usability of these solutions. In this paper, we present a security enhancement to dynamic source routing (DSR) protocol against wormhole attacks for ad hoc networks which relies on calculation of round trip time (RTT). Our protocol secures DSR against a wormhole attack in ad hoc networks for multirate transmissions. We also consider the processing and queuing delays of each participating node in the calculation of RTTs between neighbors which to date has not been addressed in the existing literature. This work provides two test cases that show that not taking multirate transmission into consideration results in miss identifying a wormhole attack.

A New Spreading Matrix for Block Spread OFDM

This paper presents a new spreading matrix for block spread OFDM (BSOFDM) to improve the performance of the system by increasing the correlation between the symbols. This is achieved by rotating the modulation scheme used at the transmission, say QPSK, into a higher order modulation scheme, for example 16QAM. By this the correlation between the transmitted symbols is increased. The advantage of this new spreading matrix over more traditional spreading matrices is its flexibility in achieving different higher order modulation schemes during transmission depending on the angle alpha. This is compared to other spreading matrices in frequency selective channel environment

Approximation algorithms for broadcasting in duty cycled wireless sensor networks

Broadcast is a fundamental operation in wireless sensor networks (WSNs). Given a source node with a packet to broadcast, the aim is to propagate the packet to all nodes in a collision free manner whilst incurring minimum latency. This problem, called minimum latency broadcast scheduling (MLBS), has been studied extensively in wireless ad-hoc networks whereby nodes remain on all the time, and has been shown to be NP-hard. However, only a few studies have addressed this problem in the context of duty-cycled WSNs. In these WSNs, nodes do not wake-up simultaneously, and hence, not all neighbors of a transmitting node will receive a broadcast packet at the same time. Unfortunately, the problem remains NP-hard and multiple transmissions may be necessary due to different wake-up times. Henceforth, this paper considers MLBS in duty cycled WSNs and presents two approximation algorithms, BS-1 and BS-2, that produce a maximum latency of at most

New Higher Order Rotation Spreading Matrix for BSOFDM

(\Delta -1) TH