Complexity in wireless scheduling: Impact and tradeoffs

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn , Issue , 2008, Pages 33-42

  Yi, Yung ^a   Proutière, Alexandre ^b   Chiang, Mung ^a  

^a PRINCETON UNIVERSITY   (United States)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Complexity; Scheduling; Tradeoff; Wireless networks

Indexed keywords

COMMERCE; COMMUNICATION CHANNELS (INFORMATION THEORY); CONTROL SYSTEMS; DELAY CONTROL SYSTEMS; SCHEDULING; SCHEDULING ALGORITHMS; SYSTEM STABILITY; TELECOMMUNICATION NETWORKS; THREE DIMENSIONAL; WIRELESS TELECOMMUNICATION SYSTEMS;

COMPLEXITY; CONGESTION CONTROLS; CONTROL MESSAGES; DELAY TRADEOFFS; DIMENSIONAL SPACES; EFFECTIVE THROUGHPUTS; EXPONENTIAL GROWTHS; ONE DIMENSIONS; PRACTICAL MODELS; QUEUEING SYSTEMS; RESEARCH TOPICS; STABILITY REGIONS; TRADEOFF; TRADEOFF ANALYSIS; TWO DIMENSIONS; UTILITY MAXIMIZATIONS; WIRELESS AD HOC NETWORKS; WIRELESS SCHEDULING;

AD HOC NETWORKS;

EID: 57349137203     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374618.1374624     Document Type: Conference Paper

References (29)

1. P. Chaporkar, K. Kar, and S. Sarkar. Throughput guarantees through maximal scheduling in wireless networks. In Proc. of Allerton, 2005.
2. P. Chaporkar and S. Sarkar. Stable scheduling policies for maximizing throughput in generalized constrained queueing. In Proc. of Infocom, 2006.
3. L. Chen, S. H. Low, M. Chiang, and J. C. Doyle, Joint optimal congestion control, routing, and scheduling in wireless ad hoc networks. In Proc. of Infocom, 2006.
4. A. Eryihnaz, A. Ozdaglar, and E. Modiano. Polynomial complexity algorithms for full utilization of multi-hop wireless networks. In Proc. of Infocom, 2007.
5. M. Hanckowiak, M. Karonski, and A. Panconesi. On the distributed complexity of computing maximal matchings. In Proc. of the ninth annual ACM-SIAM symposium on discrete algorithms, 1998.
6. C. Joo and N. B. Shroff. Performance of random access scheduling schemes in multi-hop wireless networks. In Proc. of Infocom, 2007.
7. K. Jung and D. Shah. Low delay scheduling in wireless network. In Proc. of ISIT, 2007.
8. A. Kabbani, T. Salonidis, and E. W. Knightly. Distributed low-complexity maximum-throughput scheduling for wireless backhaul networks. In Proc. of Infocom, 2007.
9. K. Kar, S. Sarkar, and L. Tassiulas. Achieving proportional fairness using local information in aloha networks. IEEE Transactions on Automatic Control, 49:1858-1863, 2004.
10. E. Leonardi, M. Mellia, F. Neri, and M. A. Marsan. Bounds on delays and queue lengths in input-queued cell switches. Journal of ACM, 50(4):520-550, 2003.
11. X. Lin and S. Rasool. Constant-time distributed scheduling policies for ad hoc wireless networks. In Proc. of CDC, 2006.
12. X. Lin and N. B. Shroff. The impact of imperfect scheduling on cross-layer rate control in wireless networks. In Proc. of Infocom, 2005.
13. S. P. Meyn and R. L. Tweedie. Markov chains and stochastic stability. Springer-Verlag, 1993.
14. E. Modiano, D. Shah, and G. Zussman. Maximizing throughput in wireless networks via gossiping. In Proc. of ACM Sigmetrics, 2006.
15. M. J. Neely, E. Modiano, and C. Li. Fairness and optimal stochastic control for heterogeneous networks. In Proc. of IEEE INFOCOM, 2005.
16. M. J. Neely, E. Modiano, and C. E. Rohrs. Tradeoffs in delay guarantees and computation complexity for nxn packet switches. In Proc. of CISS, 2002.
17. M. J. Neely, E. Modiano, and C. E. Rohrs. Dynamic power allocation and routing for time varying wireless networks. In Proc. of Infocom, 2003.
18. R. Preis. Linear time 1/2-approximation algorithm for maximum weighted matching in general graphs. In Proc. of STOC, 1999.
19. S. Ray and S. Sarkar. Arbitrary throughput versus complexity tradeoffs in wireless networks using graph partitioning. In Proc. of Information Theory and Applications Second Workshop, 2007.
20. S. Sanghavi, L. Bui, and R. Srikant. Distributed link scheduling with constant overhead. In Proc. of ACM Sigmetrics, 2007.
21. S. Sarkar and K. Kar. Achieving 2/3 throughput approximation with sequential maximal scheduling under primary internference constraints. In Proc. of Allerton, 2006.
22. D. Shah and M. Kopikare. Delay bounds for approximate maximum weight matching algorithms for input queued switches. In Proc. of Infocom, 2002.
23. G. Sharma, R. R. Mazumdar, and N. B. Shroff. On the complexity of scheduling in wireless networks. In Proc. of Mobicom, 2006.
24. L. Tassiulas. Linear complexity algorithms for maximum throughput in radionetworks and input queued switches. In Proc. of Infocom, 1998.
25. L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37(12):1936-1949, December 1992.
26. V. V. Vazirani. Approximate Algorithms. Springer-Verlag, 2001.
27. X. Wu and R. Srikant. Bounds on the capacity region of multi-hop wireless networks under distributed greedy scheduling. In Proc. of Infocom, 2006.
28. Y. Yi and M. Chiang. Stochastic network utility maximization. European Transactions on Telecommunications, March, 2008.
29. Y. Yi and M. Chiang. Wireless scheduling with O(1) complexity for m-hop interference model. In Proc. of ICC, 2008.