Weitere Artikel dieser Ausgabe durch Wischen aufrufen
Supported by Natural Science Foundation of Jiangsu Province of China (No. BK20151399) and NSFC 11771080.
This paper considers the channel assignment problem in mobile communications systems. Suppose there are many base stations in an area, each of which demands a number of channels to transmit signals. The channels assigned to the same base station must be separated in some extension, and two channels assigned to two different stations that are within a distance must be separated in some other extension according to the distance between the two stations. The aim is to assign channels to stations so that the interference is controlled within an acceptable level and the spectrum of channels used is minimized. This channel assignment problem can be modeled as the multiple t-separated \(L(j_1,j_2,\ldots ,j_m)\)-labeling of the interference graph. In this paper, we consider the case when all base stations demand the same number of channels. This case is referred as n-fold t-separated \(L(j_1,j_2,\ldots ,j_m)\)-labeling of a graph. This paper first investigates the basic properties of n-fold t-separated \(L(j_1,j_2,\ldots ,j_m)\)-labelings of graphs. And then it focuses on the special case when \(m=1\). The optimal n-fold t-separated L(j)-labelings of all complete graphs and almost all cycles are constructed. As a consequence, the optimal n-fold t-separated \(L(j_1,j_2,\ldots ,j_m)\)-labelings of the triangular lattice and the square lattice are obtained for the case \(j_1=j_2=\cdots =j_m\). This provides an optimal solution to the corresponding channel assignment problems with interference graphs being the triangular lattice and the square lattice, in which each base station demands a set of n channels that are t-separated and channels from two different stations at distance at most m must be \(j_1\)-separated. We also study a variation of n-fold t-separated \(L(j_1,j_2,\ldots ,j_m)\)-labeling, namely, n-fold t-separated consecutive \(L(j_1,j_2,\ldots ,j_m)\)-labeling. And present the optimal n-fold t-separated consecutive L(j)-labelings of all complete graphs and cycles.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
Audhya GK, Sinha K, Ghosh SC, Sinha BP (2011) A survey on the channel assignment problem in wireless networks. Wirel Commun Mob Comput 11:583–609 CrossRef
Calamoneri T (2011) The L(h, k)-labelling problem: an updated survey and annotated bibliography. Comput J 54(8):1344–1371 CrossRef
Díaz IM, Zabala P (1999) A generalization of the graph coloring problem. Investig Oper 8(1–3):167–184
Ghosh SC, Sinha BP, Das N (2003) Channel assignment using genetic algorithm based on geometric. IEEE Trans Veh Technol 52(4):860–875 CrossRef
Hale WK (1980) Frequency assignment: theory and applications. Proc IEEE 68:1497–1514 CrossRef
Janssen J (2002) Channel assignment and graph labeling. In: Handbook of wireless networks and mobile computing. John Wiley & Sons, Inc., pp 95–117
Khanna S, Kumaran K (1998) On wireless spectrum estimation and generalized graph coloring. In: Proceedings of IEEE INFOCOM98,
Thevenin S, Zufferey N, Potvin J-Y (2016) Graph multi-coloring for a job scheduling application. Discrete Appl Math. https://doi.org/10.1016/j.dam.2016.05.023 MATH
- Channel assignment problem and n-fold t-separated -labeling of graphs
- Springer US
Neuer Inhalt/© ITandMEDIA