Abstract
Attaining stability guarantees using distributed scheduling policies is an important design goal in multi-hop wireless networks. Several recent results have recently characterized tradeoffs tradeoffs between computation times and stability guarantees in multi-hop wireless networks. We summarize existing results that have substantially advanced the state of the art in this context, and discuss problems that remain open.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chaporkar, P., Kar, K., Sarkar, S.: Throughput guarantees through maximal scheduling in multihop wireless networks. In: Proceedings of 43d Annual Allerton Conference on Communication, Control and Computing, September 28-30, 2005, Allerton, Monticello, Illinois (2005)
Dai, J., Prabhakar, B.: The throughput of data switches with and without speedup. In: Proceedings of INFOCOM, March 2000, Tel Aviv, Israel, pp. 556–564 (2000)
Dimakis, A., Walrand, J.: Sufficient conditions for stability of longest queue first scheduling: second order properties using fluid limits. Advances of applied Probability 38(2), 505–521 (2006)
Shah, D., Modiano, E., Zussman, G.: Maximizing throughput in wireless networks via gossiping. In: Proc. ACM SIGMETRICS / IFIP Performance 2006 (June 2006)
Lin, X., Rasool, S.: Constant-time distributed scheduling policies for ad hoc wireless networks. In: Proceedings of IEEE CDC-ECC 2005, San Diego, CA, December 2006, IEEE Computer Society Press, Los Alamitos (2006)
Lin, X., Shroff, N.: The impact of imperfect scheduling on cross-layer rate control in multihop wireless networks. In: Proceedings of INFOCOM, March 2005, Miami, FL (2005)
Ray, S., Sarkar, S.: Arbitrary throughput versus complexity tradeoffs in wireless networks using graph partitioning. In: Proceedings of the Second Workshop on Information Theory and Applications, January 29-February 2, 2007, San Diego, CA (2007)
Sarkar, S., Kar, K.: Achieving 2/3 throughput approximation with sequential maximal scheduling under primary interference constraints. In: Proceedings of 44th Annual Allerton Conference on Communication, Control and Computing, September 27-29, 2006, Allerton, Monticello, Illinois (2006)
Tassiulas, L.: Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In: Proceedings of INFOCOM, pp. 533–539 (1998)
Tassiulas, L., Ephremidis, A.: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control 37(12), 1936–1948 (1992)
Wu, X., Srikant, R.: Regulated maximal matching: a distributed scheduling algorithm for multihop wireless networks with node-exclusive spectrum sharing. In: Proceedings of IEEE CDC-ECC 2005, Seville, Spain, December 2005, IEEE Computer Society Press, Los Alamitos (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sarkar, S. (2007). A Survey of Throughput Versus Complexity Tradeoffs in Wireless Networks. In: Chahed, T., Tuffin, B. (eds) Network Control and Optimization. NET-COOP 2007. Lecture Notes in Computer Science, vol 4465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72709-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-72709-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72708-8
Online ISBN: 978-3-540-72709-5
eBook Packages: Computer ScienceComputer Science (R0)