Backscatter Nodes Research Articles

Chance-constrained resource allocation for cognitive wireless-powered backscatter communication networks

With the rapid development of the Internet of Things (IoT) and the increasing number of wireless nodes, the problems of scare spectrum and energy supply of nodes have become main issues. To achieve green IoT techniques and resolve the challenge of wireless power supply, wireless-powered backscatter communication as a promising transmission paradigm has been concerned by many scholars. In wireless-powered backscatter communication networks, the passive backscatter nodes can harvest the ambient radio frequency signals for the devices’ wireless charging and also reflect some information signals to the information receiver in a low-power-consumption way. To balance the relationship between the amount of energy harvesting and the amount of information rate, resource allocation is a key technique in wireless-powered backscatter communication networks. However, most of the current resource allocation algorithms assume available perfect channel state information and limited spectrum resource, it is impractical for actual backscatter systems due to the impact of channel delays, the nonlinearity of hardware circuits and quantization errors that may increase the possibility of outage probability. To this end, we investigate a robust resource allocation problem to improve system robustness and spectrum efficiency in a cognitive wireless-powered backscatter communication network, where secondary transmitters can work at the backscattering transmission mode and the harvest-then-transmit mode by a time division multiple access manner. The total throughput of the secondary users is maximized by jointly optimizing the transmission time, the transmit power, and the reflection coefficients of secondary transmitters under the constraints on the throughput outage probability of the users. To tackle the non-convex problem, we design a robust resource allocation algorithm to obtain the optimal solution by using the proper variable substitution method and Lagrange dual theory. Simulation results verify the effectiveness of the proposed algorithm in terms of lower outage probabilities.

Non‐orthogonal multiple access in backscatter communication system under the scene of the moving reader

AbstractThis article studies non‐orthogonal multiple access (NOMA) backscatter communication (BackCom) system under the scene of the moving reader. As the reader moves, the communication link between backscatter nodes (BNs) and the reader is dynamic, and the computational complexity of regrouping is high. To address these problems, a dynamic NOMA‐BackCom scheme is proposed, which consists of a dynamic multiplexing BNs scheme and a dynamic scheme of choosing the reflection coefficient. Moreover, a performance evaluation is conducted to compare the decoding rate of the proposed scheme and the traditional scheme. Simulation results show that the proposed scheme has higher decoding rate and better throughput than the traditional scheme.

Interference-Aware Mobile Backscatter Communication: A PHY-Assisted Rate Adaptive Approach

Over the past decade, backscatter nodes have received booming interest for many emerging mobile applications, such as sports analytics and interactive gaming. However, backscatter networks are not ready to provide a high-throughput and stable communication platform for billions of such mobile nodes due to two main factors in rate adaptation. First, the common mapping paradigm that chooses the optimal rate based on RSSIs is hardly adaptable to hardware diversity. Second, the current probing processes are not optimized for mobile scenarios due to inefficient probing trigger, inaccurate channel estimation, and unique self-interference. To address those issues, we propose MobiRate, a mobility-aware rate adaptation link-layer that fully exploits the mobility hints from PHY information to deliver a high-throughput link-layer for mobile backscatter networks. The key insight is that mobility-hints can greatly benefit link-layer design, including rate selection and channel probing. Specifically, we introduce a novel velocity-based loss-rate estimation module, a mobility-assisted probing trigger, a selective probing module, and a robust self-interference detection module, significantly saving probing time and improving probing accuracy. As MobiRate is fully compatible with the current standard, we prototype it using COTS RFID readers and commercial tags. Our extensive experiments demonstrate that MobiRate can successfully identify self-interference with detection accuracy over 90% for tags of different velocities. Moreover, it achieves up to 3.8x throughput gain over the state-of-the-art methods across a wide range of mobility, channel conditions, and tag types.

On Energy Allocation and Data Scheduling in Backscatter Networks With Multi-Antenna Readers

In this paper, we study the throughput utility functions in buffer-equipped monostatic backscatter communication networks with multi-antenna Readers. In the considered model, the backscatter nodes (BNs) store the data in their buffers before transmission to the Reader. We investigate three utility functions, namely, the sum, the proportional and the common throughput. We design online admission policies, corresponding to each utility function, to determine how much data can be admitted in the buffers. Moreover, we propose an online data link control policy for jointly controlling the transmit and receive beamforming vectors as well as the reflection coefficients of the BNs. The proposed policies for data admission and data link control jointly optimize the throughput utility, while stabilizing the buffers. We adopt the min-drift-plus-penalty (MDPP) method in designing the control policies. Following the MDPP method, we cast the optimal data link control and the data admission policies as solutions of two independent optimization problems which should be solved in each time slot. The optimization problem corresponding to the data link control is non-convex and does not have a trivial solution. Using Lagrangian dual and quadratic transforms, we find a closed-form iterative solution. Finally, we use the results on the achievable rates of finite blocklength codes to study the system performance in the cases with short packets. As demonstrated, the proposed policies achieve optimal utility and stabilize the data buffers in the BNs.

