DEVELOPMENT OF A SPARSE RFID READER DEPLOYMENT ALGORITHM FOR EFFECTIVE RFID NETWORK PLANNING

Abstract

A well planned Radio Frequency Identification (RFID) network achieves the following twin objectives, (a) reduces the cost of acquiring the readers to be deployed (b) completes coverage of tags deployed in the network. A reader deployment approach that considered the physical topology of passive tags that were sparsely deployed in a RFID network was developed. In the implemented technique, readers could not be deployed outside the work area which implied that tags located outside the work area could not be detected. Bidirectional communication between the readers and tags could only be established if their receiver sensitivity was less than or equal to the incoming signal. The developed algorithm was optimized by logically integrating some sub-algorithms such as Useless Reader Elimination Algorithm (UREA) and Redundant Reader Elimination Algorithm (RREA). The effectiveness of the developed Sparse Reader Deployment Algorithm (SRDA) was demonstrated through simulation of various scenarios. The implemented approach was compared to the Constrained Reader Deployment Approach (CORDA) and the former outperformed the latter in terms of Optimal Power Dissipated (OPD) which was 255mW. The impact of increasing the number of tags and coverage area on the OPD of SRDA was investigated in a bid to ascertain the robustness of the developed algorithm.

http://dx.doi.org/10.4314/njt.v37i3.29