Wireless scheduling with power control

ACM Transactions on Algorithms

Volumn 9, Issue 1, 2012, Pages

  Halldorsson, Magnus M ^a  

^a REYKJAVIK UNIVERSITY   (Iceland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; CAPACITY PROBLEMS; DOUBLING METRICS; EUCLIDEAN PLANES; GRAPH MODEL; LINK LENGTH; PHYSICAL MODEL; POLYLOGARITHMIC; POWER ASSIGNMENT; POWER SETTINGS; SCHEDULING PROBLEM; SIGNAL-TO-INTERFERENCE-PLUS-NOISE; TIME SLOTS; WIRELESS INTERFERENCE; WIRELESS LINK; WIRELESS SCHEDULING;

GEOMETRY; MODELS; POWER CONTROL; SCHEDULING; SIGNAL INTERFERENCE; SPURIOUS SIGNAL NOISE;

APPROXIMATION ALGORITHMS;

EID: 84865004967     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/2390176.2390183     Document Type: Article

References (40)

1. AKCOGLU, K., ASPNES, J., DASGUPTA, B., AND KAO, M.-Y. 2002. Opportunity-cost algorithms for combinatorial auctions. In Applied Optimization 74: Computational Methods in Decision-Making, Economics and Finance, E. J. Kontoghiorghes, B. Rustem, and S. Siokos, Eds., Kluwer Academic Publishers, 455-479.
2. ANDREWS, M. AND DINITZ, M. 2009. Maximizing capacity in arbitrary wireless networks in the sinr model: Complexity and game theory. In Proceedings of the 28th Annual IEEE Conference on Computer Communications (INFOCOM).
3. ASSOUAD, P. 1983. Plongements lipschitziens dans Rn. Soc. Math. France 111, 4, 429-448.
4. AULETTA, V., MOSCARDELLI, L., PENNA, P., AND PERSIANO, G. 2008. Interference games in wireless networks. In Proceedings of the 4th International Workshop on Internet and Network Economics (WINE). Lecture Notes in Computer Science Series, vol. 5385, 278-285.
5. AVIN, C., EMEK, Y., KANTOR, E., LOTKER, Z., PELEG, D., AND RODITTY, L. 2008. SNR diagrams: Towards algorithmically usable SINR models of wireless networks. In Proceedings of the 28th Annual ACMSIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC).
6. AVIN, C., LOTKER, Z., AND PIGNOLET, Y. A. 2009. On the power of uniform power: Capacity of wireless networks with bounded resources. In Proceedings of the 17th Annual European Symposium on Algorithms (ESA).
7. BRAR, G. S., BLOUGH, D. M., AND SANTI, P. 2008. The SCREAM approach for efficient distributed scheduling with physical interference in wireless mesh networks. In Proceedings of the 28th IEEE International Conference on Distributed Computing Systems (ICDCS 2008). 214-224.
8. CHAFEKAR, D., KUMAR, V., MARATHE, M., PARTHASARATHY, S., AND SRINIVASAN, A. 2007. Cross-layer latency minimization for wireless networks using SINR constraints. In Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc).
9. CLARKSON, K. 2005. Nearest-neighbor searching and metric space dimensions. In Nearest-Neighbor Methods for Learning and Vision: Theory and Practice, MIT Press.
10. COUTURE, M., BARBEAU, M., BOSE, P., CARMI, P., AND KRANAKIS, E. 2007. Location oblivious distributed unit disk graph coloring. In Proceedings of the 14th International Conference on Structural Information and Communication Complexity (SIROCCO). Springer-Verlag, 222-233.
11. ELBATT, T. A. AND EPHREMIDES, A. 2004. Joint scheduling and power control for wireless ad hoc networks. IEEE Trans. Wirel. Commun. 3, 1, 74-85.
12. ERLEBACH, T. AND GRANT, T. 2010. Scheduling multicast requests in the sinr model. In Proceedings of the 6th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS).
13. FANGHÄNEL, A., GEULEN, S., HOEFER, M., AND VÖCKING, B. 2010. Online capacity maximization in wireless networks. In Proceedings of the 22nd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA). 92-99.
14. FANGHÄNEL, A., KESSELHEIM, T., RÄCKE, H., AND VÖCKING, B. 2009a. Oblivious interference scheduling. In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing (PODC).
15. FANGHÄNEL, A., KESSELHEIM, T., AND VÖCKING, B. 2009b. Improved algorithms for latency minimization in wireless networks. In Proceedings of the 37th International Conference on Algorithms, Languages and Programming (ICALP).
16. FEJES TÓTH, G. 1972. Lagerungen in der Ebene, auf der Kugel und in Raum 2nd Ed. Springer-Verlag, Berlin.
17. GAO, Y., HOU, J. C., AND NGUYEN, H. 2008. Topology control for maintaining network connectivity and maximizing network capacity under the physical model. In Proceedings of the 27th Annual IEEE Conference on Computer Communications (INFOCOM).
18. GOUSSEVSKAIA, O., HALLDOŔSSON, M. M., WATTENHOFER, R., AND WELZL, E. 2009. Capacity of arbitrary wireless networks. In Proceedings of the 28th Annual IEEE Conference on Computer Communications (INFOCOM).
19. GOUSSEVSKAIA, O., MOSCIBRODA, T., AND WATTENHOFER, R. 2008. Local broadcasting in the physical interference model. In Proceedings of the 5th ACM SIGACT-SIGOPS International Workshop on Foundations of Mobile Computing.
20. GOUSSEVSKAIA, O., OSWALD, Y. A., AND WATTENHOFER, R. 2007. Complexity in geometric SINR. In Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 100-109.
21. GRÖNKVIST, J. AND HANSSON, A. 2001. Comparison between graph-based and interference-based STDMA scheduling. In Proceedings of the 2nd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 255-258.
22. GUPTA, P. AND KUMAR, P. R. 2000. The capacity of wireless networks. IEEE Trans. Inf. Theory 46, 2, 388-404.
23. HALLDÓRSSON, M. M. 2009. Wireless scheduling with power control. In Proceedings of the 17th European Symposium on Algorithms (ESA).
24. HALLDÓRSSON, M. M. AND MITRA, P. 2011. Wireless capacity with oblivious power in general metrics. In Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA).
25. HALLDÓRSSON, M. M. AND WATTENHOFER, R. 2009. Wireless communication is in APX. In Proceedings of the 37th International Conference on Algorithms, Languages and Programming (ICALP).
26. HEINONEN, J. 1999. Lectures on Analysis in Metric Spaces. Springer.
27. KATZ, B., VÖLKER, M., AND WAGNER, D. 2008. Link scheduling in local interference models. In Proceedings of the 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS). 57-71.
28. KESSELHEIM, T. 2011. 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).
29. LIPTON, R. J., AND TOMKINS, A. 1994. Online interval scheduling. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 302-311.
30. MAHESHWARI, R., JAIN, S., AND DAS, S. R. 2008. A measurement study of interference modeling and scheduling in low-power wireless networks. In Proceedings of the 6th International Conference on Embedded Networked Sensor Systems (SenSys). 141-154.
31. MOSCIBRODA, T. 2007. The worst-case capacity of wireless sensor networks. In Proceedings of the 6th International Conference on Information Processing in Sensor Networks (IPSN). 1-10.
32. MOSCIBRODA, T., OSWALD, Y. A., AND WATTENHOFER, R. 2007. How optimal are wireless scheduling protocols? In Proceedings of the 26th Annual IEEE Conference on Computer Communications (INFOCOM). 1433-1441.
33. MOSCIBRODA, T. AND WATTENHOFER, R. 2006. The complexity of connectivity in wireless networks. In Proceedings of the 25th Annual IEEE Conference on Computer Communications (INFOCOM).
34. MOSCIBRODA, T. AND WATTENHOFER, R. 2008. Coloring unstructured radio networks. Distrib. Comput. 21, 271-284.
35. MOSCIBRODA, T., WATTENHOFER, R., AND WEBER, Y. 2006a. Protocol design beyond graph-based models. In Proceedings of the 5th Workshop on Hot Topics in Networks (HotNets).
36. MOSCIBRODA, T., WATTENHOFER, R., AND ZOLLINGER, A. 2006b. Topology Control meets SINR: The scheduling complexity of arbitrary topologies. In Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc).
37. SCHEIDELER, C., RICHA, A. W., AND SANTI, P. 2008. An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model. In Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 91-100.
38. TONOYAN, T. 2011. Algorithms for scheduling with power control in wireless networks. In Proceedings of the TAPAS, A. Marchetti-Spaccamela and M. Segal, Eds., Lecture Notes in Computer Science Series, vol. 6595, Springer, 252-263.
39. WEISSTEIN, E.W. Circle packing. From MathWorld-AWolframWeb Resource. http://mathworld.wolfram.com/CirclePacking.html.
40. YE, Y. AND BORODIN, A. 2009. Elimination graphs. In Proceedings of the 37th International Conference on Algorithms, Languages and Programming (ICALP). 774-785.