Please use this identifier to cite or link to this item:
Title: Come and be served : parallel decoding for COTS RFID tags
Authors: Ou, J
Li, M
Zheng, Y 
Keywords: Parallel decoding
Physical layer
RFID systems
Issue Date: 2015
Publisher: Association for Computing Machinery
Source: Proceedings of the 21st Annual International Conference on Mobile Computing and Networking, MobiCom 2015, 7-11 September 2015, p. 500-511 How to cite?
Abstract: Current commodity RFID systems incur high communication overhead due to severe tag-to-tag collisions. Although some recent works have been proposed to support parallel decoding for concurrent tag transmissions, they require accurate channel measurements, tight tag synchronization, or modifications to standard RFID tag operations. In this paper, we present BiGroup, a novel RFID communication paradigm that allows the reader to decode the collision from multiple COTS (commodity-off-the-shelf) RFID tags in one communication round. In BiGroup, COTS tags can directly join ongoing communication sessions and get decoded in parallel. The collision resolution intelligence is solely put at the reader side. To this end, BiGroup examines the tag collisions at RFID physical layer from constellation domain as well as time domain, exploits the under-utilized channel capacity due to low tag transmission rate, and leverages tag diversities. We implement BiGroup with USRP N210 software radio that is able to read and decode multiple concurrent transmissions from COTS passive tags. Our experimental study gives encouraging results that BiGroup greatly improves RFID communication efficiency, i.e., 11 x performance improvement compared to the alternative decoding scheme for COTS tags and 6 x gain in time efficiency when applied to EPC C1G2 tag identification.
ISBN: 9781450336192
DOI: 10.1145/2789168.2790101
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record


Last Week
Last month
Citations as of Dec 8, 2018

Page view(s)

Last Week
Last month
Citations as of Dec 17, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.