Polynomial complexity algorithms for full utilization of multi-hop wireless networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 499-507

  Eryilmaz, Atilla ^a   Ozdaglar, Asuman ^a   Modiano, Eytan ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Massachusetts Institute of Technology Cambridge

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARALLEL ALGORITHMS; POLYNOMIAL APPROXIMATION; RADIO INTERFERENCE; WIRELESS NETWORKS;

INTERFERENCE MODELS; MULTI-HOP WIRELESS NETWORKS;

SCHEDULING ALGORITHMS;

EID: 34548322743     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.65     Document Type: Conference Paper

References (30)

1. M. Andrews, K. Kumaran, K. Ramanan, A. Stolyar, R. Vijayakumar, and P. Whiting. Scheduling in a queueing system with asynchronously varying service rates, 2000. Bell Laboratories Technical Report.
2. E. Arikan. Some complexity results about packet radio networks. IEEE Transactions on Information Theory, 30:681-685, 1984.
3. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Athena Scientific, Belmont, MA, 1997.
4. L. Bui, A. Eryilmaz, R. Srikant, and X. Wu. Joint asynchronous congestion control and distributed scheduling for wireless networks. Proceedings of IEEE Infocom 2006.
5. P. Chaporkar, K. Kar, and S. Sarkar. Throughput guarantees through maximal scheduling in wireless networks. In Proceedings of the Allerton Conference on Control, Communications and Computing, 2005.
6. L. Chen, S. H. Low, M. Chiang, and J. C. Doyle. Jointly optimal congestion control, routing, and scheduling for wireless ad hoc networks. In Proceedings of IEEE Infocom, Barcelona, Spain, April 2006.
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, McGraw-Hill Book Company, 2001.
8. A. Eryilmaz, E. Modiano, and A. Ozdaglar. Randomized algorithms for throughput-optimality and fairness in wireless networks. In Proc. of IEEE Conf. on Decision and Control, San Diego, CA, December 2006.
9. A. Eryilmaz and R. Srikant. Fair resource allocation in wireless networks using queue-length based scheduling and congestion control. In Proc. of IEEE Infocom, pages 1794-1803, Miami, FL, March 2005.
10. A. Eryilmaz and R. Srikant. Joint congestion control, routing and mac for stability and fairness in wireless networks. IEEE Journal on Selected Areas in Communications, special issue on Nonlinear Optimization of Communication Systems, 14:1514-1524, August 2006.
11. R. G. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming Languages and Systems, 5:66-77, 1983.
12. F. P. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8:33-37, 1997.
13. F. P. Kelly, A. Maulloo, and D. Tan. Rate control in communication networks: Shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49:237-252, 1998.
14. X. Lin and N. Shroff. Joint rate control and scheduling in multihop wireless networks. In Proceedings of IEEE Conference on Decision and Control, Paradise Island, Bahamas, December 2004.
15. X. Lin and N. Shroff. The impact of imperfect scheduling on crosslayer rate control in multihop wireless networks. In Proceedings of IEEE Infocom, Miami, FL, March 2005.
16. S. H. Low and D. E. Lapsley. Optimization flow control, I: Basic algorithm and convergence. IEEE/ACM Transactions on Networking, 7:861-875, December 1999.
17. E. Modiano, D. Shah, and G. Zussman. Maximizing throughput in wireless networks via gossiping. In ACM SIGMETRICS/IFIP Performance, 2006.
18. M.J. Neely, E. Modiano, and C. Li. Fairness and optimal stochastic control for heterogeneous networks. In Proceedings of IEEE Infocom, pages 1723-1734, Miami, FL, March 2005.
19. M.J. Neely, E. Modiano, and C.E. Rohrs. Dynamic power allocation and routing for time varying wireless networks. In Proceedings of IEEE Infocom, pages 745-755, April 2003.
20. L. Peterson and B. Davie. Computer Networks: A Systems Approach. Morgan Kaufmann Publishers, Second edition, 2000.
21. S. Sanghavi, L. Bui, and R. Srikant. Distributed link scheduling with constant overhead, 2006. Technical Report.
22. G. Sasaki and B. Hajek. Link scheduling in polynomial time. IEEE Transactions on Information Theory, 32:910-917, 1988.
23. S. Shakkottai and A. Stolyar. Scheduling for multiple flows sharing a time-varying channel: The exponential rule. Translations of the AMS, Series 2, A volume in memory of F. Karpelevich, 207:185-202, 2002.
24. R. Srikant. The Mathematics of Internet Congestion Control. Birkhäuser, Boston, MA, 2004.
25. A. Stolyar. Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm. Queueing Systems, 50(4):401-457, 2005.
26. L. Tassiulas. Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In Proceedings of IEEE Infocom, pages 533-539, 1998.
27. L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 36:1936-1948, December 1992.
28. X. Wu and R. Srikant. Regulated maximal matching: A distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharing. In Proceedings of IEEE Conference on Decision and Control., 2005.
29. X. Wu and R. Srikant. Bounds on the capacity region of multi-hop wireless networks under distributedgreedy scheduling. In Proceedings of IEEE Infocom, 2006.
30. H. Yaiche, R. R. Mazumdar, and C. Rosenberg. A game-theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE/ACM Transactions on Networking, 8(5):667-678, October 2000.