English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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&#x0394;maxT + 1)&#x03B4; log2 &#x0394;maxT time slots for a constant &#x03B4;. Specifically, &#x0394;maxT 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(&#x03B4; + 1)&#x0394;maxT ln (&#x0394;maxT + 1) time slots. In addition, extensive simulations evaluate the performance of two proposed algorithms.

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