Joint congestion control and distributed scheduling for throughput guarantees in wireless networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 2072-2080

  Sharma, Gaurav ^a   Shroff, Ness B ^a   Mazumdar, Ravi R ^b  

^a PURDUE UNIVERSITY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; MATHEMATICAL MODELS; PARALLEL ALGORITHMS; SCHEDULING ALGORITHMS; WIRELESS NETWORKS;

DISTRIBUTED SCHEDULING; RANDOMIZED DISTRIBUTED ALGORITHMS;

CONGESTION CONTROL (COMMUNICATION);

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

References (31)

1. D. J. Baker, J. Wieselthier, and A. Ephremides. A Distributed Algorithm for Scheduling the Activation of Links in a Self-organizing Mobile Radio Network. In IEEE ICC, pages 2F.6.1-2F.6.5, 1982.
2. T. Bonald and L. Massoulie. Impact of fariness on Internet performance. In ACM Sigmetrics, 2001.
3. L. Bui, A. Eryilmaz, R. Srikant, and X. Wu. Joint Asynchronous Congestion Control and Distributed Scheduling for Multi-Hop Wireless Networks. In IEEE INFOCOM, 2006.
4. P. Chaporkar, K. Kar, and S. Sarkar. Throughput Guarantees Through Maximal Scheduling in Wireless Networks. 43rd Annual Allerton Conf. on Communications, Control, and Computing, Sep 2005.
5. R. L. Cruz and A. V. Santhanam. Optimal routing, link scheduling and power control in multihop wireless networks. In INFOCOM, 2003.
6. H. Balakrishnan et al. The Distance-2 Matching Problem and its Relationship to the MAC-layer Capacity of Ad Hoc Wireless Networks. IEEE JSAC, 22(6):1069-1079, Aug 2004.
7. B. Hajek and G. Sasaki. Link Scheduling in Polynomial Time. IEEE Transactions on Information Theory, 34(5):910-917, Sep 1988.
8. F. Kelly, A. Maulloo, and D. Tan. Rate control in communication networks: shadow prices, proportional fairness and stability. In Journal of the Oper. Res. Society, volume 49, pages 237-252, 1998.
9. X. Lin and N. B. Shroff. Joint Rate Control and Scheduling in Multi-hop Wireless Networks. In IEEE CDC, 2004.
10. X. Lin and N. B. Shroff. The Impact of Imperfect Scheduling on Cross-Layer Rate Control in Multihop Wireless Networks. In IEEE INFOCOM, Mar 2005.
11. X. Lin, N. B. Shroff, and R. Srikant. On the Connection-Level Stability of Congestion-Controlled Communication Networks. Preprint, 2006.
12. S. H. Low and D. E. Lapsley. Optimization flow control - I: basic algorithm and convergence. IEEE/ACM Trans. on Networking, 7(6):861-874, 1999.
13. S. H. Low and R. Srikant. A Mathematical Framework for Designing a Low-Loss, Low-Delay Internet. Network and Spatial Economics, 4(1):75-102, March 2004.
14. B. Miller and C. Bisdikian. Bluetooth Revealed: The Insider's Guide to an Open Specification for Global Wireless Communications. Prentice Hall, 2000.
15. M. J. Neely, E. Modiano, and C. Li. Fairness and optimal stochastic control for heterogeneous networks. In IEEE INFOCOM, 2005.
16. M. J. Neely, E. Modiano, and C. E. Rohrs. Dynamic Power Allocation and Routing for Time Varying Wireless Networks. In IEEE INFOCOM, 2003.
17. M. J. Neely, E. Modiano, and C. E. Rohrs. Power allocation and routing in multibeam satellites with time-varying channels. IEEE/ACM Trans. Netw., 11(1):138-152, 2003.
18. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Math. Appl., SIAM, Philadelphia, 2000.
19. S. Sarkar and L. Tassiulas. End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks. IEEE Trans. on Automatic Control, 50(9), Sep 2005.
20. G. Sharma, C. Joo, and N. B. Shroff. Distributed Scheduling Schemes for Throughput Guarantees in Wireless Networks. In 44th Annual Allerton conference on Communications, Control, and Computing (Invited paper), Sep 2006.
21. G. Sharma, R. R. Mazumdar, and N. B. Shroff. Maximum Weighted Matching with Interference Constraints. In IEEE FAWN, March 2006.
22. G. Sharma, R. R. Mazumdar, and N. B. Shroff. On the Complexity of Scheduling in Wireless Networks. In ACM MOBICOM, 2006.
23. R. Srikant. The Mathematics of Internet Congestion Control. Birkhauser, 2004.
24. L. Stockmeyer and V. Vazirani. NP-completeness of some generalizations of the maximum matching problem. Inform. Process. Lett., 15(1):14-19, 1982.
25. A. L. Stolyar. Maximizing Queueing Network Utility subject to Stability: Greedy Primal-Dual Algorithm. Queueing Systems, 50(4):401-457, 2005.
26. L. Tassiulas and A. Ephremides. Jointly optimal routing and scheduling in packet radio networks. IEEE Trans. on Info. Theory, 38(1):165-168, Jan 1992.
27. L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. on Automatic Control, 37(12):1936-1948, December 1992.
28. X. Wu and R. Srikant. Bounds on the Capacity Region of Multi-hop Wireless Networks under Distributed Greedy Scheduling. In IEEE INFOCOM, 2006.
29. L. Xiao, M. Johansson, and S. Boyd. Simultaneous routing and resource allocation via dual decomposition. IEEE Trans. on Comm., 52(7):1136-1144, July 2004.
30. H. Yaiche, R. Mazumdar, and C. Rosenberg. A game-theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE/ACM Trans. on Networking, 8(5):667-678, Oct 2000.
31. Y. Yi and S. Shakkottai. Hop-by-hop Congestion Control over a Wireless Multi-hop Network. In IEEE INFOCOM, March 2004.