Graph-Based Resource Allocation for D2D Communications Underlying Cellular Networks in Multiuser Scenario

Algorithm 1

Graph-based resources allocation algorithm.

Step  1. Graph Construction

Construct the graph and initialize the parameters of the graph.

Calculate and .

Calculate according to and construct edges between D2D pairs according to .

Step  2. Allocation Scheme

Initialize the elements of and to 0.

Repeat:

Select the minimum element in the matrix which adds to each column of .

Record the selected resource in and accumulate the corresponding weight in .

Find D2D pairs whose value in the selected column of

is 1 and set these D2D pairs’ weights on selected resource to infinite.

Until has no 0 elements.