An
(t)
|
payoff function of each node n in the network, where n ranges from 1 to N, at time tn
|
|
maximum allowed time for an iteration cycle |
|
set of positive real numbers |
|
probability function that it may come with a threat message |
|
probability function of a node to avoid threat |
|
first point of time when a set of nodes in the network establishes successful communication |
|
instance when any two nodes say m and n in the network wait to establish communication |
(Ω,
F, P)
|
Probability triplet (representing node n) |
Ω
|
collection of all potential outcomes, i.e., a sample space |
F
|
space in which events occur, i.e., event space |
P
|
probabilistic function that assigns a probability to each event in the event space |
|
time space representing node n
|
|
time when two nodes try to connect |
|
when node n maximizes the chance of avoiding threats in continuous time domain t
|
|
exit index of node n
|
PUF |
Physical Unclonable Function |
IoT |
Internet of Things |
IoV |
Internet of Vehicles |
dPoW |
Dynamic Proof of Work |
V2X |
Vehicle to Everything |
V2V |
Vehicle to Vehicle |
V2R |
Vehicle to Roadside |
V2H |
Vehicle to Human |
V2S |
Vehicle to Sensor |
RSU |
Roadside Unit |
RFID |
Radio-Frequency Identification Technology |
ECC |
Elliptic Curve Cryptography |
(DoS) |
Denial of Service |
CRL |
Certificate Revocation List |
VANET |
Vehicular Ad Hoc Network |
MITM |
Man-in-the-Middle Attack |
IC |
Integrated Circuits |
MAC |
Message Authentication Code |
MSP |
Membership Service Provider |
HLF |
Hyperledger Fabric |
DHT |
Distributed Hash Table |