Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1806.09814

Optimal Beamforming and Time Allocation for Partially Wireless Powered Sensor Networks with Downlink SWIPT

Shiqi Gong·Shaodan Ma·Chengwen Xing·Guanghua Yang
View original source ↗Read source document ↗Export metadata ↓

Abstract

Wireless powered sensor networks (WPSNs) have emerged as a key development towards the future self-sustainable Internet of Things (IoT) networks. To achieve a good balance between self-sustainability and reliability, partially WPSNs with a mixed power solution are desirable for practical applications. Specifically, most of the sensor nodes are wireless powered but the key sensor node adopts traditional wire/battery power for reliability. As a result, this paper mainly investigates optimal design for the partially WPSNs in which simultaneous wireless information and power transfer (SWIPT) is adopted in the downlink. Two scenarios with space division multiple access (SDMA) and time division multiple access (TDMA) in the uplink are considered. For both the SDMA-enabled and TDMA-enabled partially WPSNs, joint design of downlink beamforming, uplink beamforming and time allocation is investigated to maximize the uplink sum rate while guaranteeing the quality-of-service (i.e., satisfying the downlink rate constraint) at the key sensor node. After analyzing the feasibility of uplink sum rate maximization problems and the influence of the downlink rate constraint, semi-closed-form optimal solutions for both SDMA-enabled and TDMA-enabled WPSNs are proposed with guaranteed global optimality. Complexity analysis is also provided to justify the advantage of the proposed solutions in low complexity. The effectiveness and optimality of the proposed optimal solutions are finally demonstrated by simulations.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shiqi Gong, Shaodan Ma, Chengwen Xing, Guanghua Yang. 2018-06-26. Optimal Beamforming and Time Allocation for Partially Wireless Powered Sensor Networks with Downlink SWIPT. https://doi.org/10.1109/tsp.2019.2912876

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT↗
arXiv2026

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT↗
arXiv2026

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT↗