A Heterogeneous IoV Architecture for Data Forwarding in Vehicle to Infrastructure Communication

Table 2

Best interface selection algorithm for IoV.

---

1: Procedure: m(B, C, D, N) //selecting interface

  for an application requirement app

2:  B ⟵ set bandwidth requirement

3:  C ⟵ set cost requirement

4:  D ⟵ set delay requirement

5:  N ⟵ set network utilization requirement

6: SET s_k,n = 1 such that s_knε S_(m×t) //Interface ⟵ select a random network ID for initialization

7: SWITCH app’s access preferences (B, C, D, Nn)

8: CASE B:

9: IF b_kn >= ba such that b_k,nε B_(m×t) //if the current network interface meets application bandwidth requirements then,

10: RETURN B

11: ELSE B_(m×t) >= b_a such that B_(m×t) = B = B_lte = B_wave = B_wifi //compare it with

  //the bandwidths available to other access networks

12: RETURN B //network interface with highest bandwidth support

13: BREAK;

14: CASE C:

15:  C_(m)= ∑ C_(e) //sum of costs of all links “e”

      c_kε C_(m)

16: For all C_(m), c_kε C_(m) do //FOR get the list of networks to iterate and sort in the increasing cost order

17: RETURN (min(∑c_k)) //return the network interface with least cost. k, m

18: BREAK;

19: CASE D:

20: IF d_kn <= da such that d_k,nε D_(m×t) where ∑d_total,k = d_proc + d_queu + d_trans + d_prop

  //if the current network interface meets the delay requirements then, return void

21: ELSE D_(m×t) <= d_asuch that D_(m×t) = d_total = d_ltetotal = d_wavetotal = d_wifitotal

  //compare it with the delays of other access networks

22: RETURN ∀ d_totale D

    min(∑d_total)

      total, m //return the network interface with least delay

23: BREAK;

24: CASE default:

25: For all c_k = 0 to n, //where n is the nth cost amount subject to vector of unit cost, that is, C_(m), c_ke C_(m)

  //FOR get the list of network interfaces to iterate and sort in an increasing cost order

26: IF N_n >=N_asuch that b_k,ne B_(m×t) and d_k,ne D_(m×t), where N_n = B d_total,n

  //if the current network interface meets bandwidth and delay requirements then,

27: RETURN N_n

28: ELSE N_n < N_a such that N_n = N_inclte = N_incwave = N_incwifi and N_inclte = B_lte d_ltetotal, N_incwave = B_wave d_wavetotal, N_incwifi = B_wifi d_wifitotal

  //compare it with the bandwidth and delay for other available access networks, and

29: RETURN (max(∑N_inc)) //the one with highest bandwidth and least delay

         N_ince N

30: BREAK;

31:  F s_k,n = 0 //no network interface is assigned then,

32: RETURN false;

33: ELSE RETURN true;

---