2018
DOI: 10.1109/tcomm.2017.2772261
|View full text |Cite
|
Sign up to set email alerts
|

Modulation in the Air: Backscatter Communication Over Ambient OFDM Carrier

Abstract: Ambient backscatter communication (AmBC) enables radio-frequency (RF) powered backscatter devices (BDs) (e.g., sensors, tags) to modulate their information bits over ambient RF carriers in an over-the-air manner. This technology also called "modulation in the air", thus has emerged as a promising solution to achieve green communications for future Internet-of-Things. This paper studies an AmBC system by leveraging the ambient orthogonal frequency division multiplexing (OFDM) modulated signals in the air.We fir… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
200
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
4
2
1

Relationship

1
6

Authors

Journals

citations
Cited by 300 publications
(200 citation statements)
references
References 37 publications
0
200
0
Order By: Relevance
“…which plays a key role in deriving the transceiver in [16]. Letb t denote the signal transmitted by the BD in the timedomain.…”
Section: A With Repeating Structurementioning
confidence: 99%
See 2 more Smart Citations
“…which plays a key role in deriving the transceiver in [16]. Letb t denote the signal transmitted by the BD in the timedomain.…”
Section: A With Repeating Structurementioning
confidence: 99%
“…Letb t denote the signal transmitted by the BD in the timedomain. To exploit the repeating structure in (4), the following signal is considered in [16]:…”
Section: A With Repeating Structurementioning
confidence: 99%
See 1 more Smart Citation
“…The locations of CE m ∈ M and BD k ∈ K m are denoted by u m ∈ R 2×1 and w m,k ∈ R 2×1 , 7 respectively. The exact locations of the CEs and BDs on the ground are assumed to be known by a central controller of the system.…”
Section: A System Descriptionmentioning
confidence: 99%
“…The time complexity of Algorithm 1 is polynomial. In each iteration, only a linear MIP problem (7) is solved by using the cutting-plane technique, and two FP problems (8) as well as (16) are solved by using the Dinkelbach's method which needs to solve a series of convex problems.…”
Section: E Convergence and Complexity Analysismentioning
confidence: 99%