Data Cooperative Distribution Mechanism of Internet of Vehicles Using D2D Technology

Table 1

D2D multicast cooperative distribution algorithm based on multihop relay.

---

Algorithm 1

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

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

Step 1: Calculate the initial threshold value D⁽⁰⁾ using formula (2)

Step 2: Based on the threshold value D⁽ⁿ⁾, calculate and using formula (3) and formula (4), respectively. If , then skip to step 6. Otherwise, skip to step 3

Step 3: Use formula (5) to find in , use formula (6) to solve for the resource cost of the 1st hop D2D multicast , and use formula (7) to solve for the resource cost of the 2nd hop D2D multicast

Step 4: Use formula (8) to calculate and record

Step 5: Use formula (9) to calculate D^(n + 1), and return to step 2

Step 6: Use formula (10) to find in

Step 7: Use formula (11) to calculate

Step 8: Use formula (12) to find the cost_opt

---