High-Throughput and Robust Rate Adaptation for Backscatter Networks

Recently backscatter networks have received booming interest because, they offer a battery-free communication paradigm using propagation radio waves as opposed to active radios in traditional sensor networks while providing comparable sensing functionalities, ranging from light and temperature sensors to recent microphones and cameras. While sensing data on backscatter nodes has been seen on a clear path to increasing in both volume and variety, backscatter communication is not well prepared and optimized for transferring such continuous and high-volume data. To bridge this gap, we propose a high-throughput rate adaptation scheme for backscatter networks by exploring the unique characteristics of backscatter links and the design space of the ISO 18000-6C (C1G2) protocol. Our key insight is that while prior work has left the downlink unattended, we observe that the quality of downlink is affected significantly by multipath fading and thus can degrade the uplink and overall throughput considerably. Therefore, we introduce a novel rate mapping algorithm that chooses the best rate for both the downlink and uplink. Also, we design an efficient channel estimation method fully compatible with the C1G2 protocol and a reliable probing trigger, substantially saving probing overhead. To combat interference, we further design an interference detector using clusters and lightweight countermeasures to make rate adaptation more robust. Our scheme is prototyped using commercial RFID readers and tags. The results show that we can achieve up to $2.6\times $ throughput gain over state-of-the-art approaches across various mobility, channel, network-size, and interference conditions.

Performance Characterization of Relaying Using Backscatter Devices

In this paper, we examine the error performance of backscatter communication in the presence of ambient interference, where the backscatter device acts as a relay. Specifically, the performance comparison of amplify-and-forward (AF) and decode-and-forward (DF) backscatter relaying is considered for the first time. Considering energy-based detection for on-off keying (OOK) modulation, we derive the statistics of the received signal power, from which the detection thresholds and corresponding bit error rates (BER) are obtained analytically. For the DF scheme, we allow the source node to transmit continuous-wave signals during the relay-to-destination transmission phase to power the backscatter relay. Under a total power budget constraint at the source, we optimize the power allocation for the transmissions in the source-to-relay and relay-to-destination phases. Numerical analysis shows that the DF scheme with optimal power allocation performs similarly compared to the AF scheme, despite the added complexity of the decoding operation. On the other hand, the AF scheme significantly outperforms the DF scheme when the reflection coefficients at the backscatter device do not correspond to perfect OOK. These results provide valuable insights into the design and deployment of backscatter nodes with the goal of improving coverage.

Coverage Probability Analysis Under Clustered Ambient Backscatter Nodes

In this letter, we consider a new large-scale communication scheme where randomly distributed backscatter nodes are involved as secondary users to primary transmitter and primary receiver pairs. The secondary communication between a backscatter transmitter and a backscatter receiver introduces additional double fading channels and has a two-side effect to the primary communications. We derive the signal-to-interference-plus-noise ratio and signal-to-interference ratio based coverage probabilities for two network configuration scenarios.

Channel-Aware Rate Adaptation for Backscatter Networks

Backscatter communication networks receive much attention recently due to the small size and low power of backscatter nodes. As backscatter communication is often influenced by the dynamic wireless channel quality, rate adaptation becomes necessary. Most existing approaches share a common drawback: they fail to take both spatial and frequency diversity into consideration at the same time. Consequently, the transmission rate may be improperly selected, resulting in low network throughput. In this paper, we propose a channel-aware rate adaptation framework (CARA) for backscatter networks. CARA incorporates three essential modules, a lightweight channel probing scheme that differentiates collisions from packet losses, a burstiness-aware channel selection mechanism benefiting as many backscatter nodes as possible, a rate selection method choosing the optimal rate, and a mobility detection that discovers location changes. We implement CARA on commercial readers, and the experiment results show that CARA achieves up to $4 \times$ goodput gain compared with the state-of-the-art rate adaptation scheme.

Efficient and reliable low-power backscatter networks

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.