. 2021 Jul 20;21(14):4935. doi: 10.3390/s21144935

Table 2.

Variable notation.

Notations	Abbreviation
$x$	Vehicle
$C_{x}$	Throughput Achieved
$e_{x y}$	Channel allocation decision
$y$	Channel
$V_{x}$	Channel set allocated to vehicle $x$
$l_{x y}$	The likelihood for channel $y$ accessibility
$1 - \prod_{y \in V_{x}} l_{x y}^{'}$	The likelihood for channel $y$ accessibility for at most one channel
$l_{x y}^{'}$	The likelihood that channel $y$ is not accessible
$δ C_{x}$	Throughput increment
$V_{z}$	The input set of accessible channels
$C_{x}^{z}$	Throughput before channel allocation $y_{x}^{'}$ .
$C_{x}^{q}$	Throughput after channel allocation $y_{x}^{'}$ .
$T$	Is the total number of channels in the network
$l_{x y}^{'} = 1 - l_{x y}$	Is the probability of vehicle $x$ not accessing the channel $y$
$y_{x}^{'}$	channel allocation
$1 - \prod_{y \in T_{x}} l_{x y}^{'}$	Is the probability of $x$ vehicle accessing the channel
$D$	MAC Overhead
$V$	Number of vehicles
$T$	The sharing vehicles of channel $y$
$s$	Is the common shared channel
$n$	The shared channel user number
$m$	Is the user’s number using the shared channel
$\prod_{m = 1, m \neq n}^{T} l_{x_{m} y}$	Is the likelihood computation of throughput gain on a shared user channel
$ℛ_{X}$ $and ℛ_{Y}$	The region member required to securely communicate over the secure channel
$j$	Vehicle
$P_{j}$	A set of channels shared by $j$
$F_{y}$	Group of vehicles who share channel $y$
$P_{o}$	A set of channels shared by $o$ vehicle
$A$	contention window
$ℒ_{u}$	Likelihood of the first collision
$ϵ L$	likelihood tradeoff
$r$	No. of vehicles
$g$	Arbitrary back-off time
$ℒ_{u}^{(r)}$	Condition likelihood of the first collision
$L {r v e h i c l e c o n t e n d}$	The likelihood that $r$ vehicles participate in the contention phase
$\land_{R}$	Set of all $R$ vehicles $({1, 2, 3, \dots, R})$
$\land_{t}$	A specific set of $r$ user
$h$	Mean value of the back-off parameter
$D (A)$	Mean Overhead
$s_{C T S}$	Corresponding time of CTS
$s_{R T S}$	Corresponding time of RTS
$s_{S I F S}$	Corresponding time of SIFS
$s_{S Y N C}$	Size of synchronization packets
$s_{S E N}$	Time of sensing
$φ$	A time that corresponds to one back off param
$S_{ℐ}$	Cycle Time
$A_{a}^{c}$	Prime Number
$B_{b}^{c}$	Prime Number
$ℰ^{c}$	Public Key
$D^{c}$	Secret Key
$U$	Data
$Y$	EncData
$D_{V}$	Decryption EncData