Research Article
Towards Developing Enhanced Cluster-Based QoS-Aware Routing in MANET
| Input: Node n, 1-hop neighbor set N1(n) | | Process: | | Initially, all old entries are removed from the routing table. | | The new entries are recorded in the table from the N1(n) as the destination nodes and the hop count h is set to be 1. | | FOR all route entries in which destination nodes is h + 2 hops are recorded | | IF (node destination is in the same cluster zone) | | IF (node destination = next node and no | | multiple next nodes) | | Add a new entry with the destination node in | | the routing table | | ELSEIF (multiple next node destinations) | | Compare the number of hops and their link | | status like delay and quality to the destination | | Select and record the one having a better route | | destination | | ENDIF | | ENDIF | | ELSE | | IF (node destination is in different cluster zone) | | It looks like cluster heads associated with a destination node | | Compare routes to the destination | | Add the next node with a destination node | | ENDIF | | END FOR | | Output: Routing table of a node |
|