Delay-Guaranteed Cross-Layer Scheduling in Multi-Hop Wireless Networks

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-695463

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.