Research Article
Performance Analysis of Dijkstra-Based Weighted Sum Minimization Routing Algorithm for Wireless Mesh Networks
Algorithm 1
The Dijkstra-based routing algorithm (optimizing path capacity).
(1) INPUT: no. of nodes , source node , destination node , for all . | (2) OUTPUT: | (3) /* Initialization */ | (4) FOR ALL nodes | (5) Incorporated nodes = NIL | (6) | (7) Parent(node) = NIL | (8) END | (9) | (10) FOR | (11) FOR ALL incorporated nodes | (12) | (13) END | (14) | (15) = node corresponding to . | (16) /* is the incorporated node */ | (17) FOR ALL nodes | (18) IF THEN | (19) | (20) ELSE | (21) END IF | (22) IF THEN | (23) | (24) | (25) /* */ | (26) END IF | (27) END FOR | (28) IF ≠ NIL THEN | (29) | (30) | (31) WHILE | (32) | (33) | (34) | (35) END | (36) END IF | (37) END FOR | (38) | (39) RETURN |
|