Built-in test for VLSI: pseudorandom techniques
Built-in test for VLSI: pseudorandom techniques
Energy efficient Modulation and MAC for Asymmetric RF Microsensor Systems
ISLPED '01 Proceedings of the 2001 international symposium on Low power electronics and design
W-CDMA and cdma2000 for 3G Mobile Networks
W-CDMA and cdma2000 for 3G Mobile Networks
Bitmap algorithms for counting active flows on high speed links
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Fundamentals of wireless communication
Fundamentals of wireless communication
Fast and reliable estimation schemes in RFID systems
Proceedings of the 12th annual international conference on Mobile computing and networking
Zigzag decoding: combating hidden terminals in wireless networks
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Taking the sting out of carrier sense: interference cancellation for wireless LANs
Proceedings of the 14th ACM international conference on Mobile computing and networking
Cross-layer wireless bit rate adaptation
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Cooperative Wireless Communications
Cooperative Wireless Communications
Performance analysis of multi-carrier RFID systems
SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
A sparsity detection framework for on-off random access channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Sequential sparse matching pursuit
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
A "Gen 2" RFID monitor based on the USRP
ACM SIGCOMM Computer Communication Review
Strider: automatic rate adaptation and collision handling
Proceedings of the ACM SIGCOMM 2011 conference
Proceedings of the 10th ACM Workshop on Hot Topics in Networks
Sublinear time, measurement-optimal, sparse recovery for all
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Optimal bounds for Johnson-Lindenstrauss transforms and streaming problems with sub-constant error
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A Survey and Tutorial of RFID Anti-Collision Protocols
IEEE Communications Surveys & Tutorials
IEEE Transactions on Information Theory - Part 1
Low-density parity-check codes based on finite geometries: a rediscovery and new results
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
IEEE Transactions on Information Theory
Exact sparse recovery with L0 projections
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Understanding RFID counting protocols
Proceedings of the 19th annual international conference on Mobile computing & networking
RF-compass: robot object manipulation using RFIDs
Proceedings of the 19th annual international conference on Mobile computing & networking
Fast tag searching protocol for large-scale RFID systems
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
There is a long-standing vision of embedding backscatter nodes like RFIDs into everyday objects to build ultra-low power ubiquitous networks. A major problem that has challenged this vision is that backscatter communication is neither reliable nor efficient. Backscatter nodes cannot sense each other, and hence tend to suffer from colliding transmissions. Further, they are ineffective at adapting the bit rate to channel conditions, and thus miss opportunities to increase throughput, or transmit above capacity causing errors. This paper introduces a new approach to backscatter communication. The key idea is to treat all nodes as if they were a single virtual sender. One can then view collisions as a code across the bits transmitted by the nodes. By ensuring only a few nodes collide at any time, we make collisions act as a sparse code and decode them using a new customized compressive sensing algorithm. Further, we can make these collisions act as a rateless code to automatically adapt the bit rate to channel quality --i.e., nodes can keep colliding until the base station has collected enough collisions to decode. Results from a network of backscatter nodes communicating with a USRP backscatter base station demonstrate that the new design produces a 3.5× throughput gain, and due to its rateless code, reduces message loss rate in challenging scenarios from 50% to zero.