Graph coloring-based wireless frequency allocation working method

A technology of wireless frequency and working method, applied in the field of information communication, can solve the problems such as the inability to guarantee the optimal solution, the inability of the frequency allocation algorithm to apply to the wireless ad hoc network, and the long time period.

Inactive Publication Date: 2011-05-18
NO 30 INST OF CHINA ELECTRONIC TECH GRP CORP
View PDF2 Cites 15 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Therefore, many frequency allocation algorithms that are currently successfully applied in the field of mobile communication cannot be applied to wireless ad hoc networks.
[0004] In addition, most of the existing wireless frequency allocation technologies use exhaustive search methods or polynomial time to obtain the optimal solution of frequency allocation. These methods have a long period of time and cannot guarantee the optimal solution without frequency conflicts.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Graph coloring-based wireless frequency allocation working method
  • Graph coloring-based wireless frequency allocation working method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0022] V k The coloring algorithm for can be given by the following formula:

[0023] Order C k = C 0

[0024] C k = C k +1, |C k -C l | k = C k ,|C k -C l | ≥ Wj (l=1..n and l ≠ k, Wj is V k and V l sides between).

[0025]

[0026] For example, if there are five wireless subnets A, B, C, D, and E below, the subnets are abstracted into vertices, and several edges with weights are generated between the subnets according to the frequency interval rules. The relationship between nets and subnets is abstracted as an undirected graph, as shown in the accompanying drawings figure 1 Shown:

[0027] The algorithm selects the vertex B with the highest degree from the graph, assigns the default initial color number 1, and then colors the adjacent vertices of vertex B in turn. The color numbers for A, C, and E are: 6, 4, 7, and finally Color vertex D as 11. After coloring, the algorithm selects f6, f1, f4, f11, and f7 from the frequency table {f1, f2, ..., fn (n>1)}...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The feasible solution of a large number of non-player character (NPC) problems in engineering practice is acquired by a few approximation algorithms, so a graph coloring-based frequency allocation algorithm is to acquire the approximate optimal solution of the problems on the premise of a plurality of limiting conditions. The invention provides the specific steps of the graph coloring-based frequency allocation algorithm.

Description

technical field [0001] The invention relates to the field of information communication, in particular to a frequency allocation method. Background technique [0002] The allocation of radio frequency resources is one of the issues that must be considered during the organization and operation of wireless communication networks. The organization and use of large-scale wireless communication networks involves the planning and maintenance of hundreds or even more wireless subnets. How to effectively and rationally use limited frequency resources is essential for organizing, opening, and operating wireless communication networks and reducing frequency interference. It is very important to improve the service quality of the wireless communication network. [0003] At present, the frequency allocation algorithms mainly include heuristic algorithm, graph theory algorithm, genetic algorithm and neural network algorithm. frequency planning requirements. For example, frequency reuse...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04W16/14
Inventor 杨震孟凡欣冯志先
Owner NO 30 INST OF CHINA ELECTRONIC TECH GRP CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap