Research Article
Ad Hoc Communication Topology Construction for Delay-Sensitive Internet of Vehicle Applications
Algorithm 4
A decentralized algorithm for the k-LTTC problem.
| Input: A set of vehicle , time constant k | | Output: k-hop topology tree T | | (1) | Set randnum; | | (2) | Set tokenlevel = 0; | | (3) | Set vehiclelocation = {(Xti,Yti), …, (Xtk,Ytk)}; | | (4) | if randnum ≥ ρ then | | (5) | Set INITIATOR; | | (6) | Broadcast INVITE Message; | | (7) | end if | | (8) | if Receive “Token” then | | (9) | ; | | (10) | if Vehiclelevel = = Zerolevelthen | | (11) | if W(i,j) ≤ CR and W(i,j) ≠ 0 then | | (12) | Change Vehiclelevel from current state; | | (13) | Reply JOIN Message; | | (14) | Broadcast INVITE Message; | | (15) | end if | | (16) | else | | (17) | if Vehiclelevel ≥ Tokenlevelthen | | (18) | Discard Token; | | (19) | else | | (20) | Change Vehiclelevel from Token; | | (21) | if W(i,j) ≤ CR and W(i,j) ≠ 0 then | | (22) | Change Vehiclelevel from current state; | | (23) | Reply JOIN Message; | | (24) | Broadcast INVITE Message; | | (25) | end if | | (26) | end if | | (27) | end if | | (28) | else if Time ≥ τ then | | (29) | Set INITIATOR; | | (30) | Broadcast INVITE Message; | | (31) | end if |
|
