New graph colouring algorithm for resource allocation in large-scale wireless networks
Authors:
- 1 August 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 233-238
Abstract
The vertex-colouring problem is a well-known classical problem in graph theory in which a colour is assigned to each vertex of the graph such that no two adjacent vertices have the same colour. The minimum vertex-colouring problem is known as NP-hard problem in an arbitrary graph. In this paper a graph colouring algorithm based on modified incidence matrix is proposed for resolving Physical Cell ID (PCI) allocation for large-scale femtocell deployment in LTE Telecommunication Networks. The proposed algorithm is not specified for neighbours only, but additionally can deal with neighbours of neighbours' objects due to telecommunication requirements. Our results show that by applying proper searching and assigning methods it is possible to achieve satisfactory results for resource allocation in large and complex networks such as resolving PCI allocation and conflict for large femtocells deployment in LTE Networks.Keywords
This publication has 6 references indexed in Scilit:
- A novel scheme to resolve PCI conflicts and assignment problems in LTE-femtocell networks2013
- A survey on interference management techniques in femtocell self-organizing networksJournal of Network and Computer Applications, 2013
- Distributed Graph Coloring for Self‐Organization in LTE NetworksJournal of Electrical and Computer Engineering, 2010
- LTE – The UMTS Long Term Evolution2009
- A Graph-Based Approach to Multi-Cell OFDMA Downlink Resource Allocation2008
- Estimation of Sparse Jacobian Matrices and Graph Coloring BlemsSIAM Journal on Numerical Analysis, 1983