Title page for etd-0725110-235656


[Back to Results | New Search]

URN etd-0725110-235656
Author Ning-yan Lin
Author's Email Address klg2727@hotmail.com
Statistics This thesis had been viewed 5353 times. Download 3 times.
Department Computer Science and Engineering
Year 2009
Semester 2
Degree Master
Type of Document
Language zh-TW.Big5 Chinese
Title Dynamic Grouping Algorithms For RFID Tag Identification
Date of Defense 2010-07-20
Page Count 46
Keyword
  • passive RFID systems
  • framed slotted ALOHA
  • anti-collision algorithm
  • Dynamic Grouping algorithm
  • Abstract In passive RFID systems, how to reduce the collision among tags is an important issue at the medium access control layer. The Framed Slotted ALOHA and its variations are well-known anti-collision algorithms for RFID systems. However, when the Framed Slotted ALOHA is used, the system efficiency and the average time delay deteriorate rapidly when the total number of tags increases. On the other hand, the total number of slots in a frame can’t be infinity. In this thesis, we first compare existing anti-collision protocols and then propose a novel algorithm based on the Enhanced Dynamic Framed Slotted ALOHA (EDFSA) and the Progressing Scanning (PS) algorithm. The proposed algorithm is called Dynamic Grouping (DG). The DG algorithm partitions the RFID tags according to the distances from tags to the reader in order to avoid using too many slots in a frame. Inparticular, the DG algorithm estimates the spatial distribution of tags based on previous scanning results and then adjusts the partition accordingly. Unlike PS algorithm, the DG algorithm is applicable when the RFID tags are uniformly distributed or normally distributed.
    Advisory Committee
  • Rung-Hung Gau - chair
  • Wei Kuang Lai - co-chair
  • CHUN-HUNG LIN - advisor
  • Files
  • etd-0725110-235656.pdf
  • indicate in-campus access in a year and off_campus not accessible
    Date of Submission 2010-07-25

    [Back to Results | New Search]


    Browse | Search All Available ETDs

    If you have more questions or technical problems, please contact eThesys