TSLS and TSLSU: Two Novel Approximation \text-Based Shortest Link Scheduling Algorithms in Wireless Networks

In this paper, we address the fundamental problem of shortest link scheduling (SLS) in wireless networks under the Signal-to-Interference-plus-Noise-Ratio (<inline-formula><tex-math notation="LaTeX">\text{SINR}</tex-math></inline-formula>) constraints and propose tw...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on vehicular technology s. 1 - 13
Hlavní autori: Mohammadi, Neda, Bigham, Bahram Sadeghi, Kadivar, Mehdi
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: IEEE 2025
Predmet:
<inline-formula xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"> <tex-math notation="LaTeX"> text{SINR}</tex-math> </inline-formula>
Approximation algorithms
Interference
Partitioning algorithms
Power control
Schedules
Scheduling
Scheduling algorithms
Shortest link scheduling
Signal to noise ratio
Throughput
Wireless networks
ISSN:0018-9545, 1939-9359
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we address the fundamental problem of shortest link scheduling (SLS) in wireless networks under the Signal-to-Interference-plus-Noise-Ratio (<inline-formula><tex-math notation="LaTeX">\text{SINR}</tex-math></inline-formula>) constraints and propose two efficient Triangle-based Shortest Link Scheduling (TSLS and TSLSU) algorithms by assuming both oblivious power control and uniform power assignment scenarios. Many existing algorithms, to solve SLS under the <inline-formula><tex-math notation="LaTeX">\text{SINR}</tex-math></inline-formula> constraints, partition the set of links into classes and for each class, schedule the links by partitioning the link deployment plane into small regions. In this paper, we present a new triangle-based method for plane partitioning, showing that it significantly improves efficiency by increasing the number of simultaneously schedulable same-color regions. Consequently, more links can be activated within a time slot compared to other partitioning methods. Theoretical analysis indicates the correctness and effectiveness of our algorithms. Theoretical analysis demonstrates that our plane partition and approximation ratios are respectively much more efficient and tighter than those of state-of-the-art algorithms' results. In summary, both theoretical analysis and simulation results confirm that our algorithms offer superior performance in terms of efficiency and solution quality compared to the state-of-the-art algorithms.
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2025.3585916