Efficient Link Scheduling Solutions for the Internet of Things Under Rayleigh Fading

Abstract

Link scheduling is an appealing solution for ensuring the reliability and latency requirements of Internet of Things (IoT). Most existing results on the link scheduling problem were based on the graph or SINR (Signal-to-Interference-plus-Noise-Ratio) models, which ignored the impact of the random fading gain of the signals strength. In this paper, we address the link scheduling problem under the Rayleigh fading model. Both Shortest Link Scheduling (SLS) and Maximum Link Scheduling (MLS) problems are studied. In particular, we show that a set of links can be activated simultaneously under Rayleigh fading model if all link SINR constraints are satisfied. Based on the analysis of previous Link Diversity Partition (LDP) algorithm, we propose an Improved LDP (ILDP) algorithm and a centralized algorithm by localizing the global interference (denoted by CLT), building on which we design a distributed CLT algorithm (denoted by RCRDCLT) that converges to a constant approximation factor of the optimum with the time complexity of O(ln n), where n is the number of links. Furthermore, executing repeatedly RCRDCLT can solve the SLS with an approximation factor of Θ(ln n). Extensive simulations indicate that CLT is more effective than previous six popular link scheduling algorithms, and RCRDCLT has the lowest time complexity while only losses a constant fraction of the optimum schedule.

A Privacy Protection Scheme for Facial Recognition and Resolution Based on Edge Computing

“…In [12], Ning et al proposed a new information retrieval scheme that better reduces the computing burden and network transmission load of the cloud by introducing edge computing technology. In [13], Yu et al improved the Label Distribution Protocol (LDP) algorithm and the centralized algorithm for global interference location. And they designed a distributed Centralized and Localized Traversal (CLT) algorithm on this basis, which only lost a constant part of the optimal scheduling and significantly reduced the time complexity of the algorithm and transmission delay.…”

The impact of mobility on physical layer security in 5G uRLLC

“…Referring to the concept of COP and the CDF of $$| {h}_{\mathrm{ab}}{| }^{2}$$, namely, $$\Pr [h\ge z]=\text{exp}(-z)$$, 27,45 the COP of static Bob is given by $$${p}_{\mathrm{co}}=1-\Pr \left[{h}_{\mathrm{ab}}\ge s({\beta }_{{\rm{t}}}){d}_{\mathrm{ab}}^{\alpha }\left(\sum _{k\ne a,k\in {\phi }_{{\rm{t}}}}{h}_{k{\rm{b}}}\cdot {d}_{k{\rm{b}}}^{-\alpha }+\upsilon \right)\right]=1-\text{exp}\left(-s\upsilon {d}_{\mathrm{ab}}^{\alpha }\right){\ell }_{1}\left(s{d}_{\mathrm{ab}}^{\alpha }\right),$$$ where $${\ell }_{1}\left(s{d}_{\mathrm{ab}}^{\alpha }\right)$$ represents the Laplace transform of interference $$I=\sum _{k\ne a,k\in {\phi }_{{\rm{t}}}}{h}_{k{\rm{b}}}\cdot {d}_{k{\rm{b}}}^{-\alpha }$$ 38 . Applying the probability generating functional of PPP $${\phi }_{{\rm{t}}}$$, we can obtain …”

Secure Data Aggregation Aided by Privacy Preserving in Internet of Things

“…In an IoT system, sensor nodes of WSNs are usually deployed in open and hostile environments, attackers can more easily compromise the data security through the eavesdropping and the tampering attacks. What is worse, the constrained resources (e.g., the battery energy, the computation capacity, and the communication scope), it is a challenging issue to directly introduce the traditional security mechanisms into WSNs [7][8][9]. Therefore, security data aggregation (SDA) is proposed to guarantee the security of IoT, eliminate the redundancy of data acquisition, and improve the energy efficiency of smart nodes.…”