## 3 Proposed Methodology
### Proposed Flow Table Architecture
\begin{table}
\begin{tabular}{p{142.3 pt} p{142.3 pt}} \hline \hline
**Notation** & **Description** \\ \hline \(D_{ij}\),\(D_{ij}^{\text{max}},\delta_{x_{i}},\delta_{y_{j}},\delta\mathbbm{v}_{x_{j}}, \delta\mathbbm{v}_{y_{j}},\delta\mathbbm{a}_{x_{i}},\delta\mathbbm{a}_{y}\) & Wireless transmission distance, maximum wireless transmission distance, change in \(x\) direction displacement, change in \(y\) direction displacement, change in \(x\) direction velocity, change in \(x\) direction acceleration, and change in \(y\) direction acceleration, respectively \\ \hline \(t_{ij}\) & Wireless link lifetime between nodes \(i\) and \(j\) \\ \hline \(\mathcal{D}_{i},t_{train,i},t_{ij,i},t_{start,i},t_{proc,i},t_{control,i},t_{ prop,j}\) & Total one-hop delay of node \(i\), transmission delay of last packet of node \(i\), queuing delay of all other packets except last packet in node \(i\), contention delay of last packet of node \(i\), processing delay of last packet of node \(i\), and propagation delay of last packet of node \(i\), respectively \\ \hline \(\mathcal{D}_{iWL},\mathcal{D}_{iWI}\) & Average wireless one-hop link delay of node \(i\) using CSMA-CA, and average wired one-hop link delay of node \(i\) using CSMA-CD, respectively \\ \hline \(t_{trans,ij},t_{ij,j^{\prime}},t_{control,j^{\prime}},t_{proc,j^{\prime}},t_{ control,j^{\prime}},t_{pump,j}\) & Transmission delay of \(j\)th packet of node \(i\), queuing delay of \(j\)th packet in node \(i\), contention delay of \(j\)th packet of node \(i\), processing delay of \(j\)th packet of node \(i\), flow control delay of \(j\)th packet of node \(i\), and propagation delay of \(j\)th packet of node \(i\), respectively \\ \hline \(t_{tru},t_{tru},t_{ack}\) & Transmission delay for transmitting RTS, STS, and ACK packets, respectively \\ \hline \(t_{frame\,space},B\mathcal{O}_{ij},t_{collision,ij}\) & Frame spacing in CSMA, total random backoff time of the \(j\)th packet in \(i\)th node during contention period, and total collision duration during contention for \(j\)th packet in \(i\)th node, respectively \\ \hline \(S\), \(T[N,N,2]\), \(X[N,N,2]\), \(D[N,N,2]\), \(P_{j}[k]\), \(V_{j}[k]\) & Destination node, adjacency matrix of link lifetime, adjacency matrix of position, adjacency matrix of link delay, and the parent vector containing list of parent nodes and channel types (wired or wireless) in reaching destination node \(j\) from source node \(k\), route valid time for the path from source node \(k\) to destination node \(j\), respectively \\ \hline \(\mathcal{C}_{\text{th}},T_{\text{th}},DR_{WL},DR_{WI}\) & Network congestion threshold, link lifetime threshold, wireless data rate, and wired data rate, respectively \\ \hline \(H_{channel},H_{knun},H_{WL},H_{WI}\) & Normalized network per channel link entropy, homogeneous normalized entropy, normalized homogeneous link entropy with respect to wireless links, and normalized homogeneous link entropy with respect to wired links, respectively \\ \hline \(\mathcal{Q}_{i},U_{ij},\overline{\mathcal{Q}}\) & Average pending transmission packet distribution factor at node \(i\), pending transmission factor of node \(i\) at \(j\)th time step, and average pending transmission packet distribution factor of the network, respectively \\ \hline \(\overline{\mathcal{R}}_{i},V_{ij}\) & Average queue size of node \(i\), and queue size of node \(i\) at \(j\)th time step, respectively \\ \hline \(\overline{\mathcal{P}}_{WL},\overline{\mathcal{P}WI}\) & Average collision probability for wireless links, and average collision probability for wired links, respectively \\ \hline \(t_{control,WL},t_{start,WI}\), \(t_{control,WL,max},t_{control,WI,max}\) & Average contention delay for CSMA–CA, average contention delay for CSMA–CA, and maximum of average contention delay for CSMA–CD, respectively \\ \hline \(E\), \(T_{slot},T_{c},CW_{min},CW_{max}\) & Maximum retransmission attempts during contention, slot time, collision duration, minimum contention window, and maximum contention window, respectively \\ \hline \(\mathcal{C},C_{WL},\mathcal{C}_{WI}\) & Normalized network contention, normalized wireless contention, and normalized wired \\ \hline \(\mathcal{S}_{i},N_{i},N_{iWL},N_{iW1},N_{c},N_{r}\) & Node \(i\)’s set of one-hop neighbors’ node addresses, total one-hop neighbors of node \(i\), total number of nodes, number of wireless links connected to node \(i\), number of wired links connected to node \(i\), total number of vehicle nodes, and total number of RSU nodes, respectively \\ \hline \(f,f^{\prime},f^{\prime\prime}\) & Data collection frequency, optimization frequency, and routing frequency, respectively \\ \hline \hline \end{tabular}
\end{table}