Search arXivSearch

arXiv · 2203.05689

IoT Coverage Enhancement using Repetition in Energy Constrained Devices: an Analytic Approach

Abstract

Novel Internet-of-Things (IoT) access technologies are emerging as part of the next generation cellular networks. These technologies are specifically oriented towards energy-limited IoT devices that are scattered far away from their serving base station. One of the key methods of achieving deep coverage is via repeated transmissions of data. However, repetition leads to higher energy consumption and reduces the device battery-lifetime. Thus, a trade-off between coverage and energy consumption exists and requires careful investigation. This paper evaluates the effects of transmission repetition on enhancing the probability of coverage and the cost of the incurred energy. Using an empirical repetition profile based on traffic load and device distance from the base station, we derive the coverage probability and energy profile models for IoT links that utilize two different diversity combining techniques. In particular, we focus on two common diversity combining that are; (i) Selection Combining (SC), and (ii) Maximal Ratio Combining (MRC). We utilize tools from stochastic geometry to formulate an analytic framework that compares these two combining methods. This framework can aid network designers in jointly maximizing the network coverage while minimizing the energy expenditure of devices.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Bisma Manzoor, Bassel Al Homssi, Akram Al-Hourani. 2022-03-11. IoT Coverage Enhancement using Repetition in Energy Constrained Devices: an Analytic Approach. https://doi.org/10.1109/tgcn.2021.3132081

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