Making the most of bits : efficient protocols for monitoring large RFID systems

Pao Yue-kong Library Electronic Theses Database

Making the most of bits : efficient protocols for monitoring large RFID systems


Author: Bu, Kai
Title: Making the most of bits : efficient protocols for monitoring large RFID systems
Degree: Ph.D.
Year: 2013
Subject: Radio frequency identification systems.
Hong Kong Polytechnic University -- Dissertations
Department: Dept. of Computing
Pages: xx, 136 p. : ill. ; 30 cm.
Language: English
InnoPac Record:
Abstract: Radio-Frequency Identification (RFID) technology has stimulated many innovative applications in, for example, supply chain management, health care, mobile payment, ticketing, and target tracking. To support these applications, various protocols are necessary for monitoring RFID systems. A recent trend in monitoring protocol design, triggered by the explosion of RFID technology over the last few years, is toward efficient monitoring in large RFID systems. Established efforts for efficient monitoring protocols lie primarily in cardinality estimation, missing-tag detection, and sensed-information collection. In the thesis, we concentrate on designing efficient protocols for two other monitoring operations, namely misplaced-tag pinpointing and replication attack detection in large RFID systems. We strive for efficiency gains in the protocol design toward making the most of bits. The fewer bits an RFID protocol requires readers and tags to transmit, the more efficiency it promises to large RFID systems. The major contributions of the thesis to efficient monitoring of large RFID systems are threefold. First, we propose efficient misplaced-tag pinpointing protocols. Misplacement errors fail optimal inventory placement and thus significantly decrease profit. The existing misplaced-tag pinpointing solution needs to collect a large amount of data from tags. It suffers from time inefficiency and energy inefficiency as well if active tags are in use. The proposed protocols gain time efficiency and energy efficiency by leveraging reader-related data instead of tag-related data and requiring only a fraction of tags to respond. Second, we propose efficient and privacy-preserving replication attack detection protocols. Replication attacks threaten RFID applications but are hard to prevent. Existing detection protocols are limited in efficiency and privacy mainly due to the transmission of tag IDs. The proposed protocols leverage the broadcast nature and collisions, preserving privacy by avoiding ID transmission. They also integrate lightweight operations to save unnecessary execution time and tag responses, and therefore harvest promising gains in both time efficiency and energy efficiency. Third, considering that tag IDs should be protected to enable and secure privacy-sensitive applications in anonymous RFID systems, we further propose a replication attack detection protocol without requiring tag IDs as a priori. More specifically, the anonymity requires that readers cannot query tag IDs from tags or backend servers. The proposed protocol leverages unreconciled collisions to uncover replication attacks. An unreconciled collision is probably due to responses from multiple tags with the same ID, exactly the evidence of replication attacks. Both theoretical analysis and simulation experiments demonstrate that the proposed protocol can detect replication attacks in anonymous RFID systems fairly fast with required accuracy. In summary, we hope that together with established efficient protocols the proposals in the thesis can greatly benefit various monitoring operations in large RFID systems.

Files in this item

Files Size Format
b26390887.pdf 1.661Mb PDF
Copyright Undertaking
As a bona fide Library user, I declare that:
  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.


Quick Search


More Information