| To enhance end-to-end communication in mobile wireless ad hoc network, enhance the local repair mechanism performance, reduce as maximum its latency and avoid frequent route discovery latency and overhead, many multipath and backup routing protocols based on existing single routing protocol have been implemented. Because of the richer connectivity of a mesh, these protocols have been shown to perform well compared with tree based single route protocols. This thesis proposed two new algorithms AODV-BHBN (Ad hoc On-demand Vector-Based Hello message Backup Node) routing protocol and AODV-BHBR (Ad hoc On-demand Vector-Based Hello message Backup Route) routing protocol in which the primary route nodes, during the RREP process and through hello message broadcasting, build alternate nodes and routes. AODV-BHBN only allows primary path nodes to build alternate node which record the hello sender as its next hop to the destination in its alternative routing table. And thus, become usable when the primary link breaks. In AODV-BHBR each primary route nodes despite the primary routing table has alternative routing table in which it records its alternate path to the destination. And thus when link break occur, the node on the primary path don't need to trigger first the local repair mechanism, it can directly use its alternate path to forward data.The main characteristics and advantages of our algorithms with others, except the use of hello message to build backup path, is the alternate nodes and path can be updated periodically before the primary route time out, and thus, they reflect the current network topology and stay reachable anytime the primary route nodes need to build alternate path. With node speed variation, the simulation shows the both proposed algorithms scale well than AODV when the speed increases. And by computing the traffic load by varying the packet sending speed, the simulation shows the performance improvement for the both protocols AODV-BHBN and AODV-BHBR. |
PDF Full Text Request