A fully distributed algorithm for throughput performance in wireless networks

We study link scheduling in wireless networks under stochastic arrival processes of packets, and give an algorithm that achieves stability in the physical (SINR) interference model. The efficiency of such an algorithm is the fraction of the maximum feasible traffic that the algorithm can handle with...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2012 46th Annual Conference on Information Sciences and Systems s. 1 - 5
Hlavní autori: Asgeirsson, E. I., Halldorsson, M. M., Mitra, P.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.03.2012
Predmet:
ISBN:9781467331395, 1467331392
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We study link scheduling in wireless networks under stochastic arrival processes of packets, and give an algorithm that achieves stability in the physical (SINR) interference model. The efficiency of such an algorithm is the fraction of the maximum feasible traffic that the algorithm can handle without queues growing indefinitely. Our algorithm achieves two important goals: (i) efficiency is independent of the size of the network, and (ii) the algorithm is fully distributed, i.e., individual nodes need no information about the overall network topology, not even local information.
ISBN:9781467331395
1467331392
DOI:10.1109/CISS.2012.6310846