Multihop local pooling for distributed throughput maximization in wireless networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 1813-1821

  Zussman, Gil ^a   Brzezinski, Andrew ^b   Modiano, Eytan ^c  

^a Columbia University ^*  (United States)

^b Fidelity Investments   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Distributed algorithms; Interference; Local pooling; Routing; Scheduling; Stability; Wireless networks

Indexed keywords

DISTRIBUTED ALGORITHMS; INTERFERENCE; LOCAL POOLING; ROUTING; STABILITY; WIRELESS NETWORKS;

ALGORITHMS; COMPUTER NETWORKS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; PARALLEL ALGORITHMS; SCHEDULING; TELECOMMUNICATION NETWORKS; THROUGHPUT;

ROUTING ALGORITHMS;

EID: 51349115213     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.169     Document Type: Conference Paper

References (27)

1. M. Ajmone Marsan, E. Leonardi. M. Mellia, and F. Neri, "On the stability of isolated and interconnected input-queueing switches under multiclass traffic," IEEE Trans. Inform. Th., vol. 51. no. 3. pp. 1167-1174, Mar. 2005.
2. B. Awerbuch and T. Leighton. "Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks," in Proc. ACM STOC'94, 1994.
3. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. P. Williamson, "Adversarial queuing theory," J. ACM. vol. 48, no. 1, pp. 13-38, Jan. 2001.
4. A. Brandstädt, V. B. Le. and J. P. Spinrad, Graph Classes: A Survey. SIAM, 1999.
5. A. Brzezinski, "Scheduling algorithms for throughput maximization in data networks," Ph.D. dissertation. MIT, May 2007. [Online]. Available: http://web.mit.edu/brzezin/www/thesis.pdf
6. A. Brzezinski, G. Zussman, and E. Modiano, "Enabling distributed throughput maximization in wireless mesh networks - a partitioning approach," in Proc. ACM MOBICOM'06, Sept. 2006.
7. _, "Local pooling conditions for joint routing and scheduling," in Proc. Inform. Th. and Appl. (ITA'08), Jan. 2008.
8. K. Cameron, "Induced matchings," Discrete Appl. Math., vol. 24, no. 1-3. pp. 97-102, 1989.
9. _, "Induced matchings in intersection graphs," Discrete Math., vol. 278, no. 1-3, pp. 1-9. Mar. 2004.
10. P. Chaporkar, K. Kar, X. Luo, and S. Sarkar, "Throughput and fairness guarantees through maximal scheduling in wireless networks," IEEE Trans. Inform. Th., vol. 54. no. 2, Feb. 2008.
11. L. Chen, S. H. Low, M. Chiang, and J. C. Doyle. "Optimal cross-layer congestion control, routing and scheduling design in ad hoc wireless networks," in Proc. IEEE INFOCOM'06, Apr. 2006.
12. J. G. Dai, "On the positive Harris recurrence for open multiclass queueing networks: a unified approach via fluid limit models," Ann. Appl. Probab., vol. 5, no. 1. pp. 49-77. Feb. 1995.
13. A. Dimakis and J. Walrand, "Sufficient conditions for stability of longest queue first scheduling: second order properties using fluid limits," Adv. Appl. Probab., vol. 38, no. 2, pp. 505-521, June 2006.
14. A. Goel, "Stability of networks and protocols in the adversarial queueing model for packet routing," Networks, vol. 37, no. 4, pp. 219-224, 2001.
15. F. Harary, Graph Theory. Addison-Wesley, 1969.
16. J.-H. Hoepman, "Simple distributed weighted matchings," Oct. 2004. eprint cs.DC/0410047.
17. K. Jain, J. Padhye, V. N. Padmanabhan, and L. Qiu, "Impact of interference on multi-hop wireless network performance," ACM/Springer Wireless Networks, vol. 11, no. 4. pp. 471-487, July 2005.
18. C. Joo, X. Lin, and N. B. Shroff, "Performance limits of greedy maximal matching in multi-hop wireless networks," in Proc. IEEE CDC'07, Dec. 2007.
19. F. Kuhn, T. Moscibroda, and R. Wattenhofer, "What cannot be computed locally!" in Proc. ACM PODC'04, July 2004.
20. X. Lin and S. Rasool, "Constant-time distributed scheduling policies for ad hoc wireless networks," in Proc. IEEE CDC'06, Dec. 2006.
21. X. Lin and N. B. Shroff. "The impact of imperfect scheduling on crosslayer rate control in wireless networks." IEEE/ACM Trans. Netw., vol. 14, no. 2, pp. 302-315, Apr. 2006.
22. E. Modiano, D. Shah, and G. Zussman. "Maximizing throughput in wireless networks via gossiping." in Proc. ACM SIGMETRICS'06, June 2006.
23. T. Moscibroda and R. Wattenhofer, 'The complexity of connectivity in wireless networks," in Proc. IEEE INFOCOM'06, Apr. 2006.
24. G. Sharma, R. R. Mazumdar, and N. B. Shroff, "On the complexity of scheduling in wireless networks," in Proc. ACM MOBICOM'06, Sept. 2006.
25. L. Tassiulas and A. Ephremides. "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Automat. Contr., vol. 37. no. 12, pp. 1936-1948. Dec. 1992.
26. X. Wu and R. Srikant, "Regulated maximal matching: a distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharing," in Proc. IEEE CDC'05, Dec. 2005.
27. _, "Bounds on the capacity region of multi-hop wireless networks under distributed greedy scheduling," in Proc. IEEE INFOCOM'06, Apr. 2006.