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

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!