Mobile communication frequency point optimization method based on color theory
A mobile communication and optimization method technology, applied in wireless communication, electrical components, network planning, etc., to achieve the effect of avoiding co-frequency interference and reducing communication load
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0027] General steps of the present invention of embodiment 1
[0028] A mobile communication frequency point optimization method based on color theory of the present invention has five steps of connection graph establishment, connection graph decomposition, extremely concentrated vertex coloring, vertex coloring in the entire connection graph, and frequency point configuration.
Embodiment 2
[0029] Embodiment 2 Establishment of Connection Diagram
[0030] In the present invention, the relationship between the base station in the urban area and the neighboring cells of the base station is converted into a connection graph in graph theory, and this connection graph is called a base station connection graph. Among them, the base station is designed as the vertices in the connection graph, the neighbor cell relationship is designed as the edge between the vertices (that is, the connection line between the vertices), and the frequency point to be configured is designed as the coloring in the connection graph (the color of each vertex to be colored ). The frequency point optimization problem can be transformed into the color theory problem of vertex coloring of the connection graph.
[0031] figure 1 A schematic illustration of the resulting connection graph.
[0032] The corresponding relationship is shown in Table 1
[0033] Table 1 Correspondence between base st...
example 3
[0035] Example 3 Decomposition of Connection Diagram
[0036] The edges and vertices in the base station connection diagram obtained in Example 3 are divided into two sets, which are denoted as the maximum set and the restricted set, respectively denoted as E 1 and E 2 The principle of division is that in one of the sets, all the edges have no other intersections except at the vertices. The maximum set contains the most edges and vertices connected by these edges when this condition is met. The limit set is the remaining edges in the connection graph except the edges in the maximum set and the vertices connected by these edges (some points will appear in the maximum set and the limit set at the same time).
[0037] figure 1 Shown is a non-maximal connected graph, in figure 1 In addition to intersecting at the vertex, there are two sides and other sides, and there are other intersection points. According to the principle of this embodiment, after removing these two sides, ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com