Computer Science – Networking and Internet Architecture
Scientific paper
2011-01-21
Computer Science
Networking and Internet Architecture
Submitted to IEEE/ACM Transactions on Networking. A preliminary version of this work was presented at IEEE WiOpt 2011
Scientific paper
This paper focuses on designing throughput-optimal scheduling policies that avoid using per-flow or per-destination information, maintain a single data queue for each link, exploit only local information, for multi-hop wireless networks under general interference constraints. Although the celebrated back-pressure algorithm maximizes throughput, it requires per-flow or per-destination information (which may be difficult to obtain and maintain), maintains complex data structure at each node, relies on constant exchange of queue length information among neighboring nodes, and results in poor delay performance in certain scenarios. In contrast, the proposed schemes can circumvent these drawbacks while guaranteeing throughput optimality. We rigorously analyze the performance of the proposed schemes using fluid limit techniques via an inductive argument and show that they are throughput-optimal. We also conduct simulations to show that the proposed schemes can substantially improve the delay performance.
Ji Bo
Joo Changhee
Shroff Ness B.
No associations
LandOfFree
Throughput-optimal Scheduling in Multi-hop Wireless Networks without Per-flow Information 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 Throughput-optimal Scheduling in Multi-hop Wireless Networks without Per-flow Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Throughput-optimal Scheduling in Multi-hop Wireless Networks without Per-flow Information will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-19978