Computer Science – Information Theory
Scientific paper
2010-09-24
Computer Science
Information Theory
Scientific paper
In this paper, we propose a cross-layer scheduling algorithm that achieves a throughput "epsilon-close" to the optimal throughput in multi-hop wireless networks with a tradeoff of O(1/epsilon) in delay guarantees. The algorithm aims to solve a joint congestion control, routing, and scheduling problem in a multi-hop wireless network while satisfying per-flow average end-to-end delay guarantees 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, the effects of delayed feedback on the optimal algorithm, and the extensions of the proposed algorithm to different interference models with arbitrary link capacities.
Ekici Eylem
Xue Dongyue
No associations
LandOfFree
Delay-Guaranteed Cross-Layer Scheduling in Multi-Hop Wireless Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Delay-Guaranteed Cross-Layer Scheduling in Multi-Hop Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Delay-Guaranteed Cross-Layer Scheduling in Multi-Hop Wireless Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-695463