Table 3 Definition of AODV_EXT_BP parameters
From: A new RREQ message forwarding technique based on Bayesian probability theory
n | The total nodes in the network |
|---|---|
F i | Any node F i , i = 1,2,…,n that receives the RREQ message |
P i | Packet forwarding probability derived from neighbour node count |
d | Minimum node density or minimum expected neighbours—if the node density at a forwarding node F i is less than this, then that node will forward the RREQ message to avoid the probability of path failure at that location. This means that the nodes will forward the packet without any further condition checking. In this study d is set to 5 |
r | Random number (between 0 and 1). This is used to generate varying conditions in the network. By this variable we are trying to avoid flooding in the RREQ mechanism as it compares each time to P i which must be smaller than 1 (100%) |