Search arXivSearch

arXiv · 1804.09689

Joint Energy and SINR Coverage in Spatially Clustered RF-powered IoT Network

Abstract

Owing to the ubiquitous availability of radio-frequency (RF) signals, RF energy harvesting is emerging as an appealing solution for powering IoT devices. In this paper, we model and analyze an IoT network which harvests RF energy and receives information from the same wireless network. In order to enable this operation, each time slot is partitioned into charging and information reception phases. For this setup, we characterize two performance metrics: (i) energy coverage and (ii) joint signal-to-interference-plus-noise (SINR) and energy coverage. The analysis is performed using a realistic spatial model that captures the spatial coupling between the locations of the IoT devices and the nodes of the wireless network (referred henceforth as the IoT gateways), which is often ignored in the literature. In particular, we model the locations of the IoT devices using a Poisson cluster process (PCP) and assume that some of the clusters have IoT gateways (GWs) deployed at their centers while the other GWs are deployed independently of the IoT devices. The level of coupling can be controlled by tuning the fraction of total GWs that are deployed at the cluster centers. Due to the inherent intractability of computing the distribution of shot noise process for this setup, we propose two accurate approximations, using which the aforementioned metrics are characterized. Multiple system design insights are drawn from our results. For instance, we demonstrate the existence of optimal slot partitioning that maximizes the system throughput. In addition, we explore the effect of the level of coupling between the locations of the IoT devices and the GWs on this optimal slot partitioning. Particularly, our results reveal that the optimal value of time duration for the charging phase increases as the level of coupling decreases.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohamed A. Abd-Elmagid, Mustafa A. Kishk, Harpreet S. Dhillon. 2018-12-24. Joint Energy and SINR Coverage in Spatially Clustered RF-powered IoT Network. https://doi.org/10.1109/tgcn.2018.2881480

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

KEEP EXPLORING

Related papers

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

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

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