Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

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.

Active Publication Date: 2019-09-10
SOUTH CHINA NORMAL UNIVERSITY
View PDF3 Cites 8 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] ① Not for different network environments, the situation of different network environments is different, to be discussed separately
[0007] ② Did not consider connecting all users to the network, did not consider the fairness of users

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
  • D2D resource allocation method based on graph coloring
  • D2D resource allocation method based on graph coloring
  • D2D resource allocation method based on graph coloring

Examples

Experimental program
Comparison scheme
Effect test

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...

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 invention discloses a D2D resource allocation method based on graph coloring. The method comprises the steps of assuming that all D2D users in a system multiplex channel resources of the same cellular user and take threshold power as transmitting power; obtaining an unignorable undirected mutual interference graph, wherein the interference value is the weight of each edge of the graph; dividing all D2D users in a cell into a plurality of clusters with relatively low mutual interference degrees through a graph coloring method; the users with the same color are the same cluster; enabling theD2D users in each cluster to multiplex the same cellular channel, acquiring a cellular channel capable of being multiplexed by each cluster, calculating the maximum throughput for matching all the cellular channels with the D2D clusters in pairs one by one, setting the throughput of the D2D clusters and the cellular channels which cannot be matched to be zero, and acquiring a throughput matrix; and solving an optimal matching matrix for maximizing the system throughput, allocating channel resources to the D2D cluster according to the matching matrix, and taking a power solution obtained by using a Lagrangian multiplier method as the transmitting power of the D2D pair.

Description

technical field [0001] The present invention relates to the field of communication technology, in particular to a method for allocating D2D resources based on graph coloring. Background technique [0002] With the rapid development of the mobile Internet, the mobile business volume is increasing rapidly, the requirements for speed and seamless transmission are getting higher and higher, and the demand for bandwidth is constantly increasing, but the bandwidth resources that can be used by the mobile network are limited. To solve the contradiction between business growth and limited resources, it is necessary to constantly explore new mobile communication technologies. One of the effective ways is to introduce D2D (Device-to-Device) communication technology into the cellular network, that is, mobile devices that are relatively close in the ground can communicate directly without following the traditional "device-to-device-to-device" approach. "Communication mode. [0003] Th...

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): H04W52/24H04W72/08H04W72/54
CPCH04W52/241H04W52/244H04W72/541H04W72/542
Inventor 潘达儒杨汝佳宋晖梁祥逸
Owner SOUTH CHINA NORMAL UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products