AN EFFICIENT ANTI-COLLISION ALGORITHM FOR PASSIVE RADIO FREQUENCY IDENTIFICATION (RFID) NETWORKS

Nnamdi Henry Umelo, Adebanjo Adekiigbe

Abstract


RFID have continued to suffer the Reader Collision Problem (RCP). A situation where the RF interference wave from a particular Reader distorts the communication between another Reader and it’s neighboring Tags. RCP is common in RFID largely because most RFID applications deploy large number of Readers. Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) has been used by many researchers as a MAC algorithm in addressing RCP. CSMA/CA alone cannot effectively addressed RCP especially in Dense Passive type of RFID. In this paper, an improved collision avoidance algorithm is proposed by incorporating time slotting to CSMA/CA. An RFID network was modeled and simulated with varying network load. The result of the simulation shows a throughput of over 960 successful tag reading per seconds with slotted CSMA/CA as against 730 successful tag reading per second for CSMA/CA and more importantly, a relatively stable probability of successful tag querying value of 0.82 as against 0.61 obtained from CSMA/CA using a maximum of thirty readers and with a simulation time of 180 seconds.

Keywords


RFID, RCP, MAC Algorithm, CSMA/CA

Full Text:

PDF


DOI: http://dx.doi.org/10.5296/npa.v5i1.2689

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

To make sure that you can receive messages from us, please add the 'macrothink.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.

Copyright © Macrothink Institute ISSN 1943-3581