Distributed link scheduling with constant overhead

Performance Evaluation Review

Volumn 35, Issue 1, 2007, Pages 313-324

  Sanghavi, Sujay ^a   Bui, Loc ^b   Srikant, R ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b CSL   (United States)

Author keywords

Matchings; Primary interference; Scheduling; Wireless networks

Indexed keywords

DISTRIBUTED WIRELESS SCHEDULING ALGORITHMS; FIXED FRACTION; TUNING KNOB PROTOCOL DESIGNERS;

DATA COMMUNICATION SYSTEMS; INTEGER PROGRAMMING; PARALLEL ALGORITHMS; SCHEDULING ALGORITHMS; SIGNAL INTERFERENCE;

TELECOMMUNICATION LINKS;

EID: 36348993112     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1269899.1254920     Document Type: Conference Paper

References (20)

1. X. Lin and S. Rasool, "Constant-time distributed scheduling policies for ad hoc wireless networks," in IEEE Conference on Decision and Control, 2006.
2. A. Gupta, X. Lin, and R. Srikant, "Low-complexity distributed scheduling algorithms for wireless networks," 2006, preprint.
3. C. Joo and N. Shroff, "Performance of random access scheduling schemes in multi-hop wireless networks," 2006, preprint.
4. B. Hajek and G. Sasaki, "Link scheduling in polynomial time," IEEE Transactions on Information Theory, vol. 34, no. 5, pp. 910-917, Sept. 1988.
5. 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, vol. 37, no. 12, pp. 1936-1949, Dec. 1992.
6. N. McKeown, V. Anantharam, and J. Walrand, "Achieving 100input-queued switch," in Proceedings of IEEE Infocom, 1996.
7. L. Tassiulas, "Linear complexity algorithms for maximum throughput in radionetworks and input queued switches," in Proceedings of IEEE Infocom, 1998.
8. P. Giaccone, B. Prabhakar, and D. Shah, "Towards simple, high-performance schedulers for high-aggregate bandwidth switches," in Proceedings of IEEE Infocom, 2002.
9. E. Modiano, D. Shah, and G. Zussman, "Maximizing throughput in wireless networks via gossiping," in ACM SIGMETRICS / IFIP Performance, 2006.
10. T. Weller and B. Hajek, "Scheduling nonuniform traffic in a packet-switching system with small propagation delay," IEEE/ACM Trans. Networking, vol. 5, pp. 813-823, Dec. 1997.
11. J. G. Dai and B. Prabhakar, "The throughput of data switches with and without speedup," in Proceedings of IEEE Infocom, 2000, pp. 556-564.
12. X. Lin and N. B. Shroff, "The impact of imperfect scheduling on cross-layer rate control in wireless networks," in Proceedings of IEEE Infocom, 2005.
13. A. Brzezinski, G. Zussman, and E. Modiano, "Enabling distributed throughput maximization in wireless mesh networks - a partitioning approach," in ACM MOBICOM, Sept. 2006.
14. A. Eryilmaz, A. Ozdaglar, and E. Modiano, "Polynomial complexity algorithms for full utilization of multi-hop wireless networks," tech. Report 2006.
15. Y. Yi, G. de Veciana, and S. Shakkottai, "Learning contention patterns and adapting to load/topology changes in a mac scheduling algorithm," in Proceedings of WiMesh, 2006, invited Paper.
16. X. Wu and R. Srikant, "Regulated maximal matching: A distributed scheduling algorithm for multi-hop wireless networks with node-exclusive spectrum sharing," in IEEE Conf. on Decision and Control, 2005.
17. P. Chaporkar, K. Kar, and S. Sarkar, "Achieving queue length stability through maximal scheduling in wireless networks," in Workshop on Information Theory and Applications, UCSD, 2006, invited.
18. X. Wu, R. Srikant, and J. R. Perkins, "Queue-length stability of maximal greedy schedules in wireless networks," in Workshop on Information Theory and Applications, UCSD, 2006, invited.
19. S. Pettie and P. Sanders, "A simpler linear time 2/3 ε approximation for maximum weight matching," Inf. Process. Lett., vol. 91, no. 6, pp. 271-276, 2004.
20. S. Asmussen, Applied Probability and Queues 2nd Ed. Springer, 2003.