Scheduling multicast transmissions under SINR constraints

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

Volumn 6451 LNCS, Issue , 2010, Pages 47-61

  Erlebach, Thomas ^a   Grant, Tom ^a  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPH ALGORITHMS; MOBILE AD HOC NETWORKS; SCHEDULING; SIGNAL INTERFERENCE; SIGNAL TO NOISE RATIO; WIRELESS SENSOR NETWORKS; AD HOC NETWORKS; MULTICASTING; SCHEDULING ALGORITHMS; SPURIOUS SIGNAL NOISE;

COMPETITIVE RATIO; DETERMINISTIC ALGORITHMS; MULTICAST SCHEDULING; MULTICAST TRANSMISSIONS; ON-LINE ALGORITHMS; SIGNAL TO INTERFERENCE PLUS NOISE RATIO; THROUGHPUT MAXIMISATION; WIRELESS TRANSMISSIONS;

MULTICASTING; WIRELESS AD HOC NETWORKS;

EID: 85037531262     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16988-5_5     Document Type: Conference Paper

References (15)

1. Andrews, M., Dinitz, M.: Maximizing capacity in arbitrary wireless networks in the SINR model: Complexity and game theory. In: INFOCOM, pp. 1332-1340 (April 2009)
2. Avin, C., Lotker, Z., Pignolet, Y.-A.: On the power of uniform power: Capacity of wireless networks with bounded resources. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 373-384. Springer, Heidelberg (2009)
3. Fanghänel, A., Geulen, S., Hoefer, M., Vöcking, B.: Online capacity maximization in wireless networks. In: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 92-99. ACM, New York (2010)
4. Fanghänel, A., Kesselheim, T., Räcke, H., Vöcking, B.: Oblivious interference scheduling. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing (PODC), pp. 220-229. ACM, New York (2009)
5. Fanghänel, A., Kesselheim, 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)
6. Goussevskaia, O., Halldórsson, M., Wattenhofer, R., Welzl, E.: Capacity of arbitrary wireless networks. In: INFOCOM, pp. 1872-1880 (April 2009)
7. Goussevskaia, O., Moscibroda, T., Wattenhofer, R.: Local Broadcasting in the Physical Interference Model. In: ACM SIGACT-SIGOPT International Workshop on Foundations of Mobile Computing (DialM-POMC), Toronto, Canada (August 2008)
8. Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in geometric SINR. In: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc), pp. 100-109. ACM, New York (2007)
9. Gupta, P., Kumar, P.: The capacity of wireless networks. IEEE Transactions on Information Theory 46(2), 388-404 (2000)
10. Halldórsson, M.: Wireless Scheduling with Power Control. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 368-380. Springer, Heidelberg (2009), http://www.hr.is/faculty/mmh/papers/ESAfull.pdf
11. Halldórsson, M., Wattenhofer, R.: Wireless Communication is in APX. In: Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP). LNCS, vol. 5555, pp. 525-536. Springer, Heidelberg (2009)
12. Marathe, M.V., Breu, H., Hunt III, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25, 59-68 (1995)
13. Moscibroda, T.: The worst-case capacity of wireless sensor networks. In: Proceedings of the 6th International Conference on Information Processing in Sensor Networks (IPSN), pp. 1-10. ACM, New York (2007)
14. Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: INFOCOM (2006)
15. Resta, G., Santi, P.: Latency and capacity optimal broadcasting in wireless multihop networks. In: ICC, pp. 1-6. IEEE, Los Alamitos (2009)