Research Article
Replication-Based Data Dissemination in Connected Internet of Vehicles
Algorithm 1
Deterministic Algorithm.
Input: Graph . | |
Output: Graph , communication stages . | |
(Initialisation; | |
(; | |
( nodes, values with ; | |
(Stage (step ( - step (1): | |
(sort in descending order; | |
(if the nodes with value no smaller than two are more than | |
the ones with value zero then | |
(let the latter ones take operations with the former ones; | |
(else | |
( take operations the other way around. | |
(end if | |
(if there is no node with value at least two or with value | |
zero then | |
(Let and take average for | |
; | |
(end if | |
(Enter into the next stage, ; | |
(End of Algorithm. |