HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Computer Science and Engineering >
CSE Master Theses  >

Please use this identifier to cite or link to this item:
Title: Efficient cardinality counting for large-scale RFID systems
Authors: Qian, Chen
Issue Date: 2008
Abstract: The growing importance of pervasive operations [1] such as location sensing [2] [3] [4], object tracking [5], activity monitoring [6] and cardinality computing [7] [8] has led to increasing interests in Radio Frequency Identification (RFID) systems. Counting the population of a tag set, one of the most crucial operations of dense RFID networks, seems to be a dilemma. Using tag identification protocols to recognize all tags is a straightforward approach, but the long latency is intolerable to most applications. Cardinality estimation protocols, designed to improve the efficiency and effectiveness, are not able to obtain a precise result. Ideally, we would like to have a protocol which can achieve the accuracy of former and the efficiency of latter. The two main contributions of my work are 1. the LOttery Frame protocol (LoF), a scheme that can quickly estimate the cardinality of a large tag set; and 2. the Precise and Anonymous Counting protocol (PAC), a scheme that remarkably reduces the processing time and energy cost in comparison to identification protocols, while still guaranteeing the result reliable and precise. The theoretical analysis shows that both the average latency and the energy cost can be significantly reduced by using my counting protocols. The simulation-based performance evaluation also shows LoF and PAC outperform existing possible schemes in tag estimation and precise counting respectively.
Description: Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2008
xii, 72 leaves : ill. ; 30 cm
HKUST Call Number: Thesis CSED 2008 Qian
Appears in Collections:CSE Master Theses

Files in This Item:

File Description SizeFormat

All items in this Repository are protected by copyright, with all rights reserved.