IDEAS home Printed from https://ideas.repec.org/a/spr/infosf/v13y2011i4d10.1007_s10796-009-9209-5.html
   My bibliography  Save this article

Threshold jumping and wrap-around scan techniques toward efficient tag identification in high density RFID systems

Author

Listed:
  • Ching-Hsien Hsu

    (Chung Hua University)

  • Han-Chieh Chao

    (National Ilan University
    National Dong Hwa University)

  • Jong Hyuk Park

    (Kyungnam University)

Abstract

With the emergence of wireless RFID technologies, the problem of Anti-Collision has been arousing attention and instigated researchers to propose different heuristic algorithms for advancing RFID systems operated in more efficient manner. However, there still have challenges on enhancing the system throughput and stability due to the underlying technologies had faced different limitation in system performance when network density is high. In this paper, we present a Threshold Jumping (TJ) and a Wrap-Around Scan (WAS) techniques, which are query tree based approaches, aiming to coordinate simultaneous communications in high density RFID environments, to speedup tag identification, to increase the overall read rate and to improve system throughput in large-scale RFID systems. The main idea of the Threshold Jumping is to limit the number of collisions. When the number of collisions exceeds a predefined threshold, it reveals that tag density in RF field is too high. To avoid unnecessary enquiry messages, the prefix matching will be moved to next level of the query tree, alleviating the collision problems. The method of setting frequency bound indeed improves the efficiency in high density and randomly deployed RFID systems. However, in irregular or imbalanced RFID networks, inefficient situation may happen. The problem is that the prefix matching is performed in single direction level-order scheme, which may cause an imbalance query tree on which the right sub-tree always not been examined if the identification process goes to next level before scan the right sub-tree due to threshold jumping. By scanning the query tree from right to left in alternative levels, i.e., wrap-around, this flaw cold be ameliorated. To evaluate the performance of proposed techniques, we have implemented the TJ and the WAS method along with the query tree protocol. The simulation results show that the proposed techniques provide superior performance in high density environments. It is shown that the TJ and WAS are effective in terms of increasing system throughput and minimizing identification delay.

Suggested Citation

  • Ching-Hsien Hsu & Han-Chieh Chao & Jong Hyuk Park, 2011. "Threshold jumping and wrap-around scan techniques toward efficient tag identification in high density RFID systems," Information Systems Frontiers, Springer, vol. 13(4), pages 471-480, September.
  • Handle: RePEc:spr:infosf:v:13:y:2011:i:4:d:10.1007_s10796-009-9209-5
    DOI: 10.1007/s10796-009-9209-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10796-009-9209-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10796-009-9209-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. R. Ramesh & H. Raghav Rao, 2011. "Editorial," Information Systems Frontiers, Springer, vol. 13(4), pages 451-452, September.
    2. Nilgun Fescioglu-Unver & Sung Hee Choi & Dongmok Sheen & Soundar Kumara, 2015. "RFID in production and service systems: Technology, applications and issues," Information Systems Frontiers, Springer, vol. 17(6), pages 1369-1380, December.
    3. Chulhwan Chris Bang, 2015. "Information systems frontiers: Keyword analysis and classification," Information Systems Frontiers, Springer, vol. 17(1), pages 217-237, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:infosf:v:13:y:2011:i:4:d:10.1007_s10796-009-9209-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.