Abstract
Existing networks deemed as complex system merged with many wireless communication networks. Traditional routing algorithm may not be sufficient to meet such complex data transmission from the source nodes to the sink nodes. Therefore, serious studying and investigation for traffic performance and congestion over complex networks seem to be an urgent challenge. Data propagation over complex networks without adopting a finest routing techniques might lead to more network congestion or deterioration in the worst case. Shortest path (SP) routing method has been widely used for its simplicity and efficiency. In this paper network performance based on SP, has been studied, investigated and evaluated. Therefore, we have proposed the new routing algorithm based on weighted nodes and paths. Our novel proposed algorithm proved its capability to preserve high throughput and low latency compared to the SP technique. Also, we have introduced the framework of applying differential evolution which enhances the overall performance of the complex networks.