Link scheduling in local interference models

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

Volumn 5389 LNCS, Issue , 2008, Pages 57-71

  Katz, Bastian ^a   Völker, Markus ^a   Wagner, Dorothea ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RESULTS; CONCURRENT TRANSMISSIONS; GRAPH-BASED; INTERFERENCE MODELS; LINK SCHEDULING; LOCAL COLORINGS; LOWER BOUNDS; NON LOCALS; SCHEDULING PROTOCOLS; SIGNAL-TO-NOISE-PLUS-INTERFERENCE RATIOS;

APPROXIMATION ALGORITHMS; CONTROL THEORY; RADIO BROADCASTING; RADIO TRANSMISSION; REAL TIME SYSTEMS; SCHEDULING; SENSOR NETWORKS; SENSORS; SIGNAL TO NOISE RATIO; TRANSMISSIONS; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 58849096686     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92862-1_6     Document Type: Conference Paper

References (20)

1. Schmidt, S., Wattenhofer, R.: Algorithmic Models for Sensor Networks, In: 20th IEEE Int. Parallel and Distributed Processing Symposium (IPDPS 2006), pp. 450-459 (2007)
2. Rappaport, T.: Wireless Communications: Principles and Practices. Prentice-Hall, Englewood Cliffs (1996)
3. Gupta, P., Kumar, P.R.: The Capacity of Wireless Networks. IEEE Transactions on Information Theory 46(2), 388-404 (2000)
4. Moscibroda, T., Wattenhofer, R., Weber, Y.: Protocol Design Beyond Graph-Based Models. In: Proc. of the 5th Workshop on Hot Topics in Networks (HotNets) (2006)
5. Hunt, H., Marathe, M., Radhakrishnan, V., Ravi, S., Rosenkrantz, D., Stearns, R.: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. Journal of Algorithms 26 (1998)
6. Krumke, S.O., Marathe, M., Ravi, S.S.: Models and approximation algorithms for channel assignment in radio networks. Wireless Networks 6, 575-584 (2000)
7. Björklund, P., Värbrand, P., Yuan, D.: A Column Generation Method for Spatial TDMA Scheduling in Ad hoc Networks. Ad Hoc Networks 2(4), 4005-4418 (2004)
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 (MOB1HOC 2007), pp. 100-109. ACM Press, New York (2007)
9. Locher, T., von Rickenbach, P., Wattenhofer, R.: Sensor Networks Continue to Puzzle: Selected Open Problems. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds.) ICDCN 2008. LNCS, vol. 4904, pp. 25-38. Springer Heidelberg (2008)
10. Hajek, B., Sasaki, G.: Link Scheduling in Polynomial Time. IEEE Transactions on Information Theory 34(5), 910-917 (1988)
11. Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: End-to-end packet scheduling in wireless ad-hoc networks. In: Proc. of the 15th annual ACM-SIAM symposium on Discrete Algorithms (SODA 2004), pp. 1021-1030 (2004)
12. Moscibroda, T., Wattenhofer, R.: Coloring Unstructured Radio Networks. In: Proc. of the 17th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA 2005) (2005)
13. Behzad, A., Rubin, I.: On the Performance of Graph-based Scheduling Algorithms for Packet Radio Networks. In: Proc. of the IEEE Global Telecommunications Conference (GLOBECOM) (2003)
14. Grönkvist, J., Hansson, A.: Comparison Between Graph-Based and Interference-Based STDMA Scheduling. In: Proc. of the 2nd ACM International Symposium on Mobile Ad Hoc Networking & Computing (MOBIHOC), pp. 255-258 (2001)
15. Moscibroda, T., Wattenhofer, R.: The Complexity of Connectivity in Wireless Networks. In: Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2006) (2006)
16. Moscibroda, T., Oswald, Y.A., Wattenhofer, R.: How Optimal are Wireless Scheduling Protocols? In: Proceedings of the 26th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2007) (2007)
17. Linial, N.: Locality in Distributed Graph Algorithms. SIAM Journal on Computing 21, 193-201 (1992)
18. Naor, M., Stockmeyer, L.: What can be computed locally? SIAM Journal on Computing 24(6), 1259-1277 (1995)
19. Kuhn, F., Moscibroda, T., Wattenhofer, R.: The Price of Being Near-Sighted. In: Proc. of the 17th ACM-SIAM Symp. on Discrete Algorithms (SODA 2006) (2006)
20. Toth, L.F.: Minkowskian distribution of discs. Proceedings of the AMS 16(5), 999-1004 (1965)