A Survey of Throughput Versus Complexity Tradeoffs in Wireless Networks

DOI10.1007/978-3-540-72709-5_12MaRDI QIDQ3614972zbMATH OpenOpenAlexFDO

Authors Saswati Sarkar

Publication date 17 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72709-5_12

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
• Practical scheduling schemes with throughput guarantees for multi-hop wireless networks
• Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
• Scheduling in wireless networks
• Joint congestion control and distributed scheduling for throughput guarantees in wireless networks

Cited in

(5)

• Stable throughput regions in wireless networks
• Wireless Network Simplification: The Performance of Routing
• WIRELESS MOBILE COMPUTING AND ITS LINKS TO DESCRIPTIVE COMPLEXITY
• Practical scheduling schemes with throughput guarantees for multi-hop wireless networks
• Stability-throughput tradeoff and routing in multi-hop wireless ad hoc networks

This page was built for publication: A Survey of Throughput Versus Complexity Tradeoffs in Wireless Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614972)