Please use this identifier to cite or link to this item: https://hdl.handle.net/2440/74096
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorSheng, Quanzhengen
dc.contributor.advisorShen, Hongen
dc.contributor.advisorZeadally, Sheralien
dc.contributor.advisorYu, Jianen
dc.contributor.advisorRanasinghe, Damith Chinthanaen
dc.contributor.authorWu, Yanboen
dc.date.issued2012en
dc.identifier.urihttp://hdl.handle.net/2440/74096-
dc.description.abstractThe emergence of radio frequency identification (RFID) technology brings significant social and economic benefits. As a non line of sight technology, RFID provides an effective way to record movements of objects within a networked system formed by a set of distributed and collaborating parties. A trail of such recorded movements is the foundation for enabling traceability applications. While traceability is a critical aspect of the majority of RFID applications, realizing traceability for these applications brings many fundamental research and development issues, including storage efficiency, query processing complexity, privacy etc. In this dissertation, we present a novel approach to realize RFIID-based traceability in large, autonomous and heterogeneous distributed networks. We first propose a Peer-to-Peer (P2P) architecture, namely PeerTrack. PeerTrack does not require any kind of centralized database for the RFID data or their index, neither it requires RFID data to be fully shared to partners. In PeerTrack, only a specific portion of data is requested by partners, when the access is necessary. We introduce a distributed model, namely MOODS (a Model for mOving Objects in Discrete Space), for the essential data structures of traceability. MOODS is maintained by a distributed index on the top of a structured Peer-to-Peer overlay. We then propose efficient algorithms for the maintenance of MOODS. The algorithms are optimized to consume statistically minimal cost of bandwidth. Based on this model, we propose algorithms for efficient item-level and statistical traceability query processing. We also propose a traceability mining model for distributed RFID streams, namely TISH (Tilted TIme Frame of Histogram). TISH takes advantages of two important data mining tools, namely Tilted Time Series and Histogram, and combines them to describe the patterns of RFID streams in the dimensions of both time and space, and capture the dynamicity of the patterns. We propose efficient algorithms to maintain TISH and algorithms that use it for traceability query processing and RFID stream mining. We present a platform, namely PeerTrack Cloud, to bring the aforementioned RFID data modeling and traceability query processing techniques to the Cloud Environments. The platform features specific traceability-oriented modules for real-time query processing and efficient data storage. The techniques proposed in this dissertation are implemented in “Asset Management System", which is a collaborative project with a local company. Finally, we conduct extensive performance studies of the proposed techniques. The experimental results reveal that our system i) is more scalable and outperforms the centralized approach when the data volume or the network becomes larger; ii) provides powerful programming interfaces for query processing; iii) is economy in both storage and bandwidth; and iv) can be easily adopted in cloud computing platforms.en
dc.subjectRFID; traceability; internet of thingsen
dc.titleEnabling traceability in large-scale RFID networks.en
dc.typeThesisen
dc.contributor.schoolSchool of Computer Scienceen
dc.description.dissertationThesis (Ph.D.) -- University of Adelaide, School of Computer Science, 2012en
Appears in Collections:Research Theses

Files in This Item:
File Description SizeFormat 
01front.pdf151.7 kBAdobe PDFView/Open
02whole.pdf4.2 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.