An Optimized and Energy-Efficient Ad-Hoc On-Demand Distance Vector Routing Protocol Based on Dynamic Forwarding Probability (AODVI)
Table 1
The proposed algorithm parameter description.
N
The total nodes in the networks
n i
Any node ni, i = 1, 2, …, n that receives the RREQ message
P i
Packet forwarding probability
β i
The number of neighboring nodes of node ni
D
Minimum number of neighboring nodes—if the number of threshold values at a forwarding node ni, is less than or equal to D, then that node will forward the RREQ message to avoid path failure or network partitioning
Cf
It is a control factor which can be used to adjust the probability Pi
R
Random number (between 0 and 100). This is used to generate varying conditions in the network
