Integrated reader and tag anti-collision protocol in RFID systems based on similar topology trees Online publication date: Sat, 20-Sep-2014
by Usama Sayed Mohammed; Mostafa Salah
International Journal of Radio Frequency Identification Technology and Applications (IJRFITA), Vol. 4, No. 2, 2013
Abstract: This paper describes a new fast anti-collision algorithm for Radio Frequency Identification (RFID) systems. In this paper, an efficient protocol is introduced for anti-collision of tags and readers in multi-tag multi-reader environment. The proposed anti-collision protocol is based on constructing Similar Binary Trees Topology (STT) for all readers in the collision domain. The novelty of our protocol is the Parallel Binary Splitting (PBS) identification path that will be used in the tag identification process. All readers are synchronised to reply similar information and build similar binary trees topology. The identification time is divided among the tags and the readers. One bit reply will be sent sequentially (one-to-one bit dialog) in the identification process. The tags in the overlapped reader-region will be identified one time only. The integrated treatment of the collision problem provides minimum bit transmission with minimum overhead, higher throughput, and simple logic operation. Performed computer simulations have shown that the proposed collision recovery scheme is very fast and simple.
Online publication date: Sat, 20-Sep-2014
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Radio Frequency Identification Technology and Applications (IJRFITA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org