Localized and distributed link scheduling algorithms in IoT under rayleigh fading

Yu, Kan; Wang, Yinglong; Yu, Jiguo; Yu, Dongxiao; Cheng, Xiuzhen; Shan, Zhiguang

doi:10.1016/j.comnet.2019.01.017

Cited by 22 publications

(21 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, we need to remove the effect of fading gain. Based on the works in [3] and [4], if above success probability exceeds 1 − , a link can be regarded as being scheduling successfully under Rayleigh fading model. Combing with the SIR model, if we can prove that the success probability of a link determined by SIR model is 1 − at least, the effect of fading gain can be removed.…”

Section: B Interference Model Transformationmentioning

confidence: 99%

“…In our previous work [3], we increased reliability and latency requirements of IoT under Rayleigh fading by solving link scheduling problem. Specifically, utilizing idea of localized global interference, two distributed algorithms were proposed.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper, we now present complementary, novel algorithms for low-latency performance. Following the previous works [3]- [5], we regard a link as being scheduled successfully under Rayleigh fading if its success probability is greater than 1− , where is an acceptable failure probability, since Rayleigh-fading leads to the uncertainty of strength of received signal.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Distributed Shortest Link Scheduling Algorithms With Constant Time Complexity in IoT Under Rayleigh Fading

Dong

et al. 2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

For the shortest link scheduling (SLS), i.e., scheduling a given set of links with minimum time slots, we consider the distributed algorithm design by using the locality of the protocol model with high fidelity under the Rayleigh fading. Different from most previous works, focusing on distributed algorithm design under the deterministic SINR model, which ignores the fading effects in signal propagation, we first show that a successful link of protocol model is also feasible under the deterministic SINR model, then it can be scheduled successfully with high probability under the Rayleigh fading, by upper-bounding interference outside interference range of protocol model. Then on the basis of this key conclusion, we design LLS-SLS algorithm to solve SLS within (2e T max + 1)δ log 2 T max time slots for a constant δ. Specifically, T max is the number of a sender's neighbors within some certain range, and can be upper-bounded. Next, based on the concept of random contention, we design CLLS algorithm to schedule all links after costing 4(δ + 1) T max ln T max + 1 time slots. In addition, extensive simulations evaluate the performance of two proposed algorithms.

show abstract

Section: B Interference Model Transformationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Distributed Shortest Link Scheduling Algorithms With Constant Time Complexity in IoT Under Rayleigh Fading

Dong

et al. 2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…Experimental work conducted in Manhattan [19] found that Rayleigh fading can be a useful model in heavily built-up city centers where there is no line of sight between the transmitter and receiver and many buildings and other objects attenuate, reflect, refract, and diffract the signals. In recent years, the Rayleigh fading model has been considered in numerous research works, such as [20,21,22,23,24].…”

Section: Introductionmentioning

confidence: 99%

Shortest Link Scheduling in Wireless Networks Under The Rayleigh Fading Model

Huang

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

Many shortest link scheduling algorithms adopt non-fading SINR interference model, which assumes that the received signal power will always remain determinate as long as the transmission power of the corresponding sender is fixed. In fact, because environment always influences the propagation of radio signals, the received signal power is by no means a certain value. Rayleigh fading is a statistical model for radio signals propagation. It assumes that the strength of a signal on a receiver is a random variable, varying with the Rayleigh distribution. This paper proposes a shortest link scheduling algorithm under the Rayleigh fading model (SLSRF). The SLSRF partitions the wireless network area into hexagons and colors the hexagons with 3 different colors such that two neighboring hexagons have different colors. The senders of the links scheduled simultaneously are arranged in hexagons with the same color. The correctness of the SLSRF is proved through theoretical analysis, and the efficiency is illustrated by elaborate simulations. Our simulation results demonstrate that the schedule delay of SLSRF is less than that of some results under the non-fading SINR interference model. Furthermore, we extend the SLSRF to a distributed version, which is suitable for large wireless networks.

show abstract

“…Due to the uncertainty of strength of received signals under this model, the successful probability to schedule a link is less than 1. Hence, similar to [3]- [5], in the MLS, it is required to find a set of links that can be scheduled simultaneously with probability of 1−, where is an acceptable failure probability. But for the SLS, we aim at deriving algorithms with an approximation guarantee, which means that the difference between the designed algorithms and the optimal solution.…”

Section: Introductionmentioning

confidence: 99%

Efficient Link Scheduling in Wireless Networks Under Rayleigh-Fading and Multiuser Interference

et al. 2020

IEEE Trans. Wireless Commun.

Self Cite

View full text Add to dashboard Cite

Link scheduling plays a key role in the network capacity and the transmission delay. In this paper, we study the problem of maximum link scheduling (MLS), aiming to characterize the maximum number of links that can be successfully scheduled simultaneously under Rayleigh-fading and multiuser interference. After analyzing the minimum distance between successful links in the existing GHW scheduling algorithm, we propose a DLS (Distance-based Link Scheduling) algorithm. Then, the global interference is characterized and bounded by introducing a separation distance between selected links, building on which we propose a distributed version of DLS (denoted by DDLS) that converges to a constant factor of the non-fading optimum within time complexity O(n ln n), where n is the number of links. Furthermore, we study the Shortest Link Scheduling (SLS) problem, which minimizes the number of time slots to successfully schedule each link for at least once. An algorithm for SLS with approximation factor of O(ln n) is obtained by executing DDLS. Extensive simulations show that DDLS greatly outperforms GHW and the other two popular algorithms.

show abstract

Localized and distributed link scheduling algorithms in IoT under rayleigh fading

Cited by 22 publications

References 16 publications

Distributed Shortest Link Scheduling Algorithms With Constant Time Complexity in IoT Under Rayleigh Fading

Distributed Shortest Link Scheduling Algorithms With Constant Time Complexity in IoT Under Rayleigh Fading

Shortest Link Scheduling in Wireless Networks Under The Rayleigh Fading Model

Efficient Link Scheduling in Wireless Networks Under Rayleigh-Fading and Multiuser Interference

Contact Info

Product

Resources

About