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 <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$O(\ln n)$ </tex-math></inline-formula> , where <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula> is the number of links. Furthermore, executing repeatedly RCRDCLT can solve the SLS with an approximation factor of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\Theta (\ln n)$ </tex-math></inline-formula> . 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.
Highlights
F OR an Internet of Things (IoT), interference, connectivity, capacity, throughput, delay, security and so on are most important indices [1]
Based on the successive interference cancellation (SIC) technique, we improve Link Diversity Partition algorithm (ILDP) under Rayleigh fading model, a centralized algorithm for the Maximum Link Scheduling (MLS) with low scheduling performance under the deterministic SINR model, which builds the relationship between two models
Combining with random contention resolution, we present a distributed implementation of Centralized and Localized Traversal (CLT) Random Contention Resolution Based Distributed CLT (RCRDCLT)) with O(ln n) rounds, where n is the number of links, which improves the performance of our prior works for MLS in [5] and [6]
Summary
F OR an Internet of Things (IoT), interference, connectivity, capacity, throughput, delay, security and so on are most important indices [1]. The interference among signals must be considered when we design link scheduling algorithms. The interference model selection has significant effects on the performance and complexity of link scheduling algorithms. Based on the successive interference cancellation (SIC) technique, we improve Link Diversity Partition algorithm (ILDP) under Rayleigh fading model, a centralized algorithm for the MLS with low scheduling performance under the deterministic SINR model, which builds the relationship between two models. Combining with random contention resolution, we present a distributed implementation of CLT RCRDCLT) with O(ln n) rounds, where n is the number of links, which improves the performance of our prior works for MLS in [5] and [6].
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
