Conventional thinking treats the wireless channel as a constraint,
so wireless network designs to date target endpoint
designs that best utilize the channel. Examples include rate
and power control at the transmitter, sophisticated receiver decoder
designs, and high-performance forward error correction
for the data itself. We instead explore whether it is possible
to reconfigure the environment itself to facilitate wireless
communication. In this work, we instrument the environment
with a large array of inexpensive antenna (LAIA) elements,
and design algorithms to configure LAIA elements in real
time. Our system achieves a high level of programmability
through rapid adjustments of an on-board phase shifter in
each LAIA element. We design a channel decomposition
algorithm to quickly estimate the wireless channel due to the
environment alone, which leads us to a process to align the
phases of the LAIA elements. Variations of our core algorithm
then improve wireless channels on the fly for singleand
multi-antenna links, as well as nearby networks operating
on adjacent frequency bands. We implement and deploy a
36-element LAIA array in a real indoor home environment.
Experiments in this setting show that, by reconfiguring the
wireless environment, we can achieve a 24% TCP throughput
improvement on average and a median improvement of 51.4%
in Shannon capacity over baseline single-antenna links. Over
baseline multi-antenna links, LAIA achieves an improvement
of 12.23% to 18.95% in Shannon capacity.
more »
« less
Towards Programming the Radio Environment with Large Arrays of Inexpensive Antennas
Conventional thinking treats the wireless channel as a given constraint. Therefore, wireless network designs to date center on the problem of the endpoint optimization that best utilizes the channel, for example, via rate and power control at the transmitter or sophisticated decoding mechanisms at the receiver. We instead explore whether it is possible to reconfigure the environment itself to facilitate wireless communication. In this work, we instrument the environment with a large array of inexpensive antennas (LAIA) and design algorithms to configure them in real time. Our system achieves this level of programmability through rapid adjustments of an on-board phase shifter in each LAIA device. We design a channel decomposition algorithm to quickly estimate the wireless channel due to the environment alone, which leads us to a process to align the phases of the array elements. Variations of our core algorithm can then optimize wireless channels on the fly for single- and multi-antenna links, as well as nearby networks operating on adjacent frequency bands. We design and deploy a 36-element passive array in a real indoor home environment. Experiments with this prototype show that, by reconfiguring the wireless environment, we can achieve a 24% TCP throughput improvement on average and a median improvement of 51.4% in Shannon capacity over the baseline single-antenna links. Over the baseline multi-antenna links, LAIA achieves an improvement of 12.23% to 18.95% in Shannon capacity.
more »
« less
- NSF-PAR ID:
- 10092827
- Date Published:
- Journal Name:
- 16th USENIX Symposium on Networked Systems Design and Implementation
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
There has been recent work on the design of antenna arrays for beamforming in dynamic evolving environments such as in vehicle-to-vehicle communication systems. A key problem is that of determining how to optimally use a large antenna array to communicate with multiple spatially located vehicles in dynamically changing channel conditions with minimal co-channel interference while minimizing overall power consumption of the wireless system. We envision disjoint subsets of antennas in the array being used to direct beams concurrently to different vehicles. The number of antennas, gain and phase of each RF-chain driving an antenna are optimized dynamically using a constrained quadratic cost formulation encompassing channel quality, interference and power consumption. This quadratic optimization problem is solved using behavior constrained bandit algorithm, a reinforcement learning based technique. A gaussian kernel is used to perform data clustering of vehicle environment and resulting solutions, allowing quick bootstrapping of the bandit solver to find optimal array configurations in real-time vehicle environments. Simulation studies prove the viability of the proposed scheme.more » « less
-
null (Ed.)Using ideas from Chu and Bode/Fano theories, we characterize the maximum achievable rate over the single-input single-output wireless communication channels under a restriction on the antenna size at the receiver. By employing circuit-theoretic multiport models for radio communication systems, we derive the information-theoretic limits of compact antennas. We first describe an equivalent Chu’s antenna circuit under the physical realizability conditions of its reflection coefficient. Such a design allows us to subsequently compute the achievable rate for a given receive antenna size thereby providing a physical bound on the system performance that we compare to the standard size-unconstrained Shannon capacity. We also determine the effective signal-to-noise ratio (SNR) which strongly depends on the antenna size and experiences an apparent finite-size performance degradation where only a fraction of Shannon capacity can be achieved. We further determine the optimal signaling bandwidth which shows that impedance matching is essential in both narrowband and broadband scenarios. We also examine the achievable rate in presence of interference showing that the size constraint is immaterial in interference-limited scenarios. Finally, our numerical results of the derived achievable rate as function of the antenna size and the SNR reveal new insights for the physically consistent design of radio systems.more » « less
-
more » « less
Many physical-layer security works in the literature rely on purely theoretical work or simulated results to establish the value of physical-layer security in securing communications. We consider the secrecy capacity of a wireless Gaussian wiretap channel using channel sounding measurements to analyze the potential for secure communication in a real-world scenario. A multi-input, multi-output, multi-eavesdropper (MIMOME) system is deployed using orthogonal frequency division multiplexing (OFDM) over an 802.11n wireless network. Channel state information (CSI) measurements were taken in an indoor environment to analyze time-varying scenarios and spatial variations. It is shown that secrecy capacity is highly affected by environmental changes, such as foot traffic, network congestion, and propagation characteristics of the physical environment. We also present a numerical method for calculating MIMOME secrecy capacity in general and comment on the use of OFDM with regard to calculating secrecy capacity.
-
This paper proposes a feasibility-optimal decentralized algorithm for real-time wireless ad hoc networks, where a strict deadline is imposed for each packet. While centralized scheduling algorithms provide provably optimal theoretical guarantees, they may not be practical in many settings, such as industrial networked control systems. Therefore, it is of great importance to design an algorithm that achieves feasibility optimality in a decentralized manner. To design a decentralized algorithm, we leverage two widely-used functions of wireless devices: carrier sensing and backoff timers. Different from the conventional approach, the proposed algorithm utilizes a collision-free backoff scheme to enforce the transmission priority of different links. This design obviates the capacity loss due to collision with quantifiably small backoff overhead. The algorithm is fully decentralized in the sense that every link only needs to know its own priority, and links contend for priorities only through carrier sensing. We prove that the proposed algorithm is feasibility-optimal. NS-3 simulation results show that the proposed algorithm indeed performs as well as the feasibility-optimal centralized algorithm. Moreover, the results also show that the proposed algorithm converges to optimality very fast.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- The DOI is not currently available.
