Hybrid Routing Algorithm on Mesh Network Based on Traffic Records

Abstract

This research proposes the determining shortest paths for hops, which are in the middle of the source and destination. The shortest path in this research means the fastest path between the source and destination. In Recent, dynamic routing algorithms are currently used and developed by researchers. This research algorithm suggests that the fastest paths between the source and the destination which is based on using the record of the network traffic history. Main subject on networking is a user, and the pattern of network usage is always corresponding to network history. Users are using the networking and the network traffic is always corresponding to how many users use the networking in specific time. Therefore, network traffic information can be predicted by the network condition which is referring to the history of network traffic record, and then the shortest path can be produced without using RIP too much. It will be helpful to improve the network traffic and contribute efficient packet transferring on network.