Delay guarantees for throughput-optimal wireless link scheduling

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 2331-2339

  Kar, Koushik ^a   Luo, Xiang ^a   Sarkar, Saswati ^b  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY TOPOLOGY; AVERAGE PACKET DELAYS; CHROMATIC NUMBER; DELAY GUARANTEE; EXPECTED DELAY; INDEPENDENT SET; INTERFERENCE GRAPHS; LINK INTERFERENCE; LINK SCHEDULING; PACKET ARRIVAL RATE; PACKET ARRIVALS; SCHEDULING POLICIES; UPPER BOUND; WEIGHTED INDEPENDENT SETS; WIRELESS LINK;

AD HOC NETWORKS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; GRAPH THEORY; OPTIMIZATION; TELECOMMUNICATION NETWORKS; TOPOLOGY; WIRELESS AD HOC NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

SCHEDULING;

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

References (26)

1. A. Brzezinski, G. Zussman, and E. Modiano. Distributed throughput maximization in wireless mesh networks - a partitioning approach. In Proceedings of ACM MOBICOM, Los Angeles, CA, September 2006.
2. P. Chaporkar, K. Kar, and S. Sarkar. Throughput guarantees through maximal scheduling in multihop wireless networks. In Proceedings of 43d Annual Allerton Conference on Communication, Control and Computing, Allerton, Monticello, Illinois, September 28-30 2005.
3. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 2000.
4. J. Dai and B. Prabhakar. The throughput of data switches with and without speedup. In Proceedings of INFOCOM, pages 556-564, Tel Aviv, Israel, Mar 2000.
5. A. Dimakis and J. Walrand. Sufficient conditions for stability of longest queue first scheduling: second order properties using fluid limits. Advances of applied Probability, 38(2):505-521, June 2006.
6. A. El Gamal, J. Mammen, B. Prabhakar, and D. Shah. Throughput and delay in wireless networks - part i: Fluid case. IEEE Transaction on Information Theory and IEEE/ACM Transaction on Networking (joint issue), 52(6):2568-2592, June 2006.
7. A. El Gamal, J. Mammen, B. Prabhakar, and D. Shah. Throughput and delay in wireless networks - part ii: Constant-size packet. IEEE Transaction on Information Theory, 52(11):5111-5116, 2006.
8. G. Grimmett and D. Stirzaker. Probability and Random Processes. Oxford University Press, 3rd edition, 2001.
9. P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transaction on Information Theory, 46(2):388-404, March 2000.
10. B. Hajek and G. Sasaki. Link scheduling in polynomial time. IEEE Transactions on Information Theory, 34(5):910-917, Sep 1988.
11. F. Harary. Graph Theory. Addison-Wesley, 1969.
12. K. Jung and D. Shah. Low delay scheduling in wireless networks. In Proc. IEEE ISIT, France, 2007. Full version available at http://web.mit.edu/devavrat/www/delay.pdf.
13. X. Lin and S. Rasool. Constant-time distributed scheduling policies for ad hoc wireless networks. In Proceedings of IEEE CDC-ECC'05, San Diego, CA, Dec 2006.
14. X. Lin, G. Sharma, R̃. Mazumdar, and N. B. Shroff. Degenerate delay-capacity trade-offs in ad hoc networks with brownian mobility. IEEE Transaction on Information Theory and IEEE/ACM Transaction on Networking (joint issue), 52(6):2777-2784, June 2006.
15. X. Lin and N. Shroff. The impact of imperfect scheduling on cross-layer rate control in multihop wireless networks. In Proceedings of INFOCOM, Miami, FL, Mar 2005.
16. X. Lin and N. B. Shroff. The fundamental capacity-delay tradeoff in large mobile ad hoc networks. In Proc. Third Annual Mediterranean Ad Hoc Networking Workshop, Bodrum, Turkey, June 2004.
17. J. Mammen and D. Shah. Throughput and delay in random wireless networks with restricted mobility. IEEE Transaction on Information Theory, 53(3):1108-1116, March 2007.
18. E. Modiano, D. Shah, and G. Zussman. Maximizing throughput in wireless networks via gossiping. In Proc. ACM SIGMETRICS/IFIP Performance'06, June 2006.
19. M. Neely. Delay analysis for maximal scheduling in wireless networks with bursty traffic. In Proc. IEEE INFOCOM, Phoenix, AZ, April 2008.
20. M. J. Neely and E. Modiano. Capacity and delay tradeoffs for ad-hoc mobile networks. IEEE Transaction on Information Theory, 51(6):1917-1937, June 2005.
21. T. Salonidis and L. Tassiulas. Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks. In Proceedings of ACM MOBIHOC, 2005.
22. S. Sarkar and S. Ray. Arbitrary throughput versus complexity tradeoffs in wireless networks using graph partitioning. IEEE Transaction on Automatic Control, November 2008 (To appear). Available at http://www.seas.upenn.edu/ ~swati/arbitraryclosepoly.ps.
23. D. Shah, P. Giaccone, and B. Prabhakar. An efficient randomized algorithm for input-queued switch scheduling. IEEE Micro, 22(1):19-25, Jan-Feb 2002.
24. L. Tassiulas. Linear complexity algorithms for maximum throughput in radio networks and input queued switches. In Proceedings of INFOCOM, pages 533-539, 1998.
25. L. Tassiulas and A. Ephremidis. 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, Dec 1992.
26. X. Wu and R. Srikant. Regulated maximal matching: a distributed scheduling algorithm for multihop wireless networks with node-exclusive spectrum sharing. In Proceedings of IEEE CDC-ECC'05, Seville, Spain, Dec 2005.