Data Cooperative Distribution Mechanism of Internet of Vehicles Using D2D Technology

Table 2

Detailed steps of D2D unicast cooperative distribution algorithm based on multihop relay.

---

Algorithm 2

---

Input:F = (C_M, L),C_S = {i},C_R,d

Output: Optimal multicast distribution path tree from C_S to C_R with the constraint that the number of D2D unicast forwarding hops is not greater than 2 and the corresponding resource consumption cost_opt

Step 1: Initialize the algorithm by making the resource cost function cost(i) = 0 for element i, making the set C_SR = {i} and the loop variable t = 1

Step 2: Use formula (13) to look for x_opt in C_SR. In the path tree, add the element s_t as a child of the node x_opt

Step 3: Use formula (14) to calculate

Step 4: If s_t is a child of element i, the terminal s_t is added to the set C_SR

Step 5: If t < M − 1, then let t = t + 1 and return to step 3. Otherwise, use formula (15) to find the cost_opt

---