Delay-Guaranteed Cross-Layer Scheduling in Multihop Wireless Networks

In this paper, we propose a cross-layer scheduling algorithm that achieves a throughput " ε-close" to the optimal throughput in multihop wireless networks with a tradeoff of O([1/(ε)]) in average end-to-end delay guarantees. The algorithm guarantees finite buffer sizes and aims to solve a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE/ACM transactions on networking Ročník 21; číslo 6; s. 1696 - 1707
Hlavní autoři: Dongyue Xue, Ekici, Eylem
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.12.2013
Témata:
Algorithm design and analysis
Cross-layer designs
Delay
delay guarantees
finite buffer
flow control and scheduling
multihop wireless networks
Scheduling
Scheduling algorithms
Spread spectrum communication
Throughput
throughput optimization
Wireless networks
ISSN:1063-6692, 1558-2566
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we propose a cross-layer scheduling algorithm that achieves a throughput " ε-close" to the optimal throughput in multihop wireless networks with a tradeoff of O([1/(ε)]) in average end-to-end delay guarantees. The algorithm guarantees finite buffer sizes and aims to solve a joint congestion control, routing, and scheduling problem in a multihop wireless network while satisfying per-flow average end-to-end delay constraints and minimum data rate requirements. This problem has been solved for both backlogged as well as arbitrary arrival rate systems. Moreover, we discuss the design of a class of low-complexity suboptimal algorithms, effects of delayed feedback on the optimal algorithm, and extensions of the proposed algorithm to different interference models with arbitrary link capacities.
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2012.2230404