| The performance of a network depends on the routing protocol and the architecture of the network. With the presence of network topology change, a good routing protocol and architecture must evolve efficiently to sustain the best performance of the network. In this research work, dynamic algorithms are designed for networks with constant topology changes, such as computer networks, wireless communication systems, and mobile ad hoc wireless networks. In the dissertation, efficient dynamic algorithms to recompute the Shortest Path Tree (SPT) are presented for computer networks; for wireless communication systems, the partitioning problem and the clustering problem are studied with improved heuristic approximation algorithms; optimized technology for route maintenance is designed for ad hoc wireless networks. Analysis of the proposed algorithm's complexity reveals the significant improvement. Furthermore, experiments are implemented to demonstrate the proposed algorithms with less computation time and smaller traffic delay for a network under dynamic topology changes. |
