Localized and distributed link scheduling algorithms in IoT under rayleigh fading

Abstract

The Internet of Things (IoT) is rapidly gaining ground in future wireless communications. Transmission reliability and latency are two significant measurements for the utilization of the IoT. In this paper, we aim to improve reliability and latency requirements by solving the link scheduling problem. Under the Rayleigh fading model, a more realistic interference model, we first localize the global interference by ignoring the interference outside some certain distance, and obtain the success probability of a transmission at least 1−ϵ, where ϵ is an acceptable error probability of a transmission. Based on this key result, we then design two localized and distributed algorithms for one-slot scheduling problem (i.e., how to ensure that the selected links have high transmission reliability or can be scheduled successfully). In addition, we design a localized and distributed algorithm with time complexity of O(Δmax′T,rlogn) to resolve latency minimization problem (i.e., minimize the number of time slots until all transmissions were successful), where Δmax′T,r is the maximum number of senders within RT centered at a receiver in the network, where RT is transmission range of a node. Theoretical analysis and extensive simulations demonstrate that the proposed algorithms can improve the reliability and latency requirements significantly.