Fading-Resistant Link Scheduling in Wireless Networks

Qiu, Chenxi; Shen, Haiying

doi:10.1109/icpp.2017.40

Cited by 6 publications

(18 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [4], Qiu and Shen formulated a problem called the Fading-Resistant Link Scheduling (Fading-R-LS) problem under the Rayleigh-fading model, and proposed two centralized schemes with O(g(L)) and O(1) performance guarantees, respectively.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

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

et al. 2020

IEEE Trans. Wireless Commun.

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

Section: Related Workmentioning

confidence: 99%

“…ii , where α is the path-loss exponent and h ii is the channel fading gain between sender s i and receiver r i which follows the exponential distribution with unit mean [4], [5]. Namely, h ii ∼ exp (1).…”

Section: A Network Model and Notationsmentioning

confidence: 99%

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

et al. 2020

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…In the centralized settings, SLS is closely related to capacity maximization (i.e., maximize the number of successful transmissions in a single slot), since we can execute algorithms for capacity maximization repeatedly to solve SLS. However, those works about capacity maximization were centralized and lead to equivalent bounds for SLS with O(log n)approximation (e.g., [4], [6]- [23]).…”

Section: Related Workmentioning

confidence: 99%

“…Similarly, the main idea of plane-partition-based algorithms also used interference localization, i.e., deriving an upper bound of the interference received outside neighboring cell (e.g., [4], [28]- [30]).…”

Section: Related Workmentioning

confidence: 99%

“…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%

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

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

Connectivity Maintenance for Next-Generation Decentralized Vehicle Platoon Networks

Sarker

Qiu

Shen

2020

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Fading-Resistant Link Scheduling in Wireless Networks

Cited by 6 publications

References 19 publications

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

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

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

Connectivity Maintenance for Next-Generation Decentralized Vehicle Platoon Networks

Contact Info

Product

Resources

About