Bandwidth-Aware Traffic Sensing in Vehicular Networks with Mobile Edge Computing

. 2019 Aug 14;19(16):3547. doi: 10.3390/s19163547

Algorithm 1 The Bandwidth-aware Data Collection (BDC) Algorithm

Input: Historical data set

S^{p r e v} (i, j)

\forall r_{i} \in R_{m}, m \in M, j = 1, 2, . . ., T

Output: The collected traffic state matrix

X_{m}

and indicator matrix

B_{m}

\forall m \in M

Step 1: determine the selection priority of the road segments (Offline Phase)

1:
Compute $X_{m}^{p r e v}$ based on Equation (2), $\forall m \in M$
2:
Set priority matrix $G_{m} = {[0]}_{R_{m} \times T}$
3:
for each $r_{i} \in R_{m}$ do
4:
for j from 1 to T do
5:
$X_{m}^{p r e v^{'}} \leftarrow X_{m}^{p r e v}$
6:
$x_{i j}^{p r e v^{'}} \leftarrow 0$
7:
Decompose $X_{m}^{p r e v^{'}}$ as $P_{m}^{p r e v^{'}}$ and $Q_{m}^{p r e v^{'}}$ based on Equation (11)
8:
$x_{i j}^{p r e v^{'}} \leftarrow p_{i}^{p r e v^{'}} q_{j}^{p r e v^{'}}$
9:
Compute $G_{m} (r_{i}, t_{j})$ based on Equation (12)
10:
end for
11:
end for
12:
Set index matrix $I = \emptyset$
13:
forj from 1 to T do
14:
$t m p \leftarrow$ the jth column row vector of $G_{m}$
15:
Sort elements of $t m p$ in descending order
16:
$t m p_i n d e x \leftarrow$ the index vector of sorted elements in $t m p$
17:
$I \leftarrow [I, t m p_i n d e x]$
18:
end for

Step 2: allocate wireless bandwidth and collect vehicle data (Online Phase)