文化大學機構典藏 CCUR:Item 987654321/24131
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 46833/50693 (92%)
Visitors : 11867766      Online Users : 740
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: https://irlib.pccu.edu.tw/handle/987654321/24131


    Title: Adaptive collision resolution for efficient RFID tag identification
    Authors: Chen, YC (Chen, Yung-Chun)
    Yeh, KH (Yeh, Kuo-Hui)
    Lo, NW (Lo, NaiWei)
    Li, YJ (Li, Yingjiu)
    Winata, E (Winata, Enrico)
    Contributors: Dept Informat Management
    Keywords: ANTICOLLISION
    PROTOCOL
    SYSTEMS
    ALOHA
    ARBITRATION
    ALGORITHMS
    CHANNELS
    Date: 2011
    Issue Date: 2013-01-31 14:59:08 (UTC+8)
    Abstract: In large-scale RFID systems, all of the communications between readers and tags are via a shared wireless channel. When a reader intends to collect all IDs from numerous existing tags, a tag identification process is invoked by the reader to collect the tags' IDs. This phenomenon results in tag-to-reader signal collisions which may suppress the system performance greatly. To solve this problem, we design an efficient tag identification protocol in which a significant gain is obtained in terms of both identification delay and communication overhead. A k-ary tree-based abstract is adopted in our proposed tag identification protocol as underlying architecture for collision resolution. Instead of just recognizing whether tag collision happens at each interrogation time period, the reader can further obtain the reason of why the collision occurs in the current tag inquiry operation. With this valuable information, we can reduce tag signal collisions significantly and at the same time avoid all of the tag idle scenarios during a tag identification session. The rigorous performance analysis and evaluation show that our proposed tag identification protocol outperforms existing tree-based schemes.
    Relation: EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 文獻號碼: 139
    Appears in Collections:[Department of Information Management & Graduate Institute of Information Management] periodical articles

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML544View/Open


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


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback