Real number channel assignments for lattices

SIAM Journal on Discrete Mathematics

Volumn 22, Issue 3, 2008, Pages 996-1021

  Griggs, Jerrold R ^a   Jin, Xiaohua Teresa ^a  

^a UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

Channel assignment; Generalized graph coloring; Planar lattice graphs

Indexed keywords

CHANNEL ASSIGNMENT; COMPLETE FUNCTIONS; GENERALIZED GRAPH COLORING; HEXAGONAL LATTICE; LABELINGS; MAXIMUM DEGREE; MULTIPLE LEVELS; PIECE-WISE LINEAR FUNCTIONS; PLANAR LATTICE GRAPHS; PLANAR NETWORKS; REAL NUMBER; REGULAR ARRAY; REGULAR LATTICE; SQUARE LATTICES; TRIANGULAR LATTICE;

COLORING; ELECTRON TRANSITIONS; LABELS; MOBILE TELECOMMUNICATION SYSTEMS; NUMBER THEORY; PIECEWISE LINEAR TECHNIQUES; TRANSMITTERS;

GRAPH THEORY;

EID: 69249241182     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/060650982     Document Type: Article

References (36)

1. A. A. Bertossi and M. A. Bonuccelli, Code assignment for hidden terminal interference avoidance in multihop packet radio networks, IEEE/ACM Trans. Networking, 3 (1995), pp. 441-449.
2. A. A. Bertossi, C. M. Pinotti, R. Rizzi, and A. M. Shende, Channel assignment in honeycomb networks, in Proceedings of the 8th Italian Conference on Theoretical Computer Science (ICTCS2003), Lecture Notes in Comput. Sci. 2841, Springer-Verlag, Berlin, 2003, pp. 150-162.
3. A. A. Bertossi, C. M. Pinotti, and R. B. Tan, Channel assignment with separation for interference avoidance in wireless networks, IEEE Trans. Parallel Distrib. Sys., 14 (2003), pp. 222-235.
4. R. E. Broadhurst, W. J. Shanahan, and M. D. Steffen, "We're sorry, you're outside the coverage area, " UMAP J., 21 (2000), pp. 327-342.
5. T. Calamoneri, Exact solution of a class of frequency assignment problems in cellular networks and other regular grids (extended abstract), in Proceedings of the 8th Italian Conference on Theoretical Computer Science (ICTCS2003), Lecture Notes in Comput. Sci. 2841, Springer-Verlag, Berlin, 2003, pp. 163-173.
6. T. Calamoneri, Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks and Other Regular Grids, preprint, 2004.
7. T. CALAMONERI, The L (h, k) -labelling Problem: An Annotated Bibliography, online survey updated and posted at http://www.dsi.uniromal.it/- calamo/PDF-FILES/survey.pdf, 2006.
8. T. Calamoneri, A. Pelc, and R. Petreschi, Labeling trees with a condition at distance two, Discrete Math., 306 (2006), pp. 1534-1539.
9. A. Dubhashi, M. V. S. Sashanka, A. Pati, S. Ramaprasad, and A. M. Shende, Channel assignment for wireless networks modelled as d-dimensional square grids, in Proceedings of the 4th International Workshop on Distributed Computing, Lecture Notes in Comput. Sci. 2571, Springer-Verlag, Berlin, 2002, pp. 130-141.
10. D. J. Durand, J. M. Kline, and K. M. Woods, Groovin' with the big band (width), UMAP J., 21 (2000), pp. 357-368.
11. A. Gamst, Homogeneous distribution of frequencies in a regular hexagonal cell system, IEEE Trans. Vehic. Tech., 31 (1982), pp. 132-144.
12. J. P. Georges and D. W. Mauro, Labeling trees with a condition at distance two, Discrete Math., 269 (2003), pp. 127-148.
13. J. P. Georges and D. W. Mauro, On regular graphs optimally labeled with a condition at distance two, SIAM J. Discrete Math., 17 (2003), pp. 320-331.
14. J. Goodwin, D. Johnston, and A. Marcus, Radio channel assignments, UMAP J., 21 (2000), pp. 369-378.
15. J. R. Griggs, Author/Judge's commentary: The outstanding channel assignment papers, UMAP J., 21 (2000), pp. 379-386.
16. J. R. Griggs and X. T. Jin, Optimal channel assignments for lattices with conditions at distance two (extended abstract), in Proceedings of the 5th IEEE International Parallel and Distributed Processing Symposium (International Workshop on Wireless, Mobile, and Ad Hoc Networks), extended abst., 2005.
17. J. R. Griggs and X. T. Jin, Real number graph labellings with distance conditions, SIAM J. Discrete Math., 20 (2006), pp. 302-327.
18. J. R. Griggs and X. T. Jin, Recent progress in mathematics and engineering on optimal graph labellings with distance conditions, J. Comb. Optim., 14 (2007), pp. 249-257.
19. J. R. GRIGGS and X. T. Jin, Real number labellings for paths and cycles, Internet Math., to appear.
20. J. R. Griggs and D. Král', Graph labellings with variable weights, a survey, Discrete Appl. Math., to appear.
21. J. R. Griggs and R. K. Yeh, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math., 5 (1992), pp. 586-595.
22. W. K. Hale, Frequency assignment: Theory and applications, Proc. IEEE, 68 (1980), pp. 1497-1514.
23. X. T. Jin, Real Number Graph Labeling with Distance Conditions, Ph. D. Dissertation, University of South Carolina, Columbia, SC, 2005.
24. X. T. Jin and R. K. Yeh, Graph distance-dependent labeling related to code assignment in computer networks, Naval Res. Logis., 52 (2005), pp. 159-164.
25. D. Král', The channel assignment problem with variable weights, SIAM J. Discrete Math., 20 (2006), pp. 690-704.
26. D. Král' and P. škoda, Bounds for the real number graph labellings and application to labellings of the triangular lattice, SIAM J. Discrete Math., submitted.
27. A. Kramling, M. Scheibenbogen, and B. Walke, Dynamic channel allocation in wireless ATM networks, Wireless Netw., 2 (2000), pp. 381-398.
28. R. A. Leese, A unified approach to the assignment of radio channels on a regular hexagonal grid, IEEE Trans. Vehic. Tech., 46 (1997), pp. 968-979.
29. J. Mintz, A. Newcomer, and J. C. Price, Channel assignment model: The span without a face, UMAP J., 21 (2000), pp. 311-326.
30. B. S. Panda, M. Kumar, and S. K. Das, Optimal schemes for channel assignment problem in wireless networks modeled as 2-dimensional square grids, in Proceedings of the 6th International Workshop on Distributed Computing, Lecture Notes in Comput. Sci. 3326, Springer-Verlag, Berlin, 2004, pp. 424-434.
31. S. Ramanathan, A unified framework and algorithm for channel assignment in wireless networks, Wireless Netw., 5 (1999), pp. 81-94.
32. F. S. Roberts, T-Colorings of graphs: Recent results and open problems, Discrete Math., 93 (1991), pp. 229-245.
33. F. S. Roberts, Working Group Agenda, DIMACS/DIMATIA/Renyi Working Group on Graph Colorings and Their Generalizations, posted at http://dimacs.rutgers. edu/Workshops/GraphColor/main.html, 2003.
34. C. Rui, X. Baoxin, and Z. Ruidi, Utilize the limited frequency resources efficiently, UMAP J., 21 (2000), pp. 343-356.
35. J. van den Heuvel, R. A. Leese, and M. A. Shepherd, Graph labeling and radio channel assignment, J. Graph Theory, 29 (1998), pp. 263-283.
36. D. Zhu and A. Shi, Optimal Channel Assignments, preprint, 2001.