PROJECT TITLE :
Channel-Oblivious Counting Algorithms for Large-Scale RFID Systems
Scalable, low-latency and correct RFID counting algorithms have recently been proposed as a basic building block to support additional complicated query operations in an exceedingly massive-scale RFID system. One distinct feature of these algorithms is that they do not need specific identification of individual tags and thus can eliminate the latency bottleneck caused by serialization throughout multiple access management. But, these algorithms all assume reliable communications between the reader and therefore the tags. Whereas this assumption is also adopted by several tag-identification protocols in this RFID standards, it's practically unachievable given the current technology and low-cost demand of RFID tags. In fact, recent empirical studies have found that the communication between an RFID reader and a collection of seemingly “in-range” tags are still unreliable and highly non-deterministic due to the varying channel conditions. During this paper, we discuss the design and performance analysis of a collection of channel-oblivious RFID counting algorithms which can estimate the scale of a tag-set of interest over unreliable wireless channels. The proposed schemes will give correct cardinality estimates without any prior data of the channel parameters. We have a tendency to 1st propose a series of algorithms and analyze their performance underneath a simplified memoryless lossy channel model. We tend to then extend them to handle the impact due to backscattering effects and correlated losses found in sensible RFID systems. Our proposed designs solely require simple modifications to standard RFID tags and readers and can be implemented using current technologies with minimal increase in tag/ reader value. Our styles can also be extended to alternative RFID counting algorithms which assumed reliable communication channels.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here