Please use this identifier to cite or link to this item:
Title: Come and be served : parallel decoding for COTS RFID tags
Authors: Ou, JJ
Li, M
Zheng, YQ 
Keywords: RFID systems
Physical layer
Parallel decoding
Issue Date: 2017
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE/ACM transactions on networking, 2017, v. 25, no. 3, p. 1569-1581 How to cite?
Journal: IEEE/ACM transactions on networking 
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 commodity-off-the-shelf (COTS) 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 underutilized 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 times performance improvement compared with the alternative decoding scheme for COTS tags.
ISSN: 1063-6692
EISSN: 1558-2566
DOI: 10.1109/TNET.2016.2645232
Appears in Collections:Journal/Magazine Article

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


Citations as of Nov 13, 2018


Last Week
Last month
Citations as of Nov 12, 2018

Page view(s)

Last Week
Last month
Citations as of Nov 11, 2018

Google ScholarTM



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