A Mobile Frequency Allocation Algorithm Based on the Graph Theory
- L. Yang, Y.H. Yu
- Corresponding Author
- L. Yang
Available Online June 2015.
- https://doi.org/10.2991/cisia-15.2015.2How to use a DOI?
- frequency configuration; graph theory; vertex coloring; same frequency interference
- By using the theory of point coloring in graph theory, the algorithm in this article converts the relationship among base stations to the relationship between the vertices and lines in a graph, performs the point coloring for the great connecting diagram on the basis of the thought of the wheel diagram, and then determines whether to complete frequency allocation by certain constraint conditions. In additional, we consider a mapping relation among the sets of vertices and frequency points, so as to reduce the same frequency interference among the cells and improve the quality of communication. Based on the analysis on the example of Yanji, the results show that this optimizing mobile frequency allocation method can effectively improve the robustness of the communication, decrease the same frequency interference between the base stations, and achieve the improvement of communication quality.
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - L. Yang AU - Y.H. Yu PY - 2015/06 DA - 2015/06 TI - A Mobile Frequency Allocation Algorithm Based on the Graph Theory BT - International Conference on Computer Information Systems and Industrial Applications PB - Atlantis Press SN - 2352-538X UR - https://doi.org/10.2991/cisia-15.2015.2 DO - https://doi.org/10.2991/cisia-15.2015.2 ID - Yang2015/06 ER -