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

Ching-Hsien Hsu (), Han-Chieh Chao () and Jong Hyuk Park ()
Additional contact information
Ching-Hsien Hsu: Chung Hua University
Han-Chieh Chao: National Ilan University
Jong Hyuk Park: Kyungnam University

Information Systems Frontiers, 2011, vol. 13, issue 4, No 3, 480 pages

Abstract: 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.

Keywords: Tag anti-collision; Query tree; Wrap-around scan; Threshold jumping (search for similar items in EconPapers)
Date: 2011
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10796-009-9209-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:infosf:v:13:y:2011:i:4:d:10.1007_s10796-009-9209-5

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10796

DOI: 10.1007/s10796-009-9209-5

Access Statistics for this article

Information Systems Frontiers is currently edited by Ram Ramesh and Raghav Rao

More articles in Information Systems Frontiers from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().