Cellular telecommunications network
View Patent ↗A method of operating a cellular telecommunications network having a plurality of base stations, wherein each base station of the plurality of base stations has an operational parameter being one of a set of values, wherein the set includes k values, the method including defining a first graph comprising a first plurality of nodes and a first plurality of edges, wherein a node of the first plurality of nodes represents a first base station of the plurality of base stations, and an edge of the first plurality of edges represents a first neighboring relationship between two base stations of the plurality of base stations, wherein each edge of the first plurality of edges has an associated first weight value; partitioning the first graph into k sub-first graphs, each having a first subset of the plurality of nodes and a first subset of the plurality of edges, such as to minimize a first sum value of the first weight values of the first subset of the plurality of edges in all k sub-first graphs; calculating a first conflict value for the k sub-first graphs based on the first sum value; determining whether to initiate a change relating to the operating parameter to one or more base stations in the plurality of base stations based on the first conflict value.
1. A method of operating a cellular telecommunications network comprising a plurality of base stations, wherein each of the plurality of base stations has an operational parameter being one of a set of values, wherein the set includes k values, the method comprising:
defining a first graph comprising a first plurality of nodes and a first plurality of edges, wherein a node of the first plurality of nodes represents a first base station of the plurality of base stations, and an edge of the first plurality of edges represents a first neighboring relationship between two base stations of the plurality of base stations, wherein each edge of the first plurality of edges has an associated first weight value;
partitioning the first graph into a first set of sub-graphs, wherein the first set of sub-graphs includes k sub-graphs, each having a subset of the first plurality of nodes and a subset of the first plurality of edges, such as to minimize a first sum value of all first weight values associated with each edge of each subset of the first plurality of edges in all sub-graphs of the first set of sub-graphs;
calculating a first conflict value based on the first sum value; and
initiating a change relating to the operational parameter to one or more base stations in the plurality of base stations if the first conflict value satisfies a condition.
2. A method as claimed in claim 1 , further comprising:
partitioning the first graph into a second set of sub-graphs, wherein the second set of sub-graphs includes m sub-graphs, each having a subset of the first plurality of nodes and a subset of the first plurality of edges, such as to minimize a second sum value of the first weight values associated with each edge of each subset of the first plurality of edges in all sub-graphs of the second set of sub-graphs; and
calculating a second conflict value based on the second sum value,
wherein the initiating a change includes determining whether the set of values for the operational parameter should have k or m values based on the first and second conflict values.
3. A method as claimed in claim 2 , wherein the initiating a change includes determining whether the set of values for the operational parameter should have k or m values based on the first and second conflict values and on whether the second conflict value satisfies a threshold.
4. A method as claimed in claim 2 , further comprising:
defining a second graph comprising a second plurality of nodes and a second plurality of edges, wherein a node of the second plurality of nodes represents a second base station of the plurality of base stations, and an edge of the second plurality of edges represents a second neighboring relationship between two base stations of the plurality of base stations, wherein each edge of the second plurality of edges has an associated second weight value;
partitioning the second graph into a third set of sub-graphs, wherein the third set of sub-graphs includes k sub-graphs, each having a subset of the second plurality of nodes and a subset of the second plurality of edges, such as to minimize a third sum value of the second weight values associated with each edge of each subset of the second plurality of edges in all sub-graphs of the third set of sub-graphs; and
calculating the first conflict value based on the first and third sum values.
5. A method as claimed in claim 4 , further comprising:
partitioning the second graph into a fourth set of sub-graphs, wherein the fourth set of sub-graphs includes m values, each having a subset of the second plurality of nodes and a subset of the second plurality of edges, such as to minimize a fourth sum value of the second weight values associated with each edge of each subset of the plurality of edges in all sub-graphs of the fourth set of sub-graphs; and
calculating the second conflict value based on the second and fourth sum values.
6. A method as claimed in claim 4 , wherein the operational parameter is a Physical Cell Identifier (PCI) and the set is a PCI pool.
7. A method as claimed in claim 6 , wherein the first weight value represents a PCI conflict and the second weight value represents a PCI confusion.
8. A method as claimed in claim 2 , wherein, if it is determined that the set of values for the operating parameter should have m values, then the method further comprises:
causing the first base station of the plurality of base stations to reconfigure the operational parameter based on the set of values, wherein the set includes m values.
9. A method as claimed in claim 1 , wherein the initiating a change includes determining whether the first base station in the plurality of base stations should reselect its operational parameter based on the first conflict value.
10. A method as claimed in claim 1 , wherein the first weight value represents a coverage area overlap between the two base stations of the plurality of base stations.
11. A non-transitory computer-readable storage medium storing a computer program comprising instructions which, when the program is executed by a computer, cause the computer to carry out the method of claim 1 .
12. A network node for a cellular telecommunications network, the network node comprising:
a receiver configured to receive an operational parameter value associated with each base station of a plurality of base stations, wherein the operational parameter values are each one of a set of values; and
a processor configured to:
define a first graph comprising a first plurality of nodes and a first plurality of edges, wherein a node of the first plurality of nodes represents a first base station of a plurality of base stations, and an edge of the first plurality of edges represents a first neighboring relationship between two base stations of the plurality of base stations, wherein each edge of the first plurality of edges has an associated first weight value;
partitioning the first graph into a first set of sub-graphs, wherein the first set of sub-graphs includes k sub-graphs, each having a subset of the first plurality of nodes and a subset of the first plurality of edges, such as to minimize a first sum value of all first weight values associated with each edge of each subset of the first plurality of edges in all sub-graphs of the first set of sub-graphs;
calculating a first conflict value based on the first sum value; and
initiating a change relating to an operational parameter to one or more base stations in the plurality of base stations if the first conflict value satisfies a condition, wherein the operational parameter is one of a set of values, wherein the set includes k values.
13. A cellular network comprising the network node of claim 12 .