D2D resource allocation method based on graph coloring
A technology of resource allocation and graph coloring, applied in the field of communication, can solve the problems of not targeting different network environments, not considering user fairness, not considering all users accessing the network, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0066] In this embodiment, a method for resource allocation based on graph coloring is provided, which is characterized in that it includes:
[0067] Step 101: Divide the scenario in which the number of D2D in the wireless communication network is far more than that of cellular users into a dense D2D hybrid cellular network, and the resource allocation of graph coloring is mainly applied to such a scenario;
[0068] Step 102: All D2D users multiplex the cellular channels in the Underlay mode, and the D2D communication users multiplex the uplink channels of the cellular users in the underlay multiplexing mode;
[0069] Step 103: An undirected mutual interference graph can be obtained by combining the interference conditions, and the interference value is the weight of each edge;
[0070] Step 104: Divide the D2D users into clusters. The degree of mutual interference between users in each cluster is low. All users in the cluster reuse the same cellular channel, and then calculat...
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