Abstract
In this paper, we consider frequency assignment for orthogonal frequency division multiple access-based cellular networks. We develop a new framework for the mathematical modeling of the frequency assignment problem, which aims at suppressing multi-links interference and enhancing spectral efficiency. The concept of incidence coloring from modern graph theory is utilized to recast the original frequency assignment problem and guide the solution from graph theory perspective. In addition, optimal position of relay stations in a hierarchical cluster based two-hop cellular networks is investigated, and proposes an efficient frequency assignment scheme based on the incidence coloring. System-level simulation results demonstrate that the frequency assignment scheme can effectively mitigate inter-cell interference and improve signal-to-interference-plus-noise ratio. Compared with existing frequency assignment schemes, better coverage performance is obtained and throughput of cell-edge mobile stations is greatly improved.
Access this article
Rent this article via DeepDyve
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11277-014-1891-z/MediaObjects/11277_2014_1891_Fig1_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11277-014-1891-z/MediaObjects/11277_2014_1891_Fig2_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11277-014-1891-z/MediaObjects/11277_2014_1891_Fig3_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11277-014-1891-z/MediaObjects/11277_2014_1891_Fig4_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11277-014-1891-z/MediaObjects/11277_2014_1891_Fig5_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11277-014-1891-z/MediaObjects/11277_2014_1891_Fig6_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11277-014-1891-z/MediaObjects/11277_2014_1891_Fig7_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11277-014-1891-z/MediaObjects/11277_2014_1891_Fig8_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11277-014-1891-z/MediaObjects/11277_2014_1891_Fig9_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11277-014-1891-z/MediaObjects/11277_2014_1891_Fig10_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs11277-014-1891-z/MediaObjects/11277_2014_1891_Fig11_HTML.gif)
Similar content being viewed by others
References
Le, L., & Hossain, E. (2007). Multihop cellular networks: Potential gains, research challenges, and a resource allocation framework. IEEE Communications Magazine, 45(9), 66–73.
Rahman, M., & Yanikomeroglu, H. (2010). Enhancing cell-edge performance: A downlink dynamic interference avoidance scheme with inter-cell coordination. IEEE Transactions on Wireless Communications, 9(4), 1414–1425.
Lin, S., Sheen, W., & Huang, C. (2009). Downlink performance and optimization of relay-assisted cellular networks. In IEEE conference on wireless communications and networking (pp. 1–6).
Hill, J. (1978). Spectrum management technique. Proceedings of the IEEE, 66(9), 192–193.
Hale, W. (1980). Frequency assignment: Theory and applications. Proceedings of the IEEE, 68(12), 1497–1514.
Sivarajan, K., McEliece, R., & Ketchum, J. (1989). Channel assignment in cellular radio. In The 39th IEEE vehicular technology conference (pp. 846–850).
Liu, D. (1996). T-graphs and the channel assignment problem. Discrete Mathematics, 161(3), 197–205.
Raychaudhuri, A. (1994). Further results on T-coloring and frequency assignment problems. SIAM Journal on Discrete Mathematics, 7(4), 605–606.
Chang, G., & Kuo, D. (1996). The L(2,1)-labeling problem on graphs. SIAM Journal on Discrete Mathematics, 9(2), 309–316.
Jha, P. (2001). Optimal L(2, 1)-labeling of strong products of cycles: Transmitter frequency assignment. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 48(4), 498–500.
Iridon, M., Matula, D., & Yang, C. (2001). A graph theoretic approach for channel assignment in cellular networks. Wireless Networks, 7(6), 567–574.
Sharma, P., & Chaudhari, N. (2011). A graph coloring approach for channel assignment in cellular network via propositional satisfiability. In IEEE conference on emerging trends in networks and computer communications (pp. 23–26).
Sharma, P., & Chaudhari, N. (2012). Channel assignment problem in cellular network and its reduction to satisfiability using graph k-colorability. In 7th IEEE conference on industrial electronics and application (pp. 1734–1737).
Chang, R. Y., Zhifeng, T., & Kuo, C. (2009). Multicell OFDMA downlink resource allocation using a graphic framework. IEEE Transaction on Vehicular Technology, 58(7), 3494–3507.
Tamura, H., Watanabe, K., Sengoku, M., & Shinoda, S. (2004). A channel assignment problem in multihop wireless networks and graph theory. Journal of Circuits, Systems, and Computers, 13(2), 375–385.
Bhobe, A., & Perini, P. (2001). An overview of smart antenna technology for wireless communication. In IEEE proceedings aerospace conference (pp. 875–883).
Wang, L., Huang, S., & Tseng, Y. (2005). Interference analysis and resource allocation for TDD-CDMA systems to support asymmetric services by using directional antennas. IEEE Transactions on Vehicular Technology, 54(3), 1056–1069.
Yi, S., Pei, Y., & Kalyanaraman, S. (2003). On the capacity improvement of ad hoc wireless networks using directional antennas. In Proceedings of the 4th ACM international symposium on mobile ad hoc networking and computing (pp. 108–116).
Chan, G. (1992). Effects of sectorization on the spectrum efficiency of cellular radio systems. IEEE Transactions on Vehicular Technology, 41(3), 217–225.
Hu, H., Yanikomeroglu, H., Falconer, D., & Periyalwar, S. (2004). Range extension without capacity penalty in cellular networks with digital fixed relays. In IEEE global telecommunications conference (pp. 3053–3057).
Li, P., Rong, M., Liu, T., Xue, Y., Yu, D., & Schulz, E. (2006). Reuse partitioning based frequency planning for relay enhanced cellular system with NLOS BS-Relay links. In IEEE 64th vehicular technology conference (pp. 1–5).
Wamser, F., Mittelstadt, D., & Staehle, D. (2010). Soft frequency reuse in the uplink of an ofdma network. In IEEE vehicular technology conference (pp. 1–5).
Guan, L., Zhang, J., Li, J., Liu, G., & Zhang, P. (2007). Spectral efficient frequency allocation scheme in multihop cellular network. In IEEE vehicular technology conference (pp. 1446–1450).
Cho, K., Lee, W., Yoon, D., Jin, H., Kim, K., & Park, S. (2008). Frequency allocation scheme for interference avoidance in cellular system with fixed relay. In IEEE the third international conference on digital telecommunications (pp. 130–134).
Lee, W., Nguyen, M., Jeong, J., Keum, B., & Lee, H. (2008). An orthogonal resource allocation algorithm to improve the performance of OFDMA based cellular wireless systems using relays. In IEEE consumer communications and networking conference (pp. 917–921).
Qu, L., Wang, X., Wang, Y., & Liao, J. (2010). Performance evaluation of frequency planning in a novel cellular architecture based on sector relay. In IEEE vehicular technology conference (pp. 1–5).
Lee, J., & Yanikomeroglu, H. (2010). A novel architecture for multi-hop wimax systems: shared relay segmentation. In IEEE wireless communications and networking conference (pp. 1–6).
Cho, J., & Haas, Z. (2004). On the throughput enhancement of the downstream channel in cellular radio networks through multihop relaying. IEEE Journal on Selected Areas in Communications, 22(7), 1206–1219.
Brualdi, R., & Quinn Massey, J. (1993). Incidence and strong edge colorings of graphs. Discrete Mathematics, 122(3), 51–58.
Bondy, J., & Murty, U. (1976). Graph theory with applications. London: MacMillan.
Yun, S., Park, S., Lee, Y., Alsusa, E., & Kang, C. (2005). Spectrum efficient region-based resource allocation with fractional loading for fh-ofdma cellular systems. Electronics Letters, 41(13), 752–754.
Qu, L. (2010). Performance evaluation of frequency planning in a novel cellular architecture based on sector relay. Master’s Thesis of Beijing University of Posts and Telecommunications.
Acknowledgments
This work described in this paper was supported by National Nature Science Foundation of China (No. 71231004 and 61004086) and the Specialized Research Fund for the Doctoral Program of Higher Education (No. J2014HGBZ0189).
Author information
Authors and Affiliations
Corresponding author
Appendix: Mathematical Analysis and Theoretical Proof
Appendix: Mathematical Analysis and Theoretical Proof
In the new architecture, the cellular networks have been divided into regular triangles lattice, which is considered to be a graph whose nodes are the points of the lattice, and edges exist precisely between neighboring points.
Lemma 1
[29] Let \(G\) be a graph with maximum degree\(\Delta (G)\). Then, \(\chi _i (G)\ge \Delta (G)+1\).
For a vertex \(v\) of degree \(\Delta (G)\), we must use \(\Delta (G)\) colors for coloring \(I_v \) and at least one additional color for coloring \(A_v \).
Theorem 1
Let \(G\) be a triangular lattice. Then, \(\chi _i (G)=7\).
Proof
By Lemma 1, we know that \(\chi _i (G)\ge \Delta (G)+1=7\). Thus, we only need to give a 7-incidence coloring \(\sigma \) of \(G\). Let \(G\) be a triangular lattice as shown in Fig. 12 and we fix a vertex to be the original point \(O(0,0)\) and impose a \(XOY\) lattice coordinates to identify the vertices. Let the center vertex \(O(0,0)\) in a triangular lattice be the origin and vertex \(v\) be any other vertex in a triangular lattice with coordinates \((x,y)\), the coordinates of the six incidences of vertex \(v\) in a triangular lattice are \((x,y+1),(x+1,y),(x+1,y-1),(x,y-1),(x-1,y)\) and \((x-1,y+1)\), respectively, as shown in Fig. 12. We then define \(\phi (x,y)\equiv (3x+y)\mathrm{mod} 7\), where \((x,y)\) are the coordinates of any vertex. Let \(\sigma \) be a \((\Delta +1)\)-incidence coloring with color set \(C=\left\{ {1,2,\ldots ,\Delta +1} \right\} \), and we divided the color set \(C\) into seven subsets \(C_0 ,C_1 ,\ldots ,C_6 \), each subset includes \(\Delta =6\) colors as follows: \(C_0 =\{1,2,3,4,5,6\},C_1 =\{3,5,2,7,6,4\},C_2 =\{2,6,5,1,4,7\},C_3 =\{5,4,6,3,7,1\},C_4 =\{6,7,4,2,1,3\}\), \(C_5 =\{4,1,7,5,3,2\}\), \(C_6 =\{7,3,1,6,2,5\}\). \(\square \)
Let \(\sigma :I\rightarrow C\) and
Then, the incidence colors with respect to vertex \(v_{(x,y)} \) can be obtained by the following formula:
\(\phi (x,y)=i\;(i=0,1,2,3,4,5,6)\) and \(\sigma (I_{v_{(x,y)} } )=C_i \;.\) It is easy to see that the coloring above is a proper 7-incidence coloring of \(G\).
Rights and permissions
About this article
Cite this article
Zuo, C., Xiong, C., Zhang, H. et al. Incidence Coloring-Assisted Frequency Assignment in Two-Hop OFDMA-based Cellular Networks. Wireless Pers Commun 79, 861–876 (2014). https://doi.org/10.1007/s11277-014-1891-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11277-014-1891-z