Algorithms for scheduling with power control in wireless networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6595 LNCS, Issue , 2011, Pages 252-263

  Tonoyan, Tigran ^a  

^a UNIVERSITY OF GENEVA MEDICAL SCHOOL   (Switzerland)

Author keywords

algorithm; scheduling; wireless network

Indexed keywords

FOLLOWING PROBLEM; METRIC SPACES; MINIMUM TIME; NETWORK NODE;

POWER CONTROL; SCHEDULING ALGORITHMS; SIGNAL DETECTION; SIGNAL INTERFERENCE; WIRELESS NETWORKS; ALGORITHMS; APPROXIMATION ALGORITHMS; SCHEDULING; SPURIOUS SIGNAL NOISE;

APPROXIMATION ALGORITHMS; SCHEDULING ALGORITHMS;

EID: 79953821971     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-19754-3_25     Document Type: Conference Paper

References (18)

1. Andrews, M., Dinitz, M.: Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory. In: 29th Annual IEEE Conference on Computer Communications, INFOCOM (2009)
2. Avin, C., Emek, Y., Kantor, E., Lotker, Z., Peleg, D., Roditty, L.: SINR Diagrams: Towards Algorithmically Usable SINR Models of Wireless Networks. In: 28th Annual Symposium on Principles of Distributed Computing, PODC (2009)
3. Avin, C., Lotker, Z., Pasquale, F., Pignolet, Y.-A.: A note on uniform power connectivity in the SINR model. In: 5th International Workshop on Algorithmic Aspects of Wireless Sensor Networks, ALGOSENSORS (2009)
4. Chafekar, D., Kumar, V., Marathe, M., Parthasarathi, S., Srinivasan, A.: Crosslayer Latency Minimization for Wireless Networks using SINR Constraints. In: ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc (2007)
5. Fanghänel, A., Keßelheim, T., Räcke, H., Vöking, B.: Oblivious interference scheduling. In: Proc. 28th Symposium on Principles of Distributed Computing, PODC (2009)
6. Fanghänel, A., Keßelheim, T., Vöcking, B.: Improved algorithms for latency minimization in wireless networks. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 447-458. Springer, Heidelberg (2009)
7. Gronkvist, J., Hansson, A.: Comparison between Graph-Based and Interference-Based STDMA scheduling. In: ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc (2001)
8. Halldórsson, M.M.: Wireless scheduling with power control. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 361-372. Springer, Heidelberg (2009)
9. Halldórsson, M.M.: Wireless Scheduling with Power Control, http://arxiv.org/abs/1010.3427
10. Halldórsson, M.M., Wattenhofer, R.: Wireless communication is in APX. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 525-536. Springer, Heidelberg (2009)
11. Heinonen, J.: Lectures on Analysis on Metric Spaces. Springer, Heidelberg (1999)
12. Hochbaum, D.S.: Efficient bounds for the Stable Set, Vertex Cover and Set Packing problems. Diskrete Applied Mathematics 6 (1983)
13. Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for Unit Disk Graphs. Networks 25 (1995)
14. Moscibroda, T., Oswald, Y.A., Wattenhofer, R.: How optimal are wireless scheduling protocols? In: 26th Annual IEEE Conference on Computer Communications, INFOCOM (2006)
15. Moscibroda, T., Wattenhofer, R.: The Complexity of Connectivity in Wireless Networks. In: 26th Annual IEEE Conference on Computer Communications, INFOCOM (2006)
16. Moscibroda, T., Wattenhofer, R., Weber, Y.: Protocol design beyond Graph-Based models. In: Hot Topics in Networks, HotNets (2006)
17. Moscibroda, T., Wattenhofer, R., Zollinger, A.: Topology Control meets SINR: The Scheduling Complexity of Arbitrary Topologies. In: ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc (2006)
18. Szekeres, G., Wilf, H.S.: An Inequality for the Chromatic Number of a Graph. Journal of Combinatorial Theory 4(1) (1968)