Research Article
Optimization of Maximum Routing Hop Count Parameter Based on Vehicle Density for VANET
Algorithm 1
: MRHSA: maximum routing hop count selection algorithm.
(1) | Notations; | (2) | XS: source vehicle location; XD: destination vehicle location; λ: vehicle density; | (3) | τ: average packet transmission probability. H: output of maximum routing hop count | (4) | Initialization; | (5) | x = sqrt (XS − XD)2; ; H = Hmin; | (6) | if Hmin <= 1 then | (7) | return H = 2; | (8) | else then | (9) | if (λ < 1) then | (10) | return H = ; | (11) | else then | (12) | repeat | (13) | calculate Pcon (H) and Psuccess (H) with (8) and (19); | (14) | calculate Growth (H) and Reduction (H) with (18) and (20); | (15) | H++; | (16) | until σ ∗ Growth (H) >= (1 − σ) ∗ Reduction (H) | (17) | return H; | (18) | end if | (19) | end if |
|