Dynamic packet scheduling in wireless networks

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2012, Pages 281-290

  Kesselheim, Thomas ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

adversarial queuing theory; dynamic scheduling; sinr; wireless network

Indexed keywords

ADVERSARIAL QUEUING THEORY; COMPETITIVE RATIO; DYNAMIC SCHEDULING; INTERFERENCE MODELS; MULTIPLE ACCESS CHANNELS; PACKET INJECTION; PACKET SCHEDULING; PROTOCOL MODEL; SCHEDULING PROBLEM; SIGNAL TO INTERFERENCE PLUS NOISE RATIO; SINR; STATIC ALGORITHMS; TRANSMISSION REQUEST;

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; QUEUEING THEORY; SCHEDULING; SIGNAL INTERFERENCE; SPURIOUS SIGNAL NOISE; WIRELESS NETWORKS;

STOCHASTIC MODELS;

EID: 84865041973     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2332432.2332487     Document Type: Conference Paper

References (38)

1. N. Abramson. The ALOHA system: another alternative for computer communications. In Proceedings of the November 17-19, 1970, fall joint computer conference, AFIPS '70 (Fall), pages 281-285, 1970.
2. W. Aiello, E. Kushilevitz, R. Ostrovsky, and A. Rosén. Adaptive packet routing for bursty adversarial traffic. In Proceedings of the 30th annual ACM symposium on Theory of computing (STOC), pages 359-368, 1998.
3. M. Andrews, B. Awerbuch, A. Fernández, J. M. Kleinberg, F. T. Leighton, and Z. Liu. Universal stability results for greedy contention-resolution protocols. In Proceedings of the 37th IEEE Annual Symposium on Foundations of Computer Science (FOCS), pages 380-389, 1996.
4. M. Andrews and L. Zhang. Routing and scheduling in multihop wireless networks with time-varying channels. In Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1031-1040, 2004.
5. E. I. Asgeirsson, M. M. Halldórsson, and P. Mitra. A fully distributed algorithm for throughput performance in wireless networks. In Proceedings of the 46th Annual Conference on Information Sciences and Systems (CISS), 2012.
6. B. Awerbuch, A. Richa, and C. Scheideler. A jamming-resistant MAC protocol for single-hop wireless networks. In Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (PODC), pages 45-54, 2008.
7. M. A. Bender, M. Farach-Colton, S. He, B. C. Kuszmaul, and C. E. Leiserson. Adversarial contention resolution for simple channels. In Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 325-332, 2005.
8. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. P. Williamson. Adversarial queuing theory. Journal of the ACM, 48:13-38, January 2001.
9. B. S. Chlebus. Randomized communication in radio networks. In Handbook on Randomized Computing, pages 401-456. Kluwer Academic Publishers, 2001.
10. B. S. Chlebus, D. R. Kowalski, and M. A. Rokicki. Stability of the multiple-access channel under maximum broadcast loads. In Proceedings of the 9th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pages 124-138, 2007.
11. B. S. Chlebus, D. R. Kowalski, and M. A. Rokicki. Adversarial queuing on the multiple access channel. ACM Transactions on Algorithms, 8(1):5:1-5:31, 2012.
12. V. Cholvi and D. R. Kowalski. Bounds on stability and latency in wireless communication. IEEE Communications Letters, 14(9):842-844, 2010.
13. J. Dams, M. Hoefer, and T. Kesselheim. Scheduling in wireless networks with Rayleigh-fading interference. In Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2012. To appear.
14. D. P. Dubhashi and D. Ranjan. Balls and bins: A study in negative dependence. Random Structures and Algorithms, 13(2):99-124, 1998.
15. A. Fanghänel, T. Kesselheim, H. Räcke, and B. Vöcking. Oblivious interference scheduling. In Proceedings of the 28th ACM Symposium on Principles of Distributed Computing (PODC), pages 220-229, 2009.
16. A. Fanghänel, T. Kesselheim, and B. Vöcking. Improved algorithms for latency minimization in wireless networks. Theoretical Computer Science, 412(24):2657-2667, 2011.
17. L. Goldberg, M. Jerrum, S. Kannan, and M. Paterson. A bound on the capacity of backoff and acknowledgement-based protocols. In Proceedings of the 27th International EATCS Colloquium on Automata, Languages and Programming (ICALP), pages 705-717, 2000.
18. L. A. Goldberg, P. D. Mackenzie, M. Paterson, and A. Srinivasan. Contention resolution with constant expected delay. Journal of the ACM, 47:1048-1096, 2000.
19. O. Goussevskaia, R. Wattenhofer, M. M. Halldórsson, and E. Welzl. Capacity of arbitrary wireless networks. In Proceedings of the 28th Conference of the IEEE Communications Society (INFOCOM), pages 1872-1880, 2009.
20. M. M. Halldórsson. Wireless scheduling with power control. In Proceedings of the 17th annual European Symposium on Algorithms (ESA), pages 361-372, 2009.
21. M. M. Halldórsson and P. Mitra. Nearly optimal bounds for distributed wireless scheduling in the sinr model. In Proceedings of the 38th International EATCS Colloquium on Automata, Languages and Programming (ICALP), pages 625-636, 2011.
22. M. M. Halldórsson and P. Mitra. Wireless capacity with oblivious power in general metrics. In Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1538-1548, 2011.
23. M. M. Halldórsson and R. Wattenhofer. Computing wireless capacity. unpublished manuscript, 2010.
24. J. Håstad, F. T. Leighton, and B. Rogoff. Analysis of backoff protocols for multiple access channels. SIAM Journal on Computing, 25:740, 1996.
25. M. Hoefer and T. Kesselheim. Secondary spectrum auctions for symmetric and submodular bidders. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC), 2012. To appear.
26. M. Hoefer, T. Kesselheim, and B. Vöcking. Approximation algorithms for secondary spectrum auctions. In Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 177-186, 2011.
27. T. Kesselheim. A constant-factor approximation for wireless capacity maximization with power control in the SINR model. In Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1549-1559, 2011.
28. T. Kesselheim. Approximation algorithms for wireless link scheduling with flexible data rates. CoRR, abs/1205.1331, 2012.
29. T. Kesselheim and B. Vöcking. Distributed contention resolution in wireless networks. In Proceedings of the 24th International Symposium on Distributed Computing (DISC), pages 163-178, 2010.
30. F. Kuhn, N. Lynch, C. Newport, R. Oshman, and A. Richa. Broadcasting in unreliable radio networks. In Proceedings of the 29th ACM Symposium on Principles of Distributed Computing (PODC), pages 336-345, 2010.
31. T. Moscibroda and R. Wattenhofer. The complexity of connectivity in wireless networks. In Proceedings of the 25th Conference of the IEEE Communications Society (INFOCOM), pages 1-13, 2006.
32. A. Pakes. Some conditions for ergodicity and recurrence of markov chains. Operations Research, pages 1058-1061, 1969.
33. G. Pei and V. A. Kumar. Low-complexity scheduling for wireless networks. In Proceedings of the 13th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), 2012.
34. Y. Rabani and E. Tardos. Distributed packet switching in arbitrary networks. In Proceedings of the 28th annual ACM symposium on Theory of computing (STOC), pages 366-375, 1996.
35. P. Raghavan and E. Upfal. Stochastic contention resolution with short delays. SIAM Journal on Computing, 28(2):709-719, 1999.
36. A. Richa, C. Scheideler, S. Schmid, and J. Zhang. A jamming-resistant MAC protocol for multi-hop wireless networks. In Proceedings of the 24th International Symposium on Distributed Computing (DISC), pages 179-193, 2010.
37. C. Scheideler and B. Vöcking. From static to dynamic routing: Efficient transformations of store-and-forward protocols. SIAM Journal on Computing, 30(4):1126-1155, 2000.
38. 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, 37(12):1936-1948, 1992.